diff --git a/seed/math-challenges/00-getting-started/getting-started.json b/seed/math-challenges/00-getting-started/getting-started.json
new file mode 100644
index 0000000000..a3a162e309
--- /dev/null
+++ b/seed/math-challenges/00-getting-started/getting-started.json
@@ -0,0 +1,1925 @@
+{
+  "name": "Join the freeCodeCamp Community",
+  "order": 1,
+  "time": "15 minutes",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "560add10cb82ac38a17513be",
+      "title": "Learn How freeCodeCamp Works",
+      "description": [
+        [
+          "//i.imgur.com/6ibIavQ.jpg",
+          "A picture of freeCodeCamp's 4 benefits: Get connected, Learn JavaScript, Build your Portfolio, Help nonprofits",
+          "Welcome to freeCodeCamp. We're an open source community that helps you learn to code, then practice by building projects for nonprofits.",
+          ""
+        ],
+        [
+          "//i.imgur.com/Elb3dfj.jpg",
+          "A screenshot of some of our campers coding together in Toronto.",
+          "<bold>Learning to code is hard.</bold> To succeed, you'll need lots of practice and support. That's why we've created a rigorous curriculum and supportive community.",
+          ""
+        ],
+        [
+          "//i.imgur.com/WD3STY6.jpg",
+          "Photos of three campers who got jobs after learning to code at freeCodeCamp.",
+          "freeCodeCamp is a proven path to your first software developer job. Companies have hired thousands of people like you who have learned to code through freeCodeCamp.",
+          ""
+        ],
+        [
+          "//i.imgur.com/D7Y5luw.jpg",
+          "A graph of the rate of job growth against growth in computer science degree graduates. There are 1.4 million jobs and only 400 thousand people to fill them.",
+          "There are thousands of software developer jobs currently going unfilled, and the demand for coders grows every year.",
+          ""
+        ],
+        [
+          "//i.imgur.com/vLNso6h.jpg",
+          "An illustration showing that you will learn HTML5, CSS3, JavaScript, Databases, Git, Node.js, React and D3.",
+          "We have hundreds of optional coding challenges that will teach you fundamental web development technologies like HTML5, Node.js and databases.",
+          ""
+        ],
+        [
+          "//i.imgur.com/UVB9hxp.jpg",
+          "An image of a camper at a cafe building projects on freeCodeCamp.",
+          "We believe humans learn best by doing. So you'll spend most of your time actually building projects. We'll give you a list of specifications (agile user stories), and you'll figure out how to build apps that fulfill those specifications.",
+          ""
+        ],
+        [
+          "//i.imgur.com/pbW7K5S.jpg",
+          "An image of showing our front end, back end, and data visualization certifications (400 hours each), our nonprofit projects (800 hours), and interview prep (80 hours) for a total of 2,080 hours of coding experience.",
+          "Our curriculum is divided into 4 certifications. These certifications are standardized, and instantly verifiable by your freelance clients and future employers. Like everything else at freeCodeCamp, these certifications are free. We recommend doing them in order, but you are free to jump around. The first three certifications take 400 hours each, and the final certification takes 800 hours, and involves building real-life projects for nonprofits.",
+          ""
+        ],
+        [
+          "//i.imgur.com/akGfLoa.jpg",
+          "A screenshot of our Front End Development Certificate",
+          "To earn our verified Front End Development Certification, you'll build 10 projects using HTML, CSS, jQuery, and JavaScript.",
+          ""
+        ],
+        [
+          "//i.imgur.com/ocEL0D3.jpg",
+          "A screenshot of our Data Visualization Certificate",
+          "To earn our Data Visualization Certification, you'll build 10 projects using React, Sass and D3.js.",
+          ""
+        ],
+        [
+          "//i.imgur.com/8HCk1Od.jpg",
+          "A screenshot of our Back End Development Certificate",
+          "To earn our Back End Development Certification, you'll build 10 projects using Node.js, Express, and MongoDB. You'll use Git and Heroku to deploy them to the cloud.",
+          ""
+        ],
+        [
+          "//i.imgur.com/yXyxbDd.jpg",
+          "A screen shot of our nonprofit project directory.",
+          "After you complete all three of these certificates, you'll team up with another camper and use agile software development methodologies to build two real-life projects for nonprofits. You'll also add functionality to two legacy code nonprofit projects. By the time you finish, you'll have a portfolio of real apps that people use every day.",
+          ""
+        ],
+        [
+          "//i.imgur.com/PDGQ9ZM.jpg",
+          "An image of campers building projects together in a cafe in Seoul.",
+          "If you complete all 2,080 hours worth of challenges and projects, you'll earn our Full Stack Development Certification. We'll offer you free coding interview practice. We even offer a job board where employers specifically hire campers who've earned freeCodeCamp certifications.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        "function sym(args) {",
+        "  return args;",
+        "}",
+        "",
+        "sym([1, 2, 3], [5, 2, 1, 4]);"
+      ],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "de": {
+          "title": "Lerne wie freeCodeCamp funktioniert",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "Ein Bild von den 4 Vorteilen von freeCodeCamp: Vernetz Dich, Lerne Javascript, Bau ein Portfolio auf, Hilf Non-Profit-Organisationen",
+              "Willkommen bei freeCodeCamp. Wir sind eine Open Source Gemeinschaft von motivierten Leuten, die programmieren lernen und Non-Profit-Organisationen helfen",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "Ein Screenshot von einigen unserer Camper beim gemeinsamen Programmieren in Toronto.",
+              "<bold>Programmieren zu lernen ist hart.</bold> Um erfolgreich zu sein brauchst du viel Übung und Unterstützung. Deswegen haben wir ein umfangreiches Curriculum und eine unterstützende Gemeinschaft geschaffen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "Ein Graph vom Verhältnis der Wachstumsrate von Jobs gegenüber der Abschlüsse von Informatik Studien. Es gibts 1,4 Millionen Jobs aber nur 400.000 Leute um diese zu füllen.",
+              "Es gibt tausende von unbesetzen Programmierjobs und die Nachfrage wächst jedes Jahr",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "Foto von drei Campern die einen Job bekommen haben nachdem sie bei freeCodeCamp programmieren gelernt haben",
+              "freeCodeCamp ist ein sicherer Weg zu deinem ersten Programmierjob. Tatsächlich hat noch niemand unser komplettes Programm beendet, weil Campers bereits davor Jobs finden.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "Eine Illustration die zeigt dass du HTML5, CSS3, JavaScript, Datenbanken, Git, Node.js, React und D3 lernen wirst",
+              "Wir haben hunderte von optionalen Programmieraufgaben die dir die fundamentalen Webentwicklungstechnologien wie HTML5, Node.js und Datanbanken beibringen werden.",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Ein Foto von einem Camper in einem Cafe der an freeCodeCamp Projekten arbeitet.",
+              "Wir glauben dass Menschen am Besten beim Tun lernen. Deswegen wirst du die meiste Zeit damit beschäftigt sein an tatsächlichen Projekten zu arbeiten. Wir werden dir eine Liste an Anforderungen (agile User Stories) geben und du wirst dich damit auseinander setzen diese zu erfüllen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpg",
+              "Ein Bild auf dem man unsere Frontend-, Backend- und Daten Visualisierungzertifikate (je 400 Stunden), unsere Non-Profit-Projekte (800 Stunden) und Bewerbungsgesprächsvorbereitung (80 Stunden) sieht mit einer Summe von 2080 Stunden Programmiererfahrung.",
+              "Unser Curriculum ist in 4 Zertifikate aufgeteilt. Diese Zertifikate sind standardisiert und jederzeit von deinen Kunden oder zukünftigen Arbeitgeber überprüfbar. Wie alles andere auch bei freeCodeCamp sind die Zertifikate gratis. Wir empfehlen sie in der vorgesehenen Reihenfolge zu machen, aber es steht dir offen frei zu wählen. Die ersten drei Zertifikate dauern jeweils 400 Stunden. Das letzte Zertifikat dauert 800 Stunden und beinhaltet die Umsetzung eines echten Projektes für eine Non-Profit-Organisation.",
+              ""
+            ],
+            [
+              "//i.imgur.com/akGfLoa.jpg",
+              "Ein Screenshot von unserem Frontendzertifikat",
+              "Um sich unser geprüftes Frontend-Entwicklungszertifikat zu verdienen, wirst du 10 Projekte mit HTML, CSS, jQuery und Javascript umsetzen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/ocEL0D3.jpg",
+              "Ein Screenshot von unserem Datenvisualisierungszertifikat",
+              "Für unser Datenvisualisierungszertifikat, wirst du 10 Projekte mit React, Sass und D3.js umsetzen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/8HCk1Od.jpg",
+              "Ein Screenshot von unserem Backend-Entwicklungszertifikat",
+              "Um unser Backend-Entwicklungszertifikat zu erhalten, wirst du 10 Projekte mit Node.js, Express und MongoDB umsetzen. Du wirst Git und Heroku verwenden um sie in der Cloud zu veröffentlichen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "Ein Screenshot von unserem Non-Profit-Verzeichnis",
+              "Nachdem du alle drei von diesen Zertifikaten abgeschlossen hast, wirst du mit einem anderen Camper zusammen Methoden der agilen Softwareentwicklung verwenden und zwei echte Projekte für Non-Profit-Organisationen umsetzen. Außerdem wirst du zwei bereits existierende Non-Profit-Projekte um neue Funktionalität erweitern. Wenn du fertig bist, wirst du ein Portfolio mit zwei echten Apps besitzen, die täglich von Leuten genutzt werden.",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Ein Foto von Campern die zusammen in einem Cafe in Seoul an einem Projekt arbeiten.",
+              "Wenn du alle 2080 Stunden an Aufgaben und Projekten absolviert hast, hast du dir unser Full Stack Development Zertifikat verdient. Wir bieten dir dann ein gratis Bewerbungstraining an. Außerdem haben wir eine Jobbörse, wo Arbeitsgeber Camper einstellen die freeCodeCamp Zertifikate erhalten haben.",
+              ""
+            ]
+          ]
+        },
+        "es": {
+          "title": "Aprende como funciona freeCodeCamp",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "Una imagen de los 4 beneficios de freeCodeCamp: Conéctate, Aprende JavaScript, Construye tu  Portafolio, Ayuda organizaciones sin ánimo de lucro",
+              "Bienvenido a freeCodeCamp. Somos una comunidad de código abierto formada por personas ocupadas quienes aprenden a programar y ayudan a organizaciones sin ánimo de lucro.",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "Una imagen de algunos de nuestros campistas programando juntos en Toronto.",
+              "<bold>Aprender a programar es difícil.</bold> Para tener éxito, necesitarás mucha práctica y apoyo. Por eso es que hemos creado un riguroso currículo y una comunidad de apoyo.",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "Una gráfica del crecimiento de trabajos en comparación con los graduados en un pregrado de ciencias de la computación. Hay 1.4 millones de empleos y solo 400 mil personas para ocuparlos.",
+              "Actualmente, hay miles de trabajos de programación sin ocupar, y la demanda de programadores crece cada año.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "Fotos de tres campistas quienes obtuvieron trabajos después de aprender a programar en freeCodeCamp.",
+              "freeCodeCamp es un camino probado para que obtengas tu primer trabajo de programación. De hecho, nadie actualmente ha completado nuestro programa entero, porque los campistas obtienen trabajos antes de poder hacerlo.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "Una ilustración mostrando que aprenderás HTML5, CSS3, JavaScript, Bases de Datos, Git, Node.js, react y D3.",
+              "Tenemos cientos de desafíos de programación opcionales que te enseñarán las tecnologías fundamentales para el desarrollo web como HTML5, Node.js y bases de datos.",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Una foto de un campista en un café construyendo proyectos con freeCodeCamp.",
+              "Creemos que los humanos aprender mejor haciendo.  Así que en realidad emplearás la mayoría de tu tiempo construyendo proyectos.  Te daremos una lista de especificaciones (historias de usuario ágiles), y te las ingeniarás para construir aplicaciones que cumplan esas especificaciones.",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpgk",
+              "Una imagen de los tiempos de nuestras certificaciones para desarrollo de interfaces, desarrollo al lado del servidor y visualización de datos (400 horas cada uno), para nuestros proyectos sin ánimo de lucro (800 horas) y preparación para entrevistas (80 horas) que dan un total de 2,080 horas e experiencia programando.",
+              "Nuestro currículo se divide en 4 certificaciones.  Estas certificaciones están estandarizadas, y son verificables al instante por sus clientes como trabajador independiente y por sus futuros empleadores.  Tal como todo lo demás en freeCodeCamp, estas certificaciones son gratuitas.  Recomendamos hacerlas en orden, pero usted es libre de saltar de una a otra.  Las primeras tres certificaciones requieren 400 horas cada una, y la certificación final requiere 800 horas, e involucra construir proyectos de la vida real para organizaciones sin ánimo de lucro.",
+              ""
+            ],
+            [
+              "//i.imgur.com/akGfLoa.jpg",
+              "Una imagen de nuestro Certificado de Desarrollo de Interfaces",
+              "Para obtener nuestra certificación verificada de Desarrollo de Interfaces, construirás 10 proyectos usando HTML, CSS, jQuery y JavaScript.",
+              ""
+            ],
+            [
+              "//i.imgur.com/ocEL0D3.jpg",
+              "Una imagen de nuestro Certificado de Visualización de Datos",
+              "Para obtener nuestra certificación en Visualización de Datos, construirás 10 proyectos usando React, Sass y D3.js.",
+              ""
+            ],
+            [
+              "//i.imgur.com/8HCk1Od.jpg",
+              "Una imagen de nuestro Certificado de Desarrollo al Lado del Servidor",
+              "Para obtener nuestro Certificado de Desarrollo al Lado del Servidor, construirás 10 proyectos empleando Node.js, Express y MongoDB. Usarás Git y Heroku para desplegarlos en la nube.",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "Una imagen de nuestro directorio de organizaciones sin ánimo de lucro.",
+              "Después de completar todos los tres certificados, harás equipo con otro campista y usarás metodologías de desarrollo ágil para construir dos proyectos de la vida real para organizaciones sin ánimo de lucro. También añadirás funcionalidad a dos proyectos de fuentes legadas de organizaciones sin ánimo de lucro.  Cuando termines esto, tendrás un portafolio de aplicaciones reales que la gente usa a diario. ",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Una imagen de nuestros campistas construyendo proyectos juntos en un café en Seoul.",
+              "Si completas todas las 2,080 horas de desafíos y proyectos, obtendrás un Certificado de Desarrollo de Pila Completa.  Te ofreceremos gratuitamente una práctica en entrevistas para desarrolladores. Incluso ofrecemos un directorio de trabajos donde los empleadores contratan específicamente campistas que han recibido certificaciones de freeCodeCamp.",
+              ""
+            ]
+          ]
+        },
+        "fr": {
+          "title": "Apprenez comment freeCodeCamp fonctionne",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "Une idée des avantages de freeCodeCamp: restez connecté , apprenez le JavaScript , construisez votre portfolio , Aidez les organismes sans but lucratif",
+              "Bienvenue sur freeCodeCamp . Nous sommes une communauté opensource de gens passionnés qui apprend à coder et aide les organisations à but non lucratif.",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "Une capture d'écran de certains de nos développeurs réunis à Toronto.",
+              "<bold>Apprendre à code est dur.</bold> Pour réussir, vous aurez besoin de beaucoup de pratique et de soutien. Voilà pourquoi nous avons créé un programme rigoureux et une communauté de soutien.",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "Un graphique de la vitesse de croissance de l'emploi face à la croissance du nombre de diplômés en études d'informatique . Il y a 1,4 million d'emplois et seulement 400 000 personnes pour les occuper.",
+              "Il y a des milliers d'emplois de développeurs actuellement vacants, et la demande pour les développeurs augmente chaque année.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "Photos de trois développeurs qui ont obtenu un emploi après l'apprentissage de code au freeCodeCamp.",
+              "freeCodeCamp est une voie éprouvée pour obtenir votre premier job de développeur. En fait , personne n'a jamais accompli l'ensemble de notre programme , car nos développeurs ont trouvé un emploi avant qu'ils ne soient en mesure de le finir notre parcours.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "Une illustration montrant que vous allez apprendre HTML5 , CSS3 , JavaScript , bases de données , Git , Node.js , React et D3.",
+              "Nous avons des centaines de défis de codage optionnels qui vous apprendront les fondamentaux du développement web comme HTML5 , Node.js et les bases de données.",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Une image d'un développeur dans un café projets sur Camp Code Free.",
+              "Nous croyons que les êtres humains apprennent mieux par la pratique . De sorte que vous passerez la plupart de votre temps à construire efficacement des projets. Nous allons vous donner une liste de spécifications ( des témoignages d'utilisateurs agiles ) , et vous allez comprendre comment construire des applications qui répondent à ces spécifications.",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpg",
+              "Une image pour montrer notre front-end, back end, et data visualisation certificat ( 400 heures chacun) , nos projets à but non lucratif (800 heures) , et l'interview de préparation ( 80 heures ) pour un total de 2080 heures d'expérience de codage.",
+              "Notre programme est divisé en 4 certifications . Ces certifications sont standardisés , et immédiatement vérifiable par vos clients indépendants et les futurs employeurs . Comme tout le reste au Code Camp gratuit, ces certifications sont gratuits. Nous vous recommandons de les faire dans l'ordre, mais vous êtes libre d'en sauter . Les trois premièrs certifications prennent 400 heures chacune , et la certification finale prend 800 heures , et implique la construction de projets concrets pour les organisations caritatives.",
+              ""
+            ],
+            [
+              "//i.imgur.com/akGfLoa.jpg",
+              "Une capture d'écran de notre certificat développeur Front-End",
+              "Pour réussir notre certificat Front-End vérifié, vous allez construire 10 projets utilisant HTML , CSS , jQuery et JavaScript.",
+              ""
+            ],
+            [
+              "//i.imgur.com/ocEL0D3.jpg",
+              "Une capture d'écran de notre certificat de visualisation de données",
+              "Pour gagner notre certification de visualisation de données , vous allez construire 10 projets utilisant Réagir, Sass et D3.js.",
+              ""
+            ],
+            [
+              "//i.imgur.com/8HCk1Od.jpg",
+              "Une capture d'écran de notre certificat Back-End",
+              "Pour gagner notre certification de développeur Back-End, vous allez construire 10 projets utilisant Node.js , Express, et MongoDB . Vous allez utiliser Git et Heroku de les déployer dans le cloud.",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "Une capture d'écran de notre répertoire de projet à but non lucratif.",
+              "Après avoir effectué tous les trois de ces certificats , vous faites équipe avec un autre développeur et utilisez agiles méthodologies de développement de logiciel pour construire deux projets de la vie réelle pour les organismes sans but lucratif . Vous aurez également d'ajouter des fonctionnalités à deux projets à but non lucratif de code hérité. Au moment où vous avez terminé, vous aurez un portefeuille de véritables applications que les gens utilisent tous les jours.",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Une image de campeurs construction des projets ensemble dans un café de Séoul ",
+              "Si vous finissez les 2.080 heures de défis et projets, vous gagnerez notre certification complète Stack développement . Nous vous offrons gratuitement la pratique d'entrevue de codage . Nous offrons même un accès à notre si d'emploi où les employeurs embauchent spécifiquement les développeurs qui ont obtenu des certificats de freeCodeCamp.",
+              ""
+            ]
+          ]
+        },
+        "it": {
+          "title": "Impara come funziona freeCodeCamp",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "Una immagine dei 4 benefici di freeCodeCamp: Creare Contatti, Imparare il JavaScript, costruire il proprio portfolio, Aiutare delle organizzazioni no-profit",
+              "Benvenuto in freeCodeCamp. Siamo una comunità open source di persone impegnate che imparano a programmare e aiutano le organizzazioni no-profit.",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "Uno screenshot di alcuni dei nostri camper che programmano insieme a Toronto.",
+              "<Bold> Imparare a programmare è difficile. </ Bold> Per riuscirci, sono necessari un sacco di pratica e molto sostegno. Per questo motivo abbiamo creato un curriculum rigoroso e una comunità solidale.",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "Un grafico del tasso di crescita dei posti di lavoro contro la crescita di laureati in informatica (in USA). Ci sono 1,4 milioni di posti e solo 400 mila persone adatte ad occuparli.",
+              "Ci sono migliaia di posizioni da Sviluppatore Software attualmente vacanti, e la domanda di programmatori cresce ogni anno.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "Foto di tre camper che hanno ottenuto un lavoro dopo aver imparato a programmare con freeCodeCamp.",
+              "freeCodeCamp è un modo collaudato per ottenere il primo lavoro da sviluppatore. In effetti, nessuno ha ancora completato tutto il nostro programma, perché i campers trovano lavoro prima di finire il corso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "Un esempio che mostra che qui si imparano HTML5, CSS3, JavaScript, Database, Git, Node.js, React e D3.",
+              "Abbiamo centinaia di problemi di programmazione opzionali che vi insegneranno tecnologie di sviluppo web fondamentali come HTML5, Node.js e Database.",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Un'immagine di un camper in un bar che lavora ai progetti di freeCodeCamp.",
+              "Crediamo che gli esseri umani imparino meglio facendo. Quindi lavorerai per la maggior parte del tempo a dei progetti pratici. Ti daremo una lista di specifiche (Storie-Utente 'Agili'), e Tu dovrai decidere come sviluppare delle applicazioni che soddisfino queste specifiche.",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpg",
+              "Un'immagine che mostra le nostre certificazioni front-end, back-end, e visualizzazione dei dati (400 ore ciascuno), i nostri progetti no-profit (800 ore), e la preparazione ai colloqui (80 ore) per un totale di 2.080 ore di esperienza.",
+              "Il nostro curriculum è diviso in 4 certificazioni. Queste certificazioni sono standardizzate, e immediatamente verificabili dai tuoi clienti come freelance e dai futuri datori di lavoro. Come tutto il resto di freeCodeCamp, queste certificazioni sono gratuite. Ti consigliamo di farle in ordine, ma non è obbligatorio. Per le prime tre certificazioni, ci vogliono 400 ore ciascuna, per la certificazione finale ci vogliono 800 ore, e questa prevede lo sviluppo di progetti reali per delle organizzazioni no-profit. ",
+              ""
+            ],
+            [
+              "//i.imgur.com/akGfLoa.jpg",
+              "Uno screenshot del nostro certificato di sviluppatore Front-End",
+              "Per ottenere la certificazione verificata di Sviluppatore Front-End, dovrai realizzare 10 progetti utilizzando HTML, CSS, jQuery, e JavaScript.",
+              ""
+            ],
+            [
+              "//i.imgur.com/ocEL0D3.jpg",
+              "Uno screenshot del nostro certificato di Visualizzazione Dati",
+              "Per ottenere la certificazione di Visualizzazione Dati, dovrai realizzare 10 progetti utilizzando React, Sass e D3.js.",
+              ""
+            ],
+            [
+              "//i.imgur.com/8HCk1Od.jpg",
+              "Uno screenshot del nostro certificato di sviluppatore Back-End",
+              "Per ottenere la certificazione di Sviluppatore Back-End, dovrai realizzare 10 progetti utilizzando Node.js, Express e MongoDB. Userai Git e Heroku per distribuirli in rete.",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "Una schermata della nostra directory dei progetti no-profit.",
+              "Dopo aver ottenuto tutti e tre i certificati, potrai collaborare con un altro camper e utilizzerai metodologie di sviluppo 'Agili' per sviluppare due progetti reali per delle organizzazioni no-profit. Inoltre dovrai aggiungere funzionalità a due progetti no-profit sviluppati precedentemente. Quando avrai finito, avrai un portafoglio di applicazioni reali utilizzate quotidianamente.",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Un'immagine di alcuni campers che lavorano insieme ai progetti in un bar a Seoul.",
+              "Una volta completati tutti i problemi e i progetti, per l'equivalente di 2080 ore, potrai ottenere la nostra Certificazione di sviluppatore Full-Stack. Offriamo gratuitamente anche delle simulazioni di colloqui di lavoro. Abbiamo anche una Bacheca in cui i datori di lavoro stanno cercando dei campers che abbiano completato le certificazioni di freeCodeCamp. ",
+              ""
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Aprenda como o freeCodeCamp funciona",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "Imagem dos 4 benefícios do freeCodeCamp: Conecte-se, Aprenda Javascript, Construa seu Portfolio, Ajude Organizações Sem Fins Lucrativos",
+              "Bem-vindo ao freeCodeCamp. Nós somos uma comunidade open source cujo objetivo é ajudá-lo(a) a aprender a programar, e a praticar através da construção de projetos para organizações sem fins lucrativos.",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "Um screenshot de alguns dos nossos campistas programando em Toronto.",
+              "<bold>Aprender a programar é difícil.</bold> Para ter sucesso, você precisará de muita prática e apoio. É por isto que criamos um rigoroso programa de estudos e uma comunidade bastante acolhedora.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "Foto de três campistas que conseguiram emprego depois de aprender a programar através do freeCodeCamp.",
+              "freeCodeCamp é o caminho certo em direção ao seu primeiro emprego como desenvolvedor(a) de software. Várias empresas já contrataram milhares de pessoas como você que aprenderam a programar através do freeCodeCamp.",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "Gráfico da taxa de crescimento das vagas de emprego em relação ao crescimento do total de formandos em ciências da computação. Existem 1.4 milhões vagas de emprego e apenas 400 mil pessoas para preenchê-las.",
+              "Existem milhares de vagas de emprego não preenchidas para desenvolvedores de softwares e a demanda para programadores cresce a cada ano.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "Uma ilustração mostrando que você aprenderá HTML5, CSS3, JavaScript, Bancos de Dados, Git, Node.js, React e D3.",
+              "Nós temos centenas de desafios opcionais de programação que o(a) ensinarão as principais tecnologias de desenvolvimento web como HTML5, Node.js e bancos de dados.",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Imagem de um campista numa cafeteria construindo projetos no freeCodeCamp.",
+              "Nós acreditamos que as pessoas aprendem melhor na prática, portanto você gastará a maior parte do seu tempo de fato construindo projetos. Nós proveremos a você uma lista de espeficicações (agile user stories), e você dará um jeito de construir aplicações que satisfaçam essas espeficações.",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpg",
+              "Uma imagem mostrando nossos certificados de front-end, back-end e visualização de dados (400 horas cada), nossos projetos sem fins lucrativos (800 horas) e preparação para entrevista (80 horas), totalizando 2.080 horas de experiência em programação.",
+              "Nosso programa de estudos está dividido em 4 certificações. Estas certificações são padronizadas e podem ser verificadas a qualquer momento por seus clientes freelance e futuros empregadores. Assim como tudo no freeCodeCamp, essas certificações são gratuitas. Nós recomendamos que elas sejam feitas em ordem, mas você é livre para fazê-las como preferir. As primeiras três certificações levam 400 horas cada e a certificação final leva 800 horas e envolve a construção de projetos reais para organizações sem fins lucrativos.",
+              ""
+            ],
+            [
+              "//i.imgur.com/akGfLoa.jpg",
+              "Uma foto de nossa certificação de desenvolvimento Front End",
+              "Para ganhar nossa certificação verificada de desenvolvimento Front End, você terá que construir 10 projetos usando HTML, CSS, jQuery e JavaScript.",
+              ""
+            ],
+            [
+              "//i.imgur.com/ocEL0D3.jpg",
+              "Uma foto de nosso certificado de Visualização de Dados",
+              "Para ganhar nossa certificação verificada de Visualização de Dados, você terá que construir 10 projetos usando React, Sass e D3.js.",
+              ""
+            ],
+            [
+              "//i.imgur.com/8HCk1Od.jpg",
+              "Uma foto de nossa certificação de desenvolvimento Back End",
+              "Para ganhar nossa certificação verificada de desenvolvimento Back End, você terá que construir 10 projetos usando Node.js, Express e MongoDB. Você usará Git e Heroku para implementá-los na nuvem.",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "Uma foto de nosso diretório de projetos sem fins lucrativos.",
+              "Após você completar todos os três certificados, você formará uma equipe com outro campista e usará metodologias ágeis de desenvolvimento de software para construir dois projetos reais para organizações sem fins lucrativos. Você também adicionará funcionalidades a dois projetos sem fins lucrativos pré-existentes. Quando terminar, você terá um portfolio com projetos reais que pessoas usam todos os dias.",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Uma imagem de campistas construindo projetos juntos em Seoul.",
+              "Se você completar todas as 2.080 horas de desafios e projetos, você ganhará nosso certificado de desenvolvimento Full Stack. Nós lhe ofereceremos prática gratuita para entrevistas de programação. Nós ofereceremos ainda um portal de empregos onde empregadores especificamente contratam campistas que conseguiram certificações no freeCodeCamp.",
+              ""
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Узнайте как работает freeCodeCamp",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "4 преимущества freeCodeCamp: подключайтесь, учите JavaScript, создавайте ваше портфолио, помогайте некоммерческим организациям.",
+              "Добро пожаловать в freeCodeCamp. Мы открытое сообщество занятых людей, которые изучают программирование и помогают некоммерческим организациям.",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "Некоторое количество наших участников, программирующих вместе в Торонто.",
+              "<bold>Учиться программировать сложно.</bold> Для успеха вам понадобится много практики и поддержки. Именно поэтому мы создали строгую учебную программу и поддерживающее сообщество.",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "Граф скорости роста предложений работы по сравнению со скоростью роста количества выпускников, изучивших информатику - 1.4 миллиона вакансий и только 400 тысяч людей для их заполнения.",
+              "Существует множество пустеющих вакансий для программистов, и спрос на программистов растёт с каждым годом.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "Фото троих участников, получивших работу после изучения программы freeCodeCamp.",
+              "freeCodeCamp - проверенный путь к вашей первой работе в области программирования. Фактически, мало кто выполнил нашу учебную программу целиком, так как участники получают работы до того, как успевают это сделать.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "",
+              "Иллюстрация, показывающая, что вы изучите HTML5, CSS3, JavaScript, Databases, Git, Node.js, React и D3.",
+              "У нас есть сотни необязательных заданий, которые научат вас применению основополагающих технологий web-разработки, например: HTML5, Node.js и базы данных.",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Изображение участника, работающего над созданием проектов по программе freeCodeCamp в кафе.",
+              "Мы верим, что люди лучше всего учатся на практике. Поэтому большую часть своего времени вы потратите на непосредственную работу над проектами. Мы предоставим вам список спецификаций (гибких пользовательских историй), и вы разберётесь как создать приложения, которые им удовлетворяют.",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpg",
+              "Изображение наших сертификаций: клиентской, серверной и по визуализации данных (400 часов каждая), наших некоммерческих проектов (800 часов), и подготовки к интервью (80 часов), что складывается в 2,080 часов опыта в области программирования.",
+              "Наша учебная программа разделена на 4 сертификации. Эти сертификации стандартизованы и могут быть мгновенно проверены вашими клиентами и будущими работодателями. Как и всё остальное в freeCodeCamp, эти сертификации бесплатны. Мы рекоммендуем проходить эти сертификационные программы в заданной очереди, но вы можете выполнять их в любом порядке. Первые три сертификации занимают по 400 часов каждая, а конечная сертификаци занимает 800 часов и включает создание реальных проектов для некоммерческих организаций.",
+              ""
+            ],
+            [
+              "//i.imgur.com/k8btNUB.jpg",
+              "Изображение нашего сертификата разработчика клиентской части",
+              "Для получения нашего проверенного сертификата разработчика клиентской части, вы создадите 10 проектов с применением HTML, CSS, jQuery и JavaScript.",
+              ""
+            ],
+            [
+              "//i.imgur.com/Et3iD74.jpg",
+              "Изображение нашего сертификата по визуализации данных",
+              "Для получения нашего сертификата по визуализации данных, вы создадите 10 проектов с применением React, Sass и D3.js.",
+              ""
+            ],
+            [
+              "//i.imgur.com/8v3t84p.jpg",
+              "Изображение нашего сертификата разработчика серверной части",
+              "Для получения нашего сертификата разработчика серверной части, вы создадите 10 проектов с применением Node.js, Express и MongoDB. Вы будете использовать Git и Heroku для их размещения в облаке.",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "Изображение нашего указателя проектов для некоммерческих организаций.",
+              "После завершения всех трёх сертификаций, вы объединитесь в команду с другим участником и будете применять гибкие методологии разработки программного обеспечения для создания двух реальных проектов для некоммерческих организаций. Также, вы добавите функционал к двум устаревшим некоммерческим проектам. К моменту завершения у вас в портфолио будут реальные приложения, которые люди используют каждый день.",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Изображение участников, вместе работающих над проектами в кафе в Сеуле.",
+              "Если вы завершите всю программу, эквивалентную 2,080 часам заданий и проектов, вы получите наш сертификат разработчика полного стека. Мы предложим вам бесплатную практику прохождения интервью при приёме на работу программистом. Мы даже предоставляем доску объявлений, где работодатели целенаправленно нанимают участников проекта, получивших сертификаты.",
+              ""
+            ]
+          ]
+        },
+        "tw": {
+          "title": "如何使用 Free Code Camp",
+          "description": [
+            [
+              "//i.imgur.com/6ibIavQ.jpg",
+              "Free Code Camp 四大好處: 接觸其他 Camper (開發者), 學習 JavaScript, 打造個人非凡履歷, 幫助非營利事業",
+              "歡迎加入 Free Code Camp. 幫助您學習程式的開源社群, 在此您可透過協助非營利事業的專案, 學習程式開發",
+              ""
+            ],
+            [
+              "//i.imgur.com/Elb3dfj.jpg",
+              "多倫多的 Camper 聚會一景",
+              "<bold>學寫程式不簡單</bold> 想成功, 你會需要很多的練習和幫助, 因此我們準備了綿密的課程, 以及熱心幫助的社群",
+              ""
+            ],
+            [
+              "//i.imgur.com/WD3STY6.jpg",
+              "三位 Camper 在 Free Code Camp 學習後順利取得工作",
+              "Free Code Camp 是你取得第一份軟體工作的幫手, 目前有數以千計, 像你一樣的人們在 Free Code Camp 學習完畢後順利被公司招聘",
+              ""
+            ],
+            [
+              "//i.imgur.com/D7Y5luw.jpg",
+              "資訊工程學位需求圖。世上有一千四百萬的工作機會, 卻只有四百萬的供給, 數以千計的軟體工程師職缺求賢若渴著, 而需求每年都還在成長",
+              ""
+            ],
+            [
+              "//i.imgur.com/vLNso6h.jpg",
+              "您會學習到關於 HTML5, CSS3, Javascript, Database, Git, Node.js, React 和 D3 等核心技術",
+              "數以百計的程式挑戰等著你, 讓您學到網頁開發的基礎技術例如 HTML5, Node.js 和資料庫",
+              ""
+            ],
+            [
+              "//i.imgur.com/UVB9hxp.jpg",
+              "Camper 們在咖啡店開發 Free Code Camp 專案一景",
+              "我們相信做從中學, 因此你大多數的時間將會用於實際專案開發. 我們會給您規格的列表(agile user stories), 而您將會了解到如何打造應用程式來滿足這些需求",
+              ""
+            ],
+            [
+              "//i.imgur.com/pbW7K5S.jpg",
+              "前端, 後端和資料視覺化的認證 (每個 400 小時), 非營利專案 (800 小時), 以及面試準備 (80 小時). 共 2080 小時的開發經驗",
+              "我們的課程分成四項認證, 均依照業界標準並可讓您的案主或雇主馬上驗證. 而就和其他在 Free Coe camp 的事情一樣, 都是免費的. 我們建議學習過程要照順序, 但您也可以依情況自由選擇. 前三個認證每個需要400小時, 最後一個需要 800 小時, 且涵蓋在真實環境中幫非營利組織實際開發專案的過程.",
+              ""
+            ],
+            [
+              "//i.imgur.com/akGfLoa.jpg",
+              "前端開發認證",
+              "要取得前端開發認證, 您需要用 HTML, CSS, jQuery 和 Javascript 完成十個專案",
+              ""
+            ],
+            [
+              "//i.imgur.com/ocEL0D3.jpg",
+              "資料視覺化認證",
+              "要取得資料視覺化認證, 您需要用 React, Sass 和 D3.js 完成十個專案",
+              ""
+            ],
+            [
+              "//i.imgur.com/8HCk1Od.jpg",
+              "後端開發認證",
+              "要取得後端開發認證, 您需要用Node.js, Express 和 MongoDB 完成十個專案, 並用Git 和 Heroku 佈署到雲端",
+              ""
+            ],
+            [
+              "//i.imgur.com/yXyxbDd.jpg",
+              "非營利專案一景",
+              "在您完成以上三個認證後, 您將會和其他 Camper 組隊, 使用敏捷開發技巧, 為非營利組織完成兩個實際專案, 以及加強兩份老舊的原始碼. 當您完成的時候, 您的個人經歷將能包含開發了正在被廣泛使用的應用程式",
+              ""
+            ],
+            [
+              "//i.imgur.com/PDGQ9ZM.jpg",
+              "Campers 在首爾協同作業一景",
+              "如果您完成全部 2080 小時的挑戰和專案, 您將會得到全端工程師認證, 我們將提供免費的面試練習和工作機會, 有些雇主特別喜歡雇用有 Free Cade Camp 認證的 Camper 們",
+              ""
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "560add37cb82ac38a17513bf",
+      "title": "Create a GitHub Account and Join our Chat Rooms",
+      "description": [
+        [
+          "//i.imgur.com/EAR7Lvh.jpg",
+          "A screenshot of our one of our Gitter chat rooms.",
+          "Before we start coding, let's join freeCodeCamp's chat rooms. You can come here any time of day to hang out, ask questions, or find another camper to pair program with. First you'll need a GitHub account.",
+          ""
+        ],
+        [
+          "//i.imgur.com/n6GeSEm.gif",
+          "A gif showing you to click the link below to go to GitHub. Fill in the necessary fields and click submit. Then check your email inbox for an email from GitHub so you can verify your account.",
+          "Click the \"Open link in new tab\" button below to open up GitHub. Create a GitHub account by filling in the form. Be sure to use your real email address - GitHub will keep this private. Then check your email inbox for an email from GitHub. Open it and click the \"verify email address\" button inside it. <br><div class=\"small\">Note: If you already have a GitHub account, you can skip this step by clicking \"Open link in new tab\", closing the new tab that opens, then clicking \"go to my next step\". We removed our \"skip step\" button because many people would just click it repeatedly without doing these important steps.</div>",
+          "https://github.com/join"
+        ],
+        [
+          "//i.imgur.com/hFqAEr8.gif",
+          "A gif showing you how to click the profile image in the upper right hand corner of GitHub. Upload a photo of yourself or you will continue to use the automatically generated pixel art. Then fill in the remaining form fields and click submit.",
+          "Click the pixel art in the upper right hand corner of GitHub, then choose settings. Upload a picture of yourself. A picture of your face works best. This is how your fellow campers will see you in our chat rooms, so look your best. You can add your city and your name if you want.",
+          "https://github.com/settings/profile"
+        ],
+        [
+          "//i.imgur.com/ommZH5V.gif",
+          "A gif showing you freeCodeCamp's GitHub repo.",
+          "Open freeCodeCamp's open-source repository. This is where our volunteer team collaborates on building freeCodeCamp.",
+          "https://github.com/freeCodeCamp/freeCodeCamp"
+        ],
+        [
+          "//i.imgur.com/OmRmLB4.gif",
+          "A gif showing you how to click the link below to go to our chat room and click the \"sign in with GitHub\" button. Then you can click into the text input field and type a message to your fellow campers.",
+          "Now that you have a GitHub account, you can join our main chat room by logging in with GitHub. Please do not sign in with Twitter. Introduce yourself by saying \"Hello world!\" Tell your fellow campers how you found freeCodeCamp. Also tell us why you want to learn to code.",
+          "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+        ],
+        [
+          "//i.imgur.com/ud03jig.gif",
+          "A gif showing you how you can click the settings button in the upper right hand corner and modify your notification settings.",
+          "Our chat rooms are extremely active. You should change your settings so you're only notified if someone mentions you.",
+          ""
+        ],
+        [
+          "//i.imgur.com/T0bGJPe.gif",
+          "A gif showing how you can click on a user profile image to initiate a private message with that user.",
+          "Please note that all of our chat rooms are visible to the public. If you need to share sensitive information, such as an email address or phone number, do it in a private message.",
+          ""
+        ],
+        [
+          "//i.imgur.com/GqSiNn5.gif",
+          "A gif showing that you can tab back and forth between challenges and our chat rooms.",
+          "Keep our chat room open while you work through our challenges. That way, you can ask for help if you get stuck. You can also socialize with other campers when you feel like taking a break.",
+          ""
+        ],
+        [
+          "//i.imgur.com/WvQvNGN.gif",
+          "A gif showing how you can click the link below to download a native chat room app for your computer.",
+          "You can also download the chat room app to your computer or phone.",
+          "https://gitter.im/apps"
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "de": {
+          "title": "Erstelle einen GitHub Account und tritt unserem Chat bei",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Ein Screenshot von einem userer Gitter Chats.",
+              "Bevor wir zu programmieren beginnen, lass uns den freeCodeCamp Chats beitreten. Hier kannst du zu jeder Tageszeit kommen, Fragen stellen oder einen anderen Camper suchen um gemeinsam zu programmieren. Doch zuerst benötigst du einen GitHub Account.",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "Ein GIF das zeigt wie der unten stehenden Link angeklickt wird um auf GitHub zu kommen. Füll die notwendigen Felder aus und bestätige. Dann schau in deine Mails nach einer Nachricht von GitHub um deinen Account zu verifizieren.",
+              "Klicke unten auf den \"Link in neuem Tab öffnen\" Button um GitHub zu öffnen. Erstelle einen GitHub Account indem du die Felder in dem Formular ausfüllst. Überprüfe ob du deine echte Emailadresse verwendest - GitHub wird sie nicht weitergeben. Dann suche in deinem Posteingang nach einer Nachricht von GitHub. Öffne sie und klicke den darin befindenden \"Emailadresse bestätigen\" Button. <br><div class=\"small\">Hinweis: Wenn du bereits einen GitHub Account besitzt, kannst du diesen Schritt überspringen, indem du \"Link in neuem Tab öffnen\" drückst, den neuen Tab schließt und dann auf \"Gehe zu nächstem Schritt\" klickst. Wir haben den \"Schritt überspringen\" Button entfernt weil viele Leute sich einfach durchgeklickt haben ohne diese wichtigen Schritte zu tun</div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Ein GIF das dir zeigt wie man sein Profilebild im rechten oberen Eck von GitHub anklickt. Lade ein Foto von dir hoch oder verwende weiterhin das automatisch generierte Pixelbild. Dann fülle die übrigen Formularfelder aus und klicke auf Bestätigung.",
+              "Klicke auf das Pixel-Art Bild in der rechten oberen Ecke von GitHub, dann gehe auf Einstellungen (settings). Lade ein Bild von dir hoch. Ein Foto von deinem Gesicht bietet sich am Besten an. So sehen dich die anderen Camper im Chat, also mach dich schick. Du kannst deine Stadt und deinen Namen hinzufügen, falls du willst.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "Ein GIF das dir zeigt wie man einem GitHub Repository einen Stern gibt",
+              "Öffne freeCodeCamp's open-source Repository. Hier arbeitet das ehrenamtliche Team zusammen an freeCodeCamp. Du kannst unserem Repositoy einen Stern geben. Das ist das GitHub Äquivalent für etwas \"liken\"",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "Ein GIF das dir zeigt wie der unten stehende Link geklickt, auf den Chat weitergeleitet und mit dem \"Melde dich mit GitHub an\" Button man angemeldet wird. Dann kannst du auf das Textfeld klicken und eine Nachricht an andere Camper schicken",
+              "Jetzt, da du einen GitHub Account besitzt, kannst du unserem Hauptchat beitreten indem du dich mit GitHub anmeldest. Bitte melde dich nicht mit Twitter an. Stell dich vor indem du \"Hello World\" schreibst. Erzähl den anderen Campern wie du freeCodeCamp gefunden hast. Außerdem könntest du uns erzählen warum du programmieren lernen willst.",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "Ein Gif das dir zeigt wie man den Einstellungsbutton im oberen rechten Eck anklickt und die Benachrichtigungseinstellungen ändert.",
+              "Unsere Chats sind sehr aktiv. Du solltest die Einstellungen ändern, damit du nur benachrichtigt wirst falls dich jemand erwähnt",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "Ein GIF das dir zeigt wie man ein Profilbild von einem anderen User anklickt um eine private Nachricht zu versenden.",
+              "Sei dir bitte bewusst, dass alle unsere Chats komplett öffentlich sind. Falls du also sensible Informationen, wie zum Beispiel Emailadressen oder Telefonnummern, austauschen willst, verwende Privatnachrichten.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "Ein GIF das dir zeigt, dass du mithilfe mehrerer Tabs zwischen Aufgaben und dem Chat hin und her wechseln kannst",
+              "Halte den Chat offen, während du an den Aufgaben arbeitest. So kannst du jederzeit nach Hilfe fragen falls du nicht weiterkommst. Außerdem kannst du dich mit anderen Campern unterhalten falls du eine Pause brauchst.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "Ein GIF das dir zeigt wie du den den untenstehenden Link klickst um die native Chatapp für deinen Computer herunterzuladen.",
+              "Du kannst dir auch die Chatapp für deinen Computer oder dein Smartphone herunterladen.",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "es": {
+          "title": "Crea una Cuenta de GitHub y Únete a nuestras Salas de Chat",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Una imagen de una de nuestras salas de chat en Gitter.",
+              "Ahora únete a las salas de chat de freeCodeCamp. Puedes venir aquí en cualquier momento para charlar, hacer preguntas, o encontrar otro campista para programar juntos. Primero necesitarás una cuenta de GitHub.",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "Una imagen mostrándote como pulsar en el enlace inferior para ir a GitHub, llenar los campos necesarios y enviarlos.",
+              "Crea una cuenta en GitHub. Asegúrate de usar tu dirección de correo real - GitHub mantendrá esto en privado.",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Un gif mostrándote como pulsar en la imagen de perfil en la esquina superior derecha de GitHub. Sube una foto tuya o continuaras usando la imagen de píxeles generada automáticamente. Entonces llena los campos restantes y haz clic en enviar.",
+              "En la esquina superior derecha pulsa sobre la imagen de píxeles, entonces selecciona configuraciones. Sube una imagen tuya. Una foto de tu cara es mejor. Así es como tus compañeros campistas te verán en nuestras salas de chat, así que toma tu mejor ángulo. Puedes añadir tu ciudad y tu nombre si lo deseas.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "Un gif mostrándote como puedes dar una estrella a un repositorio de GitHub.",
+              "Ve al repositorio de código libre de freeCodeCamp y dale una \"estrella\". Las \"estrellas\" son el equivalente en GitHub de los \"me gusta\".",
+              "Si quieres, ve al repositorio de código libre de freeCodeCamp.",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "Un gif mostrándote como pulsar en el enlace inferior para ir a nuestra sala de chat y pulsar en el botón de \"iniciar sesión con GitHub\". Entonces puedes pulsar en el próximo campo de texto y escribir un mensaje a tus compañeros campistas.",
+              "Ahora que tienes una cuenta de GitHub, puedes unirte a nuestro chat principal al iniciar sesión con GitHub. Por favor no ingrese con Twitter. Preséntate diciendo \"Hello world!\" Cuéntales a los tus compañeros campistas como encontraste freeCodeCamp. Además cuéntanos porque deseas aprender a programar.",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "Un gif mostrándote como puedes pulsar en el botón de configuraciones en la esquina superior derecha y modificar tus configuraciones de notificaciones.",
+              "Nuestras salas de chat son extremadamente activas. Deberías cambiar tus configuraciones para ser notificado únicamente si alguien te menciona.",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "Un gif mostrándote como puedes pulsar en la imagen de perfil de un usuario para iniciar una conversación privada con ese usuario.",
+              "Por favor nota que todas nuestras salas de chat son visibles para el público. Si necesitas compartir información privada, como una dirección de correo o un número de teléfono, hazlo en un mensaje privado.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "Un gif mostrándote que puedes cambiar entre desafíos y nuestras salas de chat.",
+              "Mantén nuestra sala de chat abierta mientras trabajas en nuestros desafíos. De esta manera, puedes pedir ayuda si quedas atascado. Además puedes socializar con otros campistas cuando quieras tomar un descanso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "Un gif mostrándote como puedes pulsar abajo para descargar una aplicación de chat nativa para tu computadora.",
+              "También puedes descargar la aplicación de chat para tu computadora o teléfono móvil.",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "fr": {
+          "title": "Créer un compte GitHub et rejoignez nos Salons de chat",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Une capture d'écran de notre l'un de nos Gitter salles de chat.",
+              "Avant de commencer à coder, nous allons rejoindre les salles de chat de Camp Code Free . Vous pouvez venir ici tout moment de la journée pour se détendre , poser des questions , ou trouver un autre camping de jumeler programme avec. D'abord, vous aurez besoin d'un compte GitHub.",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "Un gif vous montrant à cliquer sur le lien ci-dessous pour aller à GitHub . Remplissez les champs nécessaires et cliquez sur soumettre . Ensuite, vérifiez votre boîte de réception pour un courriel de GitHub sorte que vous pouvez vérifier votre compte.",
+              "Cliquez sur le \"lien Ouvrir dans une nouvelle touche de tabulation\" ci-dessous pour ouvrir GitHub. Créer un compte GitHub en remplissant le formulaire . Assurez-vous d'utiliser votre adresse email réelle - GitHub gardera cette privé. Ensuite, vérifiez votre boîte de réception pour un courriel de GitHub. Ouvrez-le et cliquez sur \"l'adresse email sur vérifier\" l'intérieur. <br><div class=\"small\">Remarque: Si vous avez déjà un compte GitHub , vous pouvez sauter cette étape en cliquant sur \"Ouvrir le lien dans un nouvel onglet\", fermeture le nouvel onglet qui ouvre, puis en cliquant \"aller à ma prochaine étape\". Nous avons retiré notre bouton de \"l'étape de saut\" , car beaucoup de gens il suffit de cliquer à plusieurs reprises sans faire ces étapes importantes.</div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Un gif vous montrant comment cliquez sur l' image de profil dans le coin supérieur droit de GitHub. Télécharger une photo de vous-même ou vous allez continuer à utiliser l'art de pixel généré automatiquement . Ensuite, remplissez les champs du formulaire restants et cliquez sur soumettre.",
+              "Cliquez sur le pixel art dans le coin supérieur droit de GitHub , puis choisissez les paramètres . Télécharger une photo de vous-même. Une photo de votre visage qui fonctionne le mieux . Voici comment les autres campeurs vous voir dans nos salles de chat , donc regarder votre meilleur . Vous pouvez ajouter votre ville et votre nom si vous voulez.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "Un gif montrant comment vous pouvez activer un repo GitHub.",
+              "Ouvrez open-source du dépôt central de Camp Code Free . Ceci est où notre équipe de bénévoles collabore à la construction de Camp Code Free.",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "Un gif vous montrant comment Cliquez sur le lien ci-dessous pour accéder à notre salle de chat et cliquez sur \"Se connecter avec\" bouton GitHub. Puis vous pouvez cliquer dans le champ de saisie de texte et saisissez un message à vos amis campeurs.",
+              "Maintenant que vous avez une GitHub compte, vous pouvez vous joindre à notre principale salle de chat en vous connectant à GitHub. Ne connectez-vous pas avec Twitter. Présentez-vous en disant \"Hello World!\" avertissez votre amis campeurs comment vous avez trouvé Libre Code Camp. Aussi nous dire pourquoi vous voulez apprendre à code.",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "Un gif vous montrant comment vous pouvez cliquez sur le bouton Réglages dans le coin supérieur droit et modifier vos paramètres de notification.",
+              "Nos salles de chat sont extrêmement actifs. Vous devez modifier vos paramètres pour vous're notifié que si quelqu'un vous mentionne.",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "Un gif montrant comment vous pouvez cliquer sur une image de profil utilisateur pour lancer un message privé avec cet utilisateur.",
+              "Veuillez noter que tous nos salons de chat sont visibles pour le public. Si vous avez besoin de partager des informations sensibles, comme un numéro de téléphone ou l'adresse e-mail, faites-le dans un message privé.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "Un gif montrant que vous pouvez Tab et retour entre défis et nos salles de chat.",
+              "Garder notre salle de discussion ouverte pendant que vous travaillez à travers nos défis. De cette façon, vous pouvez demander de l'aide si vous êtes coincé. Vous pouvez également socialiser avec d'autres campeurs lorsque vous sentez comme prendre une pause.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "Un gif montrant comment vous pouvez cliquer sur le lien ci-dessous pour télécharger un natif salle de chat app pour votre ordinateur.",
+              "Vous pouvez également télécharger la salle de chat app pour votre ordinateur ou votre téléphone.",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "it": {
+          "title": "Crea un account GitHub e iscriviti alle nostre Chat Rooms",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Uno screenshot di una delle nostre chat rooms in Gitter.",
+              "Prima di iniziare a scrivere codice, entra nelle chat di freeCodeCamp. Potrai venire qui in ogni momento della giornata per chiacchierare, fare domande, o trovare un altro camper per programmare in coppia. Prima di tutto avrai bisogno di un account GitHub.",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "Una gif che invita a cliccare sul link qui sotto per andare su GitHub. Compila i campi necessari e fare clic su Invia. Quindi controlla la tua casella di posta elettronica, riceverai una e-mail da GitHub per verificare il tuo account.",
+              "Clicca sul pulsante \" Apri link in una nuova scheda \" qui sotto per aprire GitHub. Crea un account compilando il modulo. Assicurati di utilizzare un indirizzo email reale - GitHub lo terrà privato. Poi controlla la tua casella di posta, riceverai un'e-mail da GitHub. Aprila e clicca il pulsante \"verificare l'indirizzo e-mail \" al suo interno <br> <div class=\"small\">. Nota: Se disponi già di un account GitHub, è possibile saltare questo passaggio cliccando \"Apri link in una nuova scheda \", chiudendo poi la scheda appena aperta, quindi facendo clic su \"Vai al mio prossimo passo \". Abbiamo rimosso il pulsante \"Salta il passaggio \" perché molte persone lo premerebbero ripetutamente, saltando questi importanti passaggi. </ div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Una gif che mostra come cliccare l'immagine del profilo nell'angolo in alto a destra di GitHub. Carica una foto di te altrimenti continuerai ad utilizzare la pixel art generata automaticamente. Poi, compila gli altri campi del modulo e fai clic su Invia.",
+              "Clicca sulla pixel art nell'angolo in alto a destra di GitHub, quindi seleziona impostazioni. Carica una foto di te stesso. Una foto del viso è la scelta migliore. Gli altri campers ti vedranno così nelle nostre chat rooms, quindi cerca di apparire al meglio . È anche possibile aggiungere la tua città e il tuo nome.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "Una gif che mostra la repository GitHub di freeCodeCamp.",
+              "Apri la repository open-source di freeCodeCamp. E' qui che il nostro team di volontari collabora allo sviluppo di freeCodeCamp.",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "Una gif che mostra come cliccare sul link qui sotto per andare alla nostra chat room e fare clic sul pulsante \" accedi con GitHub \". Quindi potrai cliccare nel campo di immissione testo e digitare un messaggio agli altri campers.",
+              "Ora che disponi di un account GitHub, puoi aggiungerti alla nostra chat principale effettuando il login con GitHub. Si prega di non accedere con Twitter. Presentati dicendo \" Hello World! \"Dì ai campers come hai trovato freeCodeCamp. Dicci anche perché vuoi imparare a programmare. ",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "Una gif che mostra come cliccare sul pulsante Impostazioni nell'angolo in alto a destra e modificare le impostazioni di notifica.",
+              "Le nostre chat rooms sono estremamente attive. È preferibile modificare le impostazioni in modo da essere notificati solo se qualcuno ti menziona direttamente.",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "Una gif che mostra come cliccare sull'immagine di un profilo utente per avviare una conversazione privata con quell'utente.",
+              "Ti preghiamo di notare che tutte le nostre chat rooms sono visibili al pubblico. Se hai bisogno di condividere le informazioni sensibili, come ad esempio un indirizzo email o il numero di telefono, fallo in un messaggio privato.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "Una gif che mostra come passare ripetutamente tra i problemi e le nostre chat rooms.",
+              "Mantieni aperta la nostra chat mentre lavori ai nostri problemi. In questo modo, potrai chiedere aiuto se ti troverai in ​​difficoltà. Potrai anche socializzare con gli altri campers, quando avrai voglia di prendere una pausa.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "Una gif che mostra come è possibile fare clic sul link qui sotto per scaricare applicazione di chat nativa per il computer.",
+              "È anche possibile scaricare un'applicazione nativa per il computer o il telefono.",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "ja": {
+          "title": "Githubアカウントを作成し、チャットに参加しましょう",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Gitterチャットルームの一場面です。",
+              "コーディングを始める前に、freeCodeCamp のチャットルームに参加してください。いつでも、雑談や質問ができたりペアプログラミングをするための仲間を見つけ流ことができます。最初に GitHub アカウントが必要です。",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "この gif は GitHub を開始するまでの流れを表しています。必要な欄に情報を入れて登録をしてください。そして GitHub からあなたのメールアドレス宛にメールが届きますのでアカウントを承認してください。",
+              "\"Open link in new tab\"をクリックして GitHub を開いてください。 必要な欄に情報を入力して GitHub アカウントを作ってください。実際に使われている email アドレスかを確認してください( GitHub にはこの情報が保存されます )。メールアドレス宛に GitHub からメールが来たことを確認してください。 メールにある\"verify email address\"をクリックして開いてください。<br><div class=\"small\">注意： もしすでに GitHub アカウントを持っていたら、あなたは \"Open link in new tab\" をクリックすることでこのステップを飛ばすことができます、新しく開かれたタブを閉じて \"go to my next step\" をクリックしてください。私たちはこの大事なステップが飛ばされてしまうのを防ぐために \"このステップを飛ばす\" ボタンは削除してあります。</div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "この gif は GitHub の右上にあるプロフィール画像をクリックする方法です。あなたの写真をアップロードするか、自動で生成されるピクセルアートを利用してください。そして、残りの欄に情報を入力し submit ボタンを押してください。",
+              "GitHub の右上に表示されているピクセルアートをクリックしてください、そして settings を選んでください。あなたの画像をアップロードしてください。画像はあなたの顔が写っていると良いです。他のキャンパーズの仲間たちがチャットルームであなたを見かけるようになります。住んでいる場所や名前を登録することもできます",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "この gif は GitHub のレポジトリへのスターをつける方法です。",
+              "オープンソースの freeCodeCamp のレポジトリを開いてください。これは私たちボランティアチームの協力者が freeCodeCamp で作っているものです。",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "この git は私たちのチャットルームへのリンクをクリックして、\"sign in with GitHub\" ボタンをクリックしています。そして、テキストを入力してキャンパーズの仲間へメッセージを送る方法を表しています。",
+              "あなたは GitHub のアカウントを持っているので、私たちのチャットルームへ GitHub を利用してログインできます。\"Hellow world!\" と言って自己紹介をし、あなたがどうやって freeCodeCamp を見つけたかや何故プログラミングを学びたいのかを私たちに話してください。",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "この gif は右上の settings ボタンを押すことで、通知の設定を変更する方法を表しています。",
+              "私たちのチャットルームはとても活発です。あなたは誰かがあなたに対してメンションを送った時にだけ通知してもらうように設定を変更した方が良いでしょう。",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "この gif はどうやって該当するユーザに向けて個人的なメーッセージを送れるようにするかを表しています。",
+              "私たちのチャットルームは全て公開されているので、もしあなたが個人的な情報(メールアドレスや電話番号)を共有したい場合には、プライベートメッセージを利用してください。",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "この gif はチャレンジとチャットルームへの行き来がタブを戻すことでできることを表しています。",
+              "私たちのチャレンジを通して作業をしている間はチャットルームを開いておくと良いでしょう。そうすることで、必要な時に助けを求めることができます。あなたは休憩をしているかのように他のキャンパーズと関わりを持てるでしょう。",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "この gif は、チャットルームアプリをあなたのコンピュータに直接インストールするためにダウンロードする方法を表しています。",
+              "チャットルームのアプリをスマホや自分のパソコンにダウンロードして使うことができます。",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Crie uma conta no Github e junte-se a nossas salas de bate-papo",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Um screenshot de uma de nossas salas de bate-papo Gitter.",
+              "Antes de começarmos a programar, vamos nos juntar às salas de bate-papo do freeCodeCamp. Você pode vir aqui a qualquer hora do dia para socializar, fazer perguntas ou encontar outro campista para programar em dupla. Primeiro, você precisará de uma conta no GitHub.",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "Um gif mostrando o processo para você clicar no botão abaixo para ir ao site do GitHub. Preencha os campos necessários em clique em enviar. Então acesse sua caixa de e-mails e encontre um e-mail enviado pelo GitHub para que você verifique sua conta.",
+              "Clique no botão \"Abrir link em nova aba\" abaixo para abrir o GitHub. Crie uma conta ao preencher o formulário. Certifique-se que você está usando seu e-mail real - o GitHub o manterá em sigilo. Então acesse sua caixa de e-mails e encontre um e-mail enviado pelo GitHub para que você verifique sua conta. Abra-o e clique no botão \"Verifique seu e-mail\" dentro do e-mail recebido. <br><div class=\"small\">Nota: Se você já possui uma conta no GitHub, pode pular este passo clicando em \"Abrir link em nova aba\", fechando a nova aba que abrirá e então clicando em \"avançar para o próximo passo\". Nós removemos o botão \"pular passo\" porque muitas pessoas estavam clicando nele repetidamente sem seguir as instruções.</div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Um gif mostrando como clicar na sua foto de perfil no canto superior direito na página do GitHub. Faça o upload de uma foto sua ou você continuará a usar a foto gerada automaticamente. Preencha os campos restantes no formulário e clique em enviar.",
+              "Clique na foto no canto superior direito na página do GitHub e clique em opções. Faça o upload de uma foto sua. Recomendamos uma foto de seu rosto. É assim que você será visto(a) por seus amigos campistas nas salas de bate-papo. Você pode adicionar sua cidade e seu nome se quiser.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/pYk0wOk.gif",
+              "Um gif mostrando o repositório do freeCodeCamp no GitHub.",
+              "Abra o repositório open-source do freeCodeCamp. É lá que nossa equipe voluntária colabora em construir o freeCodeCamp.",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "Um gif mostrando como clicar no link abaixo para ir à nossa sala de bate-papo e clicar no botão \"entre com GitHub\". Em seguida, você pode clicar no campo de entrada de texto e digitar uma mensagem para os seus colegas campistas.",
+              "Agora que você tem uma conta GitHub, você pode se juntar à nossa sala de chat principal, fazendo login com GitHub. Por favor, não faça login no Twitter. Apresente-se, diga \"Hello world! \" e diga a seus colegas campistas como você encontrou o freeCodeCamp. Também diga-nos por que você quer aprender a programar.",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/Ecs5XAd.gif",
+              "Um gif mostrando como você pode clicar no botão Configurações no canto superior direito e modificar suas configurações de notificação.",
+              "Nossas salas de chat são extremamente ativas. Você deve alterar as configurações para que você seja notificado somente se alguém mencionar seu nome.",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "Um gif mostrando como você pode clicar em uma imagem de perfil para iniciar uma conversa em particular com outro usuário.",
+              "Por favor, note que todas as nossas salas de chat são visíveis ao público. Se você precisa compartilhar informações pessoais, tais como um endereço de e-mail ou número de telefone, compartilhe através de uma mensagem privada.",
+              ""
+            ],
+            [
+              "//i.imgur.com/vDTMJSh.gif",
+              "Um gif mostrando que você pode alternar entre os desafios e nossas salas de chat.",
+              "Mantenha a nossa sala de chat aberta enquanto você trabalha nos desafios. Dessa forma, você pode pedir ajuda se ficar empacado(a) numa parte difícil. Você também pode socializar com outros campistas quando quiser fazer uma pausa.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "Um gif mostrando como você pode clicar no link abaixo para baixar um aplicativo de bate-papo nativo para o seu computador.",
+              "Você também pode baixar o app da sala de chat para o seu computador ou telefone.",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Создайте учётную запись на GitHub и присоединяйтесь к нашим чатам",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "Изображение одного из наших чатов в Gitter",
+              "Давайте, перед тем как приступить к программированию, присоединимся к чатам freeCodeCamp. Вы можете подсоединяться к ним в любое время суток, чтобы просто позависать, позадавать вопросы, или найти другого участника, с которым вы можете объединиться для парной работы. Для начала вам понадобится учётная запись на GitHub.",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "Анимация, показывающая нажатие на ссылку, расположенную ниже, для перехода на GitHub. Заполните требуемые поля и подтвердите отправку данных. Затем проверьте вашу электронную почту на предмет получения письма от GitHub, чтобы вы могли подтвердить создание вашей учётной записи.",
+              "Нажмите кнопку \"Открыть ссылку в новой вкладке\", расположенную ниже, чтобы открыть GitHub. Создайте учётную запись GitHub путём заполнения формы. Убедитесь, что вы используете ваш настоящий адрес электронной почты - GitHub не публикует эту информацию. Затем проверьте ваши входящие на предмет получения письма от GitHub. Откройте его и нажмите кнопку в теле письма \"подтвердить адрес электронной почты\". <br><div class=\"small\">Заметка: Если у вас уже есть учётная запись GitHub, вы можете пропустить этот шаг путём нажатия на \"Открыть ссылку в новой вкладке\", закрывания открывшейся вкладки, последующего нажатия \"перейти к следующему шагу\". Мы убрали кнопку \"пропустить шаг\", так как многие склонны нажимать её повторно несколько раз подряд, пропуская эти важные шаги.</div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Анимация, показывающая нажатие на изображение профиля в верхнем правом углу экрана на GitHub. Загрузите ваше фото или вы продолжите использование автоматически сгенерированного пиксельного изображения. Затем заполните оставшиеся поля формы и подтвердите отправку данных",
+              "Нажмите на пиксельное изображение в правом верхнем углу экрана на GitHub, выберите настройки. Загрузите фаше фото. Изображение вашего лица работает наилучшим образом. Именно так вас будут видеть участники проекта в наших чатах, так что постарайтесь выглядеть наилучшим образом. Вы можете указать ваш город и имя, если хотите.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "Анимация, показывающая как вы можете установить отметку в виде звезды к репо на GitHub.",
+              "Откройте репозиторий freeCodeCamp с открытым кодом. Это место, где наша команда добровольцев сотрудничает над созданием freeCodeCamp. Вы можете отметить наш репозиторий звездой. Эта отметка на GitHub эквивалентна функции \"нравится\".",
+              "https://github.com/freeCodeCamp/freeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "Анимация, показывающая нажатие на ссылку, расположенную ниже, для перехода в чат и нажатие на кнопку \"войти с помощью GitHub\". Затем вы можете нажать на область поля ввода и напечатать сообщение для ваших приятелей, являющихся участниками проекта.",
+              "Теперь, когда у вас есть учётная запись GitHub, вы можете присоединиться к нашему основному чату, войдя с помощью GitHub. Представьтесь отправив фразу \"Hello world!\". Сообщите вашим приятелям, участвующим в проекте, что вы нашли freeCodeCamp. Также, сообщите нам почему вы хотите изучать программирование.",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "Анимация, показывающая нажатие на кнопку настроек в правом верхнем углу экрана и изменение ваших настроек уведомлений.",
+              "Наши чаты очень активны. Вам следует изменить ваши настройки уведомлений, чтобы вы видели только когда кто-то упоминает вас.",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "Анимация, показывающая нажатие на изображение профиля пользователя для начала личной переписки с этим пользователем.",
+              "Пожалуйста, обратите внимание, что все наши чаты доступны публично. Если вам нужно поделиться чувствительной информацией, например, адресом электронной почты или номером телефона, пользуйтесь для этого личной перепиской.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "Анимация, показывающая перемещение между заданиями и чатами.",
+              "Сохраняйте наши чаты открытыми в процессе работы над заданиями. Таким образом вы сможете обратиться за помощью, если застрянете в процессе выполнения задания. Также, вы можете социализироваться с другими участниками проекта, когда решите сделать перерыв.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "Анимация, показывающая нажатие на ссылку, расположенную ниже, для скачивания приложения-чата на ваш компьютер.",
+              "Также, вы можете скачать и установить приложение-чат на ваш компьютер или телефон.",
+              "https://gitter.im/apps"
+            ]
+          ]
+        },
+        "tw": {
+          "title": "建立 Github 帳號與加入聊天室",
+          "description": [
+            [
+              "//i.imgur.com/EAR7Lvh.jpg",
+              "我們的 Gitter 聊天室一景",
+              "在開始之前, 讓我們先加入 Free Code Camp 的聊天室, 你可以隨時隨地加入, 問問題, 或找夥伴一起寫程式. 但您會需要先申請一個 Github 帳號",
+              ""
+            ],
+            [
+              "//i.imgur.com/n6GeSEm.gif",
+              "點選下方連結前往 Github 示意圖. 填完必填欄位後送出, 並到您的電子信箱收取認證信, 通過 Github帳號認證",
+              "點選 \"Open link in new tab\" 新開視窗前往 Github. 填寫表單建立 Github 帳號. 請填寫使用中的電子信箱 - Github 將會保密. 送出後在您的信箱中找到 Github 的信件並打開, 點選 \"verify email address\" 按鈕.<br><div class=\"small\">注意: 如果您已經有Github帳號, 可跳過此步驟並點選\"Open link in new tab\"然後關閉新開的視窗, 再點選 \"go to my next step\". 我們移除了 \"skip step\" (略過此步驟)的按鈕因為太多人在沒有建立Github帳號的情況下直接跳過此步驟</div>",
+              "https://github.com/join"
+            ],
+            [
+              "//i.imgur.com/hFqAEr8.gif",
+              "Github 個人帳號區示意圖. 上傳照片或使用預設的像素圖, 填寫相關欄位後並送出",
+              "點選右上角像素圖, 選設定(settings), 上傳自己的示意照, 個人相片尤佳, 這能讓其他的 camper 在聊天室中看見你. 你也可以新增城市和名稱.",
+              "https://github.com/settings/profile"
+            ],
+            [
+              "//i.imgur.com/ommZH5V.gif",
+              "Free Code Camp 的 GitHub repo",
+              "打開 Free Code Camp 的開放原始碼 repository. 這裡是由志工們合作開發的 Free Code Camp 程式.",
+              "https://github.com/freecodecamp/freecodecamp"
+            ],
+            [
+              "//i.imgur.com/OmRmLB4.gif",
+              "進入聊天室和 登入Github (\"sign in with GitHub\") 按鈕示意圖. 點選輸入框傳送訊息給其他Camper夥伴",
+              "在建立好 Github 帳號後, 您可以使用該帳號加入聊天室. 說句 \"Hello world!\" 介紹自己吧！和其他人聊聊你是怎麼發現 Free Code Camp, 同時也分享一下學寫程式的動機",
+              "https://gitter.im/FreeCodeCamp/FreeCodeCamp"
+            ],
+            [
+              "//i.imgur.com/ud03jig.gif",
+              "點選右上方設定按鈕, 設定通知訊息",
+              "我們的聊天室內非常活耀, 建議您更改您的通知設定, 以保證只收到有提到您的訊息",
+              ""
+            ],
+            [
+              "//i.imgur.com/T0bGJPe.gif",
+              "點選使用者圖示並發送個人訊息的示意圖",
+              "請記得, 所有我們的聊天室都是公開的, 如果你需要發送敏感資訊, 例如電子郵件位置或電話號碼, 請透過私人訊息發送",
+              ""
+            ],
+            [
+              "//i.imgur.com/GqSiNn5.gif",
+              "在挑戰(challenges)和聊天室中互切換的示意圖",
+              "當你練習我們的挑戰時, 記得打開聊天室. 如果有問題可以隨時隨地發問, 想忙裡偷閒時也可與其他 Camper 互動",
+              ""
+            ],
+            [
+              "//i.imgur.com/WvQvNGN.gif",
+              "下載聊天應用程式到電腦中的示意圖",
+              "您更可下載聊天室 App 到你的電腦或手機中",
+              "https://gitter.im/apps"
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "560add56cb82ac38a17513c0",
+      "title": "Configure Your Code Portfolio",
+      "description": [
+        [
+          "//i.imgur.com/Tw5allJ.gif",
+          "A gif showing how you can click your profile image in your upper right hand corner to your code portfolio and connect GitHub.",
+          "Check out your code portfolio. Click your picture in your upper right hand corner. To activate your code portfolio, you'll need to link your GitHub account with freeCodeCamp. Your code portfolio shows your progress and how many Brownie Points you have. You can get Brownie Points by completing challenges and by helping other campers in our chat rooms. If you get Brownie Points on several days in a row, you'll get a streak.",
+          ""
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "de": {
+          "title": "Erstelle dein Code Portfolio",
+          "description": [
+            [
+              "//i.imgur.com/Tw5allJ.gif",
+              "Ein GIF das dir zeigt wie man sein Profilbild in der rechten oberen Ecke anklickt um zu deinem Code Portfolio zu gelangen und mit GitHub zu verbinden",
+              "Schau dir dein Code Portfolio an. Klick auf dein Profilbild in der rechten oberen Ecke. Um dein Portfolio zu aktivieren musst du deinen GitHub Account mit freeCodeCamp verbinden. Dein Code Portfolio zeigt deinen Fortschritt und wieviele Brownie Punkte du hast. Du bekommst Brownie Punkte wenn du Aufgaben löst oder anderen Campern im Chat hilfst. Wenn du an mehreren Tagen in Folge Brownie Punkte erhälst bekommst du einen \"streak\"",
+              ""
+            ]
+          ]
+        },
+        "es": {
+          "title": "Configura tu portafolio de código",
+          "description": [
+            [
+              "//i.imgur.com/Tw5allJ.gif",
+              "Un gif mostrándote como puedes pulsar en tu imagen de perfil en la esquina superior derecha conectar tu portafolio y GitHub.",
+              "Dale un vistazo de tu portafolio de código. Pulsa en tu imagen en la esquina superior derecha. Para activar tu portafolio de código, necesitaras conectar tu cuenta de GitHub con freeCodeCamp. Tu portafolio de código muestra tu progreso y cuantos Puntos Cafés tienes. Puedes obtener Puntos Cafés completando desafíos y ayudando a otros campistas en nuestras salas de chat. Si obtienes Puntos Cafés varios días consecutivos, obtendrás una racha.",
+              ""
+            ]
+          ]
+        },
+        "fr": {
+          "title": "Configurer votre code portefeuille",
+          "description": [
+            [
+              "//i.imgur.com/Tw5allJ.gif",
+              "Un gif montrant comment vous pouvez cliquez sur l'image de votre profil dans votre coin supérieur droit à votre code portefeuille et connectez GitHub.",
+              "Vérifiez votre code portefeuille. Cliquez sur votre photo dans votre coin supérieur droit. Pour activer votre code portefeuille, vous'll nécessité de lier votre compte avec code sans GitHub Camp. Votre code portefeuille affiche votre progression et combien de bons points vous avez. Vous pouvez obtenir de bons points par remplir les défis et en aidant d'autres campeurs dans nos salles de chat. Si vous obtenez Brownie Points sur plusieurs jours d'affilée, vous'll obtenez une rayure.",
+              ""
+            ]
+          ]
+        },
+        "it": {
+          "title": "Configura il tuo portfolio da programmatore",
+          "description": [
+            [
+              "//i.imgur.com/Tw5allJ.gif",
+              "Una gif che mostra come puoi cliccare l'immagine del profilo in alto a destra per collegare a GitHub il tuo portfolio da programmatore.",
+              "Controlla il tuo portfolio da programmatore. Clicca l'immagine in alto a destra. Per attivare il portfolio da programmatore, è necessario collegare il tuo account GitHub con freeCodeCamp. Il tuo portfolio da programmatore mostra i tuoi progressi e quanti Brownie Points hai. È possibile ottenere i Brownie Points completando i problemi e aiutando altri campers nelle nostre chat rooms. Se si ricevono Brownie Points per diversi giorni di fila, si otterrà uno \"Streak\". ",
+              ""
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Configure o seu portfolio de código",
+          "description": [
+            [
+              "//i.imgur.com/tP2ccTE.gif",
+              "Um gif mostrando como você pode clicar em sua imagem de perfil no canto superior direito para seu portifólio de código e se conectar com GitHub.",
+              "Confira seu portfolio de código. Clique na sua imagem no canto superior direito. Para ativar seu portfolio de código, você precisa vincular sua conta do GitHub com o freeCodeCamp. Seu portfolio de código mostra o seu progresso e quantos Brownie Points você tem. Você pode obter Brownie Points completando desafios e ajudando outros campistas em nossas salas de chat. Se você receber Brownie Points em vários dias seguidos, você vai ter um \"streak\".",
+              ""
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Настройте ваше портфолио с кодом",
+          "description": [
+            [
+              "//i.imgur.com/Tw5allJ.gif",
+              "Анимация, показывающая нажатие на изображение профиля в правом верхнем углу экрана от вашего портфолио с кодом и соединение с GitHub.",
+              "Просмотрите ваше портфолио с кодом. Нажмите на ваше изображение в правом верхнем углу экрана. Для активации вашего портфолио с кодом, вам нужно будет присоединить свою учётную запись GitHub к freeCodeCamp. Ваше портфолио с кодом отражает выполнение вами программы и количество набранных очков прогресса. Вы можете получить очки прогресса завершая задания или помогая другим участникам проекта в наших чатах. Если вы получаете очки прогресса несколько дней подряд, вы получите полосу.",
+              ""
+            ]
+          ]
+        },
+        "tw": {
+          "title": "設定您的個人履歷",
+          "description": [
+            [
+              "//i.imgur.com/Tw5allJ.gif",
+              "點選右上角個人圖示, 前往您的個人程式履歷 (Code portfolio) 以及和 Github 帳號連結",
+              "要檢查您個人的程式履歷, 點選右上角的個人照片. 要啟用您的程式履歷, 您必須要將Free Code Camp 和您的 Github 帳號連結, 您的程式履歷顯示您的學習進度, 以及你擁有多少布朗尼點(Brownie Points). 您可藉由完成挑戰, 或在聊天室幫助其他人取得布朗尼點, 如果連續數天都有取得點數, 你會進入得到取得點數狀態",
+              ""
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "560add71cb82ac38a17513c2",
+      "title": "Join a freeCodeCamp Group in Your City",
+      "description": [
+        [
+          "//i.imgur.com/XugIMb4.jpg",
+          "A picture of some of our campers meeting in a local cafe.",
+          "You can code together with other campers in your city by joining a local freeCodeCamp group.",
+          ""
+        ],
+        [
+          "//i.imgur.com/iBctF6s.gif",
+          "A gif showing how you can click the link below, find your city on the list of local groups.",
+          "Find your city on this list and click it. This will take you to its Facebook page. Click the \"Join group\" button. Someone from the group should approve you shortly. If your city isn't on this list, scroll to the top of the wiki article for instructions on how you can start a group in your city.",
+          "http://forum.freeCodeCamp.com/t/free-code-camp-city-based-local-groups/19574"
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "de": {
+          "title": "Tritt einem Campsite in deiner Stadt bei",
+          "description": [
+            [
+              "//i.imgur.com/XugIMb4.jpg",
+              "Ein Foto von einigen Campern bei einem Treffen in einem lokalen Cafe.",
+              "Unsere Campsites sind Facebook Gruppen die dir helfen dich mit anderen Campern aus deiner Stadt zu treffen. Du kannst diese Gruppen verwenden um an \"Coffee-and-Code\" Treffen, wo du andere Camper in einem Cafe triffst um gemeinsam zu programmieren, teilzunehmen oder zu organisieren",
+              ""
+            ],
+            [
+              "//i.imgur.com/iBctF6s.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. Falls deine Stadt nicht auf der Liste ist, scrolle zum Ende des Wiki Artikels für eine Anleitung wie du ein Campsite für deine Stadt erstellst.",
+              "http://forum.freeCodeCamp.com/t/free-code-camp-city-based-local-groups/19574"
+            ]
+          ]
+        },
+        "es": {
+          "title": "Únete a un Campamento en Tu Ciudad",
+          "description": [
+            [
+              "//i.imgur.com/NAOFJWN.jpg",
+              "Una imagen de algunos de nuestros campistas compartiendo en un café local. 3 hombres y 3 mujeres están sentados alrededor de una mesa con portátiles afuera, y están sonriendo y programando.",
+              "Nuestros Campamentos te ayudan a programar con otros campistas en tu ciudad. Puedes coordinar grupos de estudio o atender eventos de programación locales juntos.",
+              ""
+            ],
+            [
+              "//i.imgur.com/iBctF6s.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. Si tu ciudad no esta en esta lista, ve al final del articulo de la wiki para ver instrucciones de como crear un campamento para tu ciudad.",
+              "http://forum.freeCodeCamp.com/t/free-code-camp-city-based-local-groups/19574"
+            ]
+          ]
+        },
+        "it": {
+          "title": "Unisciti ad un gruppo freeCodeCamp nella tua città",
+          "description": [
+            [
+              "//i.imgur.com/XugIMb4.jpg",
+              "Una foto di alcuni dei nostri camper riuniti in un bar locale.",
+              "È possibile programmare insieme ad altri campers nella tua città aderendo ad un gruppo freeCodeCamp vicino a te.",
+              ""
+            ],
+            [
+              "//i.imgur.com/iBctF6s.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"
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Junte-se a um grupo do freeCodeCamp em sua cidade",
+          "description": [
+            [
+              "//i.imgur.com/XugIMb4.jpg",
+              "Uma imagem de alguns de nossos campistas reunidos em uma cafeteria local.",
+              "Você pode programar em conjunto com outros campistas em sua cidade ao se juntar em um grupo local do freeCodeCamp.",
+              ""
+            ],
+            [
+              "//i.imgur.com/fTFMjwf.gif",
+              "Um gif mostrando como você pode clicar no link abaixo e encontrar a sua cidade na lista de grupos locais.",
+              "Encontre sua cidade na lista e clique nela. Isto irá levá-lo à sua respectiva página do Facebook. Clique no botão \"Entrar no grupo\". Alguém do grupo irá aprová-lo em breve. Se a sua cidade não está nesta lista, vá ao topo do artigo wiki para obter instruções sobre como você pode começar um grupo em sua cidade.",
+              "http://forum.freeCodeCamp.com/t/free-code-camp-city-based-local-groups/19574"
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Присоединяйтесь к группе freeCodeCamp в вашем городе",
+          "description": [
+            [
+              "//i.imgur.com/XugIMb4.jpg",
+              "Изображение встречи нескольких участников проекта в кафе.",
+              "Наши лагери - это группы в Facebook, которые помогают вам встречаться с другими участниками проекта в вашем городе. Вы можете использовать эти группы для планирования и посещения нерегулярных событий \"кофе-и-код\", на которых вы встречаетесь с другими участниками проекта в кафе и программируете вместе.",
+              ""
+            ],
+            [
+              "//i.imgur.com/iBctF6s.gif",
+              "Анимация, показывающая нажатие на ссылку, расположенную ниже, нахождение вашего города в списке лагерей, последующее нажатие на ссылку для перехода в Facebook и вступление в группу вашего города.",
+              "Найдите ваш город в списке и нажмите на его название. Так вы попадёте в группу вашего города в Facebook. Нажмите кнопку \"Вступить в группу\" для подачи заявки на вступление в группу. Кто-нибудь из участников, являющийся членом этой группы, подтвердит вашу заявку в скором времени. Если вашего города нет в списке, переместитесь в нижнюю часть wiki-статьи для получения инструкций о том, как вы можете создать группу для вашего города.",
+              "https://github.com/freeCodeCamp/freeCodeCamp/wiki/List-of-Free-Code-Camp-city-based-Campsites"
+            ]
+          ]
+        },
+        "tw": {
+          "title": "參與您城市中的Free Code Camp 小組",
+          "description": [
+            [
+              "//i.imgur.com/XugIMb4.jpg",
+              "一張 Camper 在當地咖啡店開會的照片",
+              "您可以參加當地城市的 Free Code Camp 小組與其他 Camper 一起學習",
+              ""
+            ],
+            [
+              "//i.imgur.com/iBctF6s.gif",
+              "點選下方連結, 找到您所屬城市的示意圖",
+              "在清單中找到您的城市並點選, 您將會前往相關的臉書專頁, 再點選加入群組(\"Join group\"). 群組中的人將會迅速審核您的申請. 若您的城市不在名單中, 請到頁面最上方的維基文章裡了解要如何在您的城市開始一個Free Code Camp小組",
+              "http://forum.freecodecamp.com/t/free-code-camp-city-based-local-groups/19574"
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "560adf65cb82ac38a17513c2",
+      "title": "Read Coding News on our Medium Publication",
+      "description": [
+        [
+          "//i.imgur.com/AZNLvEC.gif",
+          "A gif showing how you can click the \"follow\" button to follow freeCodeCamp's publication.",
+          "Our community has a popular Medium publication where we publish tons of helpful articles about coding and technology. Once you open the link, click the \"follow\" button in the upper right hand corner. If you don't have a Medium account, you can create one in seconds.",
+          "https://medium.freecodecamp.com"
+        ]
+      ],
+      "releasedOn": "February 10, 2016",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "de": {
+          "title": "Lese Programmier-Nachrichten auf unserer Medium Seite",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "Ein GIF, das dir zeigt, wie du einen Medium Account anlegen kannst.",
+              "Unsere Community hat eine Medium Seite, auf der wir viele Artikel über Software Entwicklung veröffentlichen. Kannst du auf die Medium Seite von freeCodeCamp gehen und den \"follow\" Button klicken. Unsere Camper veröffentlichen jede Woche mehrere Artikel. Wenn du noch keinen Medium Account hast, kannst du dem Link folgen und dich entweder mit einem Account aus einem Social Network oder einer E-Mail Adresse (sie senden dir eine E-Mail, die du durchklicken kannst, um dir einen Account anzulegen.). Wenn du ein Thema ausgewählt hast, das dich interessiert, kannst du den weiteren Schritten folgen.",
+              "https://www.medium.com"
+            ]
+          ]
+        },
+        "es": {
+          "title": "Lee noticias de codificación en nuestros canal de publicaciones Medium",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "Un gif mostrando cómo crear una cuenta en Medium.",
+              "Nuestra comunidad tiene un canal de publicaciones Medium, donde escribimos un montón de artículos sobre desarrollo de software. Ir al canal de publicaciones de freeCodeCamp Medium y pulsar \"follow\". Nuestros campistas publican varios artículos cada semana. Si aún no dispones de una cuenta Medium, puedes seguir el enlace y registrarte usando una red social o ingresando un correo electrónico (enviarán un correo electrónico que debes abrirlo para crear tu cuenta.)",
+              "https://www.medium.com"
+            ]
+          ]
+        },
+        "fr": {
+          "title": "Lisez les nouvelles de la programmation sur notre Publication Medium",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "Une gif montrant comment tu peux créer un compte sur Medium.",
+              "Notre communauté a une publication sur Medium où on écrit plusieurs articles sur la programmation. Tu peux visiter la publication de freeCodeCamp sur Medium et cliquer sur \"follow\". Nos campers publient plusieurs articles chaque semaine. Si tu n’as pas encore un compte Medium, utilise le lien ci-dessous  pour s’inscrire en utilisant un compte sur les médias sociaux ou en utilisant ton email (un email de confirmation sera envoyé à votre email pour terminer l’inscription). Une fois un sujet qui t’intéresse est choisi, tu peux continuer les étapes.",
+              "https://www.medium.com"
+            ]
+          ]
+        },
+        "it": {
+          "title": "Leggi notizie sul mondo della programmazione nelle nostre pubblicazioni su Medium",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "Una gif che mostra come puoi cliccare sul tasto \"follow\" per seguire le pubblicazioni di freeCodeCamp.",
+              "La nostra comunità ha uno spazio su Medium dove pubblica numerosi articoli pratici che parlano di programmazione e di tecnologia. Una volta aperto il link, clicca sul tasto \"follow\" in alto a destra. Se non hai un account di Medium, puoi crearne uno in pochi secondi.",
+              "https://medium.freecodecamp.com"
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Leia notícias sobre programação em nossas publicações no Medium",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "Um gif mostrando como você pode clicar no botão \"seguir\" para acompanhar as publicações do freeCodeCamp.",
+              "Nossa comunidade possui um espaço na plataforma Medium onde publicamos um monte de artigos úteis sobre programação e tecnologia. Uma vez que você abrir o link, clique no botão \"seguir\" no canto superior direito. Se você não tiver uma conta no Medium, pode criar uma rapidamente.",
+              "https://medium.freecodecamp.com"
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Читайте наши публикации в Medium о новостях программирования",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "Анимация, показывающая нажатие кнопки \"follow\", чтобы подписаться на публикации freeCodeCamp.",
+              "Наше сообщество публикует огромное количество полезных статей по программированию и технологиям на популярной платформе Medium. Когда перейдёте по ссылке, нажмите кнопку \"follow\" в правом верхнем углу экрана. Если у вас нет учётной записи Medium, вы можете создать её за несколько секунд.",
+              "https://medium.freecodecamp.com"
+            ]
+          ]
+        },
+        "tw": {
+          "title": "訂閱我們的程式新知 Medium Publication",
+          "description": [
+            [
+              "//i.imgur.com/AZNLvEC.gif",
+              "點選 \"follow\" 按鈕訂閱 Free Code Camp 電子刊物",
+              "我們的社群也提供熱門刊物 Medium Publication, 在上面有一大堆關於程式和科技新知的文章.",
+              "點選連結後, 點選右上角的 \"follow\" 按鈕, 如果你沒有 Medium 帳號, 歡迎您馬上建立一個.",
+              "https://medium.freecodecamp.com"
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "560add8ccb82ac38a17513c4",
+      "title": "Learn What to Do If You Get Stuck",
+      "description": [
+        [
+          "//i.imgur.com/3aiJZA3.jpg",
+          "The text \"Coding is hard.\"",
+          "Coding is hard. You will get stuck. Even experienced coders get stuck. The key is knowing how to get unstuck.",
+          ""
+        ],
+        [
+          "//i.imgur.com/oBX0jzR.jpg",
+          "The text \"It takes time to get good at coding.\"",
+          "It takes time to get good at coding. You wouldn't expect to beat a chess master after playing for 3 months. Don't expect to build the next Facebook after coding for 3 months.",
+          ""
+        ],
+        [
+          "//i.imgur.com/EoTfOyC.jpg",
+          "An image of some of our campers coding together in Montreal.",
+          "Keep practicing coding every day and hanging out with other people who code, and you will become a job-ready coder.",
+          ""
+        ],
+        [
+          "//i.imgur.com/wK0mcVh.jpg",
+          "An image with the text \"1. Read the error 2. Search Google 3. Ask for help.",
+          "Any time you get stuck or don't know what to do next: Read-Search-Ask.",
+          ""
+        ],
+        [
+          "//i.imgur.com/99BfAcK.jpg",
+          "An image showing jQuery documentation",
+          "First, read the documentation or error message. A key skill that good coders have is the ability to interpret and then follow instructions.",
+          ""
+        ],
+        [
+          "//i.imgur.com/GxvrsFb.gif",
+          "A gif showing you how to do an advanced Google search. First, we enter the query \"jquery doesn't run when my page loads\". Then we click search tools button and change the \"Any time\" select box to \"within the last year\". Then we click on a result and read through the article and find our answer.",
+          "If that didn't help, search Google. Good Google queries take a lot of practice. When you search Google, you usually want to include the language or framework you're using. You also want to limit the results to a recent period.",
+          ""
+        ],
+        [
+          "//i.imgur.com/xipwagp.gif",
+          "A gif showing us following the link below to go to the help chat room and ask \"jquery doesn't run when my page loads\".",
+          "If that didn't help, ask your friends. If you have trouble, you can ask your fellow campers in our help chat room.",
+          "https://gitter.im/FreeCodeCamp/Help"
+        ],
+        [
+          "//i.imgur.com/Hh8RpYX.gif",
+          "A gif showing us scrolling through our challenge map.",
+          "Now you're ready to start coding. The \"Map\" button in your upper right hand corner will show you our challenge map. We recommend that you complete these from top to bottom, at a sustainable pace. Our open source community is constantly improving our challenges, so don't be surprised if they change or move around. Don't worry about going back - just keep moving forward.",
+          ""
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "de": {
+          "title": "Lerne was du tun kannst falls du nicht weiterkommst",
+          "description": [
+            [
+              "//i.imgur.com/3aiJZA3.jpg",
+              "Der Text \"Coding is hard.\"",
+              "Programmieren ist hart. Du wirst zeitweise nicht weiterkommen. Sogar erfahrene Programmierer bleiben manchmal hängen. Der Schlüssel zum Erfolg ist zu wissen wie man in so einer Situation weitermacht",
+              ""
+            ],
+            [
+              "//i.imgur.com/oBX0jzR.jpg",
+              "Der Text \"It takes time to get good at coding.\"",
+              "Es dauert seine Zeit bis man gut programmieren kann. Du erwartest auch nicht einen Schachmeister nach 3 Monaten Übung zu schlagen. Erwarte also auch nicht das nächste Facebook nach 3 Monaten zu programmieren",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "Ein Foto von einigen Campern die gemeinsam in Montreal programmieren.",
+              "Übe programmieren jeden Tag und triff dich mit anderen Leuten die programmieren, dann wirst du bereit für einen Programmierjob.",
+              ""
+            ],
+            [
+              "//i.imgur.com/wK0mcVh.jpg",
+              "Ein Bild mit dem Text \"1. Read the error 2. Search Google 3. Ask for help.",
+              "Wann immer du nicht weiterkommst oder nicht weißt was du als nächstes tun sollst: Lesen-Suchen-Fragen",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "Ein Bild von der jQuery Dokumentation",
+              "Ließ zuerst die Dokumentation oder Fehlermeldung. Eine Schlüsselfähigkeit von guten Programmierern ist die ist die Fähigkeit zu interpretieren und dann Anweisungen zu folgen",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Ein GIF das eine erweiterte Google Suche zeigt. Zuerst wird die Suchanfrage \"jquery doesn't run when my page loads\" eingegeben. Dann wird in den Suchoptionen die Auswahl \"Beliebige Zeit\" zu \"Letztes Jahr\" geändert. Dann wird auf ein Ergebnis geklickt, der Artikel gelesen und die Antwort gefunden",
+              "Wenn das nicht geholfen hat, durchsuche Google. Gute Google Abfragen brauchen einiges an Übung. Wenn du Google durchsuchst, wirst du normalerweise die Programmiersprache oder das Framework, das du verwendest, inkludieren. Außerdem solltest du die Ergebnisse auf einen aktuellen Zeitraum limitieren.",
+              ""
+            ],
+            [
+              "//i.imgur.com/xipwagp.gif",
+              "Ein GIF das zeigt wie der untenstehende Link aufgerufen wird um in den \"Help Chat\" zu kommen um dort zu fragen: \"jquery doesn't run when my page loads\".",
+              "Falls das nicht geholfen hat, frag deine Freunde. Wenn du Probleme hast kannst du die anderen Camper in unserem Hilfe Chat fragen.",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/Hh8RpYX.gif",
+              "Ein GIF das zeigt wie durch die Challenge Übersicht gescrollt wird",
+              "Jetzt bist du bereit mit Programmieren zu starten. Der \"Map\" Button in der rechten oberen Ecke zeigt dir deine Challenge Übersicht. Wir empfehlen dir diese von Oben nach Unten in einer angemessenen Geschwindikeit durchzuführen. Unsere Open-Source Gemeinschaft ist permanent am Verbessern der Challenges, wundere dich also nicht falls diese sich ändern oder verschieben. Hab keine Angst davor zurück zu gehen - schau nur dass du vorankommst. Du kommst immer zu deiner aktuellsten Aufgabe indem du den \"Learn\" Button drückst.",
+              ""
+            ]
+          ]
+        },
+        "es": {
+          "title": "Aprende que hacer si te quedas atascado",
+          "description": [
+            [
+              "//i.imgur.com/3aiJZA3.jpg",
+              "El texto \"Programar es difícil.\"",
+              "Programar es difícil. Quedarás atascado. Incluso programadores experimentados quedan atascados. La clave es saber como desatascarse.",
+              ""
+            ],
+            [
+              "//i.imgur.com/oBX0jzR.jpg",
+              "El texto \"Volverse bueno programando requiere tiempo.\"",
+              "Volverse bueno programando requiere tiempo. No esperarías derrotar a un maestro del ajedrez después de jugar por 3 meses. No esperes crear el próximo Facebook después de programar 3 meses.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "Una imagen de algunos de nuestros campistas programando juntos en Montreal.",
+              "Sigue practicando programación cada día y sal con otras personas que programen, y te volverás un programador listo para un trabajo.",
+              ""
+            ],
+            [
+              "//i.imgur.com/wK0mcVh.jpg",
+              "Una imagen con el texto \"1. Lee el error 2. Busca en Google 3. Pide ayuda.",
+              "En cualquier momento en el que te quedes atascado o no sepas que hacer a continuación: Lee-Busca-Pregunta.",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "Una imagen mostrando la documentación de jQuery",
+              "Primero, lee la documentación o el mensaje de error. Una habilidad clave que los buenos programadores poseen es el poder interpretar y seguir instrucciones.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Un gif mostrándote como hacer una búsqueda avanzada en Google. Primero, escribimos la consulta \"jquery no corre cuando mi página carga\". Entonces damos clic en el botón de herramientas y cambiamos la selección de \"En cualquier momento\" a \"en el último año\". Entonces hacemos clic en un resultado o leemos a través del artículo y encontramos nuestra respuesta.",
+              "Si eso no ayudo, busca en Google. Realizar buenas búsquedas en Google requiere mucha práctica. Cuando buscas en Google, usualmente querrás incluir el lenguaje o entorno (framework) que estás usando. También querrás limitar los resultados a un período reciente.",
+              ""
+            ],
+            [
+              "//i.imgur.com/xipwagp.gif",
+              "Un gif mostrándonos como seguir el enlace inferior para ir a nuestra sala de chat de ayuda y preguntar \"jquery no corre cuando mi página carga\".",
+              "Si eso no te ayudó, pregúntale a tus amigos. Si tienes problemas, puedes preguntar a tus compañeros campistas en nuestra sala de chat.",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/Hh8RpYX.gif",
+              "Un gif mostrándonos nuestro mapa de desafíos.",
+              "Ahora estas listo para empezar a programar. El botón de  \"Mapa\" en tu esquina superior derecha te mostrará nuestro mapa de desafíos. Te recomendaos que completes los desafíos de arriba hacía abajo, a un ritmo sostenible. Nuestra comunidad de código abierto esta constantemente mejorando nuestros desafíos, así que no te sorprendas si cambian o se mueven alrededor. No te preocupes por volver hacia atrás - solo continúa avanzando. Siempre puedes ir a tu desafío más reciente pulsando el botón de \"Aprender\".",
+              ""
+            ]
+          ]
+        },
+        "fr": {
+          "title": "Apprenez quoi faire quand vous êtes bloqué ?",
+          "description": [
+            [
+              "//i.imgur.com/3aiJZA3.jpg",
+              "Le texte \"Coder est difficile.\"",
+              "Coder est difficile. Vous serez bloqué un jour ou l'autre. Même les développeurs expérimentés peuvent être bloqués. La solution est de savoir comment se débloquer.",
+              ""
+            ],
+            [
+              "//i.imgur.com/oBX0jzR.jpg",
+              "Le texte \"Etre un bon développeur prend du temps.\"",
+              "Etre un bon développeur prend du temps. Vous ne pouvez pas vous attendre à battre un maitre des echecs aprés 3 mois d'apprentissage. Ne vous attendez pas de construire le prochain Facebook aprés 3 mois de coding.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "Une image de quelques uns de nos développeurs codant ensemble à Montreal.",
+              "Continuez de développer tous les jours et fréquentez d'autres développeurs et vous deviendrez un développeur prêt à l'emploi.",
+              ""
+            ],
+            [
+              "//i.imgur.com/wK0mcVh.jpg",
+              "Une image avec le texte \"1. Lisez l'erreur 2. Cherchez sur Google 3. Demandez de l'aide.",
+              "Chaque fois que vous êtes bloqué ou que vous ne savez pas quoi faire : Lisez-Cherchez-Demandez.",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "Une image montrant la document jQuery",
+              "Lisez d'abord la documentation ou les messages d'erreurs. Le principal atout que les bon développeurs ont est la capacité d'interpréter et ensuite de suivre les instructions.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Une image vous montrant comment fiare des recherches avancées sur Google. On commence par rentrer la requète \"jquery ne fonctionne pas lors du chargement de ma page\". Puis nous cliquons sur la barre de recherche et changeons la case à cocher \"Any time\" cochons la case \"au cours de l'année précédente\". Puis nous cliquons sur le résultat et lisons l'article et trouvons notre réponse.",
+              "Si cela ne vous aide pas, recherchez sur Google. De bonnes recherches sur Google demande pas mal de pratique. Quand vous recherchez sur Google, vous devez inclure le langage ou le framework que vous utilisez. Vous voulez aussi limiter vos résultats a une période récente.",
+              ""
+            ],
+            [
+              "//i.imgur.com/xipwagp.gif",
+              "Une image vous montrant le lien ci-dessous pour rejoindre le char et demander \"jquery ne fonctionne pas lors du chargement de ma page\".",
+              "Si cela ne vous aide pas, demande à vos amis. Si vous avez des difficultés, vous pouvez demander aux autres développeurs sur le chat.",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/Hh8RpYX.gif",
+              "Une image vous montrant le cursus de notre carte des défis.",
+              "Maintenant vous être prêt pour commencer à coder. Le boutton \"Map\" situé en haut à droite de votre écran vous montrera notre carte des défis. Nous vous recommandons de les completer du début jusqu'à la fin, régulièrement. Notre communauté open source continue de d'améliorer nos défis, ne soyez donc pas surpris si ils changent ou évoluent. Ce n'est pas la peine de revenir en arrière, continuez à progresser. Vous pouvez toujours accéder à nos derniers défis juste en cliquant sur le boutton \"Learn\".",
+              ""
+            ]
+          ]
+        },
+        "it": {
+          "title": "Impara Cosa fare se ti trovi in ​​difficoltà",
+          "description": [
+            [
+              "//i.imgur.com/3aiJZA3.jpg",
+              "Il testo \" Programmare è difficile. \"",
+              "Programmare è difficile. Prima o poi rimarrai bloccato. Succede anche ai programmatori esperti. La chiave è sapere come uscirne.",
+              ""
+            ],
+            [
+              "//i.imgur.com/oBX0jzR.jpg",
+              "Il testo \" Ci vuole tempo per diventare bravi sviluppatori. \"",
+              "Ci vuole tempo per diventare bravi sviluppatori. Non ti aspetteresti di battere un campione di scacchi dopo aver giocato per 3 mesi. Non aspettarti di realizzare il prossimo Facebook dopo aver programmato per 3 mesi.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "Un'immagine di alcuni dei nostri campers che programmano insieme a Montreal.",
+              "Continua ad esercitarti a programmare tutti i giorni e discuti con altre persone che programmano, e potrai diventare uno sviluppatore pronto per il lavoro.",
+              ""
+            ],
+            [
+              "//i.imgur.com/wK0mcVh.jpg",
+              "Un'immagine con il testo \" 1. Leggi l'errore 2. Cerca su Google 3. Chiedi aiuto. ",
+              "Ogni volta che ti trovi in ​​difficoltà o non sai cosa fare. Leggi-Cerca-Chiedi",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "Un'immagine che mostra la documentazione di jQuery",
+              "Innanzitutto, leggi la documentazione o il messaggio di errore. Una competenza chiave che i buoni programmatori hanno è la capacità di interpretare e seguire le istruzioni.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Una gif che mostra come fare una ricerca avanzata su Google. Prima di tutto, si inserisce la query \"jquery non viene eseguito quando la mia pagina si carica\". Poi si clicca sul pulsante strumenti di ricerca e si cambia l'opzione \"Qualsiasi data\" selezionando a \"Ultimo Anno\". Poi si clicca su un risultato, si legge l'articolo e troviamo la nostra risposta.",
+              "Se ciò non è stato d'aiuto, cerca su Google. Ci vuole un sacco di pratica per formulare delle buone query. Quando si esegue una ricerca su Google, di solito si preferisce includere il linguaggio o il framework che si sta utilizzando. Inoltre è meglio limitare i risultati ad un periodo recente.",
+              ""
+            ],
+            [
+              "//i.imgur.com/xipwagp.gif",
+              "Una gif che mostra come seguire il link qui sotto per andare alla chat room di supporto e chiedere \"jquery non viene eseguito quando la mia pagina si carica\".",
+              "Se anche questo non ha aiutato, chiedi ai tuoi amici. In caso di problemi, puoi chiedere ai tuoi amici campers nelle nostre chat rooms di supporto.",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/Hh8RpYX.gif",
+              "Una gif che mostra come scorrere la nostra mappa di problemi.",
+              "Ora sei pronto per iniziare a scrivere codice. Il tasto \"Mappa\" in alto a destra ti mostrerà la nostra mappa dei problemi. Ti consigliamo di completarli dall'alto verso il basso, ad un ritmo sostenibile. La nostra comunità open source sta migliorando costantemente i nostri problemi, quindi non stupirti se cambiano o se vengono spostati. Non preoccuparti di tornare indietro - continua ad andare avanti.",
+              ""
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Aprenda o que fazer se você ficar empacado(a)",
+          "description": [
+            [
+              "//i.imgur.com/lzKvwU2.jpg",
+              "A frase \"Programar é difícil.\"",
+              "Programar é difícil. Em alguns momentos você não vai conseguir sair do lugar. Acontece até com desenvolvedores experientes. A chave é saber como desempacar.",
+              ""
+            ],
+            [
+              "//i.imgur.com/sfsidp6.jpg",
+              "A frase \"Leva tempo para ficar bom em programação\"",
+              "Leva-se tempo para ficar bom em programação. Você não esperaria vencer um mestre de xadrez depois de jogar por apenas 3 meses. Não espere conseguir construir o próximo Facebook após programar por apenas 3 meses.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "Uma imagem de alguns dos nossos campistas programando juntos em Montreal.",
+              "Continue a praticar programação todos os dias, socialize com outras pessoas que programam e você se tornará um desenvolvedor pronto para o mercado de trabalho.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EWWZBag.jpg",
+              "Uma imagem com o texto \"1. Leia o erro 2. Pesquisa no Google 3. Peça ajuda.\"",
+              "Toda vez que você ficar preso ou não souber o que fazer: Leia-Pesquise-Pergunte.",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "Uma imagem mostrando a documentação do jQuery",
+              "Primeiro, leia a documentação ou mensagem de erro. Uma habilidade fundamental que  bons programadores têm é a capacidade de interpretar e, em seguida, seguir instruções.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Um gif mostrando como fazer uma pesquisa avançada no Google. Primeiro, inserimos a consulta \"jquery não executa quando a minha página carrega\". Em seguida, clique no botão ferramentas de pesquisa e altere a caixa de seleção de \"Qualquer momento\" para \"Ano passado\". Em seguida, clique em um resultado, leia o artigo e encontre a nossa resposta.",
+              "Se isso não ajudar, pesquise no Google. Pesquisar no Google de maneira eficiente requer prática. Quando você pesquisa no Google, é aconselhável incluir a linguagem de programação ou framework que você está usando, e tambem limitar os resultados para um período recente.",
+              ""
+            ],
+            [
+              "//i.imgur.com/LZYU7p2.gif",
+              "Um gif mostrando-nos usando link abaixo para ir na sala de bate-papo de ajuda e dizendo que \"jquery não executa quando a minha página carrega\".",
+              "Se isso não ajudar, pergunte a seus amigos. Se você tiver problemas, você pode perguntar a seus companheiros campistas na nossa sala de ajuda no bate-papo.",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/ZRgXraT.gif",
+              "Um gif mostrando a navegação no nosso mapa de desafios.",
+              "Agora você está pronto para começar a programar. O botão \"Mapa\" no canto superior direito irá mostrar o nosso mapa de desafios. Recomendamos que você complete estes desafios de cima para baixo, em um ritmo adequado. Nossa comunidade open source está constantemente melhorando os nossos desafios por isso não se surpreenda se os desafios mudarem. Não se preocupe em voltar - apenas continue seguindo em frente.",
+              ""
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Узнайте, что делать если вы застряли",
+          "description": [
+            [
+              "//i.imgur.com/3aiJZA3.jpg",
+              "Текст \"Программировать сложно.\"",
+              "Программировать сложно. Вы будете застревать. Даже опытные программисты застревают. Главное знать как выйти из этого положения.",
+              ""
+            ],
+            [
+              "//i.imgur.com/oBX0jzR.jpg",
+              "Текст \"Требуется время, чтобы стать хорошим программистом.\"",
+              "Требуется время, чтобы стать хорошим программистом. Вы же не будете ожидать победить мастера по шахматам после игры в шахматы в течение трёх месяцев. Не ожидайте, что построите следующий Facebook через три месяца занятий программированием.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "Изображение нескольких участников проекта, программирующих вместе в Монтреале.",
+              "Практикуйте ежедневное программирование и общение с другими людьми, занимающимися программированием, и вы станете подготовленным к работе программистом.",
+              ""
+            ],
+            [
+              "//i.imgur.com/wK0mcVh.jpg",
+              "Изображение с текстом \"1. Читай ошибку 2. Ищи с помощью Google 3. Проси помощи.",
+              "В любой момент, если вы застряли или не знаете, что делать дальше: Читайте-Ищите-Спрашивайте.",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "Изображение документации jQuery",
+              "Во-первых, читайте документацию или сообщение об ошибке. Ключевой навык, которым обладают хорошие программисты - способность истолковать и следовать инструкциям впоследствии.",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Анимация, показывающая как осуществлять продвинутый поиск Google. Во-первых, мы вводим запрос \"jquery не запускается при загрузке страницы\". Затем мы нажимаем кнопку вызова меню поисковых инструментов и меняем значение периода с \"За всё время\" на \"За год\". Затем мы нажимаем на результат и просматриваем статью на предмет наличия решения.",
+              "Если это не помогло, поищите с помощью Google. Способность писать хорошие Google-запросы - результат продолжительной практики. Когда вы ищите с помощью Google, обычно вам стоит указывать применяемый язык или используемую библиотеку. Также, вам стоит ограничивать результаты поиска недавним периодом.",
+              ""
+            ],
+            [
+              "//i.imgur.com/xipwagp.gif",
+              "Анимация, показывающая переход по ссылке ниже в чат для помощи и задание вопроса \"jquery не запускается при загрузке страницы\".",
+              "Если это не помогло, спросите ваших друзей. Если вы не можете решить проблему, вы можете обратиться к вашим приятелям, участникам проекта, в нашем чате для помощи.",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/Hh8RpYX.gif",
+              "Анимация, показывающая прокрутку нашей карты заданий.",
+              "Теперь вы готовы начать программировать. Нажатие на кнопку \"Карта\" в правом верхнем углу вашего экрана отобразит вам нашу карту заданий. Мы рекоммендуем выполнять задания сверху-вниз в равномерном темпе. Наше открытое сообщество постоянно улучшает наши задания, так что не удивляйтесь, если они будут меняться или перемещаться. Не переживайте о том, чтобы сдвинуться назад - просто продолжайте двигаться вперёд. Вы всегда можете перейти к вашему недавнему заданию путём нажатия на кнопку \"Учиться\".",
+              ""
+            ]
+          ]
+        },
+        "tw": {
+          "title": "了解當你卡關時該怎麼做",
+          "description": [
+            [
+              "//i.imgur.com/3aiJZA3.jpg",
+              "重點 \"寫程式不簡單.\"",
+              "寫程式很難, 你一定會卡關. 就算是資深工程師也會卡關. 關鍵是該怎麼突破難關",
+              ""
+            ],
+            [
+              "//i.imgur.com/oBX0jzR.jpg",
+              "重點 \"專精需要時間\"",
+              "專精寫程式需要花很多時間, 你不會期待說只有學三個月的西洋棋, 就能打敗棋王, 因此也別期待只花三個月就能打造下一個臉書.",
+              ""
+            ],
+            [
+              "//i.imgur.com/EoTfOyC.jpg",
+              "一些 Camper 們在蒙特羅一起開發的照片",
+              "每天持續的練習, 和其他工程師交流, 那麼你將能成為一個無懼於市場挑戰的工程師.",
+              ""
+            ],
+            [
+              "//i.imgur.com/wK0mcVh.jpg",
+              "\"1. 了解錯誤 2. Google 搜尋 3. 問問題.\"",
+              "每當你卡關而不知道怎麼辦時, 記得這三個步驟",
+              ""
+            ],
+            [
+              "//i.imgur.com/99BfAcK.jpg",
+              "jQuery 文件一角",
+              "首先, 閱讀文件或錯誤訊息, 依照步驟操作或解讀問題是好工程師的關鍵能力",
+              ""
+            ],
+            [
+              "//i.imgur.com/GxvrsFb.gif",
+              "Google 進階搜尋的示意圖, 首先我們輸入 \"jquery doesn't run when my page loads\", 然後點搜尋工具按鈕, 把\"任何時間\" (Any time) 換成過去一年內(within the last year), 查看結果, 仔細閱讀文章並找到我們想要的答案.",
+              "如果這招沒用, 就試著再搜一次. 下搜尋關鍵字也需要很多的練習, 當搜尋時, 你通常也會想在關鍵字中加入使用的語言和框架, 你也會希望限制搜尋結果為近期的文章",
+              ""
+            ],
+            [
+              "//i.imgur.com/xipwagp.gif",
+              "依以下連結在聊天室中問 \"jquery doesn't run when my page loads\" 的示意圖",
+              "如果搜尋沒用, 問你的朋友. 如果有問題, 歡迎在我們的聊天室中發問",
+              "https://gitter.im/FreeCodeCamp/Help"
+            ],
+            [
+              "//i.imgur.com/Hh8RpYX.gif",
+              "我們的挑戰地圖的示意圖",
+              "現在你已經準備好開始寫程式了. 右上角的地圖(Map)按鈕可以顯示我們的挑戰地圖, 我們建議從上到下, 用輕鬆的步調完成它. 我們的開源社群會持續的更新挑戰項目, 所以如果地圖有更動, 別太意外. 別擔心你的學習進度會退後, 持續向前吧.",
+              ""
+            ]
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/01-responsive-web-design/applied-accessibility.json b/seed/math-challenges/01-responsive-web-design/applied-accessibility.json
new file mode 100644
index 0000000000..bfebcb911f
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/applied-accessibility.json
@@ -0,0 +1,1160 @@
+{
+  "name": "Applied Accessibility",
+  "order": 3,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d774b367417b2b2512a9b",
+      "title": "Introduction to the Applied Accessibility Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "\"Accessibility\" generally means having web content and a user interface that can be understood, navigated, and interacted with by a broad audience. This includes people with visual, auditory, mobility, or cognitive disabilities.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Websites should be open and accessible to everyone, regardless of a user's abilities or resources. Some users rely on assistive technology such as a screen reader or voice recognition software. Other users may be able to navigate through a site only using a keyboard. Keeping the needs of various users in mind when developing your project can go a long way towards creating an open web.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Here are three general concepts this section will explore throughout the following challenges:<br><br><ol><br><li>have well-organized code that uses appropriate markup</li><br><li>ensure text alternatives exist for non-text and visual content</li><br><li>create an easily-navigated page that's keyboard-friendly</li><br></ol><br><br>Having accessible web content is an ongoing challenge. A great resource for your projects going forward is the W3 Consortium's Web Content Accessibility Guidelines (WCAG). They set the international standard for accessibility and provide a number of criteria you can use to check your work.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d774c367417b2b2512a9c",
+      "title": "Add a Text Alternative to Images for Visually Impaired Accessibility",
+      "description": [
+        "It's likely you've seen an <code>alt</code> attribute on an <code>img</code> tag in other challenges. <code>Alt</code> text describes the content of the image and provides a text-alternative. This helps in case the image fails to load or can't be seen by a user. It's also used by search engines to understand what an image contains to include it in search results. Here's an example:",
+        "<code>&lt;img src=&quot;importantLogo.jpeg&quot; alt=&quot;Company logo&quot;&gt;</code>",
+        "People with visual impairments rely on screen readers to convert web content to an audio interface. They won't get information if it's only presented visually. For images, screen readers can access the <code>alt</code> attribute and read its contents to deliver key information.",
+        "Good <code>alt</code> text is short but descriptive, and meant to briefly convey the meaning of the image. You should always include an <code>alt</code> attribute on your image. Per HTML5 specification, this is now considered mandatory.",
+        "<hr>",
+        "Camper Cat happens to be both a coding ninja and an actual ninja, and is building a website to share his knowledge. The profile picture he wants to use shows his skills, and should be appreciated by all site visitors. Add an <code>alt</code> attribute in the <code>img</code> tag, that explains Camper Cat is doing karate. (The image <code>src</code> doesn't link to an actual file, so you should see the <code>alt</code> text in the display.)"
+      ],
+      "challengeSeed": [
+        "<img src=\"doingKarateWow.jpeg\">"
+      ],
+      "tests": [
+        "assert($('img').attr('alt'), 'message: Your <code>img</code> tag should have an <code>alt</code> attribute, and it should not be empty.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d774c367417b2b2512a9d",
+      "title": "Know When Alt Text Should be Left Blank",
+      "description": [
+        "In the last challenge, you learned that including an <code>alt</code> attribute on img tags is mandatory. However, sometimes images are grouped with a caption already describing them, or are used for decoration only. In these cases <code>alt</code> text may seem redundant or unnecessary.",
+        "In situations when an image is already explained with text content, or does not add meaning to a page, the <code>img</code> still needs an <code>alt</code> attribute, but it can be set to an empty string. Here's an example:",
+        "<code>&lt;img src=&quot;visualDecoration.jpeg&quot; alt=&quot;&quot;&gt;</code>",
+        "Background images usually fall under the 'decorative' label as well. However, they are typically applied with CSS rules, and therefore not part of the markup screen readers process.",
+        "<strong>Note</strong><br>For images with a caption, you may still want to include <code>alt</code> text, since it helps search engines catalog the content of the image.",
+        "<hr>",
+        "Camper Cat has coded a skeleton page for the blog part of his website. He's planning to add a visual break between his two articles with a decorative image of a samurai sword. Add an <code>alt</code> attribute to the <code>img</code> tag and set it to an empty string. (Note that the image <code>src</code> doesn't link to an actual file - don't worry that there are no swords showing in the display.)"
+      ],
+      "challengeSeed": [
+        "<h1>Deep Thoughts with Master Camper Cat</h1>",
+        "<article>",
+        "  <h2>Defeating your Foe: the Red Dot is Ours!</h2>",
+        "  <p>To Come...</p>",
+        "</article>",
+        "",
+        "<img src=\"samuraiSwords.jpeg\">",
+        "",
+        "<article>",
+        "  <h2>Is Chuck Norris a Cat Person?</h2>",
+        "  <p>To Come...</p>",
+        "</article>"
+      ],
+      "tests": [
+        "assert(!($('img').attr('alt') == undefined), 'message: Your <code>img</code> tag should have an <code>alt</code> attribute.');",
+        "assert($('img').attr('alt') == '', 'message: The <code>alt</code> attribute should be set to an empty string.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d774d367417b2b2512a9e",
+      "title": "Use Headings to Show Hierarchical Relationships of Content",
+      "description": [
+        "Headings (<code>h1</code> through <code>h6</code> elements) are workhorse tags that help provide structure and labeling to your content. Screen readers can be set to read only the headings on a page so the user gets a summary. This means it is important for the heading tags in your markup to have semantic meaning and relate to each other, not be picked merely for their size values.",
+        "<em>Semantic meaning</em> means that the tag you use around content indicates the type of information it contains.",
+        "If you were writing a paper with an introduction, a body, and a conclusion, it wouldn't make much sense to put the conclusion as a subsection of the body in your outline. It should be its own section. Similarly, the heading tags in a webpage need to go in order and indicate the hierarchical relationships of your content.",
+        "Headings with equal (or higher) rank start new implied sections, headings with lower rank start subsections of the previous one.",
+        "As an example, a page with an <code>h2</code> element followed by several subsections labeled with <code>h4</code> tags would confuse a screen reader user. With six choices, it's tempting to use a tag because it looks better in a browser, but you can use CSS to edit the relative sizing.",
+        "One final point, each page should always have one (and only one) <code>h1</code> element, which is the main subject of your content. This and the other headings are used in part by search engines to understand the topic of the page.",
+        "<hr>",
+        "Camper Cat wants a page on his site dedicated to becoming a ninja. Help him fix the headings so his markup gives semantic meaning to the content, and shows the proper parent-child relationships of his sections. Change all the <code>h5</code> tags to the proper heading level to indicate they are subsections of the <code>h2</code> ones."
+      ],
+      "challengeSeed": [
+        "<h1>How to Become a Ninja</h1>",
+        "<main>",
+        "  <h2>Learn the Art of Moving Stealthily</h2>",
+        "  <h5>How to Hide in Plain Sight</h5>",
+        "  <h5>How to Climb a Wall</h5>",
+        "",
+        "  <h2>Learn the Art of Battle</h2>",
+        "  <h5>How to Strengthen your Body</h5>",
+        "  <h5>How to Fight like a Ninja</h5>",
+        "",
+        "  <h2>Learn the Art of Living with Honor</h2>",
+        "  <h5>How to Breathe Properly</h5>",
+        "  <h5>How to Simplify your Life</h5>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($('h3').length === 6, 'message: Your code should have six <code>h3</code> tags.');",
+        "assert($('h5').length === 0, 'message: Your code should not have any <code>h5</code> tags.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "All the h5 tags are siblings, and should be changed to the same new heading level."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d774e367417b2b2512a9f",
+      "title": "Jump Straight to the Content Using the main Element",
+      "description": [
+        "HTML5 introduced a number of new elements that give developers more options while also incorporating accessibility features. These tags include <code>main</code>, <code>header</code>, <code>footer</code>, <code>nav</code>, <code>article</code>, and <code>section</code>, among others.",
+        "By default, a browser renders these elements similarly to the humble <code>div</code>. However, using them where appropriate gives additional meaning in your markup. The tag name alone can indicate the type of information it contains, which adds semantic meaning to that content. Assistive technologies can access this information to provide better page summary or navigation options to their users.",
+        "The <code>main</code> element is used to wrap (you guessed it) the main content, and there should be only one per page. It's meant to surround the information that's related to the central topic of your page. It's not meant to include items that repeat across pages, like navigation links or banners.",
+        "The <code>main</code> tag also has an embedded landmark feature that assistive technology can use to quickly navigate to the main content. If you've ever seen a \"Jump to Main Content\" link at the top of a page, using a main tag automatically gives assistive devices that functionality.",
+        "<hr>",
+        "Camper Cat has some big ideas for his ninja weapons page. Help him set up his markup by adding opening and closing <code>main</code> tags between the <code>header</code> and <code>footer</code> (covered in other challenges). Keep the <code>main</code> tags empty for now."
+      ],
+      "challengeSeed": [
+        "<header>",
+        "  <h1>Weapons of the Ninja</h1>",
+        "</header>",
+        "",
+        "",
+        "",
+        "<footer></footer>"
+      ],
+      "tests": [
+        "assert($('main').length == 1, 'message: Your code should have one <code>main</code> tag.');",
+        "assert(code.match(/<\\/header>\\s*?<main>\\s*?<\\/main>/gi), 'message: The <code>main</code> tags should be between the closing <code>header</code> tag and the opening <code>footer</code> tag.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d774e367417b2b2512aa0",
+      "title": "Wrap Content in the article Element",
+      "description": [
+        "<code>article</code> is another one of the new HTML5 elements that adds semantic meaning to your markup. <code>Article</code> is a sectioning element, and is used to wrap independent, self-contained content. The tag works well with blog entries, forum posts, or news articles.",
+        "Determining whether content can stand alone is usually a judgement call, but there are a couple simple tests you can use. Ask yourself if you removed all surrounding context, would that content still make sense? Similarly for text, would the content hold up if it were in an RSS feed?",
+        "Remember that folks using assistive technologies rely on organized, semantically meaningful markup to better understand your work.",
+        "<strong>Note about <code>section</code> and <code>div</code></strong><br>The <code>section</code> element is also new with HTML5, and has a slightly different semantic meaning than <code>article</code>. An <code>article</code> is for standalone content, and a <code>section</code> is for grouping thematically related content. They can be used within each other, as needed. For example, if a book is the <code>article</code>, then each chapter is a <code>section</code>. When there's no relationship between groups of content, then use a <code>div</code>.",
+        "<blockquote>&lt;div&gt; - groups content<br>&lt;section&gt; - groups related content<br>&lt;article&gt; - groups independent, self-contained content<br></blockquote>",
+        "<hr>",
+        "Camper Cat used <code>article</code> tags to wrap the posts on his blog page, but he forgot to use them around the top one. Change the <code>div</code> tag to use an <code>article</code> tag instead."
+      ],
+      "challengeSeed": [
+        "<h1>Deep Thoughts with Master Camper Cat</h1>",
+        "<main>",
+        "  <div>",
+        "    <h2>The Garfield Files: Lasagna as Training Fuel?</h2>",
+        "    <p>The internet is littered with varying opinions on nutritional paradigms, from catnip paleo to hairball cleanses. But let's turn our attention to an often overlooked fitness fuel, and examine the protein-carb-NOM trifecta that is lasagna...</p>",
+        "  </div>",
+        "",
+        "  <img src=\"samuraiSwords.jpeg\" alt=\"\">",
+        "",
+        "  <article>",
+        "    <h2>Defeating your Foe: the Red Dot is Ours!</h2>",
+        "    <p>Felines the world over have been waging war on the most persistent of foes. This red nemesis combines both cunning stealth and lightening speed. But chin up, fellow fighters, our time for victory may soon be near...</p>",
+        "  </article>",
+        "",
+        "  <img src=\"samuraiSwords.jpeg\" alt=\"\">",
+        "",
+        "  <article>",
+        "    <h2>Is Chuck Norris a Cat Person?</h2>",
+        "    <p>Chuck Norris is widely regarded as the premier martial artist on the planet, and it's a complete coincidence anyone who disagrees with this fact mysteriously disappears soon after. But the real question is, is he a cat person?...</p>",
+        "  </article>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($('article').length == 3, 'message: Your code should have three <code>article</code> tags.');",
+        "assert($('div').length == 0, 'message: Your code should not have any <code>div</code> tags.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7787367417b2b2512aa1",
+      "title": "Make Screen Reader Navigation Easier with the header Landmark",
+      "description": [
+        "The next HTML5 element that adds semantic meaning and improves accessibility is the <code>header</code> tag. It's used to wrap introductory information or navigation links for its parent tag, and works well around content that's repeated at the top on multiple pages.",
+        "<code>header</code> shares the embedded landmark feature you saw with <code>main</code>, allowing assistive technologies to quickly navigate to that content.",
+        "<strong>Note</strong><br><code>header</code> is meant for use in the <code>body</code> tag of your HTML document. This is different than the <code>head</code> element, which contains the page's title, meta information, etc.",
+        "<hr>",
+        "Camper Cat is writing some great articles about ninja training, and wants to add a page for them to his site. Change the top <code>div</code> that currently contains the <code>h1</code> to a <code>header</code> tag instead."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "",
+        "  <div>",
+        "    <h1>Training with Camper Cat</h1>",
+        "  </div>",
+        "",
+        "",
+        "  <main>",
+        "    <section id=\"stealth\">",
+        "      <h2>Stealth &amp; Agility Training</h2>",
+        "      <article><h3>Climb foliage quickly using a minimum spanning tree approach</h3></article>",
+        "      <article><h3>No training is NP-complete without parkour</h3></article>",
+        "    </section>",
+        "    <section id=\"combat\">",
+        "      <h2>Combat Training</h2>",
+        "      <article><h3>Dispatch multiple enemies with multithreaded tactics</h3></article>",
+        "      <article><h3>Goodbye world: 5 proven ways to knock out an opponent</h3></article>",
+        "    </section>",
+        "    <section id=\"weapons\">",
+        "      <h2>Weapons Training</h2>",
+        "      <article><h3>Swords: the best tool to literally divide and conquer</h3></article>",
+        "      <article><h3>Breadth-first or depth-first in multi-weapon training?</h3></article>",
+        "    </section>",
+        "  </main>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('header').length == 1, 'message: Your code should have one <code>header</code> tag.');",
+        "assert($('header').children('h1').length == 1, 'message: Your <code>header</code> tags should wrap around the <code>h1</code>.');",
+        "assert($('div').length == 0, 'message: Your code should not have any <code>div</code> tags.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7788367417b2b2512aa2",
+      "title": "Make Screen Reader Navigation Easier with the nav Landmark",
+      "description": [
+        "The <code>nav</code> element is another HTML5 item with the embedded landmark feature for easy screen reader navigation. This tag is meant to wrap around the main navigation links in your page.",
+        "If there are repeated site links at the bottom of the page, it isn't necessary to markup those with a <code>nav</code> tag as well. Using a <code>footer</code> (covered in the next challenge) is sufficient.",
+        "<hr>",
+        "Camper Cat included navigation links at the top of his training page, but wrapped them in a <code>div</code>. Change the <code>div</code> to a <code>nav</code> tag to improve the accessibility on his page."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Training with Camper Cat</h1>",
+        "",
+        "    <div>",
+        "      <ul>",
+        "        <li><a href=\"#stealth\">Stealth &amp; Agility</a></li>",
+        "        <li><a href=\"#combat\">Combat</a></li>",
+        "        <li><a href=\"#weapons\">Weapons</a></li>",
+        "      </ul>",
+        "    </div>",
+        "",
+        "  </header>",
+        "  <main>",
+        "    <section id=\"stealth\">",
+        "      <h2>Stealth &amp; Agility Training</h2>",
+        "      <article><h3>Climb foliage quickly using a minimum spanning tree approach</h3></article>",
+        "      <article><h3>No training is NP-complete without parkour</h3></article>",
+        "    </section>",
+        "    <section id=\"combat\">",
+        "      <h2>Combat Training</h2>",
+        "      <article><h3>Dispatch multiple enemies with multithreaded tactics</h3></article>",
+        "      <article><h3>Goodbye world: 5 proven ways to knock out an opponent</h3></article>",
+        "    </section>",
+        "    <section id=\"weapons\">",
+        "      <h2>Weapons Training</h2>",
+        "      <article><h3>Swords: the best tool to literally divide and conquer</h3></article>",
+        "      <article><h3>Breadth-first or depth-first in multi-weapon training?</h3></article>",
+        "    </section>",
+        "  </main>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('nav').length == 1, 'message: Your code should have one <code>nav</code> tag.');",
+        "assert($('nav').children('ul').length == 1, 'message: Your <code>nav</code> tags should wrap around the <code>ul</code> and its list items.');",
+        "assert($('div').length == 0, 'message: Your code should not have any <code>div</code> tags.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7788367417b2b2512aa3",
+      "title": "Make Screen Reader Navigation Easier with the footer Landmark",
+      "description": [
+        "Similar to <code>header</code> and <code>nav</code>, the <code>footer</code> element has a built-in landmark feature that allows assistive devices to quickly navigate to it. It's primarily used to contain copyright information or links to related documents that usually sit at the bottom of a page.",
+        "<hr>",
+        "Camper Cat's training page is making good progress. Change the <code>div</code> he used to wrap his copyright information at the bottom of the page to a <code>footer</code> element."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Training</h1>",
+        "    <nav>",
+        "      <ul>",
+        "        <li><a href=\"#stealth\">Stealth &amp; Agility</a></li>",
+        "        <li><a href=\"#combat\">Combat</a></li>",
+        "        <li><a href=\"#weapons\">Weapons</a></li>",
+        "      </ul>",
+        "    </nav>",
+        "  </header>",
+        "  <main>",
+        "    <section id=\"stealth\">",
+        "      <h2>Stealth &amp; Agility Training</h2>",
+        "      <article><h3>Climb foliage quickly using a minimum spanning tree approach</h3></article>",
+        "      <article><h3>No training is NP-complete without parkour</h3></article>",
+        "    </section>",
+        "    <section id=\"combat\">",
+        "      <h2>Combat Training</h2>",
+        "      <article><h3>Dispatch multiple enemies with multithreaded tactics</h3></article>",
+        "      <article><h3>Goodbye world: 5 proven ways to knock out an opponent</h3></article>",
+        "    </section>",
+        "    <section id=\"weapons\">",
+        "      <h2>Weapons Training</h2>",
+        "      <article><h3>Swords: the best tool to literally divide and conquer</h3></article>",
+        "      <article><h3>Breadth-first or depth-first in multi-weapon training?</h3></article>",
+        "    </section>",
+        "  </main>",
+        "",
+        "",
+        "  <div>&copy; 2016 Camper Cat</div>",
+        "",
+        "",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('footer').length == 1, 'message: Your code should have one <code>footer</code> tag.');",
+        "assert($('div').length == 0, 'message: Your code should not have any <code>div</code> tags.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7789367417b2b2512aa4",
+      "title": "Improve Accessibility of Audio Content with the audio Element",
+      "description": [
+        "HTML5's <code>audio</code> element gives semantic meaning when it wraps sound or audio stream content in your markup. Audio content also needs a text alternative to be accessible to the deaf or hard of hearing. This can be done with nearby text on the page or a link to a transcript.",
+        "The <code>audio</code> tag supports the <code>controls</code> attribute. This shows the browser default play, pause, and other controls, and supports keyboard functionality. This is a boolean attribute, meaning it doesn't need a value, its presence on the tag turns the setting on.",
+        "Here's an example:",
+        "<blockquote>&lt;audio id=&quot;meowClip&quot; controls&gt;<br>    &lt;source src=&quot;audio/meow.mp3&quot; type=&quot;audio/mpeg&quot; /&gt;<br>    &lt;source src=&quot;audio/meow.ogg&quot; type=&quot;audio/ogg&quot; /&gt;<br>&lt;/audio&gt;<br></blockquote>",
+        "<strong>Note</strong><br>Multimedia content usually has both visual and auditory components. It needs synchronized captions and a transcript so users with visual and/or auditory impairments can access it. Generally, a web developer is not responsible for creating the captions or transcript, but needs to know to include them.",
+        "<hr>",
+        "Time to take a break from Camper Cat and meet fellow camper Zersiax (@zersiax), a champion of accessibility and a screen reader user. To hear a clip of his screen reader in action, add an <code>audio</code> element after the <code>p</code>. Include the <code>controls</code> attribute. Then place a <code>source</code> tag inside the <code>audio</code> tags with the <code>src</code> attribute set to \"https://s3.amazonaws.com/freecodecamp/screen-reader.mp3\" and <code>type</code> attribute set to \"audio/mpeg\".",
+        "<strong>Note</strong><br>The audio clip may sound fast and be difficult to understand, but that is a normal speed for screen reader users."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Real Coding Ninjas</h1>",
+        "  </header>",
+        "  <main>",
+        "    <p>A sound clip of Zersiax's screen reader in action.</p>",
+        "    ",
+        "    ",
+        "    ",
+        "  </main>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('audio').length === 1, 'message: Your code should have one <code>audio</code> tag.');",
+        "assert($('audio').attr('controls'), 'message: The <code>audio</code> tag should have the <code>controls</code> attribute.');",
+        "assert($('source').length === 1, 'message: Your code should have one <code>source</code> tag.');",
+        "assert($('audio').children('source').length === 1, 'message: Your <code>source</code> tag should be inside the <code>audio</code> tags.');",
+        "assert($('source').attr('src') === 'https://s3.amazonaws.com/freecodecamp/screen-reader.mp3', 'message: The value for the <code>src</code> attribute on the <code>source</code> tag should match the link in the instructions exactly.');",
+        "assert($('source').attr('type') === 'audio/mpeg', 'message: Your code should include a <code>type</code> attribute on the <code>source</code> tag with a value of audio/mpeg.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778a367417b2b2512aa5",
+      "title": "Improve Chart Accessibility with the figure Element",
+      "description": [
+        "HTML5 introduced the <code>figure</code> element, along with the related <code>figcaption</code>. Used together, these items wrap a visual representation (like an image, diagram, or chart) along with its caption. This gives a two-fold accessibility boost by both semantically grouping related content, and providing a text alternative that explains the <code>figure</code>.",
+        "For data visualizations like charts, the caption can be used to briefly note the trends or conclusions for users with visual impairments. Another challenge covers how to move a table version of the chart's data off-screen (using CSS) for screen reader users.",
+        "Here's an example - note that the <code>figcaption</code> goes inside the <code>figure</code> tags and can be combined with other elements:",
+        "<blockquote>&lt;figure&gt;<br>  &lt;img src=&quot;roundhouseDestruction.jpeg&quot; alt=&quot;Photo of Camper Cat executing a roundhouse kick&quot;&gt;<br>  &lt;br&gt;<br>  &lt;figcaption&gt;<br>    Master Camper Cat demonstrates proper form of a roundhouse kick.<br>  &lt;/figcaption&gt;<br>&lt;/figure&gt;<br></blockquote>",
+        "<hr>",
+        "Camper Cat is hard at work creating a stacked bar chart showing the amount of time per week to spend training in stealth, combat, and weapons. Help him structure his page better by changing the <code>div</code> tag he used to a <code>figure</code> tag, and the <code>p</code> tag that surrounds the caption to a <code>figcaption</code> tag."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Training</h1>",
+        "    <nav>",
+        "      <ul>",
+        "        <li><a href=\"#stealth\">Stealth &amp; Agility</a></li>",
+        "        <li><a href=\"#combat\">Combat</a></li>",
+        "        <li><a href=\"#weapons\">Weapons</a></li>",
+        "      </ul>",
+        "    </nav>",
+        "  </header>",
+        "  <main>",
+        "    <section>",
+        "      ",
+        "      <!-- Add your code below this line -->",
+        "      <div>",
+        "        <!-- Stacked bar chart will go here -->",
+        "        <br>",
+        "        <p>Breakdown per week of time to spend training in stealth, combat, and weapons.</p>",
+        "      </div>",
+        "      <!-- Add your code above this line -->",
+        "      ",
+        "    </section>",
+        "    <section id=\"stealth\">",
+        "      <h2>Stealth &amp; Agility Training</h2>",
+        "      <article><h3>Climb foliage quickly using a minimum spanning tree approach</h3></article>",
+        "      <article><h3>No training is NP-complete without parkour</h3></article>",
+        "    </section>",
+        "    <section id=\"combat\">",
+        "      <h2>Combat Training</h2>",
+        "      <article><h3>Dispatch multiple enemies with multithreaded tactics</h3></article>",
+        "      <article><h3>Goodbye world: 5 proven ways to knock out an opponent</h3></article>",
+        "    </section>",
+        "    <section id=\"weapons\">",
+        "      <h2>Weapons Training</h2>",
+        "      <article><h3>Swords: the best tool to literally divide and conquer</h3></article>",
+        "      <article><h3>Breadth-first or depth-first in multi-weapon training?</h3></article>",
+        "    </section>",
+        "  </main>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('figure').length == 1, 'message: Your code should have one <code>figure</code> tag.');",
+        "assert($('figcaption').length == 1, 'message: Your code should have one <code>figcaption</code> tag.');",
+        "assert($('div').length == 0, 'message: Your code should not have any <code>div</code> tags.');",
+        "assert($('p').length == 0, 'message: Your code should not have any <code>p</code> tags.');",
+        "assert($('figure').children('figcaption').length == 1, 'message: The <code>figcaption</code> should be a child of the <code>figure</code> tag.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778a367417b2b2512aa6",
+      "title": "Improve Form Field Accessibility with the label Element",
+      "description": [
+        "Improving accessibility with semantic HTML markup applies to using both appropriate tag names as well as attributes. The next several challenges cover some important scenarios using attributes in forms.",
+        "The <code>label</code> tag wraps the text for a specific form control item, usually the name or label for a choice. This ties meaning to the item and makes the form more readable. The <code>for</code> attribute on a <code>label</code> tag explicitly associates that <code>label</code> with the form control and is used by screen readers.",
+        "The value of the <code>for</code> attribute must be the same as the value of the <code>id</code> attribute of the form control. Here's an example:",
+        "<blockquote>&lt;form&gt;<br>  &lt;label for=&quot;name&quot;&gt;Name:&lt;/label&gt;<br>  &lt;input type=&quottext&quot; id=&quot;name&quot; name=&quot;name&quot;&gt;<br>&lt;/form&gt;<br></blockquote>",
+        "<hr>",
+        "Camper Cat expects a lot of interest in his thoughtful blog posts, and wants to include an email sign up form. Add a <code>for</code> attribute on the email <code>label</code> that matches the <code>id</code> on its <code>input</code> field."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Deep Thoughts with Master Camper Cat</h1>",
+        "  </header>",
+        "  <section>",
+        "    <form>",
+        "      <p>Sign up to receive Camper Cat's blog posts by email here!</p>",
+        "      ",
+        "      ",
+        "      <label>Email:</label>",
+        "      <input type=\"text\" id=\"email\" name=\"email\">",
+        "      ",
+        "      ",
+        "      <input type=\"submit\" name=\"submit\" value=\"Submit\">",
+        "    </form>",
+        "  </section>",
+        "  <article>",
+        "    <h2>The Garfield Files: Lasagna as Training Fuel?</h2>",
+        "    <p>The internet is littered with varying opinions on nutritional paradigms, from catnip paleo to hairball cleanses. But let's turn our attention to an often overlooked fitness fuel, and examine the protein-carb-NOM trifecta that is lasagna...</p>",
+        "  </article>",
+        "  <img src=\"samuraiSwords.jpeg\" alt=\"\">",
+        "  <article>",
+        "    <h2>Defeating your Foe: the Red Dot is Ours!</h2>",
+        "    <p>Felines the world over have been waging war on the most persistent of foes. This red nemesis combines both cunning stealth and lightening speed. But chin up, fellow fighters, our time for victory may soon be near...</p>",
+        "  </article>",
+        "  <img src=\"samuraiSwords.jpeg\" alt=\"\">",
+        "  <article>",
+        "    <h2>Is Chuck Norris a Cat Person?</h2>",
+        "    <p>Chuck Norris is widely regarded as the premier martial artist on the planet, and it's a complete coincidence anyone who disagrees with this fact mysteriously disappears soon after. But the real question is, is he a cat person?...</p>",
+        "  </article>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('label').attr('for'), 'message: Your code should have a <code>for</code> attribute on the <code>label</code> tag that is not empty.');",
+        "assert($('label').attr('for') == 'email', 'message: Your <code>for</code> attribute value should match the <code>id</code> value on the email <code>input</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778b367417b2b2512aa7",
+      "title": "Wrap Radio Buttons in a fieldset Element for Better Accessibility",
+      "description": [
+        "The next form topic covers accessibility of radio buttons. Each choice is given a <code>label</code> with a <code>for</code> attribute tying to the <code>id</code> of the corresponding item as covered in the last challenge. Since radio buttons often come in a group where the user must choose one, there's a way to semantically show the choices are part of a set.",
+        "The <code>fieldset</code> tag surrounds the entire grouping of radio buttons to achieve this. It often uses a <code>legend</code> tag to provide a description for the grouping, which is read by screen readers for each choice in the <code>fieldset</code> element.",
+        "The <code>fieldset</code> wrapper and <code>legend</code> tag are not necessary when the choices are self-explanatory, like a gender selection. Using a <code>label</code> with the <code>for</code> attribute for each radio button is sufficient.",
+        "Here's an example:",
+        "<blockquote>&lt;form&gt;<br>  &lt;fieldset&gt;<br>    &lt;legend&gt;Choose one of these three items:&lt;/legend&gt;<br>    &lt;input id=&quot;one&quot; type=&quot;radio&quot; name=&quot;items&quot; value=&quot;one&quot;&gt;<br>    &lt;label for=&quot;one&quot;&gt;Choice One&lt;/label&gt;&lt;br&gt;<br>    &lt;input id=&quot;two&quot; type=&quot;radio&quot; name=&quot;items&quot; value=&quot;two&quot;&gt;<br>    &lt;label for=&quot;two&quot;&gt;Choice Two&lt;/label&gt;&lt;br&gt;<br>    &lt;input id=&quot;three&quot; type=&quot;radio&quot; name=&quot;items&quot; value=&quot;three&quot;&gt;<br>    &lt;label for=&quot;three&quot;&gt;Choice Three&lt;/label&gt;<br>  &lt;/fieldset&gt;<br>&lt;/form&gt;<br></blockquote>",
+        "<hr>",
+        "Camper Cat wants information about the ninja level of his users when they sign up for his email list. He's added a set of radio buttons, and learned from our last lesson to use label tags with <code>for</code> attributes for each choice. Go Camper Cat! However, his code still needs some help. Change the div tag surrounding the radio buttons to a fieldset tag, and change the p tag inside it to a legend."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Deep Thoughts with Master Camper Cat</h1>",
+        "  </header>",
+        "  <section>",
+        "    <form>",
+        "      <p>Sign up to receive Camper Cat's blog posts by email here!</p>",
+        "      <label for=\"email\">Email:</label>",
+        "      <input type=\"text\" id=\"email\" name=\"email\">",
+        "      ",
+        "      ",
+        "      <!-- Add your code below this line -->",
+        "      <div>",
+        "        <p>What level ninja are you?</p>",
+        "        <input id=\"newbie\" type=\"radio\" name=\"levels\" value=\"newbie\">",
+        "        <label for=\"newbie\">Newbie Kitten</label><br>",
+        "        <input id=\"intermediate\" type=\"radio\" name=\"levels\" value=\"intermediate\">",
+        "        <label for=\"intermediate\">Developing Student</label><br>",
+        "        <input id=\"master\" type=\"radio\" name=\"levels\" value=\"master\">",
+        "        <label for=\"master\">Master</label>",
+        "      </div>",
+        "      <!-- Add your code above this line -->",
+        "      ",
+        "      ",
+        "      <input type=\"submit\" name=\"submit\" value=\"Submit\">",
+        "    </form>",
+        "  </section>",
+        "  <article>",
+        "    <h2>The Garfield Files: Lasagna as Training Fuel?</h2>",
+        "    <p>The internet is littered with varying opinions on nutritional paradigms, from catnip paleo to hairball cleanses. But let's turn our attention to an often overlooked fitness fuel, and examine the protein-carb-NOM trifecta that is lasagna...</p>",
+        "  </article>",
+        "  <img src=\"samuraiSwords.jpeg\" alt=\"\">",
+        "  <article>",
+        "    <h2>Defeating your Foe: the Red Dot is Ours!</h2>",
+        "    <p>Felines the world over have been waging war on the most persistent of foes. This red nemesis combines both cunning stealth and lightening speed. But chin up, fellow fighters, our time for victory may soon be near...</p>",
+        "  </article>",
+        "  <img src=\"samuraiSwords.jpeg\" alt=\"\">",
+        "  <article>",
+        "    <h2>Is Chuck Norris a Cat Person?</h2>",
+        "    <p>Chuck Norris is widely regarded as the premier martial artist on the planet, and it's a complete coincidence anyone who disagrees with this fact mysteriously disappears soon after. But the real question is, is he a cat person?...</p>",
+        "  </article>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('fieldset').length == 1, 'message: Your code should have a <code>fieldset</code> tag around the radio button set.');",
+        "assert($('legend').length == 1, 'message: Your code should have a <code>legend</code> tag around the text asking what level ninja a user is.');",
+        "assert($('div').length == 0, 'message: Your code should not have any <code>div</code> tags.');",
+        "assert($('p').length == 4, 'message: Your code should no longer have a <code>p</code> tag around the text asking what level ninja a user is.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778b367417b2b2512aa8",
+      "title": "Add an Accessible Date Picker",
+      "description": [
+        "Forms often include the <code>input</code> field, which can be used to create several different form controls. The <code>type</code> attribute on this element indicates what kind of input will be created.",
+        "You may have noticed the <code>text</code> and <code>submit</code> input types in prior challenges, and HTML5 introduced an option to specify a <code>date</code> field. Depending on browser support, a date picker shows up in the <code>input</code> field when it's in focus, which makes filling in a form easier for all users.",
+        "For older browsers, the type will default to <code>text</code>, so it helps to show users the expected date format in the label or as placeholder text just in case.",
+        "Here's an example:",
+        "<blockquote>&lt;label for=&quot;input1&quot;&gt;Enter a date:&lt;/label&gt;<br>&lt;input type=&quot;date&quot; id=&quot;input1&quot; name=&quot;input1&quot;&gt;<br></blockquote>",
+        "<hr>",
+        "Camper Cat is setting up a mortal combat tournament and wants to ask his competitors to see what date works best. Add an <code>input</code> tag with a <code>type</code> attribute of \"date\", an <code>id</code> attribute of \"pickdate\", and a <code>name</code> attribute of \"date\"."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Tournaments</h1>",
+        "  </header>",
+        "  <main>",
+        "    <section>",
+        "      <h2>Mortal Combat Tournament Survey</h2>",
+        "      <form>",
+        "        <p>Tell us the best date for the competition</p>",
+        "        <label for=\"pickdate\">Preferred Date:</label>",
+        "        ",
+        "        <!-- Add your code below this line -->",
+        "        ",
+        "        ",
+        "        ",
+        "        <!-- Add your code above this line -->",
+        "        ",
+        "        <input type=\"submit\" name=\"submit\" value=\"Submit\">",
+        "      </form>",
+        "    </section>",
+        "  </main>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('input').length == 2, 'message: Your code should add one <code>input</code> tag for the date selector field.');",
+        "assert($('input').attr('type') == 'date', 'message: Your <code>input</code> tag should have a <code>type</code> attribute with a value of date.');",
+        "assert($('input').attr('id') == 'pickdate', 'message: Your <code>input</code> tag should have an <code>id</code> attribute with a value of pickdate.');",
+        "assert($('input').attr('name') == 'date', 'message: Your <code>input</code> tag should have a <code>name</code> attribute with a value of date.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778c367417b2b2512aa9",
+      "title": "Standardize Times with the HTML5 datetime Attribute",
+      "description": [
+        "Continuing with the date theme, HTML5 also introduced the <code>time</code> element along with a <code>datetime</code> attribute to standardize times. This is an inline element that can wrap a date or time on a page. A valid format of that date is held by the <code>datetime</code> attribute. This is the value accessed by assistive devices. It helps avoid confusion by stating a standardized version of a time, even if it's written in an informal or colloquial manner in the text.",
+        "Here's an example:",
+        "<code>&lt;p&gt;Master Camper Cat officiated the cage match between Goro and Scorpion &lt;time datetime=&quot;2013-02-13&quot;&gt;last Wednesday&lt;/time&gt;, which ended in a draw.&lt;/p&gt;</code>",
+        "<hr>",
+        "Camper Cat's mortal combat survey results are in! Wrap a <code>time</code> tag around the text \"Thursday, September 15&lt;sup&gt;th&lt;/sup&gt;\" and add a <code>datetime</code> attribute to it set to \"2016-09-15\"."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Tournaments</h1>",
+        "  </header>",
+        "  <article>",
+        "    <h2>Mortal Combat Tournament Survey Results</h2>",
+        "    ",
+        "    <!-- Add your code below this line -->",
+        "    ",
+        "    <p>Thank you to everyone for responding to Master Camper Cat's survey. The best day to host the vaunted Mortal Combat tournament is Thursday, September 15<sup>th</sup>. May the best ninja win!</p>",
+        "    ",
+        "    <!-- Add your code above this line -->",
+        "    ",
+        "    <section>",
+        "      <h3>Comments:</h3>",
+        "      <article>",
+        "        <p>Posted by: Sub-Zero on <time datetime=\"2016-08-13T20:01Z\">August 13<sup>th</sup></time></p>",
+        "        <p>Johnny Cage better be there, I'll finish him!</p>",
+        "      </article>",
+        "      <article>",
+        "        <p>Posted by: Doge on <time datetime=\"2016-08-15T08:12Z\">August 15<sup>th</sup></time></p>",
+        "        <p>Wow, much combat, so mortal.</p>",
+        "      </article>",
+        "      <article>",
+        "        <p>Posted by: The Grim Reaper on <time datetime=\"2016-08-16T00:00Z\">August 16<sup>th</sup></time></p>",
+        "        <p>Looks like I'll be busy that day.</p>",
+        "      </article>",
+        "    </section>",
+        "  </article>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('time').text().match(/Thursday, September 15th/g), 'message: Your <code>time</code> tags should wrap around the text \"Thursday, September 15&lt;sup&gt;th&lt;/sup&gt;\".');",
+        "assert($('time').attr('datetime'), 'message: Your <code>time</code> tag should have a <code>datetime</code> attribute that is not empty.');",
+        "assert($('time').attr('datetime') === \"2016-09-15\", 'message: Your <code>datetime</code> attribute should be set to a value of 2016-09-15.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778d367417b2b2512aaa",
+      "title": "Make Elements Only Visible to a Screen Reader by Using Custom CSS",
+      "description": [
+        "Have you noticed that all of the applied accessibility challenges so far haven't used any CSS? This is to show the importance of a logical document outline, and using semantically meaningful tags around your content before introducing the visual design aspect.",
+        "However, CSS's magic can also improve accessibility on your page when you want to visually hide content meant only for screen readers. This happens when information is in a visual format (like a chart), but screen reader users need an alternative presentation (like a table) to access the data. CSS is used to position the screen reader-only elements off the visual area of the browser window.",
+        "Here's an example of the CSS rules that accomplish this:",
+        "<blockquote>.sr-only {<br>  position: absolute;<br>  left: -10000px;<br>  width: 1px;<br>  height: 1px;<br>  top: auto;<br>  overflow: hidden;<br>}</blockquote>",
+        "<strong>Note</strong><br>The following CSS approaches will NOT do the same thing:",
+        "<ul>",
+        "<li><code>display: none;</code> or <code>visibility: hidden;</code> hides content for everyone, including screen reader users</li>",
+        "<li>Zero values for pixel sizes, such as <code>width: 0px; height: 0px;</code> removes that element from the flow of your document, meaning screen readers will ignore it</li>",
+        "</ul>",
+        "<hr>",
+        "Camper Cat created a really cool stacked bar chart for his training page, and put the data into a table for his visually impaired users. The table already has an <code>sr-only</code> class, but the CSS rules aren't filled in yet. Give the <code>position</code> an absolute value, the <code>left</code> a -10000px value, and the <code>width</code> and <code>height</code> both 1px values."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "  <style>",
+        "  .sr-only {",
+        "    position: ;",
+        "    left: ;",
+        "    width: ;",
+        "    height: ;",
+        "    top: auto;",
+        "    overflow: hidden;",
+        "  }",
+        "  </style>",
+        "</head>",
+        "<body>",
+        "  <header>",
+        "    <h1>Training</h1>",
+        "    <nav>",
+        "      <ul>",
+        "        <li><a href=\"#stealth\">Stealth &amp; Agility</a></li>",
+        "        <li><a href=\"#combat\">Combat</a></li>",
+        "        <li><a href=\"#weapons\">Weapons</a></li>",
+        "      </ul>",
+        "    </nav>",
+        "  </header>",
+        "  <section>",
+        "    <h2>Master Camper Cat's Beginner Three Week Training Program</h2>",
+        "    <figure>",
+        "      <!-- Stacked bar chart of weekly training-->",
+        "      <p>[Stacked bar chart]</p>",
+        "      <br />",
+        "      <figcaption>Breakdown per week of time to spend training in stealth, combat, and weapons.</figcaption>",
+        "    </figure>",
+        "    <table class=\"sr-only\">",
+        "      <caption>Hours of Weekly Training in Stealth, Combat, and Weapons</caption>",
+        "      <thead>",
+        "        <tr>",
+        "          <th></th>",
+        "          <th scope=\"col\">Stealth &amp; Agility</th>",
+        "          <th scope=\"col\">Combat</th>",
+        "          <th scope=\"col\">Weapons</th>",
+        "          <th scope=\"col\">Total</th>                                        ",
+        "        </tr>",
+        "      </thead>",
+        "      <tbody>",
+        "        <tr>",
+        "          <th scope=\"row\">Week One</th>",
+        "          <td>3</td>",
+        "          <td>5</td>",
+        "          <td>2</td>",
+        "          <td>10</td>",
+        "        </tr>",
+        "        <tr>",
+        "          <th scope=\"row\">Week Two</th>",
+        "          <td>4</td>",
+        "          <td>5</td>",
+        "          <td>3</td>",
+        "          <td>12</td>",
+        "        </tr>",
+        "        <tr>",
+        "          <th scope=\"row\">Week Three</th>",
+        "          <td>4</td>",
+        "          <td>6</td>",
+        "          <td>3</td>",
+        "          <td>13</td>",
+        "        </tr>",
+        "      </tbody>",
+        "    </table>",
+        "  </section>",
+        "  <section id=\"stealth\">",
+        "    <h2>Stealth &amp; Agility Training</h2>",
+        "    <article><h3>Climb foliage quickly using a minimum spanning tree approach</h3></article>",
+        "    <article><h3>No training is NP-complete without parkour</h3></article>",
+        "  </section>",
+        "  <section id=\"combat\">",
+        "    <h2>Combat Training</h2>",
+        "    <article><h3>Dispatch multiple enemies with multithreaded tactics</h3></article>",
+        "    <article><h3>Goodbye, world: 5 proven ways to knock out an opponent</h3></article>",
+        "  </section>",
+        "  <section id=\"weapons\">",
+        "    <h2>Weapons Training</h2>",
+        "    <article><h3>Swords: the best tool to literally divide and conquer</h3></article>",
+        "    <article><h3>Breadth-first or depth-first in multi-weapon training?</h3></article>",
+        "  </section>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('.sr-only').css('position') == 'absolute', 'message: Your code should set the <code>position</code> property of the <code>sr-only</code> class to a value of absolute.');",
+        "assert($('.sr-only').css('left') == '-10000px', 'message: Your code should set the <code>left</code> property of the <code>sr-only</code> class to a value of -10000px.');",
+        "assert(code.match(/width:\\s*?1px/gi), 'message: Your code should set the <code>width</code> property of the <code>sr-only</code> class to a value of 1 pixel.');",
+        "assert(code.match(/height:\\s*?1px/gi), 'message: Your code should set the <code>height</code> property of the <code>sr-only</code> class to a value of 1 pixel.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778e367417b2b2512aab",
+      "title": "Improve Readability with High Contrast Text",
+      "description": [
+        "Low contrast between the foreground and background colors can make text difficult to read. Sufficient contrast improves the readability of your content, but what exactly does \"sufficient\" mean?",
+        "The Web Content Accessibility Guidelines (WCAG) recommend at least a 4.5 to 1 contrast ratio for normal text. The ratio is calculated by comparing the relative luminance values of two colors. This ranges from 1:1 for the same color, or no contrast, to 21:1 for white against black, the strongest contrast. There are many contrast checking tools available online that calculate this ratio for you.",
+        "<hr>",
+        "Camper Cat's choice of light gray text on a white background for his recent blog post has a 1.5:1 contrast ratio, making it hard to read. Change the <code>color</code> of the text from the current gray (<code>#D3D3D3</code>) to a darker gray (<code>#636363</code>) to improve the contrast ratio to 6:1."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "  <style>",
+        "  body {",
+        "    color: #D3D3D3;",
+        "    background-color: #FFF;",
+        "  }",
+        "  </style>",
+        "</head>",
+        "<body>",
+        "  <header>",
+        "    <h1>Deep Thoughts with Master Camper Cat</h1>",
+        "  </header>",
+        "  <article>",
+        "    <h2>A Word on the Recent Catnip Doping Scandal</h2>",
+        "    <p>The influence that catnip has on feline behavior is well-documented, and its use as an herbal supplement in competitive ninja circles remains controversial. Once again, the debate to ban the substance is brought to the public's attention after the high-profile win of Kittytron, a long-time proponent and user of the green stuff, at the Claw of Fury tournament.</p>",
+        "    <p>As I've stated in the past, I firmly believe a true ninja's skills must come from within, with no external influences. My own catnip use shall continue as purely recreational.</p>",
+        "  </article>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('body').css('color') == 'rgb(99, 99, 99)', 'message: Your code should change the text <code>color</code> for the <code>body</code> to the darker gray.');",
+        "assert($('body').css('background-color') == 'rgb(255, 255, 255)', 'message: Your code should not change the <code>background-color</code> for the <code>body</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778f367417b2b2512aac",
+      "title": "Avoid Colorblindness Issues by Using Sufficient Contrast",
+      "description": [
+        "Color is a large part of visual design, but its use introduces two accessibility issues. First, color alone should not be used as the only way to convey important information because screen reader users won't see it. Second, foreground and background colors need sufficient contrast so colorblind users can distinguish them.",
+        "Previous challenges covered having text alternatives to address the first issue. The last challenge introduced contrast checking tools to help with the second. The WCAG-recommended contrast ratio of 4.5:1 applies for color use as well as gray-scale combinations.",
+        "Colorblind users have trouble distinguishing some colors from others - usually in hue but sometimes lightness as well. You may recall the contrast ratio is calculated using the relative luminance (or lightness) values of the foreground and background colors.",
+        "In practice, the 4.5:1 ratio can be reached by darkening the darker color and lightening the lighter one with the aid of a color contrast checker. Darker colors on the color wheel are considered to be blues, violets, magentas, and reds, whereas lighter colors are oranges, yellows, greens, and blue-greens.",
+        "<hr>",
+        "Camper Cat is experimenting with using color for his blog text and background, but his current combination of a greenish <code>background-color</code> with maroon text <code>color</code> has a 2.5:1 contrast ratio. You can easily adjust the lightness of the colors since he declared them using the CSS <code>hsl()</code> property (which stands for hue, saturation, lightness) by changing the third argument. Increase the <code>background-color</code> lightness value from 35% to 55%, and decrease the <code>color</code> lightness value from 20% to 15%. This improves the contrast to 5.9:1."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "  <style>",
+        "  body {",
+        "    color: hsl(0, 55%, 20%);",
+        "    background-color: hsl(120, 25%, 35%);",
+        "  }",
+        "  </style>",
+        "</head>",
+        "<body>",
+        "  <header>",
+        "    <h1>Deep Thoughts with Master Camper Cat</h1>",
+        "  </header>",
+        "  <article>",
+        "    <h2>A Word on the Recent Catnip Doping Scandal</h2>",
+        "    <p>The influence that catnip has on feline behavior is well-documented, and its use as an herbal supplement in competitive ninja circles remains controversial. Once again, the debate to ban the substance is brought to the public's attention after the high-profile win of Kittytron, a long-time proponent and user of the green stuff, at the Claw of Fury tournament.</p>",
+        "    <p>As I've stated in the past, I firmly believe a true ninja's skills must come from within, with no external influences. My own catnip use shall continue as purely recreational.</p>",
+        "  </article>",
+        "</body>"
+      ],
+      "tests": [
+        "assert(code.match(/color:\\s*?hsl\\(0,\\s*?55%,\\s*?15%\\)/gi), 'message: Your code should only change the lightness value for the text <code>color</code> property to a value of 15%.');",
+        "assert(code.match(/background-color:\\s*?hsl\\(120,\\s*?25%,\\s*?55%\\)/gi), 'message: Your code should only change the lightness value for the <code>background-color</code> property to a value of 55%.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778f367417b2b2512aad",
+      "title": "Avoid Colorblindness Issues by Carefully Choosing Colors that Convey Information",
+      "description": [
+        "There are various forms of colorblindness. These can range from a reduced sensitivity to a certain wavelength of light to the inability to see color at all. The most common form is a reduced sensitivity to detect greens.",
+        "For example, if two similar green colors are the foreground and background color of your content, a colorblind user may not be able to distinguish them. Close colors can be thought of as neighbors on the color wheel, and those combinations should be avoided when conveying important information.",
+        "<strong>Note</strong><br>Some online color picking tools include visual simulations of how colors appear for different types of colorblindness. These are great resources in addition to online contrast checking calculators.",
+        "<hr>",
+        "Camper Cat is testing different styles for an important button, but the yellow (<code>#FFFF33</code>) <code>background-color</code> and the green (<code>#33FF33</code>) text <code>color</code> are neighboring hues on the color wheel and virtually indistinguishable for some colorblind users. (Their similar lightness also fails the contrast ratio check). Change the text <code>color</code> to a dark blue (<code>#003366</code>) to solve both problems."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "  <style>",
+        "  button {",
+        "    color: #33FF33;",
+        "    background-color: #FFFF33;",
+        "    font-size: 14px;",
+        "    padding: 10px;",
+        "  }",
+        "  </style>",
+        "</head>",
+        "<body>",
+        "  <header>",
+        "    <h1>Danger!</h1>",
+        "  </header>",
+        "  <button>Delete Internet</button>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('button').css('color') == 'rgb(0, 51, 102)', 'message: Your code should change the text <code>color</code> for the <code>button</code> to the dark blue.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d778f367417b2b2512aae",
+      "title": "Give Links Meaning by Using Descriptive Link Text",
+      "description": [
+        "Screen reader users have different options for what type of content their device reads. This includes skipping to (or over) landmark elements, jumping to the main content, or getting a page summary from the headings. Another option is to only hear the links available on a page.",
+        "Screen readers do this by reading the link text, or what's between the anchor (<code>a</code>) tags. Having a list of \"click here\" or \"read more\" links isn't helpful. Instead, you should use brief but descriptive text within the <code>a</code> tags to provide more meaning for these users.",
+        "<hr>",
+        "The link text that Camper Cat is using is not very descriptive without the surrounding context. Move the anchor (<code>a</code>) tags so they wrap around the text \"information about batteries\" instead of \"Click here\"."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Deep Thoughts with Master Camper Cat</h1>",
+        "  </header>",
+        "  <article>",
+        "    <h2>Defeating your Foe: the Red Dot is Ours!</h2>",
+        "    <p>Felines the world over have been waging war on the most persistent of foes. This red nemesis combines both cunning stealth and lightening speed. But chin up, fellow fighters, our time for victory may soon be near. <a href=\"\">Click here</a> for information about batteries</p>",
+        "  </article>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('a').text().match(/information about batteries/g), 'message: Your code should move the anchor <code>a</code> tags from around the words \"Click here\" to wrap around the words \"information about batteries\".');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7790367417b2b2512aaf",
+      "title": "Make Links Navigatable with HTML Access Keys",
+      "description": [
+        "HTML offers the <code>accesskey</code> attribute to specify a shortcut key to activate or bring focus to an element. This can make navigation more efficient for keyboard-only users.",
+        "HTML5 allows this attribute to be used on any element, but it's particularly useful when it's used with interactive ones. This includes links, buttons, and form controls.",
+        "Here's an example:",
+        "<code>&lt;button accesskey=&quot;b&quot;&gt;Important Button&lt;/button&gt;</code>",
+        "<hr>",
+        "Camper Cat wants the links around the two blog article titles to have keyboard shortcuts so his site's users can quickly navigate to the full story. Add an <code>accesskey</code> attribute to both links and set the first one to \"g\" (for Garfield) and the second one to \"c\" (for Chuck Norris)."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Deep Thoughts with Master Camper Cat</h1>",
+        "  </header>",
+        "  <article>",
+        "    ",
+        "    ",
+        "    <h2><a id=\"first\" href=\"\">The Garfield Files: Lasagna as Training Fuel?</a></h2>",
+        "    ",
+        "    ",
+        "    <p>The internet is littered with varying opinions on nutritional paradigms, from catnip paleo to hairball cleanses. But let's turn our attention to an often overlooked fitness fuel, and examine the protein-carb-NOM trifecta that is lasagna...</p>",
+        "  </article>",
+        "  <article>",
+        "    ",
+        "    ",
+        "    <h2><a id=\"second\" href=\"\">Is Chuck Norris a Cat Person?</a></h2>",
+        "    ",
+        "    ",
+        "    <p>Chuck Norris is widely regarded as the premier martial artist on the planet, and it's a complete coincidence anyone who disagrees with this fact mysteriously disappears soon after. But the real question is, is he a cat person?...</p>",
+        "  </article>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('#first').attr('accesskey'), 'message: Your code should add an <code>accesskey</code> attribute to the <code>a</code> tag with the <code>id</code> of \"first\".');",
+        "assert($('#second').attr('accesskey'), 'message: Your code should add an <code>accesskey</code> attribute to the <code>a</code> tag with the <code>id</code> of \"second\".');",
+        "assert($('#first').attr('accesskey') == 'g', 'message: Your code should set the <code>accesskey</code> attribute on the <code>a</code> tag with the <code>id</code> of \"first\" to \"g\". Note that case matters.');",
+        "assert($('#second').attr('accesskey') == 'c', 'message: Your code should set the <code>accesskey</code> attribute on the <code>a</code> tag with the <code>id</code> of \"second\" to \"c\". Note that case matters.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7790367417b2b2512ab0",
+      "title": "Use tabindex to Add Keyboard Focus to an Element",
+      "description": [
+        "The HTML <code>tabindex</code> attribute has three distinct functions relating to an element's keyboard focus. When it's on a tag, it indicates that element can be focused on. The value (an integer that's positive, negative, or zero) determines the behavior.",
+        "Certain elements, such as links and form controls, automatically receive keyboard focus when a user tabs through a page. It's in the same order as the elements come in the HTML source markup. This same functionality can be given to other elements, such as <code>div</code>, <code>span</code>, and <code>p</code>, by placing a <code>tabindex=\"0\"</code> attribute on them. Here's an example:",
+        "<code>&lt;div tabindex=&quot;0&quot;&gt;I need keyboard focus!&lt;/div&gt;</code>",
+        "<strong>Note</strong><br>A negative <code>tabindex</code> value (typically -1) indicates that an element is focusable, but is not reachable by the keyboard. This method is generally used to bring focus to content programmatically (like when a <code>div</code> used for a pop-up window is activated), and is beyond the scope of these challenges.",
+        "<hr>",
+        "Camper Cat created a new survey to collect information about his users. He knows input fields automatically get keyboard focus, but he wants to make sure his keyboard users pause at the instructions while tabbing through the items. Add a <code>tabindex</code> attribute to the <code>p</code> tag and set its value to \"0\". Bonus - using <code>tabindex</code> also enables the CSS pseudo-class <code>:focus</code> to work on the <code>p</code> tag."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "  <style>",
+        "  p:focus {",
+        "    background-color: yellow;",
+        "  }",
+        "  </style>",
+        "</head>",
+        "<body>",
+        "  <header>",
+        "    <h1>Ninja Survey</h1>",
+        "  </header>",
+        "  <section>",
+        "    <form>",
+        "      ",
+        "      ",
+        "      <p>Instructions: Fill in ALL your information then click <b>Submit</b></p>",
+        "      ",
+        "      ",
+        "      <label for=\"username\">Username:</label>",
+        "      <input type=\"text\" id=\"username\" name=\"username\"><br>",
+        "      <fieldset>",
+        "        <legend>What level ninja are you?</legend>",
+        "        <input id=\"newbie\" type=\"radio\" name=\"levels\" value=\"newbie\">",
+        "        <label for=\"newbie\">Newbie Kitten</label><br>",
+        "        <input id=\"intermediate\" type=\"radio\" name=\"levels\" value=\"intermediate\">",
+        "        <label for=\"intermediate\">Developing Student</label><br>",
+        "        <input id=\"master\" type=\"radio\" name=\"levels\" value=\"master\">",
+        "        <label for=\"master\">9th Life Master</label>",
+        "      </fieldset>",
+        "      <br>",
+        "      <fieldset>",
+        "      <legend>Select your favorite weapons:</legend>",
+        "      <input id=\"stars\" type=\"checkbox\" name=\"weapons\" value=\"stars\">",
+        "      <label for=\"stars\">Throwing Stars</label><br>",
+        "      <input id=\"nunchucks\" type=\"checkbox\" name=\"weapons\" value=\"nunchucks\">",
+        "      <label for=\"nunchucks\">Nunchucks</label><br>",
+        "      <input id=\"sai\" type=\"checkbox\" name=\"weapons\" value=\"sai\">",
+        "      <label for=\"sai\">Sai Set</label><br>",
+        "      <input id=\"sword\" type=\"checkbox\" name=\"weapons\" value=\"sword\">",
+        "      <label for=\"sword\">Sword</label>",
+        "      </fieldset>",
+        "      <br>",
+        "      <input type=\"submit\" name=\"submit\" value=\"Submit\">",
+        "    </form><br>",
+        "  </section>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('p').attr('tabindex'), 'message: Your code should add a <code>tabindex</code> attribute to the <code>p</code> tag that holds the form instructions.');",
+        "assert($('p').attr('tabindex') == '0', 'message: Your code should set the <code>tabindex</code> attribute on the <code>p</code> tag to a value of 0.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7790367417b2b2512ab1",
+      "title": "Use tabindex to Specify the Order of Keyboard Focus for Several Elements",
+      "description": [
+        "The <code>tabindex</code> attribute also specifies the exact tab order of elements. This is achieved when the value of the attribute is set to a positive number of 1 or higher.",
+        "Setting a tabindex=\"1\" will bring keyboard focus to that element first. Then it cycles through the sequence of specified <code>tabindex</code> values (2, 3, etc.), before moving to default and <code>tabindex=\"0\"</code> items.",
+        "It's important to note that when the tab order is set this way, it overrides the default order (which uses the HTML source). This may confuse users who are expecting to start navigation from the top of the page. This technique may be necessary in some circumstances, but in terms of accessibility, take care before applying it.",
+        "Here's an example:",
+        "<code>&lt;div tabindex=&quot;1&quot;&gt;I get keyboard focus, and I get it first!&lt;/div&gt;</code>",
+        "<code>&lt;div tabindex=&quot;2&quot;&gt;I get keyboard focus, and I get it second!&lt;/div&gt;</code>",
+        "<hr>",
+        "Camper Cat has a search field on his Inspirational Quotes page that he plans to position in the upper right corner with CSS. He wants the search <code>input</code> and submit <code>input</code> form controls to be the first two items in the tab order. Add a <code>tabindex</code> attribute set to \"1\" to the search <code>input</code>, and a <code>tabindex</code> attribute set to \"2\" to the submit <code>input</code>."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <header>",
+        "    <h1>Even Deeper Thoughts with Master Camper Cat</h1>",
+        "    <nav>",
+        "      <ul>",
+        "        <li><a href=\"\">Home</a></li>",
+        "        <li><a href=\"\">Blog</a></li>",
+        "        <li><a href=\"\">Training</a></li>",
+        "      </ul>",
+        "    </nav>",
+        "  </header>",
+        "  <form>",
+        "    <label for=\"search\">Search:</label>",
+        "    ",
+        "    ",
+        "    <input type=\"search\" name=\"search\" id=\"search\">",
+        "    <input type=\"submit\" name=\"submit\" value=\"Submit\" id=\"submit\">",
+        "    ",
+        "    ",
+        "  </form>",
+        "  <h2>Inspirational Quotes</h2>",
+        "  <blockquote>",
+        "    <p>&ldquo;There's no Theory of Evolution, just a list of creatures I've allowed to live.&rdquo;<br>",
+        "    - Chuck Norris</p>",
+        "  </blockquote>",
+        "  <blockquote>",
+        "    <p>&ldquo;Wise men say forgiveness is divine, but never pay full price for late pizza.&rdquo;<br>",
+        "    - TMNT</p>",
+        "  </blockquote>",
+        "  <footer>&copy; 2016 Camper Cat</footer>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('#search').attr('tabindex'), 'message: Your code should add a <code>tabindex</code> attribute to the search <code>input</code> tag.');",
+        "assert($('#submit').attr('tabindex'), 'message: Your code should add a <code>tabindex</code> attribute to the submit <code>input</code> tag.');",
+        "assert($('#search').attr('tabindex') == '1', 'message: Your code should set the <code>tabindex</code> attribute on the search <code>input</code> tag to a value of 1.');",
+        "assert($('#submit').attr('tabindex') == '2', 'message: Your code should set the <code>tabindex</code> attribute on the submit <code>input</code> tag to a value of 2.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/01-responsive-web-design/applied-visual-design.json b/seed/math-challenges/01-responsive-web-design/applied-visual-design.json
new file mode 100644
index 0000000000..c01f499a62
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/applied-visual-design.json
@@ -0,0 +1,2749 @@
+{
+  "name": "Applied Visual Design",
+  "order": 2,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7790367417b2b2512ab2",
+      "title": "Introduction to the Applied Visual Design Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "Visual Design in web development is a broad topic. It combines typography, color theory, graphics, animation, and page layout to help deliver a site's message. The definition of good design is a well-discussed subject, with many books on the theme.<br><br>At a basic level, most web content provides a user with information. The visual design of the page can influence its presentation and a user's experience. In web development, HTML gives structure and semantics to a page's content, and CSS controls the layout and appearance of it.<br><br>This section covers some of the basic tools developers use to create their own visual designs.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7791367417b2b2512ab3",
+      "title": "Create Visual Balance Using the text-align Property",
+      "description": [
+        "This section of the curriculum focuses on Applied Visual Design. The first group of challenges build on the given card layout to show a number of core principles.",
+        "Text is often a large part of web content. CSS has several options for how to align it with the <code>text-align</code> property.",
+        "The <code>justify</code> property causes all lines of text except the last line to meet the left and right edges of the line box.",
+        "<hr>",
+        "Align the <code>h4</code> tag's text, which says \"Google\", to the center. Then justify the paragraph tag which contains information about how Google was founded."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    ",
+        "  }",
+        "  p {",
+        "    ",
+        "  }",
+        "  .links {",
+        "    margin-right: 20px;",
+        "    ",
+        "  }",
+        "  .fullCard {",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <p>Google was founded by Larry Page and Sergey Brin while they were Ph.D. students at Stanford University.</p>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('h4').css('text-align') == 'center', 'message: Your code should use the text-align property on the <code>h4</code> tag to set it to center.');",
+        "assert($('p').css('text-align') == 'justify', 'message: Your code should use the text-align property on the <code>p</code> tag to set it to justify.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7791367417b2b2512ab4",
+      "title": "Adjust the Width of an Element Using the width Property",
+      "description": [
+        "You can specify the width of an element using the <code>width</code> property in CSS. Values can be given in relative length units (such as em), absolute length units (such as px), or as a percentage of its containing parent element. Here's an example that changes the width of an image to 220px:",
+        "<blockquote>img {<br>  width: 220px;<br>}</blockquote>",
+        "<hr>",
+        "Add a <code>width</code> property to the entire card and set it to an absolute value of 245px. Use the <code>fullCard</code> class to select the element."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    margin-right: 20px;",
+        "    text-align: left;",
+        "  }",
+        "  .fullCard {",
+        "    ",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <p>Google was founded by Larry Page and Sergey Brin while they were Ph.D. students at Stanford University.</p>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/.fullCard\\s*{[\\s\\S][^}]*\\n*^\\s*width\\s*:\\s*245px\\s*;/gm), 'message: Your code should change the <code>width</code> property of the card to 245 pixels by using the <code>fullCard</code> class selector.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7791367417b2b2512ab5",
+      "title": "Adjust the Height of an Element Using the height Property",
+      "description": [
+        "You can specify the height of an element using the <code>height</code> property in CSS, similar to the <code>width</code> property. Here's an example that changes the height of an image to 20px:",
+        "<blockquote>img {<br>  height: 20px;<br>}</blockquote>",
+        "<hr>",
+        "Add a <code>height</code> property to the <code>h4</code> tag and set it to 25px."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    ",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    margin-right: 20px;",
+        "    text-align: left;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <p>Google was founded by Larry Page and Sergey Brin while they were Ph.D. students at Stanford University.</p>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('h4').css('height') == '25px', 'message: Your code should change the <code>h4</code> <code>height</code> property to a value of 25 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781a367417b2b2512ab7",
+      "title": "Use the strong Tag to Make Text Bold",
+      "description": [
+        "To make text bold, you can use the <code>strong</code> tag. This is often used to draw attention to text and symbolize that it is important. With the <code>strong</code> tag, the browser applies the CSS of <code>font-weight: bold;</code> to the element.",
+        "<hr>",
+        "Wrap a <code>strong</code> tag around \"Stanford University\" inside the <code>p</code> tag."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    height: 25px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <p>Google was founded by Larry Page and Sergey Brin while they were Ph.D. students at Stanford University.</p>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('strong').length == 1, 'message: Your code should add one <code>strong</code> tag to the markup.');",
+        "assert($('p').children('strong').length == 1, 'message: The <code>strong</code> tag should be inside the <code>p</code> tag.');",
+        "assert($('strong').text().match(/Stanford University/gi), 'message: The <code>strong</code> tag should wrap around the words \"Stanford University\".');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781a367417b2b2512ab8",
+      "title": "Use the u Tag to Underline Text",
+      "description": [
+        "To underline text, you can use the <code>u</code> tag. This is often used to signify that a section of text is important, or something to remember. With the <code>u</code> tag, the browser applies the CSS of <code>text-decoration: underline;</code> to the element.",
+        "<hr>",
+        "Wrap the <code>u</code> tag around the text \"Ph.D. students\". It should not include the parent <code>div</code> that has the class of <code>cardText</code>.",
+        "<strong>Note</strong><br>Try to avoid using the <code>u</code> tag when it could be confused for a link. Anchor tags also have a default underlined formatting."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    height: 25px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <p>Google was founded by Larry Page and Sergey Brin while they were Ph.D. students at <strong>Stanford University</strong>.</p>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('u').length === 1, 'message: Your code should add a <code>u</code> tag to the markup.');",
+        "assert($('u').text().indexOf('Ph.D. students') > -1, 'message: The <code>u</code> tag should wrap around the text \"Ph.D. students\".');",
+        "assert($('u').children('div').length === 0, 'message: The <code>u</code> tag should not wrap around the parent <code>div</code> tag.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781a367417b2b2512ab9",
+      "title": "Use the em Tag to Italicize Text",
+      "description": [
+        "To emphasize text, you can use the <code>em</code> tag. This displays text as italicized, as the browser applies the CSS of <code>font-style: italic;</code> to the element.",
+        "<hr>",
+        "Wrap an <code>em</code> tag around the paragraph tag to give it emphasis."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    height: 25px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('em').length == 1, 'message: Your code should add an <code>em</code> tag to the markup.');",
+        "assert($('em').children('p').length == 1, 'message: The <code>em</code> tag should wrap around the <code>p</code> tag and its contents.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781b367417b2b2512aba",
+      "title": "Use the del Tag to Strikethrough Text",
+      "description": [
+        "To strikethrough text, which is when a horizontal line cuts across the characters, you can use the <code>del</code> tag. It shows that a section of text is no longer valid. With the <code>del</code> tag, the browser applies the CSS of <code>text-decoration: line-through;</code> to the element.",
+        "<hr>",
+        "Wrap the <code>del</code> tag around \"Google\" inside the <code>h4</code> tag and then add the word Alphabet beside it, which should not have the strikethrough formatting."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    height: 25px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Google</h4>",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('del').length == 1, 'message: Your code should add one <code>del</code> tag to the markup.');",
+        "assert($('del').text().match(/Google/gi) && !$('del').text().match(/Alphabet/gi), 'message: A <code>del</code> tag should wrap around the Google text in the <code>h4</code> tag. It should not contain the word Alphabet.');",
+        "assert($('h4').html().match(/Alphabet/gi), 'message: Include the word Alphabet in the <code>h4</code> tag, without strikethrough formatting.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781b367417b2b2512abb",
+      "title": "Create a Horizontal Line Using the hr Element",
+      "description": [
+        "You can use the <code>hr</code> tag to add a horizontal line across the width of its containing element. This can be used to define a change in topic or to visually separate groups of content.",
+        "<hr>",
+        "Add an <code>hr</code> tag underneath the <code>h4</code> which contains the card title.",
+        "<strong>Note</strong><br>In HTML, <code>hr</code> is a self-closing tag, and therefore doesn't need a separate closing tag."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    height: 25px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4><del>Google</del>Alphabet</h4>",
+        "      ",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('hr').length == 1, 'message: Your code should add an <code>hr</code> tag to the markup.');",
+        "assert(code.match(/<\\/h4>\\s*?<hr(>|\\s*?\\/>)\\s*?<em>/gi), 'message: The <code>hr</code> tag should come between the title and the paragraph.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781b367417b2b2512abc",
+      "title": "Adjust the background-color Property of Text",
+      "description": [
+        "Instead of adjusting your overall background or the color of the text to make the foreground easily readable, you can add a <code>background-color</code> to the element holding the text you want to emphasize. This challenge uses <code>rgba()</code> instead of <code>hex</code> codes or normal <code>rgb()</code>.",
+        "<blockquote>rgba stands for:<br>  r = red<br>  g = green<br>  b = blue<br>  a = alpha/level of opacity</blockquote>",
+        "The RGB values can range from 0 to 255. The alpha value can range from 1, which is fully opaque or a solid color, to 0, which is fully transparent or clear. <code>rgba()</code> is great to use in this case, as it allows you to adjust the opacity. This means you don't have to completely block out the background.",
+        "You'll use <code>background-color: rgba(45, 45, 45, 0.1)</code> for this challenge. It produces a dark gray color that is nearly transparent given the low opacity value of 0.1.",
+        "<hr>",
+        "To make the text stand out more, adjust the <code>background-color</code> of the <code>h4</code> element to the given <code>rgba()</code> value.",
+        "Also for the <code>h4</code>, remove the <code>height</code> property and add <code>padding</code> of 10px."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    height: 25px;",
+        "    ",
+        "    ",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Alphabet</h4>",
+        "      <hr>",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/background-color:\\s*?rgba\\(\\s*?45\\s*?,\\s*?45\\s*?,\\s*?45\\s*?,\\s*?0?\\.1\\s*?\\)/gi), 'message: Your code should add a <code>background-color</code> property to the <code>h4</code> element set to <code>rgba(45, 45, 45, 0.1)</code>.');",
+        "assert($('h4').css('padding-top') == '10px' && $('h4').css('padding-right') == '10px' && $('h4').css('padding-bottom') == '10px' && $('h4').css('padding-left') == '10px', 'message: Your code should add a <code>padding</code> property to the <code>h4</code> element and set it to 10 pixels.');",
+        "assert(!($('h4').css('height') == '25px'), 'message: The <code>height</code> property on the <code>h4</code> element should be removed.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781b367417b2b2512abd",
+      "title": "Adjust the Size of a Header Versus a Paragraph Tag",
+      "description": [
+        "The font size of header tags (<code>h1</code> through <code>h6</code>) should generally be larger than the font size of paragraph tags. This makes it easier for the user to visually understand the layout and level of importance of everything on the page. You use the <code>font-size</code> property to adjust the size of the text in an element.",
+        "<hr>",
+        "To make the heading significantly larger than the paragraph, change the <code>font-size</code> of the <code>h4</code> tag to 27 pixels."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    background-color: rgba(45, 45, 45, 0.1);",
+        "    padding: 10px;",
+        "    ",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Alphabet</h4>",
+        "      <hr>",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('h4').css('font-size') == '27px', 'message: Your code should add a <code>font-size</code> property to the <code>h4</code> element set to 27 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781b367417b2b2512abe",
+      "title": "Add a box-shadow to a Card-like Element",
+      "description": [
+        "The <code>box-shadow</code> property applies one or more shadows to an element.",
+        "The <code>box-shadow</code> property takes values for <code>offset-x</code> (how far to push the shadow horizontally from the element), <code>offset-y</code> (how far to push the shadow vertically from the element), <code>blur-radius</code>, <code>spread-radius</code> and a color value, in that order. The <code>blur-radius</code> and <code>spread-radius</code> values are optional.",
+        "Here's an example of the CSS to create multiple shadows with some blur, at mostly-transparent black colors:",
+        "<blockquote>box-shadow: 0 10px 20px rgba(0,0,0,0.19), 0 6px 6px rgba(0,0,0,0.23);</blockquote>",
+        "<hr>",
+        "The element now has an id of <code>thumbnail</code>. With this selector, use the example CSS values above to place a <code>box-shadow</code> on the card."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    background-color: rgba(45, 45, 45, 0.1);",
+        "    padding: 10px;",
+        "    font-size: 27px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "  }",
+        "  ",
+        "  ",
+        "  ",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\" id=\"thumbnail\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Alphabet</h4>",
+        "      <hr>",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/#thumbnail\\s*?{\\s*?box-shadow/g), 'message: Your code should add a <code>box-shadow</code> property for the <code>thumbnail</code> id.');",
+        "assert(code.match(/box-shadow:\\s*?0\\s+?10px\\s+?20px\\s+?rgba\\(\\s*?0\\s*?,\\s*?0\\s*?,\\s*?0\\s*?,\\s*?0?\\.19\\),\\s*?0\\s+?6px\\s+?6px\\s+?rgba\\(\\s*?0\\s*?,\\s*?0\\s*?,\\s*?0\\s*?,\\s*?0?\\.23\\)/gi), 'message: You should use the given CSS for the <code>box-shadow</code> value.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781c367417b2b2512abf",
+      "title": "Decrease the Opacity of an Element",
+      "description": [
+        "The <code>opacity</code> property in CSS is used to adjust the opacity, or conversely, the transparency for an item.",
+        "<blockquote>A value of 1 is opaque, which isn't transparent at all.<br>A value of 0.5 is half see-through.<br>A value of 0 is completely transparent.</blockquote>",
+        "The value given will apply to the entire element, whether that's an image with some transparency, or the foreground and background colors for a block of text.",
+        "<hr>",
+        "Set the <code>opacity</code> of the anchor tags to 0.7 using <code>links</code> class to select them."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    background-color: rgba(45, 45, 45, 0.1);",
+        "    padding: 10px;",
+        "    font-size: 27px;",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "    ",
+        "  }",
+        "  #thumbnail {",
+        "    box-shadow: 0 10px 20px rgba(0,0,0,0.19), 0 6px 6px rgba(0,0,0,0.23);",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\" id=\"thumbnail\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Alphabet</h4>",
+        "      <hr>",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert.approximately(parseFloat($('.links').css('opacity')), 0.7, 0.1, 'message: Your code should set the <code>opacity</code> property to 0.7 on the anchor tags by selecting the class of <code>links</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781c367417b2b2512ac0",
+      "title": "Use the text-transform Property to Make Text Uppercase",
+      "description": [
+        "The <code>text-transform</code> property in CSS is used to change the appearance of text. It's a convenient way to make sure text on a webpage appears consistently, without having to change the text content of the actual HTML elements.",
+        "The following table shows how the different <code>text-transform</code>values change the example text \"Transform me\".",
+        "<table class=\"table table-striped\"><thead><th>Value<th>Result<tbody><tr><td><code>lowercase</code><td>\"transform me\"<tr><td><code>uppercase</code><td>\"TRANSFORM ME\"<tr><td><code>capitalize</code><td>\"Transform Me\"<tr><td><code>initial</code><td>Use the default value<tr><td><code>inherit</code><td>Use the <code>text-transform</code> value from the parent element<tr><td><code>none</code><td><strong>Default:</strong> Use the original text</td></table>",
+        "<hr>",
+        "Transform the text of the <code>h4</code> to be uppercase using the <code>text-transform</code> property."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h4 {",
+        "    text-align: center;",
+        "    background-color: rgba(45, 45, 45, 0.1);",
+        "    padding: 10px;",
+        "    font-size: 27px;",
+        "    ",
+        "  }",
+        "  p {",
+        "    text-align: justify;",
+        "  }",
+        "  .links {",
+        "    text-align: left;",
+        "    color: black;",
+        "    opacity: 0.7;",
+        "  }",
+        "  #thumbnail {",
+        "    box-shadow: 0 10px 20px rgba(0,0,0,0.19), 0 6px 6px rgba(0,0,0,0.23);",
+        "  }",
+        "  .fullCard {",
+        "    width: 245px;",
+        "    border: 1px solid #ccc;",
+        "    border-radius: 5px;",
+        "    margin: 10px 5px;",
+        "    padding: 4px;",
+        "  }",
+        "  .cardContent {",
+        "    padding: 10px;",
+        "  }",
+        "  .cardText {",
+        "    margin-bottom: 30px;",
+        "  }",
+        "</style>",
+        "<div class=\"fullCard\" id=\"thumbnail\">",
+        "  <div class=\"cardContent\">",
+        "    <div class=\"cardText\">",
+        "      <h4>Alphabet</h4>",
+        "      <hr>",
+        "      <em><p>Google was founded by Larry Page and Sergey Brin while they were <u>Ph.D. students</u> at <strong>Stanford University</strong>.</p></em>",
+        "    </div>",
+        "    <div class=\"cardLinks\">",
+        "      <a href=\"https://en.wikipedia.org/wiki/Larry_Page\" target=\"_blank\" class=\"links\">Larry Page</a><br><br>",
+        "      <a href=\"https://en.wikipedia.org/wiki/Sergey_Brin\" target=\"_blank\" class=\"links\">Sergey Brin</a>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('h4').css('text-transform') === 'uppercase', 'message: The <code>h4</code> text should be uppercase.');",
+        "assert(($('h4').text() !== $('h4').text().toUpperCase()), 'message: The original text of the h4 should not be changed.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781c367417b2b2512ac2",
+      "title": "Set the font-size for Multiple Heading Elements",
+      "description": [
+        "The <code>font-size</code> property is used to specify how large the text is in a given element. This rule can be used for multiple elements to create visual consistency of text on a page. In this challenge, you'll set the values for all <code>h1</code> through <code>h6</code> tags to balance the heading sizes.",
+        "<hr>",
+        "<ul><li>Set the <code>font-size</code> of the <code>h1</code> tag to 68px.</li><li>Set the <code>font-size</code> of the <code>h2</code> tag to 52px.</li><li>Set the <code>font-size</code> of the <code>h3</code> tag to 40px.</li><li>Set the <code>font-size</code> of the <code>h4</code> tag to 32px.</li><li>Set the <code>font-size</code> of the <code>h5</code> tag to 21px.</li><li>Set the <code>font-size</code> of the <code>h6</code> tag to 14px.</li></ul>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  ",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "<h1>This is h1 text</h1>",
+        "<h2>This is h2 text</h2>",
+        "<h3>This is h3 text</h3>",
+        "<h4>This is h4 text</h4>",
+        "<h5>This is h5 text</h5>",
+        "<h6>This is h6 text</h6>"
+      ],
+      "tests": [
+        "assert($('h1').css('font-size') == '68px', 'message: Your code should set the <code>font-size</code> property for the <code>h1</code> tag to 68 pixels.');",
+        "assert($('h2').css('font-size') == '52px', 'message: Your code should set the <code>font-size</code> property for the <code>h2</code> tag to 52 pixels.');",
+        "assert($('h3').css('font-size') == '40px', 'message: Your code should set the <code>font-size</code> property for the <code>h3</code> tag to 40 pixels.');",
+        "assert($('h4').css('font-size') == '32px', 'message: Your code should set the <code>font-size</code> property for the <code>h4</code> tag to 32 pixels.');",
+        "assert($('h5').css('font-size') == '21px', 'message: Your code should set the <code>font-size</code> property for the <code>h5</code> tag to 21 pixels.');",
+        "assert($('h6').css('font-size') == '14px', 'message: Your code should set the <code>font-size</code> property for the <code>h6</code> tag to 14 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781c367417b2b2512ac3",
+      "title": "Set the font-weight for Multiple Heading Elements",
+      "description": [
+        "You set the <code>font-size</code> of each heading tag in the last challenge, here you'll adjust the <code>font-weight</code>.",
+        "The <code>font-weight</code> property sets how thick or thin characters are in a section of text.",
+        "<hr>",
+        "<ul><li>Set the <code>font-weight</code> of the <code>h1</code> tag to 800.</li><li>Set the <code>font-weight</code> of the <code>h2</code> tag to 600.</li><li>Set the <code>font-weight</code> of the <code>h3</code> tag to 500.</li><li>Set the <code>font-weight</code> of the <code>h4</code> tag to 400.</li><li>Set the <code>font-weight</code> of the <code>h5</code> tag to 300.</li><li>Set the <code>font-weight</code> of the <code>h6</code> tag to 200.</li></ul>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h1 {",
+        "    font-size: 68px;",
+        "    ",
+        "  }",
+        "  h2 {",
+        "    font-size: 52px;",
+        "    ",
+        "  }",
+        "  h3 {",
+        "    font-size: 40px;",
+        "    ",
+        "  }",
+        "  h4 {",
+        "    font-size: 32px;",
+        "    ",
+        "  }",
+        "  h5 {",
+        "    font-size: 21px;",
+        "    ",
+        "  }",
+        "  h6 {",
+        "    font-size: 14px;",
+        "    ",
+        "  }",
+        "</style>",
+        "<h1>This is h1 text</h1>",
+        "<h2>This is h2 text</h2>",
+        "<h3>This is h3 text</h3>",
+        "<h4>This is h4 text</h4>",
+        "<h5>This is h5 text</h5>",
+        "<h6>This is h6 text</h6>"
+      ],
+      "tests": [
+        "assert($('h1').css('font-weight') == '800', 'message: Your code should set the <code>font-weight</code> property for the <code>h1</code> tag to 800.');",
+        "assert($('h2').css('font-weight') == '600', 'message: Your code should set the <code>font-weight</code> property for the <code>h2</code> tag to 600.');",
+        "assert($('h3').css('font-weight') == '500', 'message: Your code should set the <code>font-weight</code> property for the <code>h3</code> tag to 500.');",
+        "assert($('h4').css('font-weight') == '400', 'message: Your code should set the <code>font-weight</code> property for the <code>h4</code> tag to 400.');",
+        "assert($('h5').css('font-weight') == '300', 'message: Your code should set the <code>font-weight</code> property for the <code>h5</code> tag to 300.');",
+        "assert($('h6').css('font-weight') == '200', 'message: Your code should set the <code>font-weight</code> property for the <code>h6</code> tag to 200.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781c367417b2b2512ac4",
+      "title": "Set the font-size of Paragraph Text",
+      "description": [
+        "The <code>font-size</code> property in CSS is not limited to headings, it can be applied to any element containing text.",
+        "<hr>",
+        "Change the value of the <code>font-size</code> property for the paragraph to 16px to make it more visible."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  p {",
+        "    font-size: 10px;",
+        "  }",
+        "</style>",
+        "<p>",
+        "  Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur.",
+        "</p>"
+      ],
+      "tests": [
+        "assert($('p').css('font-size') == '16px', 'message: Your <code>p</code> tag should have a <code>font-size</code> of 16 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781d367417b2b2512ac5",
+      "title": "Set the line-height of Paragraphs",
+      "description": [
+        "CSS offers the <code>line-height</code> property to change the height of each line in a block of text. As the name suggests, it changes the amount of vertical space that each line of text gets.",
+        "<hr>",
+        "Add a <code>line-height</code> property to the <code>p</code> tag and set it to 25px."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  p {",
+        "    font-size: 16px;",
+        "    ",
+        "  }",
+        "</style>",
+        "<p>",
+        "  Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur.",
+        "</p>"
+      ],
+      "tests": [
+        "assert($('p').css('line-height') == '25px', 'message: Your code should set the <code>line-height</code> of the <code>p</code> tag to 25 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781d367417b2b2512ac8",
+      "title": "Adjust the Hover State of an Anchor Tag",
+      "description": [
+        "This challenge will touch on the usage of pseudo-classes. A pseudo-class is a keyword that can be added to selectors, in order to select a specific state of the element.",
+        "For example, the styling of an anchor tag can be changed for its hover state using the <code>:hover</code> pseudo-class selector. Here's the CSS to change the <code>color</code> of the anchor tag to red during its hover state:",
+        "<blockquote>a:hover {<br>  color: red;<br>}</blockquote>",
+        "<hr>",
+        "The code editor has a CSS rule to style all <code>a</code> tags black. Add a rule so that when the user hovers over the <code>a</code> tag, the <code>color</code> is blue."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  a {",
+        "    color: #000;",
+        "  }",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "<a href=\"http://freecatphotoapp.com/\" target=\"_blank\">CatPhotoApp</a>"
+      ],
+      "tests": [
+        "assert($('a').css('color') == 'rgb(0, 0, 0)', 'message: The anchor tag <code>color</code> should remain black, only add CSS rules for the <code>:hover</code> state.');",
+        "assert(code.match(/a:hover\\s*?{\\s*?color:\\s*?blue;\\s*?}/gi), 'message: The anchor tag should have a <code>color</code> of blue on hover.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781e367417b2b2512ac9",
+      "title": "Change an Element's Relative Position",
+      "description": [
+        "CSS treats each HTML element as its own box, which is usually referred to as the <code>CSS Box Model</code>. Block-level items automatically start on a new line (think headings, paragraphs, and divs) while inline items sit within surrounding content (like images or spans). The default layout of elements in this way is called the <code>normal flow</code> of a document, but CSS offers the position property to override it.",
+        "When the position of an element is set to <code>relative</code>, it allows you to specify how CSS should move it <i>relative</i> to its current position in the normal flow of the page. It pairs with the CSS offset properties of <code>left</code> or <code>right</code>, and <code>top</code> or <code>bottom</code>. These say how many pixels, percentages, or ems to move the item <i>away</i> from where it is normally positioned. The following example moves the paragraph 10 pixels away from the bottom:",
+        "<blockquote>p {<br>  position: relative;<br>  bottom: 10px;<br>}</blockquote>",
+        "Changing an element's position to relative does not remove it from the normal flow - other elements around it still behave as if that item were in its default position.",
+        "<strong>Note</strong><br>Positioning gives you a lot of flexibility and power over the visual layout of a page. It's good to remember that no matter the position of elements, the underlying HTML markup should be organized and make sense when read from top to bottom. This is how users with visual impairments (who rely on assistive devices like screen readers) access your content.",
+        "<hr>",
+        "Change the <code>position</code> of the <code>h2</code> to <code>relative</code>, and use a CSS offset to move it 15 pixels away from the <code>top</code> of where it sits in the normal flow. Notice there is no impact on the positions of the surrounding h1 and p elements."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h2 {",
+        "    ",
+        "    ",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <h1>On Being Well-Positioned</h1>",
+        "  <h2>Move me!</h2>",
+        "  <p>I still think the h2 is where it normally sits.</p>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').css('position') == 'relative', 'message: The <code>h2</code> element should have a <code>position</code> property set to <code>relative</code>.');",
+        "assert($('h2').css('top') == '15px', 'message: Your code should use a CSS offset to relatively position the <code>h2</code> 15px away from the <code>top</code> of where it normally sits.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781e367417b2b2512aca",
+      "title": "Move a Relatively Positioned Element with CSS Offsets",
+      "description": [
+        "The CSS offsets of <code>top</code> or <code>bottom</code>, and <code>left</code> or <code>right</code> tell the browser how far to offset an item relative to where it would sit in the normal flow of the document. This can be slightly confusing, because you're offsetting an element away from a given spot, which effectively moves it towards the opposite direction. As you saw in the last challenge, using the top offset moved the h2 downwards. Likewise, using a left offset effectively moves an item to the right.",
+        "<hr>",
+        "Use CSS offsets to move the <code>h2</code> 15 pixels to the right and 10 pixels up."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "<style>",
+        "  h2 {",
+        "    position: relative;",
+        "    ",
+        "    ",
+        "  }",
+        "</style>",
+        "</head>",
+        "<body>",
+        "  <h1>On Being Well-Positioned</h1>",
+        "  <h2>Move me!</h2>",
+        "  <p>I still think the h2 is where it normally sits.</p>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').css('bottom') == '10px', 'message: Your code should use a CSS offset to relatively position the <code>h2</code> 10px upwards. In other words, move it 10px away from the <code>bottom</code> of where it normally sits.');",
+        "assert($('h2').css('left') == '15px', 'message: Your code should use a CSS offset to relatively position the <code>h2</code> 15px towards the right. In other words, move it 15px away from the <code>left</code> of where it normally sits.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781e367417b2b2512acb",
+      "title": "Lock an Element to its Parent with Absolute Positioning",
+      "description": [
+        "The next option for the CSS <code>position</code> property is <code>absolute</code>, which locks the element in place relative to its parent container. Unlike the <code>relative</code> position, this removes the element from the normal flow of the document, so surrounding items ignore it. The CSS offset properties (top or bottom and left or right) are used to adjust the position.",
+        "One nuance with absolute positioning is that it will be locked relative to its closest <em>positioned</em> ancestor. If you forget to add a position rule to the parent item, (this is typically done using <code>position: relative;</code>), the browser will keep looking up the chain and ultimately default to the body tag.",
+        "<hr>",
+        "Lock the <code>#searchbar</code> element to the top-right of its <code>section</code> parent by declaring its <code>position</code> as <code>absolute</code>. Give it <code>top</code> and <code>right</code> offsets of 0 pixels each."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #searchbar {",
+        "    ",
+        "    ",
+        "    ",
+        "  }",
+        "  section {",
+        "    position: relative;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <h1>Welcome!</h1>",
+        "  <section>",
+        "    <form id=\"searchbar\">",
+        "      <label for=\"search\">Search:</label>",
+        "      <input type=\"search\" id=\"search\" name=\"search\">",
+        "      <input type=\"submit\" name=\"submit\" value=\"Go!\">",
+        "    </form>",
+        "  </section>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('#searchbar').css('position') == 'absolute', 'message: The <code>#searchbar</code> element should have a <code>position</code> set to <code>absolute</code>.');",
+        "assert($('#searchbar').css('top') == '0px', 'message: Your code should use the <code>top</code> CSS offset of 0 pixels on the <code>#searchbar</code> element.');",
+        "assert($('#searchbar').css('right') == '0px', 'message: Your code should use the <code>right</code> CSS offset of 0 pixels on the <code>#searchbar</code> element.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d781e367417b2b2512acc",
+      "title": "Lock an Element to the Browser Window with Fixed Positioning",
+      "description": [
+        "The next layout scheme that CSS offers is the <code>fixed</code> position, which is a type of absolute positioning that locks an element relative to the browser window. Similar to absolute positioning, it's used with the CSS offset properties and also removes the element from the normal flow of the document. Other items no longer \"realize\" where it is positioned, which may require some layout adjustments elsewhere.",
+        "One key difference from the <code>absolute</code> position is that the element won't move when the user scrolls.",
+        "<hr>",
+        "The navigation bar in the code is labeled with an id of <code>navbar</code>. Change its <code>position</code> to <code>fixed</code>, and offset it 0 pixels from the <code>top</code> and 0 pixels from the <code>left</code>. Notice the (lack of) impact to the <code>h1</code> position, it hasn't been pushed down to accommodate the navigation bar and would need to be adjusted separately."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #navbar {",
+        "    ",
+        "    ",
+        "    ",
+        "    width: 100%;",
+        "    background-color: #767676;",
+        "  }",
+        "  nav ul {",
+        "    margin: 0px;",
+        "    padding: 5px 0px 5px 30px;",
+        "  }",
+        "  nav li {",
+        "    display: inline;",
+        "    margin-right: 20px;",
+        "  }",
+        "  a {",
+        "    text-decoration: none;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <header>",
+        "    <h1>Welcome!</h1>",
+        "    <nav id=\"navbar\">",
+        "      <ul>",
+        "        <li><a href=\"\">Home</a></li>",
+        "        <li><a href=\"\">Contact</a></li>",
+        "      </ul>",
+        "    </nav>",
+        "  </header>",
+        "  <p>I shift up when the #navbar is fixed to the browser window.</p>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('#navbar').css('position') == 'fixed', 'message: The <code>#navbar</code> element should have a <code>position</code> set to <code>fixed</code>.');",
+        "assert($('#navbar').css('top') == '0px', 'message: Your code should use the <code>top</code> CSS offset of 0 pixels on the <code>#navbar</code> element.');",
+        "assert($('#navbar').css('left') == '0px', 'message: Your code should use the <code>left</code> CSS offset of 0 pixels on the <code>#navbar</code> element.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a3367417b2b2512ace",
+      "title": "Push Elements Left or Right with the float Property",
+      "description": [
+        "The next positioning tool does not actually use <code>position</code>, but sets the <code>float</code> property of an element. Floating elements are removed from the normal flow of a document and pushed to either the <code>left</code> or <code>right</code> of their containing parent element. It's commonly used with the <code>width</code> property to specify how much horizontal space the floated element requires.",
+        "<hr>",
+        "The given markup would work well as a two-column layout, with the <code>section</code> and <code>aside</code> elements next to each other. Give the <code>#left</code> item a <code>float</code> of <code>left</code> and the <code>#right</code> item a <code>float</code> of <code>right</code>."
+      ],
+      "challengeSeed": [
+        "<head>",
+        "  <style>",
+        "  #left {",
+        "    ",
+        "    width: 50%;",
+        "  }",
+        "  #right {",
+        "    ",
+        "    width: 40%;",
+        "  }",
+        "  aside, section {",
+        "    padding: 2px;",
+        "    background-color: #ccc;",
+        "  }",
+        "  </style>",
+        "</head>",
+        "<body>",
+        "  <header>",
+        "    <h1>Welcome!</h1>",
+        "  </header>",
+        "  <section id=\"left\">",
+        "    <h2>Content</h2>",
+        "    <p>Good stuff</p>",
+        "  </section>",
+        "  <aside id=\"right\">",
+        "    <h2>Sidebar</h2>",
+        "    <p>Links</p>",
+        "  </aside>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('#left').css('float') == 'left', 'message: The element with id <code>left</code> should have a <code>float</code> value of <code>left</code>.');",
+        "assert($('#right').css('float') == 'right', 'message: The element with id <code>right</code> should have a <code>float</code> value of <code>right</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a3367417b2b2512acf",
+      "title": "Change the Position of Overlapping Elements with the z-index Property",
+      "description": [
+        "When elements are positioned to overlap, the element coming later in the HTML markup will, by default, appear on the top of the other elements. However, the <code>z-index</code> property can specify the order of how elements are stacked on top of one another. It must be an integer (i.e. a whole number and not a decimal), and higher values for the <code>z-index</code> property of an element move it higher in the stack than those with lower values.",
+        "<hr>",
+        "Add a <code>z-index</code> property to the element with the class name of <code>first</code> (the red rectangle) and set it to a value of 2 so it covers the other element (blue rectangle)."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div {",
+        "    width: 60%;",
+        "    height: 200px;",
+        "    margin-top: 20px;",
+        "  }",
+        "  ",
+        "  .first {",
+        "    background-color: red;",
+        "    position: absolute;",
+        "    ",
+        "  }",
+        "  .second {",
+        "    background-color: blue;",
+        "    position: absolute;",
+        "    left: 40px;",
+        "    top: 50px;",
+        "    z-index: 1;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"first\"></div>",
+        "<div class=\"second\"></div>"
+      ],
+      "tests": [
+        "assert($('.first').css('z-index') == '2', 'message: The element with class <code>first</code> should have a <code>z-index</code> value of 2.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a3367417b2b2512ad0",
+      "title": "Center an Element Horizontally Using the margin Property",
+      "description": [
+        "Another positioning technique is to center a block element horizontally. One way to do this is to set its <code>margin</code> to a value of auto.",
+        "This method works for images, too. Images are inline elements by default, but can be changed to block elements when you set the <code>display</code> property to block.",
+        "<hr>",
+        "Center the <code>div</code> on the page by adding a <code>margin</code> property with a value of auto."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div {",
+        "    background-color: blue;",
+        "    height: 100px;",
+        "    width: 100px;",
+        "    ",
+        "  }",
+        "</style>",
+        "<div></div>"
+      ],
+      "tests": [
+        "assert(code.match(/margin:\\s*?auto;/g), 'message: The <code>div</code> should have a <code>margin</code> set to auto.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a3367417b2b2512ad1",
+      "title": "Learn about Complementary Colors",
+      "description": [
+        "Color theory and its impact on design is a deep topic and only the basics are covered in the following challenges. On a website, color can draw attention to content, evoke emotions, or create visual harmony. Using different combinations of colors can really change the look of a website, and a lot of thought can go into picking a color palette that works with your content.",
+        "The color wheel is a useful tool to visualize how colors relate to each other - it's a circle where similar hues are neighbors and different hues are farther apart. When two colors are opposite each other on the wheel, they are called complementary colors. They have the characteristic that if they are combined, they \"cancel\" each other out and create a gray color. However, when placed side-by-side, these colors appear more vibrant and produce a strong visual contrast.",
+        "Some examples of complementary colors with their hex codes are:",
+        "<blockquote>red (#FF0000) and cyan (#00FFFF)<br>green (#00FF00) and magenta (#FF00FF)<br>blue (#0000FF) and yellow (#FFFF00)</blockquote>",
+        "There are many color picking tools available online that have an option to find the complement of a color.",
+        "<strong>Note</strong><br>For all color challenges: Using color can be a powerful way to add visual interest to a page. However, color alone should not be used as the only way to convey important information because users with visual impairments may not understand that content. This issue will be covered in more detail in the Applied Accessibility challenges.",
+        "<hr>",
+        "Change the <code>background-color</code> property of the <code>blue</code> and <code>yellow</code> classes to their respective colors. Notice how the colors look different next to each other than they do compared against the white background."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: #FFFFFF;",
+        "  }",
+        "  .blue {",
+        "    background-color: #000000;",
+        "  }",
+        "  .yellow {",
+        "    background-color: #000000;",
+        "  }",
+        "  div {",
+        "    display: inline-block;",
+        "    height: 100px;",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "<div class=\"blue\"></div>",
+        "<div class=\"yellow\"></div>"
+      ],
+      "tests": [
+        "assert($('.blue').css('background-color') == 'rgb(0, 0, 255)', 'message: The <code>div</code> element with class <code>blue</code> should have a <code>background-color</code> of blue.');",
+        "assert($('.yellow').css('background-color') == 'rgb(255, 255, 0)', 'message: The <code>div</code> element with class <code>yellow</code> should have a <code>background-color</code> of yellow.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a4367417b2b2512ad2",
+      "title": "Learn about Tertiary Colors",
+      "description": [
+        "Computer monitors and device screens create different colors by combining amounts of red, green, and blue light. This is known as the RGB additive color model in modern color theory. Red (R), green (G), and blue (B) are called primary colors. Mixing two primary colors creates the secondary colors cyan (G + B), magenta (R + B) and yellow (R + G). You saw these colors in the Complementary Colors challenge. These secondary colors happen to be the complement to the primary color not used in their creation, and are opposite to that primary color on the color wheel. For example, magenta is made with red and blue, and is the complement to green.",
+        "Tertiary colors are the result of combining a primary color with one of its secondary color neighbors. For example, red (primary) and yellow (secondary) make orange. This adds six more colors to a simple color wheel for a total of twelve.",
+        "There are various methods of selecting different colors that result in a harmonious combination in design. One example that can use tertiary colors is called the split-complementary color scheme. This scheme starts with a base color, then pairs it with the two colors that are adjacent to its complement. The three colors provide strong visual contrast in a design, but are more subtle than using two complementary colors.",
+        "Here are three colors created using the split-complement scheme:",
+        "<table class=\"table table-striped\"><thead><tr><th>Color</th><th>Hex Code</th></tr><thead><tbody><tr><td>orange</td><td>#FF7D00</td></tr><tr><td>cyan</td><td>#00FFFF</td></tr><tr><td>raspberry</td><td>#FF007D</td></tr></tbody></table>",
+        "<hr>",
+        "Change the <code>background-color</code> property of the <code>orange</code>, <code>cyan</code>, and <code>raspberry</code> classes to their respective colors. Make sure to use the hex codes as orange and raspberry are not browser-recognized color names."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: #FFFFFF;",
+        "  }",
+        "  ",
+        "  .orange {",
+        "    background-color: #000000;",
+        "  }",
+        "  ",
+        "  .cyan {",
+        "    background-color: #000000;",
+        "  }",
+        "  ",
+        "  .raspberry {",
+        "    background-color: #000000;",
+        "  }",
+        "  ",
+        "  div {",
+        "    height: 100px;",
+        "    width: 100px;",
+        "    margin-bottom: 5px;",
+        "  }",
+        "</style>",
+        "  ",
+        "<div class=\"orange\"></div>",
+        "<div class=\"cyan\"></div>",
+        "<div class=\"raspberry\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/.orange\\s*\\{\\s*background-color:\\s*(#FF7D00|#ff7d00);?\\s*\\}/g), 'message: The <code>div</code> element with class <code>orange</code> should have a <code>background-color</code> of orange.');",
+        "assert(code.match(/.cyan\\s*\\{\\s*background-color:\\s*(#00FFFF|#00ffff);?\\s*\\}/g), 'message: The <code>div</code> element with class <code>cyan</code> should have a <code>background-color</code> of cyan.');",
+        "assert(code.match(/.raspberry\\s*\\{\\s*background-color:\\s*(#FF007D|#ff007d);?\\s*\\}/g), 'message: The <code>div</code> element with class <code>raspberry</code> should have a <code>background-color</code> of raspberry.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a4367417b2b2512ad3",
+      "title": "Adjust the Color of Various Elements to Complementary Colors",
+      "description": [
+        "The Complementary Colors challenge showed that opposite colors on the color wheel can make each other appear more vibrant when placed side-by-side. However, the strong visual contrast can be jarring if it's overused on a website, and can sometimes make text harder to read if it's placed on a complementary-colored background. In practice, one of the colors is usually dominant and the complement is used to bring visual attention to certain content on the page.",
+        "<hr>",
+        "This page will use a shade of teal (<code>#09A7A1</code>) as the dominant color, and its orange (<code>#FF790E</code>) complement to visually highlight the sign-up buttons. Change the <code>background-color</code> of both the <code>header</code> and <code>footer</code> from black to the teal color. Then change the <code>h2</code> text <code>color</code> to teal as well. Finally, change the <code>background-color</code> of the <code>button</code> to the orange color."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: white;",
+        "  }",
+        "  header {",
+        "    background-color: black;",
+        "    color: white;",
+        "    padding: 0.25em;",
+        "  }",
+        "  h2 {",
+        "    color: black;",
+        "  }  ",
+        "  button {",
+        "    background-color: white;",
+        "  }",
+        "  footer {",
+        "    background-color: black;",
+        "    color: white;",
+        "    padding: 0.5em;",
+        "  }",
+        "</style>",
+        "<header>",
+        "  <h1>Cooking with FCC!</h1>",
+        "</header>",
+        "<main>",
+        "  <article>",
+        "    <h2>Machine Learning in the Kitchen</h2>",
+        "    <p>Join this two day workshop that walks through how to implement cutting-edge snack-getting algorithms with a command line interface. Coding usually involves writing exact instructions, but sometimes you need your computer to execute flexible commands, like <code>fetch Pringles</code>.</p>",
+        "    <button>Sign Up</button>",
+        "  </article>",
+        "  <article>",
+        "    <h2>Bisection Vegetable Chopping</h2>",
+        "    <p>This week-long retreat will level-up your coding ninja skills to actual ninja skills. No longer is the humble bisection search limited to sorted arrays or coding interview questions, applying its concepts in the kitchen will have you chopping carrots in O(log n) time before you know it.</p>",
+        "    <button>Sign Up</button>",
+        "  </article>",
+        "</main>",
+        "<br>",
+        "<footer>&copy;2016 FCC Kitchen</footer>"
+      ],
+      "tests": [
+        "assert($('header').css('background-color') == 'rgb(9, 167, 161)', 'message: The <code>header</code> element should have a <code>background-color</code> of #09A7A1.');",
+        "assert($('footer').css('background-color') == 'rgb(9, 167, 161)', 'message: The <code>footer</code> element should have a <code>background-color</code> of #09A7A1.');",
+        "assert($('h2').css('color') == 'rgb(9, 167, 161)', 'message: The <code>h2</code> element should have a <code>color</code> of #09A7A1.');",
+        "assert($('button').css('background-color') == 'rgb(255, 121, 14)', 'message: The <code>button</code> element should have a <code>background-color</code> of #FF790E.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a4367417b2b2512ad4",
+      "title": "Adjust the Hue of a Color",
+      "description": [
+        "Colors have several characteristics including hue, saturation, and lightness. CSS3 introduced the <code>hsl()</code> property as an alternative way to pick a color by directly stating these characteristics.",
+        "<b>Hue</b> is what people generally think of as 'color'. If you picture a spectrum of colors starting with red on the left, moving through green in the middle, and blue on right, the hue is where a color fits along this line. In <code>hsl()</code>, hue uses a color wheel concept instead of the spectrum, where the angle of the color on the circle is given as a value between 0 and 360.",
+        "<b>Saturation</b> is the amount of gray in a color. A fully saturated color has no gray in it, and a minimally saturated color is almost completely gray. This is given as a percentage with 100% being fully saturated.",
+        "<b>Lightness</b> is the amount of white or black in a color. A percentage is given ranging from 0% (black) to 100% (white), where 50% is the normal color.",
+        "Here are a few examples of using <code>hsl()</code> with fully-saturated, normal lightness colors:",
+        "<table class=\"table table-striped\"><thead><tr><th>Color</th><th>HSL</th></tr></thead><tbody><tr><td>red</td><td>hsl(0, 100%, 50%)</td></tr><tr><td>yellow</td><td>hsl(60, 100%, 50%)</td></tr><tr><td>green</td><td>hsl(120, 100%, 50%)</td></tr><tr><td>cyan</td><td>hsl(180, 100%, 50%)</td></tr><tr><td>blue</td><td>hsl(240, 100%, 50%)</td></tr><tr><td>magenta</td><td>hsl(300, 100%, 50%)</td></tr></tbody></table>",
+        "<hr>",
+        "Change the <code>background-color</code> of each <code>div</code> element based on the class names (<code>green</code>, <code>cyan</code>, or <code>blue</code>) using <code>hsl()</code>. All three should have full saturation and normal lightness."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: #FFFFFF;",
+        "  }",
+        "  ",
+        "  .green {",
+        "    background-color: #000000;",
+        "  }",
+        "  ",
+        "  .cyan {",
+        "    background-color: #000000;",
+        "  }",
+        "  ",
+        "  .blue {",
+        "    background-color: #000000;",
+        "  }",
+        "  ",
+        "  div {",
+        "    display: inline-block;",
+        "    height: 100px;",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "  ",
+        "<div class=\"green\"></div>",
+        "<div class=\"cyan\"></div>",
+        "<div class=\"blue\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/\\.green\\s*?{\\s*?background-color:\\s*?hsl/gi), 'message: Your code should use the <code>hsl()</code> property to declare the color green.');",
+        "assert(code.match(/\\.cyan\\s*?{\\s*?background-color:\\s*?hsl/gi), 'message: Your code should use the <code>hsl()</code> property to declare the color cyan.');",
+        "assert(code.match(/\\.blue\\s*?{\\s*?background-color:\\s*?hsl/gi), 'message: Your code should use the <code>hsl()</code> property to declare the color blue.');",
+        "assert($('.green').css('background-color') == 'rgb(0, 255, 0)', 'message: The <code>div</code> element with class <code>green</code> should have a <code>background-color</code> of green.');",
+        "assert($('.cyan').css('background-color') == 'rgb(0, 255, 255)', 'message: The <code>div</code> element with class <code>cyan</code> should have a <code>background-color</code> of cyan.');",
+        "assert($('.blue').css('background-color') == 'rgb(0, 0, 255)', 'message: The <code>div</code> element with class <code>blue</code> should have a <code>background-color</code> of blue.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a4367417b2b2512ad5",
+      "title": "Adjust the Tone of a Color",
+      "description": [
+        "The <code>hsl()</code> option in CSS also makes it easy to adjust the tone of a color. Mixing white with a pure hue creates a tint of that color, and adding black will make a shade. Alternatively, a tone is produced by adding gray or by both tinting and shading. Recall that the 's' and 'l' of <code>hsl()</code> stand for saturation and lightness, respectively. The saturation percent changes the amount of gray and the lightness percent determines how much white or black is in the color. This is useful when you have a base hue you like, but need different variations of it.",
+        "<hr>",
+        "The navigation bar on this site currently inherits its <code>background-color</code> from the <code>header</code> element. Starting with that color as a base, add a <code>background-color</code> to the <code>nav</code> element so it uses the same cyan hue, but has 80% saturation and 25% lightness values to change its tone and shade."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  header {",
+        "    background-color: hsl(180, 90%, 35%);",
+        "    color: #FFFFFF;",
+        "  }",
+        "  ",
+        "  nav {",
+        "  ",
+        "  }",
+        "  ",
+        "  h1 {",
+        "    text-indent: 10px;",
+        "    padding-top: 10px;",
+        "  }",
+        "  ",
+        "  nav ul {",
+        "    margin: 0px;",
+        "    padding: 5px 0px 5px 30px;",
+        "  }",
+        "  ",
+        "  nav li {",
+        "    display: inline;",
+        "    margin-right: 20px;",
+        "  }",
+        "  ",
+        "  a {",
+        "    text-decoration: none;",
+        "    color: inherit;",
+        "  }",
+        "</style>",
+        "  ",
+        "<header>",
+        "  <h1>Cooking with FCC!</h1>",
+        "  <nav>",
+        "    <ul>",
+        "      <li><a href=\"\">Home</a></li>",
+        "      <li><a href=\"\">Classes</a></li>",
+        "      <li><a href=\"\">Contact</a></li>",
+        "    </ul>",
+        "  </nav>",
+        "</header>"
+      ],
+      "tests": [
+        "assert(code.match(/nav\\s*?{\\s*?background-color:\\s*?hsl\\(180,\\s*?80%,\\s*?25%\\)/gi), 'message: The <code>nav</code> element should have a <code>background-color</code> of the adjusted cyan tone using the <code>hsl()</code> property.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a5367417b2b2512ad6",
+      "title": "Create a Gradual CSS Linear Gradient",
+      "description": [
+        "Applying a color on HTML elements is not limited to one flat hue. CSS provides the ability to use color transitions, otherwise known as gradients, on elements. This is accessed through the <code>background</code> property's <code>linear-gradient()</code> function. Here is the general syntax:",
+        "<code>background: linear-gradient(gradient_direction, color 1, color 2, color 3, ...);</code>",
+        "The first argument specifies the direction from which color transition starts - it can be stated as a degree, where 90deg makes a vertical gradient and 45deg is angled like a backslash. The following arguments specify the order of colors used in the gradient.",
+        "Example:",
+        "<code>background: linear-gradient(90deg, red, yellow, rgb(204, 204, 255));</code>",
+        "<hr>",
+        "Use a <code>linear-gradient()</code> for the <code>div</code> element's <code>background</code>, and set it from a direction of 35 degrees to change the color from <code>#CCFFFF</code> to <code>#FFCCCC</code>.",
+        "<strong>Note</strong><br>While there are other ways to specify a color value, like <code>rgb()</code> or <code>hsl()</code>, use hex values for this challenge."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "  div{ ",
+        "    border-radius: 20px;",
+        "    width: 70%;",
+        "    height: 400px;",
+        "    margin: 50px auto;",
+        "    ",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div></div>"
+      ],
+      "tests": [
+        "assert(code.match(/background:\\s*?linear-gradient\\(35deg,\\s*?(#CCFFFF|#CFF),\\s*?(#FFCCCC|#FCC)\\);/gi), 'message: The <code>div</code> element should have a <code>linear-gradient</code> <code>background</code> with the specified direction and colors.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a5367417b2b2512ad7",
+      "title": "Use a CSS Linear Gradient to Create a Striped Element",
+      "description": [
+        "The <code>repeating-linear-gradient()</code> function is very similar to <code>linear-gradient()</code> with the major difference that it repeats the specified gradient pattern. <code>repeating-linear-gradient()</code> accepts a variety of values, but for simplicity, you'll work with an angle value and color stop values in this challenge.",
+        "The angle value is the direction of the gradient. Color stops are like width values that mark where a transition takes place, and are given with a percentage or a number of pixels.",
+        "In the example demonstrated in the code editor, the gradient starts with the color <code>yellow</code> at 0 pixels which blends into the second color <code>blue</code> at 40 pixels away from the start. Since the next color stop is also at 40 pixels, the gradient immediately changes to the third color <code>green</code>, which itself blends into the fourth color value <code>red</code> as that is 80 pixels away from the beginning of the gradient.",
+        "For this example, it helps to think about the color stops as pairs where every two colors blend together.",
+        "<code>0px [yellow -- blend -- blue] 40px [green -- blend -- red] 80px</code>",
+        "If every two color stop values are the same color, the blending isn't noticeable because it's between the same color, followed by a hard transition to the next color, so you end up with stripes.",
+        "<hr>",
+        "Make stripes by changing the <code>repeating-linear-gradient()</code> to use a gradient angle of <code>45deg</code>, then set the first two color stops to <code>yellow</code>, and finally the second two color stops to <code>black</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "  div{ ",
+        "    border-radius: 20px;",
+        "    width: 70%;",
+        "    height: 400px;",
+        "    margin:  50 auto;",
+        "    background: repeating-linear-gradient(",
+        "      90deg,",
+        "      yellow 0px,",
+        "      blue 40px,",
+        "      green 40px,",
+        "      red 80px",
+        "    );",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div></div>"
+      ],
+      "tests": [
+        "assert(code.match(/background:\\s*?repeating-linear-gradient\\(\\s*?45deg/gi), 'message: The angle of the <code>repeating-linear-gradient()</code> should be 45deg.');",
+        "assert(!code.match(/90deg/gi), 'message: The angle of the <code>repeating-linear-gradient()</code> should no longer be 90deg');",
+        "assert(code.match(/yellow\\s+?0px/gi), 'message: The color stop at 0 pixels should be <code>yellow</code>.');",
+        "assert(code.match(/yellow\\s+?40px/gi), 'message: One color stop at 40 pixels should be <code>yellow</code>.');",
+        "assert(code.match(/yellow\\s+?40px,\\s*?black\\s+?40px/gi), 'message: The second color stop at 40 pixels should be <code>black</code>.');",
+        "assert(code.match(/black\\s+?80px/gi), 'message: The last color stop at 80 pixels should be <code>black</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a5367417b2b2512ad8",
+      "title": "Create Texture by Adding a Subtle Pattern as a Background Image",
+      "description": [
+        "One way to add texture and interest to a background and have it stand out more is to add a subtle pattern. The key is balance, as you don't want the background to stand out too much, and take away from the foreground. The <code>background</code> property supports the <code>url()</code> function in order to link to an image of the chosen texture or pattern. The link address is wrapped in quotes inside the parentheses.",
+        "<hr>",
+        "Using the url of <code>https://i.imgur.com/MJAkxbh.png</code>, set the <code>background</code> of the whole page with the <code>body</code> selector."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    ",
+        "  }",
+        "</style>"
+      ],
+      "tests": [
+        "assert(code.match(/background:\\s*?url\\((\"|')https:\\/\\/i\\.imgur\\.com\\/MJAkxbh\\.png(\"|')\\)/gi), 'message: Your <code>body</code> element should have a <code>background</code> property set to a <code>url()</code> with the given link.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "Remember to wrap the address in quotes within the url() function."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a5367417b2b2512ad9",
+      "title": "Use the CSS Transform scale Property to Change the Size of an Element",
+      "description": [
+        "To change the scale of an element, CSS has the <code>transform</code> property, along with its <code>scale()</code> function. The following code example doubles the size of all the paragraph elements on the page:",
+        "<blockquote>p {<br>  transform:scale(2);<br>}</blockquote>",
+        "<hr>",
+        "Increase the size of the element with the id of <code>ball2</code> to 1.5 times its original size."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .ball { ",
+        "    width: 40px;",
+        "    height: 40px;",
+        "    margin: 50 auto;",
+        "    position: fixed;",
+        "    background: linear-gradient(",
+        "      35deg,",
+        "      #ccffff,",
+        "      #ffcccc",
+        "    );",
+        "    border-radius: 50%;",
+        "  }",
+        "  #ball1 {",
+        "    left:20%;",
+        "  }",
+        "  #ball2 {",
+        "    left:65%;",
+        "    ",
+        "  }",
+        "",
+        "",
+        "</style>",
+        "",
+        "<div class=\"ball\" id= \"ball1\"></div>",
+        "<div class=\"ball\" id= \"ball2\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/#ball2\\s*?{\\s*?left:\\s*?65%;\\s*?transform:\\s*?scale\\(1\\.5\\);/gi), 'message: Set the <code>transform</code> property for <code>#ball2</code> to scale it 1.5 times its size.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a5367417b2b2512ada",
+      "title": "Use the CSS Transform scale Property to Scale an Element on Hover",
+      "description": [
+        "The <code>transform</code> property has a variety of functions that lets you scale, move, rotate, skew, etc., your elements. When used with pseudo-classes such as <code>:hover</code> that specify a certain state of an element, the <code>transform</code> property can easily add interactivity to your elements.",
+        "Here's an example to scale the paragraph elements to 2.1 times their original size when a user hovers over them:",
+        "<blockquote>p:hover {<br>  transform: scale(2.1);<br>}</blockquote>",
+        "<hr>",
+        "Add a CSS rule for the <code>hover</code> state of the <code>div</code> and use the <code>transform</code> property to scale the <code>div</code> element to 1.1 times its original size when a user hovers over it."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div { ",
+        "    width: 70%;",
+        "    height: 100px;",
+        "    margin:  50px auto;",
+        "    background: linear-gradient(",
+        "      53deg,",
+        "      #ccfffc,",
+        "      #ffcccf",
+        "    );",
+        "  }",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "",
+        "<div></div>"
+      ],
+      "tests": [
+        "assert(code.match(/div:hover\\s*?{\\s*?transform:\\s*?scale\\(1\\.1\\);/gi), 'message: The size of the <code>div</code> element should scale 1.1 times when the user hovers over it.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "Make sure to apply the CSS rule to the hover state of the div, using div:hover"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a6367417b2b2512adb",
+      "title": "Use the CSS Transform Property skewX to Skew an Element Along the X-Axis",
+      "description": [
+        "The next function of the <code>transform</code> property is <code>skewX()</code>, which skews the selected element along its X (horizontal) axis by a given degree.",
+        "The following code skews the paragraph element by -32 degrees along the X-axis.",
+        "<blockquote>p {<br>  transform: skewX(-32deg);<br>}</blockquote>",
+        "<hr>",
+        "Skew the element with the id of <code>bottom</code> by 24 degrees along the X-axis by using the <code>transform</code> property."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div { ",
+        "    width: 70%;",
+        "    height: 100px;",
+        "    margin:  50px auto;",
+        "  }",
+        "  #top {",
+        "    background-color: red;",
+        "  }",
+        "  #bottom {",
+        "    background-color: blue;",
+        "    ",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"top\"></div>",
+        "<div id=\"bottom\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/#bottom\\s*?{\\s*?.*?\\s*?transform:\\s*?skewX\\(24deg\\);/g), 'message: The element with id <code>bottom</code> should be skewed by 24 degrees along its X-axis.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "Notice that there is no space between the number and \"deg\" (-32deg) when declaring the degrees value."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a6367417b2b2512adc",
+      "title": "Use the CSS Transform Property skewY to Skew an Element Along the Y-Axis",
+      "description": [
+        "Given that the <code>skewX()</code> function skews the selected element along the X-axis by a given degree, it is no surprise that the <code>skewY()</code> property skews an element along the Y (vertical) axis.",
+        "<hr>",
+        "Skew the element with the id of <code>top</code> -10 degrees along the Y-axis by using the <code>transform</code> property."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div { ",
+        "    width: 70%;",
+        "    height: 100px;",
+        "    margin: 50px auto;",
+        "  }",
+        "  #top {",
+        "    background-color: red;",
+        "    ",
+        "  }",
+        "  #bottom {",
+        "    background-color: blue;",
+        "    transform: skewX(24deg);",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"top\"></div>",
+        "<div id=\"bottom\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/#top\\s*?{\\s*?.*?\\s*?transform:\\s*?skewY\\(-10deg\\);/g), 'message: The element with id <code>top</code> should be skewed by -10 degrees along its Y-axis.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a6367417b2b2512add",
+      "title": "Create a Graphic Using CSS",
+      "description": [
+        "By manipulating different selectors and properties, you can make interesting shapes. One of the easier ones to try is a crescent moon shape. For this challenge you need to work with the <code>box-shadow</code> property that sets the shadow of an element, along with the <code>border-radius</code> property that controls the roundness of the element's corners.",
+        "You will create a round, transparent object with a crisp shadow that is slightly offset to the side - the shadow is actually going to be the moon shape you see.",
+        "In order to create a round object, the <code>border-radius</code> property should be set to a value of 50%.",
+        "You may recall from an earlier challenge that the <code>box-shadow</code> property takes values for <code>offset-x</code>, <code>offset-y</code>, <code>blur-radius</code>, <code>spread-radius</code> and a color value in that order. The <code>blur-radius</code> and <code>spread-radius</code> values are optional.",
+        "<hr>",
+        "Manipulate the square element in the editor to create the moon shape. First, change the <code>background-color</code> to transparent, then set the <code>border-radius</code> property to 50% to make the circular shape. Finally, change the <code>box-shadow</code> property to set the <code>offset-x</code> to 25px, the <code>offset-y</code> to 10px, <code>blur-radius</code> to 0, <code>spread-radius</code> to 0, and color to blue."
+      ],
+      "challengeSeed": [
+        "<style>",
+        ".center",
+        "{",
+        "  position: absolute;",
+        "  margin: auto;",
+        "  top: 0;",
+        "  right: 0;",
+        "  bottom: 0;",
+        "  left: 0;",
+        "  width: 100px;",
+        "  height: 100px;",
+        "  ",
+        "  background-color: blue;",
+        "  border-radius: 0px;",
+        "  box-shadow: 25px 10px 10px 10px green; ",
+        "}",
+        "",
+        "</style>",
+        "<div class=\"center\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/background-color:\\s*?transparent;/gi), 'message: The value of the <code>background-color</code> property should be set to <code>transparent</code>.');",
+        "assert(code.match(/border-radius:\\s*?50%;/gi), 'message: The value of the <code>border-radius</code> property should be set to <code>50%</code>.');",
+        "assert(code.match(/box-shadow:\\s*?25px\\s+?10px\\s+?0(px)?\\s+?0(px)?\\s+?blue\\s*?;/gi), 'message: The value of the <code>box-shadow</code> property should be set to 25px for <code>offset-x</code>, 10px for <code>offset-y</code>, 0 for <code>blur-radius</code>, 0 for <code>spread-radius</code>, and finally blue for the color.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a6367417b2b2512ade",
+      "title": "Create a More Complex Shape Using CSS and HTML",
+      "description": [
+        "One of the most popular shapes in the world is the heart shape, and this challenge creates it with raw CSS. But first, you need to understand the <code>:before</code> and <code>:after</code> selectors. These selectors are used to add something before or after a selected element. In the following example, a <code>:before</code> selector is used to add a rectangle to an element with the class <code>heart</code>:",
+        "<blockquote>.heart:before {<br>  content: \"\";<br>  background-color: yellow;<br>  border-radius: 25%;<br>  position: absolute;<br>  height: 50px;<br>  width: 70px;<br>  top: -50px;<br>  left: 5px;<br>}</blockquote>",
+        "For the <code>:before</code> and <code>:after</code> selectors to function properly, they must have a defined <code>content</code> property. It usually has content such as a photo or text. When the <code>:before</code> and <code>:after</code> selectors add shapes, the <code>content</code> property is still required, but it's set to an empty string.",
+        "In the above example, the element with the class of <code>heart</code> has a <code>:before</code> selector that produces a yellow rectangle with <code>height</code> and <code>width</code> of 50px and 70px, respectively. This rectangle has round corners due to its 25% border radius and is positioned absolutely at 5px from the <code>left</code> and 50px above the <code>top</code> of the element.",
+        "<hr>",
+        "Transform the element on the screen to a heart. In the <code>heart:after</code> selector, change the <code>background-color</code> to pink and the <code>border-radius</code> to 50%.",
+        "Next, target the element with the class <code>heart</code> (just <code>heart</code>) and fill in the <code>transform</code> property. Use the <code>rotate()</code> function with -45 degrees. (<code>rotate()</code> works the same way that <code>skewX()</code> and <code>skewY()</code> do).",
+        "Finally, in the <code>heart:before</code> selector, set its <code>content</code> property to an empty string."
+      ],
+      "challengeSeed": [
+        "<style>",
+        ".heart {",
+        "  position: absolute;",
+        "  margin: auto;",
+        "  top: 0;",
+        "  right: 0;",
+        "  bottom: 0;",
+        "  left: 0;",
+        "  background-color: pink;",
+        "  height: 50px;",
+        "  width: 50px;",
+        "  transform: ;",
+        "}",
+        ".heart:after {",
+        "  background-color: blue;",
+        "  content: \"\";",
+        "  border-radius: 25%;",
+        "  position: absolute;",
+        "  width: 50px;",
+        "  height: 50px;",
+        "  top: 0px;",
+        "  left: 25px;",
+        "}",
+        ".heart:before {",
+        "  content: ;",
+        "  background-color: pink;",
+        "  border-radius: 50%;",
+        "  position: absolute;",
+        "  width: 50px;",
+        "  height: 50px;",
+        "  top: -25px;",
+        "  left: 0px;",
+        "}",
+        "</style>",
+        "<div class = \"heart\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/\\.heart:after\\s*?{\\s*?background-color:\\s*?pink;/gi), 'message: The <code>background-color</code> property of the <code>heart:after</code> selector should be pink.');",
+        "assert(code.match(/border-radius:\\s*?50%/gi).length == 2, 'message: The <code>border-radius</code> of the <code>heart:after</code> selector should be 50%.');",
+        "assert(code.match(/transform:\\s*?rotate\\(-45deg\\)/gi), 'message: The <code>transform</code> property for the <code>heart</code> class should use a <code>rotate()</code> function set to -45 degrees.');",
+        "assert(code.match(/\\.heart:before\\s*?{\\s*?content:\\s*?(\"|')\\1;/gi), 'message: The <code>content</code> of the <code>heart:before</code> selector should be an empty string.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a7367417b2b2512adf",
+      "title": "Learn How the CSS @keyframes and animation Properties Work",
+      "description": [
+        "To animate an element, you need to know about the animation properties and the <code>@keyframes</code> rule. The animation properties control how the animation should behave and the <code>@keyframes</code> rule controls what happens during that animation. There are eight animation properties in total. This challenge will keep it simple and cover the two most important ones first:",
+        "<code>animation-name</code> sets the name of the animation, which is later used by <code>@keyframes</code> to tell CSS which rules go with which animations.",
+        "<code>animation-duration</code> sets the length of time for the animation.",
+        "<code>@keyframes</code> is how to specify exactly what happens within the animation over the duration. This is done by giving CSS properties for specific \"frames\" during the animation, with percentages ranging from 0% to 100%. If you compare this to a movie, the CSS properties for 0% is how the element displays in the opening scene. The CSS properties for 100% is how the element appears at the end, right before the credits roll. Then CSS applies the magic to transition the element over the given duration to act out the scene. Here's an example to illustrate the usage of <code>@keyframes</code> and the animation properties:",
+        "<blockquote>#anim {<br>  animation-name: colorful;<br>  animation-duration: 3s;<br>}<br>@keyframes colorful {<br>  0% {<br>   background-color: blue;<br>  }<br>  100% {<br>    background-color: yellow;<br>  }<br>}</blockquote>",
+        "For the element with the <code>anim</code> id, the code snippet above sets the <code>animation-name</code> to <code>colorful</code> and sets the <code>animation-duration</code> to 3 seconds. Then the <code>@keyframes</code> rule links to the animation properties with the name <code>colorful</code>. It sets the color to blue at the beginning of the animation (0%) which will transition to yellow by the end of the animation (100%). You aren't limited to only beginning-end transitions, you can set properties for the element for any percentage between 0% and 100%.",
+        "<hr>",
+        "Create an animation for the element with the id <code>rect</code>, by setting the <code>animation-name</code> to rainbow and the <code>animation-duration</code> to 4 seconds. Next, declare a <code>@keyframes</code> rule, and set the <code>background-color</code> at the beginning of the animation (<code>0%</code>) to blue, the middle of the animation (<code>50%</code>) to green, and the end of the animation (<code>100%</code>) to yellow."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div {",
+        "    height: 40px;",
+        "    width: 70%;",
+        "    background: black;",
+        "    margin: 50px auto;",
+        "    border-radius: 5px;",
+        "  }",
+        "",
+        "  #rect {",
+        "    ",
+        "    ",
+        "  }",
+        "  ",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "<div id=\"rect\"></div>"
+      ],
+      "tests": [
+        "assert($('#rect').css('animation-name') == 'rainbow', 'message: The element with id of <code>rect</code> should have an <code>animation-name</code> property with a value of rainbow.');",
+        "assert($('#rect').css('animation-duration') == '4s', 'message: The element with id of <code>rect</code> should have an <code>animation-duration</code> property with a value of 4s.');",
+        "assert(code.match(/@keyframes\\s+?rainbow\\s*?{/g), 'message: The <code>@keyframes</code> rule should use the <code>animation-name</code> of rainbow.');",
+        "assert(code.match(/0%\\s*?{\\s*?background-color:\\s*?blue;\\s*?}/gi), 'message: The <code>@keyframes</code> rule for rainbow should use a <code>background-color</code> of blue at 0%.');",
+        "assert(code.match(/50%\\s*?{\\s*?background-color:\\s*?green;\\s*?}/gi), 'message: The <code>@keyframes</code> rule for rainbow should use a <code>background-color</code> of green at 50%.');",
+        "assert(code.match(/100%\\s*?{\\s*?background-color:\\s*?yellow;\\s*?}/gi), 'message: The <code>@keyframes</code> rule for rainbow should use a <code>background-color</code> of yellow at 100%.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "Make sure the @keyframes rule links to the animation-name."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a7367417b2b2512ae0",
+      "title": "Use CSS Animation to Change the Hover State of a Button",
+      "description": [
+        "You can use CSS <code>@keyframes</code> to change the color of a button in its hover state.",
+        "Here's an example of changing the width of an image on hover:",
+        "<blockquote>&lt;style&gt;<br>  img:hover {<br>    animation-name: width;<br>    animation-duration: 500ms;<br>  }<br><br>  @keyframes width {<br>    100% {<br>      width: 40px;<br>    }<br>  }<br>&lt;/style&gt;<br><br>&lt;img src=&quot;https://bit.ly/smallgooglelogo&quot; alt=&quot;Google's Logo&quot; /&gt;</blockquote>",
+        "<hr>",
+        "Note that <code>ms</code> stands for milliseconds, where 1000ms is equal to 1s.",
+        "Use CSS <code>@keyframes</code> to change the <code>background-color</code> of the <code>button</code> element so it becomes <code>#4791d0</code> when a user hovers over it. The <code>@keyframes</code> rule should only have an entry for <code>100%</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  button {",
+        "    border-radius: 5px;",
+        "    color: white;",
+        "    background-color: #0F5897;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  ",
+        "  button:hover {",
+        "    animation-name: background-color;",
+        "    animation-duration: 500ms;",
+        "  }",
+        "  ",
+        "  ",
+        "</style>",
+        "  ",
+        "<button>Register</button>"
+      ],
+      "tests": [
+        "assert(code.match(/@keyframes\\s+?background-color\\s*?{/g), 'message: The @keyframes rule should use the <code>animation-name</code> background-color.');",
+        "assert(code.match(/100%\\s*?{\\s*?background-color:\\s*?#4791d0;\\s*?}/gi), 'message: There should be one rule under <code>@keyframes</code> that changes the <code>background-color</code> to <code>#4791d0</code> at 100%.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58a7a6ebf9a6318348e2d5aa",
+      "title": "Modify Fill Mode of an Animation",
+      "description": [
+        "That's great, but it doesn't work right yet. Notice how the animation resets after <code>500ms</code> has passed, causing the button to revert back to the original color. You want the button to stay highlighted.",
+        "This can be done by setting the <code>animation-fill-mode</code> property to <code>forwards</code>. The <code>animation-fill-mode</code> specifies the style applied to an element when the animation has finished. You can set it like so:",
+        "<code>animation-fill-mode: forwards;</code>",
+        "<hr>",
+        "Set the <code>animation-fill-mode</code> property of <code>button:hover</code> to <code>forwards</code> so the button stays highlighted when a user hovers over it."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  button {",
+        "    border-radius: 5px;",
+        "    color: white;",
+        "    background-color: #0F5897;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    animation-name: background-color;",
+        "    animation-duration: 500ms;",
+        "    ",
+        "  }",
+        "  @keyframes background-color {",
+        "    100% {",
+        "      background-color: #4791d0;",
+        "    }",
+        "  }",
+        "</style>",
+        "<button>Register</button>"
+      ],
+      "tests": [
+        "assert(code.match(/button:hover\\s*?{\\s*?animation-name:\\s*?background-color;\\s*?animation-duration:\\s*?500ms;\\s*?animation-fill-mode:\\s*?forwards;\\s*?}/gi), 'message: <code>button:hover</code> should have a <code>animation-fill-mode</code> property with a value of <code>forwards</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a7367417b2b2512ae1",
+      "title": "Create Movement Using CSS Animation",
+      "description": [
+        "When elements have a specified <code>position</code>, such as <code>fixed</code> or <code>relative</code>, the CSS offset properties <code>right</code>, <code>left</code>, <code>top</code>, and <code>bottom</code> can be used in animation rules to create movement.",
+        "As shown in the example below, you can push the item downwards then upwards by setting the <code>top</code> property of the <code>50%</code> keyframe to 50px, but having it set to 0px for the first (<code>0%</code>) and the last (<code>100%</code>) keyframe.",
+        "<blockquote>@keyframes rainbow {<br>  0% {<br>    background-color: blue;<br>    top: 0px;<br>  }<br>  50% {<br>    background-color: green;<br>    top: 50px;<br>  }<br>  100% {<br>    background-color: yellow;<br>    top: 0px;<br>  }<br>}</blockquote>",
+        "<hr>",
+        "Add a horizontal motion to the <code>div</code> animation. Using the <code>left</code> offset property, add to the <code>@keyframes</code> rule so rainbow starts at 0 pixels at <code>0%</code>, moves to 25 pixels at <code>50%</code>, and ends at -25 pixels at <code>100%</code>. Don't replace the <code>top</code> property in the editor - the animation should have both vertical and horizontal motion."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  div {",
+        "    height: 40px;",
+        "    width: 70%;",
+        "    background: black;",
+        "    margin: 50px auto;",
+        "    border-radius: 5px;",
+        "    position: relative;",
+        "  }",
+        "",
+        "#rect {",
+        "  animation-name: rainbow;",
+        "  animation-duration: 4s;",
+        "}",
+        "",
+        "@keyframes rainbow {",
+        "  0% {",
+        "    background-color: blue;",
+        "    top: 0px;",
+        "    ",
+        "  }",
+        "  50% {",
+        "    background-color: green;",
+        "    top: 50px;",
+        "    ",
+        "  }",
+        "  100% {",
+        "    background-color: yellow;",
+        "    top: 0px;",
+        "    ",
+        "  }",
+        "}",
+        "</style>",
+        "",
+        "<div id=\"rect\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/0%\\s*?{\\s*?background-color:\\s*?blue;\\s*?top:\\s*?0px;\\s*?left:\\s*?0px;\\s*?}/gi), 'message: The <code>@keyframes</code> rule for <code>0%</code> should use the <code>left</code> offset of 0px.');",
+        "assert(code.match(/50%\\s*?{\\s*?background-color:\\s*?green;\\s*?top:\\s*?50px;\\s*?left:\\s*?25px;\\s*?}/gi), 'message: The <code>@keyframes</code> rule for <code>50%</code> should use the <code>left</code> offset of 25px.');",
+        "assert(code.match(/100%\\s*?{\\s*?background-color:\\s*?yellow;\\s*?top:\\s*?0px;\\s*?left:\\s*?-25px;\\s*?}/gi), 'message: The <code>@keyframes</code> rule for <code>100%</code> should use the <code>left</code> offset of -25px.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a7367417b2b2512ae2",
+      "title": "Create Visual Direction by Fading an Element from Left to Right",
+      "description": [
+        "For this challenge, you'll change the <code>opacity</code> of an animated element so it gradually fades as it reaches the right side of the screen.",
+        "In the displayed animation, the round element with the gradient background moves to the right by the 50% mark of the animation per the <code>@keyframes</code> rule.",
+        "<hr>",
+        "Target the element with the id of <code>ball</code> and add the <code>opacity</code> property set to 0.1 at <code>50%</code>, so the element fades as it moves to the right."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "  #ball {",
+        "    width: 70px;",
+        "    height: 70px;",
+        "    margin: 50px auto;",
+        "    position: fixed;",
+        "    left: 20%;",
+        "    border-radius: 50%;",
+        "    background: linear-gradient(",
+        "      35deg,",
+        "      #ccffff,",
+        "      #ffcccc",
+        "    );",
+        "    animation-name: fade;",
+        "    animation-duration: 3s;",
+        "  }",
+        "",
+        "  @keyframes fade {",
+        "    50% {",
+        "      left: 60%;",
+        "      ",
+        "    }",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div id=\"ball\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/@keyframes fade\\s*?{\\s*?50%\\s*?{\\s*?(?:left:\\s*?60%;\\s*?opacity:\\s*?0?\\.1;|opacity:\\s*?0?\\.1;\\s*?left:\\s*?60%;)/gi), 'message: The <code>keyframes</code> rule for fade should set the <code>opacity</code> property to 0.1 at 50%.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a8367417b2b2512ae3",
+      "title": "Animate Elements Continually Using an Infinite Animation Count",
+      "description": [
+        "The previous challenges covered how to use some of the animation properties and the <code>@keyframes</code> rule. Another animation property is the <code>animation-iteration-count</code>, which allows you to control how many times you would like to loop through the animation. Here's an example:",
+        "<code>animation-iteration-count: 3;</code>",
+        "In this case the animation will stop after running 3 times, but it's possible to make the animation run continuously by setting that value to infinite.",
+        "<hr>",
+        "To keep the ball bouncing on the right on a continuous loop, change the <code>animation-iteration-count</code> property to infinite."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "  #ball {",
+        "    width: 100px;",
+        "    height: 100px;",
+        "    margin: 50px auto;",
+        "    position: relative;",
+        "    border-radius: 50%;",
+        "    background: linear-gradient(",
+        "      35deg,",
+        "      #ccffff,",
+        "      #ffcccc",
+        "    );",
+        "    animation-name: bounce;",
+        "    animation-duration: 1s;",
+        "    animation-iteration-count: 3;",
+        "  }",
+        "",
+        "  @keyframes bounce{",
+        "    0% {",
+        "      top: 0px;",
+        "    }",
+        "    50% {",
+        "      top: 249px;",
+        "      width: 130px;",
+        "      height: 70px;",
+        "    }",
+        "    100% {",
+        "      top: 0px;",
+        "    }",
+        "  }",
+        "</style>",
+        "<div id=\"ball\"></div>"
+      ],
+      "tests": [
+        "assert($('#ball').css('animation-iteration-count') == 'infinite', 'message: The <code>animation-iteration-count</code> property should have a value of infinite.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a8367417b2b2512ae4",
+      "title": "Make a CSS Heartbeat using an Infinite Animation Count",
+      "description": [
+        "Here's one more continuous animation example with the <code>animation-iteration-count</code> property that uses the heart you designed in a previous challenge.",
+        "The one-second long heartbeat animation consists of two animated pieces. The <code>heart</code> elements (including the <code>:before</code> and <code>:after</code> pieces) are animated to change size using the <code>transform</code> property, and the background <code>div</code> is animated to change its color using the <code>background</code> property.",
+        "<hr>",
+        "Keep the heart beating by adding the <code>animation-iteration-count</code> property for both the <code>back</code> class and the <code>heart</code> class and setting the value to infinite. The <code>heart:before</code> and <code>heart:after</code> selectors do not need any animation properties."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .back {",
+        "    position: fixed;",
+        "    padding: 0;",
+        "    margin: 0;",
+        "    top: 0;",
+        "    left: 0;",
+        "    width: 100%;",
+        "    height: 100%;",
+        "    background: white;",
+        "    animation-name: backdiv;",
+        "    animation-duration: 1s; ",
+        "    ",
+        "  }",
+        "",
+        "  .heart {",
+        "    position: absolute;",
+        "    margin: auto;",
+        "    top: 0;",
+        "    right: 0;",
+        "    bottom: 0;",
+        "    left: 0;",
+        "    background-color: pink;",
+        "    height: 50px;",
+        "    width: 50px;",
+        "    transform: rotate(-45deg);",
+        "    animation-name: beat;",
+        "    animation-duration: 1s;",
+        "    ",
+        "  }",
+        "  .heart:after {",
+        "    background-color: pink;",
+        "    content: \"\";",
+        "    border-radius: 50%;",
+        "    position: absolute;",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    top: 0px;",
+        "    left: 25px;",
+        "  }",
+        "  .heart:before {",
+        "    background-color: pink;",
+        "    content: \"\";",
+        "    border-radius: 50%;",
+        "    position: absolute;",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    top: -25px;",
+        "    left: 0px;",
+        "  }",
+        "",
+        "  @keyframes backdiv {",
+        "    50% {",
+        "      background: #ffe6f2;",
+        "    }",
+        "  }",
+        "",
+        "  @keyframes beat {",
+        "    0% {",
+        "      transform: scale(1) rotate(-45deg);",
+        "    }",
+        "    50% {",
+        "      transform: scale(0.6) rotate(-45deg);",
+        "    }",
+        "  }",
+        "",
+        "</style>",
+        "<div class=\"back\"></div>",
+        "<div class=\"heart\"></div>"
+      ],
+      "tests": [
+        "assert($('.heart').css('animation-iteration-count') == 'infinite', 'message: The <code>animation-iteration-count</code> property for the <code>heart</code> class should have a value of infinite.');",
+        "assert($('.back').css('animation-iteration-count') == 'infinite', 'message: The <code>animation-iteration-count</code> property for the <code>back</code> class should have a value of infinite.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a8367417b2b2512ae5",
+      "title": "Animate Elements at Variable Rates",
+      "description": [
+        "There are a variety of ways to alter the animation rates of similarly animated elements. So far, this has been achieved by applying an <code>animation-iteration-count</code> property and setting <code>@keyframes</code> rules.",
+        "To illustrate, the animation on the right consists of two \"stars\" that each decrease in size and opacity at the 20% mark in the <code>@keyframes</code> rule, which creates the twinkle animation. You can change the <code>@keyframes</code> rule for one of the elements so the stars twinkle at different rates.",
+        "<hr>",
+        "Alter the animation rate for the element with the class name of <code>star-1</code> by changing its <code>@keyframes</code> rule to 50%."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .stars {",
+        "    background-color: white;",
+        "    height: 30px;",
+        "    width: 30px;",
+        "    border-radius: 50%;",
+        "    animation-iteration-count: infinite;",
+        "  }",
+        "",
+        "  .star-1 {",
+        "    margin-top: 15%; ",
+        "    margin-left: 60%;",
+        "    animation-name: twinkle-1;",
+        "    animation-duration: 1s;",
+        "  }",
+        "",
+        "  .star-2 {",
+        "    margin-top: 25%;",
+        "    margin-left: 25%;",
+        "    animation-name: twinkle-2;",
+        "    animation-duration: 1s;",
+        "  }",
+        "",
+        "  @keyframes twinkle-1 {",
+        "    20% {",
+        "      transform: scale(0.5);",
+        "      opacity: 0.5;",
+        "    }",
+        "  }",
+        "",
+        "  @keyframes twinkle-2 {",
+        "    20% {",
+        "      transform: scale(0.5);",
+        "      opacity: 0.5;",
+        "    }",
+        "  }",
+        "",
+        "  #back {",
+        "    position: fixed;",
+        "    padding: 0;",
+        "    margin: 0;",
+        "    top: 0;",
+        "    left: 0;",
+        "    width: 100%;",
+        "    height: 100%;",
+        "    background: linear-gradient(black, #000099, #66c2ff, #ffcccc, #ffeee6);",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"back\"></div>",
+        "<div class=\"star-1 stars\"></div>",
+        "<div class=\"star-2 stars\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/twinkle-1\\s*?{\\s*?50%/g), 'message: The <code>@keyframes</code> rule for the <code>star-1</code> class should be 50%.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "Check the animation-name declared in the star-1 class to find the right @keyframes rule to change."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a8367417b2b2512ae6",
+      "title": "Animate Multiple Elements at Variable Rates",
+      "description": [
+        "In the previous challenge, you changed the animation rates for two similarly animated elements by altering their <code>@keyframes</code> rules. You can achieve the same goal by manipulating the <code>animation-duration</code> of multiple elements.",
+        "In the animation running in the code editor, there are three \"stars\" in the sky that twinkle at the same rate on a continuous loop. To make them twinkle at different rates, you can set the <code>animation-duration</code> property to different values for each element.",
+        "<hr>",
+        "Set the <code>animation-duration</code> of the elements with the classes <code>star-1</code>, <code>star-2</code>, and <code>star-3</code> to 1s, 0.9s, and 1.1s, respectively."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .stars {",
+        "    background-color: white;",
+        "    height: 30px;",
+        "    width: 30px;",
+        "    border-radius: 50%;",
+        "    animation-iteration-count: infinite;",
+        "  }",
+        "",
+        "  .star-1 {",
+        "    margin-top: 15%; ",
+        "    margin-left: 60%;",
+        "    animation-duration: 1s;",
+        "    animation-name: twinkle;",
+        "  }",
+        "",
+        "  .star-2 {",
+        "    margin-top: 25%;",
+        "    margin-left: 25%;",
+        "    animation-duration: 1s;",
+        "    animation-name: twinkle;",
+        "  }",
+        "",
+        "  .star-3 {",
+        "    margin-top: 10%;",
+        "    margin-left: 50%;",
+        "    animation-duration: 1s;",
+        "    animation-name: twinkle;",
+        "  }",
+        "",
+        "  @keyframes twinkle {",
+        "    20% {",
+        "      transform: scale(0.5);",
+        "      opacity: 0.5;",
+        "    }",
+        "  }",
+        "",
+        "  #back {",
+        "    position: fixed;",
+        "    padding: 0;",
+        "    margin: 0;",
+        "    top: 0;",
+        "    left: 0;",
+        "    width: 100%;",
+        "    height: 100%;",
+        "    background: linear-gradient(black, #000099, #66c2ff, #ffcccc, #ffeee6);",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"back\"></div>",
+        "<div class=\"star-1 stars\"></div>",
+        "<div class=\"star-2 stars\"></div>",
+        "<div class=\"star-3 stars\"></div>"
+      ],
+      "tests": [
+        "assert($('.star-1').css('animation-duration') == '1s', 'message: The <code>animation-duration</code> property for the star with class <code>star-1</code> should remain at 1s.');",
+        "assert($('.star-2').css('animation-duration') == '0.9s', 'message: The <code>animation-duration</code> property for the star with class <code>star-2</code> should be 0.9s.');",
+        "assert($('.star-3').css('animation-duration') == '1.1s', 'message: The <code>animation-duration</code> property for the star with class <code>star-3</code> should be 1.1s.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a8367417b2b2512ae7",
+      "title": "Change Animation Timing with Keywords",
+      "description": [
+        "In CSS animations, the <code>animation-timing-function</code> property controls how quickly an animated element changes over the duration of the animation. If the animation is a car moving from point A to point B in a given time (your <code>animation-duration</code>), the <code>animation-timing-function</code> says how the car accelerates and decelerates over the course of the drive.",
+        "There are a number of predefined keywords available for popular options. For example, the default value is <code>linear</code>, which applies a constant animation speed throughout. Other options include <code>ease-out</code>, which is quick in the beginning then slows down, or <code>ease-in</code>, which is slow in the beginning, then speeds up at the end.",
+        "<hr>",
+        "For the elements with id of <code>ball1</code> and <code>ball2</code>, add an <code>animation-timing-function</code> property to each, and set <code>#ball1</code> to <code>linear</code>, and <code>#ball2</code> to <code>ease-out</code>. Notice the difference between how the elements move during the animation but end together, since they share the same <code>animation-duration</code> of 2 seconds."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "  .balls {",
+        "    border-radius: 50%;",
+        "    background: linear-gradient(",
+        "      35deg,",
+        "      #ccffff,",
+        "      #ffcccc",
+        "    );",
+        "    position: fixed;  ",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    margin-top: 50px;",
+        "    animation-name: bounce;",
+        "    animation-duration: 2s;",
+        "    animation-iteration-count: infinite;",
+        "  }",
+        "  #ball1 { ",
+        "    left:27%;",
+        "    ",
+        "  }",
+        "  #ball2 { ",
+        "    left:56%;",
+        "    ",
+        "  }",
+        "",
+        "@keyframes bounce {",
+        "  0% {",
+        "    top: 0px;",
+        "  } ",
+        "  100% {",
+        "    top: 249px;",
+        "  }",
+        "} ",
+        "",
+        "</style>",
+        "",
+        "<div class=\"balls\" id=\"ball1\"></div>",
+        "<div class=\"balls\" id=\"ball2\"></div>"
+      ],
+      "tests": [
+        "assert($('#ball1').css('animation-timing-function') == 'linear', 'message: The value of the <code>animation-timing-function</code> property for the element with the id <code>ball1</code> should be linear.');",
+        "assert($('#ball2').css('animation-timing-function') == 'ease-out', 'message: The value of the <code>animation-timing-function</code> property for the element with the id <code>ball2</code> should be ease-out.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a9367417b2b2512ae8",
+      "title": "Learn How Bezier Curves Work",
+      "description": [
+        "The last challenge introduced the <code>animation-timing-function</code> property and a few keywords that change the speed of an animation over its duration. CSS offers an option other than keywords that provides even finer control over how the animation plays out, through the use of Bezier curves.",
+        "In CSS animations, Bezier curves are used with the <code>cubic-bezier</code> function. The shape of the curve represents how the animation plays out. The curve lives on a 1 by 1 coordinate system. The X-axis of this coordinate system is the duration of the animation (think of it as a time scale), and the Y-axis is the change in the animation.",
+        "The <code>cubic-bezier</code> function consists of four main points that sit on this 1 by 1 grid: <code>p0</code>, <code>p1</code>, <code>p2</code>, and <code>p3</code>. <code>p0</code> and <code>p3</code> are set for you - they are the beginning and end points which are always located respectively at the origin (0, 0) and (1, 1). You set the x and y values for the other two points, and where you place them in the grid dictates the shape of the curve for the animation to follow. This is done in CSS by declaring the x and y values of the <code>p1</code> and <code>p2</code> \"anchor\" points in the form: <code>(x1, y1, x2, y2)</code>. Pulling it all together, here's an example of a Bezier curve in CSS code:",
+        "<code>animation-timing-function: cubic-bezier(0.25, 0.25, 0.75, 0.75);</code>",
+        "In the example above, the x and y values are equivalent for each point (x1 = 0.25 = y1 and x2 = 0.75 = y2), which if you remember from geometry class, results in a line that extends from the origin to point (1, 1). This animation is a linear change of an element during the length of an animation, and is the same as using the <code>linear</code> keyword. In other words, it changes at a constant speed.",
+        "<hr>",
+        "For the element with the id of <code>ball1</code>, change the value of the <code>animation-timing-function</code> property from <code>linear</code> to its equivalent <code>cubic-bezier</code> function value. Use the point values given in the example above."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "  .balls{",
+        "    border-radius: 50%;",
+        "    background: linear-gradient(",
+        "      35deg,",
+        "      #ccffff,",
+        "      #ffcccc",
+        "    );",
+        "    position: fixed;  ",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    margin-top: 50px;",
+        "    animation-name: bounce;",
+        "    animation-duration: 2s;",
+        "    animation-iteration-count: infinite;",
+        "  }",
+        "  #ball1 { ",
+        "    left: 27%;",
+        "    animation-timing-function: linear;",
+        "  }",
+        "  #ball2 { ",
+        "    left: 56%;",
+        "    animation-timing-function: ease-out;",
+        "  }",
+        "",
+        "@keyframes bounce {",
+        "  0% {",
+        "    top: 0px;",
+        "  } ",
+        "  100% {",
+        "    top: 249px;",
+        "  }",
+        "} ",
+        "",
+        "</style>",
+        "",
+        "<div class=\"balls\" id=\"ball1\"></div>",
+        "<div class=\"balls\" id=\"ball2\"></div>"
+      ],
+      "tests": [
+        "assert($('#ball1').css('animation-timing-function') == 'cubic-bezier(0.25, 0.25, 0.75, 0.75)', 'message: The value of the <code>animation-timing-function</code> property for the element with the id <code>ball1</code> should be the linear-equivalent cubic-bezier function.');",
+        "assert($('#ball2').css('animation-timing-function') == 'ease-out', 'message: The value of the <code>animation-timing-function</code> property for the element with the id <code>ball2</code> should not change.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a9367417b2b2512ae9",
+      "title": "Use a Bezier Curve to Move a Graphic",
+      "description": [
+        "A previous challenge discussed the <code>ease-out</code> keyword that describes an animation change that speeds up first and then slows down at the end of the animation. On the right, the difference between the <code>ease-out</code> keyword (for the blue element) and <code>linear</code> keyword (for the red element) is demonstrated. Similar animation progressions to the <code>ease-out</code> keyword can be achieved by using a custom cubic Bezier curve function.",
+        "In general, changing the <code>p1</code> and <code>p2</code> anchor points drives the creation of different Bezier curves, which controls how the animation progresses through time. Here's an example of a Bezier curve using values to mimic the ease-out style:",
+        "<code>animation-timing-function: cubic-bezier(0, 0, 0.58, 1);</code>",
+        "Remember that all <code>cubic-bezier</code> functions start with <code>p0</code> at (0, 0) and end with <code>p3</code> at (1, 1). In this example, the curve moves faster through the Y-axis (starts at 0, goes to <code>p1</code> y value of 0, then goes to <code>p2</code> y value of 1) then it moves through the X-axis (0 to start, then 0 for <code>p1</code>, up to 0.58 for <code>p2</code>). As a result, the change in the animated element progresses faster than the time of the animation for that segment. Towards the end of the curve, the relationship between the change in x and y values reverses - the y value moves from 1 to 1 (no change), and the x values move from 0.58 to 1, making the animation changes progress slower compared to the animation duration.",
+        "<hr>",
+        "To see the effect of this Bezier curve in action, change the <code>animation-timing-function</code> of the element with id of <code>red</code> to a <code>cubic-bezier</code> function with x1, y1, x2, y2 values set respectively to 0, 0, 0.58, 1. This will make both elements progress through the animation similarly."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .balls{",
+        "    border-radius: 50%;",
+        "    position: fixed;",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    margin-top: 50px;",
+        "    animation-name: bounce;",
+        "    animation-duration: 2s;",
+        "    animation-iteration-count: infinite;",
+        "  }",
+        "  #red {",
+        "    background: red;",
+        "    left: 27%;",
+        "    animation-timing-function: linear;",
+        "  }",
+        "  #blue {",
+        "    background: blue;",
+        "    left: 56%;",
+        "    animation-timing-function: ease-out;",
+        "  }",
+        "  @keyframes bounce {",
+        "    0% {",
+        "      top: 0px;",
+        "    }",
+        "    100% {",
+        "      top: 249px;",
+        "    }",
+        "  }",
+        "</style>",
+        "<div class=\"balls\" id= \"red\"></div>",
+        "<div class=\"balls\" id= \"blue\"></div>"
+      ],
+      "tests": [
+        "assert($('#red').css('animation-timing-function') == 'cubic-bezier(0, 0, 0.58, 1)', 'message: The value of the <code>animation-timing-function</code> property of the element with the id <code>red</code> should be a <code>cubic-bezier</code> function with x1, y1, x2, y2 values set respectively to 0, 0, 0.58, 1 .');",
+        "assert($('#red').css('animation-timing-function') !== 'linear', 'message: The element with the id <code>red</code> should no longer have the <code>animation-timing-function</code> property of linear.');",
+        "assert($('#blue').css('animation-timing-function') == 'ease-out', 'message: The value of the <code>animation-timing-function</code> property for the element with the id <code>blue</code> should not change.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78a9367417b2b2512aea",
+      "title": "Make Motion More Natural Using a Bezier Curve",
+      "description": [
+        "This challenge animates an element to replicate the movement of a ball being juggled. Prior challenges covered the <code>linear</code> and <code>ease-out</code> cubic Bezier curves, however neither depicts the juggling movement accurately. You need to customize a Bezier curve for this.",
+        "The <code>animation-timing-function</code> automatically loops at every keyframe when the <code>animation-iteration-count</code> is set to infinite. Since there is a keyframe rule set in the middle of the animation duration (at <code>50%</code>), it results in two identical animation progressions at the upward and downward movement of the ball.",
+        "The following cubic Bezier curve simulates a juggling movement:",
+        "<code>cubic-bezier(0.3, 0.4, 0.5, 1.6); </code>",
+        "Notice that the value of y2 is larger than 1. Although the cubic Bezier curve is mapped on an 1 by 1 coordinate system, and it can only accept x values from 0 to 1, the y value can be set to numbers larger than one. This results in a bouncing movement that is ideal for simulating the juggling ball.",
+        "<hr>",
+        "Change value of the <code>animation-timing-function</code> of the element with the id of <code>green</code> to a <code>cubic-bezier</code> function with x1, y1, x2, y2 values set respectively to 0.311, 0.441, 0.444, 1.649."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .balls {",
+        "    border-radius: 50%;",
+        "    top: 249px;",
+        "    position: fixed;  ",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    top: 60%;",
+        "    animation-name: jump;",
+        "    animation-duration: 2s;",
+        "    animation-iteration-count: infinite;",
+        "  }",
+        "  #red {",
+        "    background: red;",
+        "    left: 25%;",
+        "    animation-timing-function: linear;",
+        "  }",
+        "  #blue {",
+        "    background: blue;",
+        "    left: 50%;",
+        "    animation-timing-function: ease-out;",
+        "  }",
+        "  #green {",
+        "    background: green;",
+        "    left: 75%;",
+        "    animation-timing-function: cubic-bezier(0.69, 0.1, 1, 0.1);",
+        "  }",
+        "",
+        "  @keyframes jump {",
+        "    50% {",
+        "      top: 10%;",
+        "    }",
+        "  }",
+        "</style>",
+        "<div class=\"balls\" id=\"red\"></div>",
+        "<div class=\"balls\" id=\"blue\"></div>",
+        "<div class=\"balls\" id=\"green\"></div>"
+      ],
+      "tests": [
+        "assert($('#green').css('animation-timing-function') == 'cubic-bezier(0.311, 0.441, 0.444, 1.649)', 'message: The value of the <code>animation-timing-function</code> property for the element with the id <code>green</code> should be a <code>cubic-bezier</code> function with x1, y1, x2, y2 values as specified.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/01-responsive-web-design/basic-css.json b/seed/math-challenges/01-responsive-web-design/basic-css.json
new file mode 100644
index 0000000000..c0f09e5062
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/basic-css.json
@@ -0,0 +1,3625 @@
+{
+  "name": "Basic CSS",
+  "order": 1,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "597d77903675177232517ab2",
+      "title": "Introduction to Basic CSS",
+      "description": [
+        [
+          "",
+          "",
+          "Cascading Style Sheets (CSS) tell the browser how to display the text and other content that you write in HTML.<br><br>Note that CSS is case-sensitive so be careful with your capitalization.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "CSS has been adopted by all major browsers and allows you to control:<br><ul><li>color</li><li>fonts</li><li>positioning</li><li>spacing</li><li>sizing</li><li>decorations</li><li>transitions</li></ul>",
+          ""
+        ],
+        [
+          "",
+          "",
+          "There are three main ways to apply CSS styling. You can apply inline styles directly to HTML elements with the <code>style</code> attribute. Alternatively, you can place CSS rules within <code>style</code> tags in an HTML document. Finally, you can write CSS rules in an external style sheet, then reference that file in the HTML document. Even though the first two options have their use cases, most developers prefer external style sheets because they keep the styles separate from the HTML elements. This improves the readability and reusability of your code.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "The idea behind CSS is that you can use a selector to target an HTML element in the DOM (Document Object Model) and then apply a variety of attributes to that element to change the way it is displayed on the page.<br><br>In this section, you'll see how adding CSS styles to the elements of your CatPhotoApp can change it from simple text to something more.",
+          ""
+        ]
+      ],
+      "releasedOn": "",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "bad87fee1348bd9aedf08803",
+      "title": "Change the Color of Text",
+      "description": [
+        "Now let's change the color of some of our text.",
+        "We can do this by changing the <code>style</code> of your <code>h2</code> element.",
+        "The style that is responsible for the color of an element's text is the \"color\" style.",
+        "Here's how you would set your <code>h2</code> element's text color to blue:",
+        "<code>&#60;h2 style=\"color: blue;\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+        "Note that it is a good practice to end inline <code>style</code> declarations with a <code>;</code> .",
+        "<hr>",
+        "Change your <code>h2</code> element's style so that its text color is red."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(code.match(/<h2\\s+style\\s*=\\s*(\\'|\")\\s*color\\s*:\\s*(?:rgb\\(\\s*255\\s*,\\s*0\\s*,\\s*0\\s*\\)|rgb\\(\\s*100%\\s*,\\s*0%\\s*,\\s*0%\\s*\\)|red|#ff0000|#f00|hsl\\(\\s*0\\s*,\\s*100%\\s*,\\s*50%\\s*\\))\\s*\\;?(\\'|\")>\\s*CatPhotoApp\\s*<\\/h2>/), 'message: Your <code>h2</code> element should be red.');",
+        "assert(code.match(/<h2\\s+style\\s*=\\s*(\\'|\")\\s*color\\s*:\\s*(?:rgb\\(\\s*255\\s*,\\s*0\\s*,\\s*0\\s*\\)|rgb\\(\\s*100%\\s*,\\s*0%\\s*,\\s*0%\\s*\\)|red|#ff0000|#f00|hsl\\(\\s*0\\s*,\\s*100%\\s*,\\s*50%\\s*\\))\\s*\\;(\\'|\")>\\s*CatPhotoApp\\s*<\\/h2>/),' message: Your <code>style</code> declaration should end with a <code>;</code> .');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Lass uns jetzt die Farbe von unserem Text ändern.",
+            "Wir können das bewerkstelligen, indem wir den <code>style</code> des <code>h2</code> Elements ändern.",
+            "Der Style, der zuständig für die Textfarbe eines Elements ist, ist der \"color\" Style.",
+            "So könntest du die Textfarbe des <code>h2</code> Elements in Blau ändern:",
+            "<code>&#60;h2 style=\"color: blue\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Ändere den Style des <code>h2</code> Elements, damit die Textfarbe rot (\"red\") ist."
+          ]
+        },
+        "fr": {
+          "title": "Changer la couleur du texte",
+          "description": [
+            "Changeons maintenant la couleur de quelques-uns de nos textes.",
+            "Nous pouvons le faire en changeant le <code>style</code> de votre élément <code>h2</code>.",
+            "Le style responsable de la couleur de texte d'un élément est \"color\".",
+            "Voici comment changer en bleu la couleur du texte de votre élément <code>h2</code> :",
+            "<code>&#60;h2 style=\"color: blue\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Changez le style de votre élément <code>h2</code> pour que son texte soit de couleur rouge."
+          ]
+        },
+        "pt-br": {
+          "title": "Substitua a Cor do Texto",
+          "description": [
+            "Agora vamos substituir a cor de parte do nosso texto.",
+            "Podemos fazer isso mudando o <code>style</code> do elemento <code>h2</code>.",
+            "A propriedade de estilo responsável pela cor do texto se chama \"color\".",
+            "Você pode mudar a cor do texto de seu elemento <code>h2</code> para azul assim:",
+            "<code>&#60;h2 style=\"color: blue\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Mude o estilo do elemento <code>h2</code> para que seu texto fique com a cor vermelha."
+          ]
+        },
+        "ru": {
+          "title": "Измените цвет текста",
+          "description": [
+            "Теперь давайте изменим цвет части нашего текста.",
+            "Мы можем сделать это изменив <code>style</code> нашего элемента <code>h2</code>.",
+            "Параметр стиля, отвечающий за цвет текста внутри элемента - \"color\".",
+            "Вот как вы могли бы установить цвет текста вашего элемента <code>h2</code> синим:",
+            "<code>&#60;h2 style=\"color: blue\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Измените стиль вашего элемента <code>h2</code> таким образом, чтобы текст элемента стал красным."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08805",
+      "title": "Use CSS Selectors to Style Elements",
+      "description": [
+        "With CSS, there are hundreds of CSS <code>properties</code> that you can use to change the way an element looks on your page.",
+        "When you entered <code>&#60;h2 style=\"color: red\"&#62;CatPhotoApp&#60;/h2&#62;</code>, you were giving that individual <code>h2</code> element an <code>inline style</code>.",
+        "That's one way to add style to an element, but there's a better way to use <code>CSS</code>, which stands for <code>Cascading Style Sheets</code>.",
+        "At the top of your code, create a <code>style</code> element like this:",
+        "<blockquote>&#60;style&#62;<br>&#60;/style&#62;</blockquote>",
+        "Inside that style element, you can create a <code>CSS selector</code> for all <code>h2</code> elements. For example, if you wanted all <code>h2</code> elements to be red, your style element would look like this:",
+        "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;h2 {color: red;}<br>&#60;/style&#62;</blockquote>",
+        "Note that it's important to have both opening and closing curly braces (<code>{</code> and <code>}</code>) around each element's style. You also need to make sure your element's style is between the opening and closing style tags. Finally, be sure to add the semicolon to the end of each of your element's styles.",
+        "<hr>",
+        "Delete your <code>h2</code> element's style attribute and instead create a CSS <code>style</code> element. Add the necessary CSS to turn all <code>h2</code> elements blue."
+      ],
+      "challengeSeed": [
+        "<h2 style=\"color: red\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(!$(\"h2\").attr(\"style\"), 'message: Remove the style attribute from your <code>h2</code> element.');",
+        "assert($(\"style\") && $(\"style\").length > 1, 'message: Create a <code>style</code> element.');",
+        "assert($(\"h2\").css(\"color\") === \"rgb(0, 0, 255)\", 'message: Your <code>h2</code> element should be blue.');",
+        "assert(code.match(/h2\\s*\\{\\s*color\\s*:.*;\\s*\\}/g), 'message: Ensure that your stylesheet <code>h2</code> declaration is valid with a semicolon and closing brace.');",
+        "assert(code.match(/<\\/style>/g) && code.match(/<\\/style>/g).length === (code.match(/<style((\\s)*((type|media|scoped|title|disabled)=\"[^\"]*\")?(\\s)*)*>/g) || []).length, 'message: Make sure all your <code>style</code> elements are valid and have a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "CSS liefert dir hunderte Attribute oder <code>properties</code> um HTML Elemente auf deiner Seite zu gestalten.",
+            "Mit <code>&#60;h2 style=\"color: red\"&#62;CatPhotoApp&#60;/h2&#62;</code> hast du dem einzelnen <code>h2</code> Element einen sogenannten <code>inline style</code> gegeben.",
+            "Das ist ein Weg, um Elemente zu gestalten. Es ist aber besser <code>CSS</code>, was für <code>Cascading Style Sheets</code> steht, zu benutzen.",
+            "Erstelle über deinem Code ein <code>style</code> Element:",
+            "<blockquote>&#60;style&#62;<br>&#60;/style&#62;</blockquote>",
+            "Innerhalb des Style Elements kannst du einen <code>CSS selector</code> für alle <code>h2</code> Elemente erstellen. Wenn du zum Beispiel alle <code>h2</code> Elemente rot färben willst, schreibst du:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;h2 {color: red;}<br>&#60;/style&#62;</blockquote>",
+            "Beachte, dass du öffnende und schließende geschwungene Klammern (<code>{</code> und <code>}</code>) um jeden Style setzen musst. Außerdem musst du sichergehen, dass deine Styles innerhalb dieser Klammern stehen. Zum Schluss benötigst du am Ende jedes Styles ein Semikolon.",
+            "<hr>",
+            "Lösche das Style Attribute deines <code>h2</code> Elements und erstelle stattdessen ein CSS <code>style</code> Element. Füge das notwendige CSS hinzu, um alle <code>h2</code> Elemente Blau zu färben."
+          ]
+        },
+        "fr": {
+          "title": "Utiliser les sélecteurs CSS pour styliser des éléments",
+          "description": [
+            "Avec CSS, il y a des centaines de <code>propriétés</code> que vous pouvez utliser pour changer l'apparence d'un élément dans votre page.",
+            "Quand vous avez entré <code>&#60;h2 style=\"color: red\"&#62;CatPhotoApp&#60;/h2&#62;</code>, vous donniez à cet élément <code>h2</code> uniquement, un style <code>inline</code>.",
+            "C'est une des façons d'ajouter un style à un élément, mais une meilleure approche est d'utiliser <code>CSS</code>, acronyme de <code>Cascading Style Sheets</code>.",
+            "Au sommet de votre code, créez un élément <code>style</code> comme ceci :",
+            "<blockquote>&#60;style&#62;<br>&#60;/style&#62;</blockquote>",
+            "À l'intérieur de cet élément style, vous pouvez créer des <code>sélecteurs CSS</code> pour tous les éléments <code>h2</code>. Par exemple, si vous voulez que tous les éléments <code>h2</code> soient en rouge, votre élément style ressemblerait à ceci :",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;h2 {color: red;}<br>&#60;/style&#62;</blockquote>",
+            "Prenez note qu'il est important d'avoir les accolades ouvrantes et fermantes (<code>{</code> and <code>}</code>) autour de chaque élément de style. Vous devez aussi vous assurer que vos styles se retrouvent entre une balise style ouvrante et fermante. Finalement, assurez-vous d'ajouter un point-virgule â la fin de chacun des styles d'éléments.",
+            "<hr>",
+            "Supprimez les attributs de styles de votre élément <code>h2</code> et créez plutôt un élément de <code>style</code> CSS. Ajoutez le CSS nécessaire pour rendre tous vos éléments <code>h2</code> de couleur bleu."
+          ]
+        },
+        "pt-br": {
+          "title": "Use Seletores CSS para Estilizar Elementos",
+          "description": [
+            "Com o CSS, existem centenas de <code>propriedades</code> que você pode utilizar para modificar a forma de como um elemento pode ser visto em uma página da internet.",
+            "Quando você usou o <code>&#60;h2 style=\"color: red\"&#62;CatPhotoApp&#60;h2&#62;</code>, você deu ao elemento <code>h2</code> um <code>estilo inline</code>.",
+            "Essa é uma forma de adicionar estilos a um elemento, mas o jeito recomendado para isso é utilizar <code>Folhas de Estilo em Cascata (Cascading Style Sheets, CSS)</code>.",
+            "Acima de seu código, crie um elemento <code>style</code> como esse: <code>&#60;style&#62;&#60;/style&#62;</code>",
+            "Dentro do elemento style, é possível criar um <code>seletor CSS</code> para todos os elementos <code>h2</code>. Por exemplo, se você quiser que todos os elementos <code>h2</code> tenham a cor vermelha, seu elemento style será assim:",
+            "<code>&#60;style&#62;</code>",
+            "&nbsp;&nbsp;<code>h2 {color: red;}</code>",
+            "<code>&#60;/style&#62;</code>",
+            "Observe que é importante utilizar as chaves de abertura e de fechamento (<code>{</code> e <code>}</code>) ao redor do estilo de cada elemento. Também é necessário que o estilo de seu elemento esteja entre as tags de abertura e fechamento. Por fim, não se esqueça de adicionar o ponto-e-vírgula no final de cada um dos estilos de seu elemento.",
+            "<hr>",
+            "Apague o atributo <code>style</code> de seu elemento <code>h2</code> e então crie um elemento <code>style</code> CSS. Adicione o CSS necessário para fazer com que todos os elementos <code>h2</code> tenham a cor azul."
+          ]
+        },
+        "ru": {
+          "title": "Используйте CSS-селекторы для стилизации элементов",
+          "description": [
+            "В CSS существуют сотни CSS-<code>свойств</code>, которые вы можете использовать для изменения внешнего вида элементов вашей страницы.",
+            "Когда вы вводите <code>&#60;h2 style=\"color: red\"&#62;CatPhotoApp&#60;/h2&#62;</code>, вы присваиваете определённому <code>h2</code> элементу <code>встроенный стиль</code>.",
+            "Это один из способов добавления стиля к элементу, но лучший способ - использование <code>CSS</code>, который является сокращением от <code>Cascading Style Sheets (Каскадные таблицы стилей)</code>.",
+            "Вверху вашего кода создайте элемент <code>style</code> следующим образом:",
+            "<blockquote>&#60;style&#62;<br>&#60;/style&#62;</blockquote>",
+            "Внутри этого элемента <code>style</code> вы можете создать <code>CSS-селектор</code> для всех элементов <code>h2</code> в документе. Например, если бы вы хотели, чтобы все элементы <code>h2</code> были красными, ваш элемент <code>style</code> выглядел бы следующим образом:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;h2 {color: red;}<br>&#60;/style&#62;</blockquote>",
+            "Обратите внимание, что важно наличие открывающих и закрывающих фигурных скобок (<code>{</code> и <code>}</code>) вокруг стиля каждого элемента. Также вам необходимо убедиться в том, что стиль элемента присвоен внутри элемента <code>style</code>. В завершении, убедитесь, что строка объявления каждого элемента стиля должна заканчиваться точкой с запятой.",
+            "<hr>",
+            "Удалите атрибут стиль вашего элемента <code>h2</code> и взамен создайте CSS-элемент <code>style</code>. Добавьте необходимый CSS, чтобы все элементы <code>h2</code> стали синими."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aecf08806",
+      "title": "Use a CSS Class to Style an Element",
+      "description": [
+        "Classes are reusable styles that can be added to HTML elements.",
+        "Here's an example CSS class declaration:",
+        "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.blue-text {<br>&nbsp;&nbsp;&nbsp;&nbsp;color: blue;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+        "You can see that we've created a CSS class called <code>blue-text</code> within the <code>&#60;style&#62;</code> tag.",
+        "You can apply a class to an HTML element like this:",
+        "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+        "Note that in your CSS <code>style</code> element, classes should start with a period. In your HTML elements' class declarations, classes shouldn't start with a period.",
+        "<hr>",
+        "Inside your <code>style</code> element, change the <code>h2</code> selector to <code>.red-text</code> and update the color's value from <code>blue</code> to <code>red</code>.",
+        "Give your <code>h2</code> element the <code>class</code> attribute with a value of <code>'red-text'</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h2 {",
+        "    color: blue;",
+        "  }",
+        "</style>",
+        "",
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"h2\").css(\"color\") === \"rgb(255, 0, 0)\", 'message: Your <code>h2</code> element should be red.');",
+        "assert($(\"h2\").hasClass(\"red-text\"), 'message: Your <code>h2</code> element should have the class <code>red-text</code>.');",
+        "assert(code.match(/\\.red-text\\s*\\{\\s*color\\s*:\\s*red;\\s*\\}/g), 'message: Your stylesheet should declare a <code>red-text</code> class and have its color set to red.');",
+        "assert($(\"h2\").attr(\"style\") === undefined, 'message: Do not use inline style declarations like <code>style=\"color&#58; red\"</code> in your <code>h2</code> element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Klassen sind wiederverwendbare Styles, die HTML Elementen zugewiesen werden können.",
+            "So sieht eine CSS Klasse aus:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.blue-text {<br>&nbsp;&nbsp;&nbsp;&nbsp;color: blue;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "Du siehst, dass wir die CSS Klasse <code>blue-text</code> innerhalb von <code>&#60;style&#62;</code> geschrieben haben.",
+            "Du kannst eine Klasse folgendermaßen einem HTML Element beifügen:",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "Beachte, dass Klassen in deinem CSS <code>style</code> Element mit einem Punkt beginnen sollten. In deinen Klassen-Deklarationen von HTML Elementen sollten diese nicht mit einem Punkt beginnen.",
+            "<hr>",
+            "Ändere deinen <code>h2</code> Selektor innerhalb deines <code>style</code> Elements zu <code>.red-text</code> und ändere den Farbwert von <code>blue</code> zu <code>red</code>.",
+            "Gib deinem <code>h2</code> Element das <code>class</code> Attribut mit dem Wert <code>'red-text'</code>."
+          ]
+        },
+        "fr": {
+          "title": "Utiliser les classes CSS pour styler un élément",
+          "description": [
+            "Les classes sont des styles réutilisables qui peuvent être ajoutées à des éléments HTML.",
+            "Voici un exemple de déclaration de classe CSS :",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.blue-text {<br>&nbsp;&nbsp;&nbsp;&nbsp;color: blue;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "Remarquez que nous avons créer une classe CSS nommée <code>blue-text</code> à l'intérieur de notre balise <code>&#60;style&#62;</code>.",
+            "Vous pouvez appliquer une classe à un élément HTML comme ceci :",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "Prenez note que que dans votre élément CSS <code>style</code>, les classes doivent débuter par un point. Dans les déclarations de classes à l'intérieur des éléments HTML, on doit omettre le point du début.",
+            "<hr>",
+            "À l'intérieur de votre élément <code>style</code>, changez le sélecteur du <code>h2</code> pour <code>.red-text</code> et changez la couleur, passant de <code>blue</code> à <code>red</code>.",
+            "Donnez à votre élément <code>h2</code> l'attribut de classe la valeur de <code>red-text</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Use Classes CSS para Estilizar Elementos",
+          "description": [
+            "As classes são estilos reutilizáveis que podem ser adicionadas a elementos HTML.",
+            "Aqui está um exemplo de como declarar uma classe com CSS:",
+            "<code>&#60;style&#62;</code>",
+            "<code>&nbsp;&nbsp;.blue-text {</code>",
+            "<code>&nbsp;&nbsp;&nbsp;&nbsp;color: blue;</code>",
+            "<code>&nbsp;&nbsp;}</code>",
+            "<code>&#60;/style&#62;</code>",
+            "Veja que criamos uma classe CSS chamada \"blue-text\" no interior da tag <code>&#60;style&#62;</code>.",
+            "Você pode aplicar uma classe a um elemento HTML assim:",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "Note que em seu elemento <code>style</code> CSS, as classes devem começar com um ponto. Já nos elementos HTML, as declarações de classes não devem começar com o ponto.",
+            "<hr>",
+            "Ao invés de criar um novo elemento <code>style</code>, tente eliminar a declaração de estilo de <code>h2</code> dos elementos de estilo existentes, e troque ela pela declaração de classe <code>.red-text</code>.",
+            "Crie uma classe CSS chamada <code>red-text</code> e então a aplique em seu elemento <code>h2</code>."
+          ]
+        },
+        "ru": {
+          "title": "Используйте CSS-класс для стилизации элемента",
+          "description": [
+            "Классы являются повторно применяемыми стилями, которые могут быть добавлены к HTML-элементам.",
+            "Вот пример объявления CSS-класса:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.blue-text {<br>&nbsp;&nbsp;&nbsp;&nbsp;color: blue;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "Вы можете увидеть, что мы создали CSS-класс названный <code>blue-text</code> внутри элемента <code>&#60;style&#62;</code>.",
+            "Вы можете применить класс к HTML-элементу следующим образом:",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "Обратите внимание, что в вашем CSS-элементе <code>style</code> названию классов следует начинаться с точки. При присваивании классов HTML-элементам названия классов не должны начинаться с точки.",
+            "<hr>",
+            "Внутри вашего элемента <code>style</code>, замените селектор <code>h2</code> на <code>.red-text</code> и измените значение цвета с <code>blue</code> на <code>red</code>.",
+            "Присвойте вашему элементу <code>h2</code> атрибут <code>class</code> со значением <code>'red-text'</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aefe08806",
+      "title": "Style Multiple Elements with a CSS Class",
+      "description": [
+        "Classes allow you to use the same CSS styles on multiple HTML elements. You can see this by applying your <code>red-text</code> class to the first <code>p</code> element."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"h2\").css(\"color\") === \"rgb(255, 0, 0)\", 'message: Your <code>h2</code> element should be red.');",
+        "assert($(\"h2\").hasClass(\"red-text\"), 'message: Your <code>h2</code> element should have the class <code>red-text</code>.');",
+        "assert($(\"p:eq(0)\").css(\"color\") === \"rgb(255, 0, 0)\", 'message: Your first <code>p</code> element should be red.');",
+        "assert(!($(\"p:eq(1)\").css(\"color\") === \"rgb(255, 0, 0)\") && !($(\"p:eq(2)\").css(\"color\") === \"rgb(255, 0, 0)\"), 'message: Your second and third <code>p</code> elements should not be red.');",
+        "assert($(\"p:eq(0)\").hasClass(\"red-text\"), 'message: Your first <code>p</code> element should have the class <code>red-text</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Du kannst Klassen zu HTML Elementen hinzufügen, indem du zum Beispiel <code>class=\"deine-klasse\"</code> innerhalb des öffnenden Tags schreibst.",
+            "Vergiss nicht dass CSS Klassenselektoren einen Punkt am Anfang brauchen:",
+            "<blockquote>.blue-text {<br>&nbsp;&nbsp;color: blue;<br>}</blockquote>",
+            "Aber Klassen-Deklarationen brauchen keinen Punkt:",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Füge die <code>red-text</code> Klasse dem ersten <code>p</code> Element hinzu."
+          ]
+        },
+        "fr": {
+          "title": "Stylez plusieurs éléments avec une classe CSS",
+          "description": [
+            "Souvenez-vous que vous pouvez ajouter des classes aux éléments HTML en utilisant <code>class=\"votre-classe-ici\"</code> à l'intérieur de la balise ouvrante correspondante.",
+            "Souvenez-vous que les sélecteurs CSS nécessitent un point au début comme ceci :",
+            "<blockquote>.blue-text {<br>&nbsp;&nbsp;color: blue;<br>}</blockquote>",
+            "Rappelez-vous également que les déclarations de classes n'ont pas de point, comme ceci :",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Appliquez la classe <code>red-text</code> à votre premier élément <code>p</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Estilize Múltiplos Elementos com uma Classe CSS",
+          "description": [
+            "Lembre-se que é possível adicionar classes a elementos HTML ao utilizar <code>class=\"sua-classe-aqui\"</code> dentro da tag de abertura do elemento.",
+            "Relembre também que os seletores de classes CSS exigem um ponto em seu início, assim:",
+            "<code>.blue-text {</code>",
+            "<code>&nbsp;&nbsp;color: blue;</code>",
+            "<code>}</code>",
+            "Contudo, não se esqueça que as declarações de classes em elementos não utilizam ponto, assim:",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;h2&#62;</code>",
+            "<hr>",
+            "Adicione a classe <code>red-text</code> ao seu primeiro elemento <code>p</code>."
+          ]
+        },
+        "ru": {
+          "title": "Стилизуйте множество элементов с помощью CSS-класса",
+          "description": [
+            "Помните, что вы можете присваивать классы HTML-элементам используя <code>class=\"ваш-класс-тут\"</code> внутри открывающей метки соответствующего элемента.",
+            "Помните, что селекторы CSS-классов должны начинаться с точки, например:",
+            "<blockquote>.blue-text {<br>&nbsp;&nbsp;color: blue;<br>}</blockquote>",
+            "Но также не забывайте, что присваивание классов не использует точку, например:",
+            "<code>&#60;h2 class=\"blue-text\"&#62;CatPhotoApp&#60;/h2&#62;</code>",
+            "<hr>",
+            "Примените класс <code>red-text</code> к вашим элемент первые <code>p</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08806",
+      "title": "Change the Font Size of an Element",
+      "description": [
+        "Font size is controlled by the <code>font-size</code> CSS property, like this:",
+        "<blockquote>h1 {<br>&nbsp;&nbsp;font-size: 30px;<br>}</blockquote>",
+        "<hr>",
+        "Inside the same <code>&#60;style&#62;</code> tag that contains your <code>red-text</code> class, create an entry for <code>p</code> elements and set the <code>font-size</code> to 16 pixels (<code>16px</code>)."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(code.match(/p\\s*{\\s*font-size\\s*:\\s*16\\s*px\\s*;\\s*}/i), 'message: Between the <code>style</code> tags, give the <code>p</code> elements <code>font-size</code> of <code>16px</code>. Browser and Text zoom should be at 100%.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Schriftgröße wird von dem CSS Attribut <code>font-size</code> kontrolliert:",
+            "<blockquote>h1 {<br>&nbsp;&nbsp;font-size: 30px;<br>}</blockquote>",
+            "<hr>",
+            "Erstelle dann innerhalb deines <code>&#60;style&#62;</code> Elements, das auch deine <code>red-text</code> Klasse enthält, einen Eintrag für <code>p</code> Elemente und setzte <code>font-size</code> auf 16 Pixel (<code>16px</code>)."
+          ]
+        },
+        "fr": {
+          "title": "Changez la taille de police d'un élément",
+          "description": [
+            "La taille de police est contrôlée par la propriété CSS <code>font-size</code>, comme ceci :",
+            "<blockquote>h1 {<br>&nbsp;&nbsp;font-size: 30px;<br>}</blockquote>",
+            "<hr>",
+            "À l'intérieur de la même balise <code>&#60;style&#62;</code> qui contiens votre classe <code>.red-text</code>, créez une nouvelle entrée pour les éléments <code>p</code> et paramétrer le <code>font-size</code> à 16 pixels (<code>16px</code>)."
+          ]
+        },
+        "pt-br": {
+          "title": "Mude o Tamanho da Fonte de um Elemento",
+          "description": [
+            "O tamanho da fonte é controlado pela propriedade CSS \"font-size\", como aqui:",
+            "<code>h1 {</code>",
+            "<code>&nbsp;&nbsp;font-size: 30px;</code>",
+            "<code>}</code>",
+            "<hr>",
+            "Dentro da mesma tag <code>&#60;style&#62;</code> que criamos para sua classe <code>red-text</code>, modifique o <code>font-size</code> dos elementos <code>p</code> para que tenha um tamanho de 16 pixels (<code>16px</code>)."
+          ]
+        },
+        "ru": {
+          "title": "Измените размер шрифта элемента",
+          "description": [
+            "Размером шрифта управляют с помощтю CSS-своайства <code>font-size</code>, например:",
+            "<blockquote>h1 {<br>&nbsp;&nbsp;font-size: 30px;<br>}</blockquote>",
+            "<hr>",
+            "Внутри того же элемента <code>&#60;style&#62;</code>, который содержит ваш класс <code>red-text</code>, создайте вхождение для элементов <code>p</code> и установите свойство <code>font-size</code> равным 16 пикселей (<code>16px</code>)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aede08807",
+      "title": "Set the Font Family of an Element",
+      "description": [
+        "You can set an element's font by using the <code>font-family</code> property.",
+        "For example, if you wanted to set your <code>h2</code> element's font to <code>Sans-Serif</code>, you would use the following CSS:",
+        "<blockquote>h2 {<br>&nbsp;&nbsp;font-family: Sans-Serif;<br>}</blockquote>",
+        "<hr>",
+        "Make all of your <code>p</code> elements use the <code>Monospace</code> font."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"p\").not(\".red-text\").css(\"font-family\").match(/monospace/i), 'message: Your <code>p</code> elements should use the font <code>Monospace</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Du kannst einem Element mit <code>font-family</code> eine Schriftart zuweisen.",
+            "Wenn du zum Beispiel deinem <code>h2</code> Element die Schriftart <code>Sans-Serif</code> zuweisen willst, kannst du das mit dem folgenden CSS tun:",
+            "<blockquote>h2 {<br>&nbsp;&nbsp;font-family: Sans-Serif;<br>}</blockquote>",
+            "<hr>",
+            "Definiere für alle <code>p</code> Elemente die Schriftart <code>Monospace</code>."
+          ]
+        },
+        "fr": {
+          "title": "Paramétrer la famille de police d'un élément",
+          "description": [
+            "Vous pouvez paramétrer la police d'un élément en utilisant la propriété <code>font-family</code>.",
+            "Par exemple, si vous voulez paramétrer la police de votre élément <code>h2</code> à <code>Sans-Serif</code>, vous devez utiliser le CSS suivant :",
+            "<blockquote>h2 {<br>&nbsp;&nbsp;font-family: Sans-Serif;<br>}</blockquote>",
+            "<hr>",
+            "Faites en sorte que tous vos éléments <code>p</code> aient la police <code>Monospace</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Defina a Fonte para um Elemento",
+          "description": [
+            "Você pode estabelecer o estilo de fonte para um elemento ao utilizar a propriedade <code>font-family</code>.",
+            "Por exemplo, se você quiser estabelecer o estilo de fonte de seu elemento <code>h2</code> como <code>Sans-Serif</code>, você poderá utilizar o seguinte código em CSS:",
+            "<code>h2 {</code>",
+            "<code>&nbsp;&nbsp;font-family: Sans-Serif;</code>",
+            "<code>}</code>",
+            "<hr>",
+            "Faça com que todos os elementos <code>p</code> utilizem o estilo de fonte <code>Monospace</code>."
+          ]
+        },
+        "ru": {
+          "title": "Установите семейство шрифтов для элемента",
+          "description": [
+            "Вы можете установить семейство шрифтов для элемента используя свойство <code>font-family</code>.",
+            "Например, если бы вы хотели установить семейство шрифтов <code>Sans-Serif</code> для вашего элемента <code>h2</code>, вы бы использовали следующий CSS:",
+            "<blockquote>h2 {<br>&nbsp;&nbsp;font-family: Sans-Serif;<br>}</blockquote>",
+            "<hr>",
+            "Присвойте шрифт <code>Monospace</code> всем вашим элементам <code>p</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08807",
+      "title": "Import a Google Font",
+      "description": [
+        "Now, let's import and apply a Google font (note that if Google is blocked in your country, you will need to skip this challenge).",
+        "<a href='https://fonts.google.com/' target='_blank'>Google Fonts</a> is a free library of web fonts that you can use in your CSS by referencing the font's URL.",
+        "To import a Google Font, you can copy the font(s) URL from the Google Fonts library and then paste it in your HTML. For this challenge, we'll import the <code>Lobster</code> font. To do this, copy the following code snippet and paste it into the top of your code editor:",
+        "<code>&#60;link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\"&#62;</code>",
+        "Now you can use the <code>Lobster</code> font in your CSS by using <code>Lobster</code> as the FAMILY_NAME as in the following example:<br><code>font-family: FAMILY_NAME, GENERIC_NAME;</code>.",
+        "The GENERIC_NAME is optional, and is a fallback font in case the other specified font is not available. This is covered in the next challenge.",
+        "Family names are case-sensitive and need to be wrapped in quotes if there is a space in the name. For example, you need quotes to use the <code>\"Open Sans\"</code> font, but not to use the <code>Lobster</code> font.",
+        "<hr>",
+        "Create a CSS rule for the <code>font-family</code> of <code>Lobster</code> and apply this new font to your <code>h2</code> element."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(new RegExp(\"googleapis\", \"gi\").test(code), 'message: Import the <code>Lobster</code> font.');",
+        "assert($(\"h2\").css(\"font-family\").match(/lobster/i), 'message: Your <code>h2</code> element should use the font <code>Lobster</code>.');",
+        "assert(/\\s*h2\\s*\\{\\s*font-family\\:\\s*(\\'|\")?Lobster(\\'|\")?\\s*;\\s*\\}/gi.test(code), 'message: Use an <code>h2</code> CSS selector to change the font.');",
+        "assert($(\"p\").css(\"font-family\").match(/monospace/i), 'message: Your <code>p</code> element should still use the font <code>Monospace</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Lass uns jetzt eine Google Font importieren und verwenden. (Beachte dass du diese Challenge überspringen musst, falls Google in deinem Land blockiert wird)",
+            "Zuerst musst du einen <code>call</code> (Anfrage) an Google machen um um auf <code>Lobster</code> zugreifen und in dein HMTL einbinden zu können.",
+            "Kopiere den folgenden Code und füge diesen in deinen Editor oben ein:",
+            "<code>&#60;link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\"&#62;</code>",
+            "Jetzt kannst du \"Lobster\" als font-family Attribut zu deinem <code>h2</code> Element hinzufügen.",
+            "<hr>",
+            "Füge dem <code>h2</code> Element die Schriftart oder <code>font-family</code> <code>Lobster</code> hinzu."
+          ]
+        },
+        "fr": {
+          "title": "Importer une police de Google",
+          "description": [
+            "Maintenant, importons et appliquons une police de Google (prenez note que si Google est interdit d'accès dans votre pays, vous devrez omettre ce défi).",
+            "Premièrement, vous devrez faire un <code>appel</code> vers Google pour prendre la police <code>Lobster</code> et la charger dans votre HTML.",
+            "Copier l'extrait de code suivant et coller le dans le haut de votre éditeur de code :",
+            "Maintenant vous pouvez paramétrer <code>Lobster</code> comme valeur de police de votre élément <code>h2</code>.",
+            "<hr>",
+            "Appliquer la valeur <code>Lobster</code> à la <code>font-family</code> de votre élément <code>h2</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Importe uma Fonte a Partir do Google Fonts",
+          "description": [
+            "Agora, vamos importar e aplicar um estilo de fonte por meio do Google Fonts.",
+            "Primeiro, faça um <code>chamado</code> ao Google Fonts para poder utilizar a fonte chamada <code>Lobster</code> e carregá-la em seu HTML.",
+            "Para fazer isso, copie o código abaixo e insira-o na parte superior de seu editor de texto:",
+            "<code>&#60;link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\"&#62;</code>",
+            "<hr>",
+            "Agora, estableça <code>Lobster</code> como o valor para font-family em seu elemento <code>h2</code>."
+          ]
+        },
+        "ru": {
+          "title": "Импортируйте шрифт Google",
+          "description": [
+            "Теперь давайте импортируем и применим шрифт Google (обратите внимание, что если Google заблокирован в ваней стране, вам нужно будет пропустить это испытание).",
+            "Сначала вам понадобится сделать <code>запрос</code> к Google для получения шрифта <code>Lobster</code> и загрузить его в ваш HTML.",
+            "Скопируйте следующй кусок кода и вставьте его в самый верх вашего редактора кода:",
+            "<code>&#60;link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\"&#62;</code>",
+            "Теперь вы можете установить шрифт <code>Lobster</code> в качестве значения семейства шрифтов для вашего <code>h2</code>.",
+            "<hr>",
+            "Примените свойство <code>font-family</code> со значением <code>Lobster</code> к вашему элементу <code>h2</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08808",
+      "title": "Specify How Fonts Should Degrade",
+      "description": [
+        "There are several default fonts that are available in all browsers. These generic font families include <code>Monospace</code>, <code>Serif</code> and <code>Sans-Serif</code>",
+        "When one font isn't available, you can tell the browser to \"degrade\" to another font.",
+        "For example, if you wanted an element to use the <code>Helvetica</code> font, but also degrade to the <code>Sans-Serif</code> font when <code>Helvetica</code> wasn't available, you could use this CSS style:",
+        "<blockquote>p {<br>&nbsp;&nbsp;font-family: Helvetica, Sans-Serif;<br>}</blockquote>",
+        "Generic font family names are not case-sensitive. Also, they do not need quotes because they are CSS keywords.",
+        "<hr>",
+        "To begin with, apply the <code>Monospace</code> font to the <code>h2</code> element, so that it now has two fonts - <code>Lobster</code> and <code>Monospace</code>.",
+        "In the last challenge, you imported the <code>Lobster</code> font using the <code>link</code> tag. Now comment out that import of the <code>Lobster</code> font from Google Fonts so that it isn't available anymore. Notice how your <code>h2</code> element degrades to the <code>Monospace</code> font.",
+        "<strong>Note</strong><br>If you have the Lobster font installed on your computer, you won't see the degradation because your browser is able to find the font."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"h2\").css(\"font-family\").match(/^\"?lobster/i), 'message: Your h2 element should use the font <code>Lobster</code>.');",
+        "assert(/\\s*h2\\s*\\{\\s*font-family\\:\\s*(\\'|\")?Lobster(\\'|\")?,\\s*Monospace\\s*;\\s*\\}/gi.test(code), 'message: Your h2 element should degrade to the font <code>Monospace</code> when <code>Lobster</code> is not available.');",
+        "assert(new RegExp(\"<!--[^fc]\", \"gi\").test(code), 'message: Comment out your call to Google for the <code>Lobster</code> font by putting <code>&#60!--</code> in front of it.');",
+        "assert(new RegExp(\"[^fc]-->\", \"gi\").test(code), 'message: Be sure to close your comment by adding <code>--&#62;</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Es gibt verschiedene Schriftarten, die jedem Browser standardmäßig zur Verfügung stehen. Das sind unter anderem <code>Monospace</code>, <code>Serif</code> und <code>Sans-Serif</code>.",
+            "Falls eine Font nicht verfügbar ist kannst du dem Browser sagen was er stattdessen verwenden soll.",
+            "Wenn du zum Beispiel einem Element die Schriftart <code>Helvetica</code> geben möchtest, aber gleichzeitig als Alertnative die Schrift <code>Sans-Serif</code> laden willst, falls <code>Helvetica</code> nicht verfügbar ist, kannst du diesen CSS Style verwenden:",
+            "<blockquote>p {<br>&nbsp;&nbsp;font-family: Helvetica, Sans-Serif;<br>}</blockquote>",
+            "<hr>",
+            "Kommentiere jetzt den Aufruf an Google Fonts aus, sodass <code>Lobster</code> nicht zur Verfügung steht. Beachte, wie nun alternativ die Schriftart <code>Monospace</code> geladen wird."
+          ]
+        },
+        "fr": {
+          "title": "Spécifier comment vos polices devraient dégrader",
+          "description": [
+            "Il y a plusieurs polices par défaut qui sont disponible dans tous les navigateurs Web. Ceci comprend <code>Monospace</code>, <code>Serif</code> et <code>Sans-Serif</code>.",
+            "Quand une police n'est pas disponible, vous pouvez demander au navigateur de \"dégrader\" vers une autre police.",
+            "Par exemple, si vous voulez qu'un élément utilise la police <code>Helvetica</code>, mais également dégrader vers <code>Sans-Serif</code> lorsque la police <code>Helvetica</code> n'est pas disponible, vous pouvez utiliser le style CSS suivant :",
+            "<blockquote>p {<br>&nbsp;&nbsp;font-family: Helvetica, Sans-Serif;<br>}</blockquote>",
+            "<hr>",
+            "Maintenant, commenter votre appel vers les polices de Google, pour que la police <code>Lobster</code> ne soit pas disponible. Regardez comment la police se dégrade vers <code>Monospace</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Especifique como as Fontes Devem se Degradar",
+          "description": [
+            "Existem diversas fontes que estão disponíveis por padrão nos navegadores de internet, incluindo <code>Monospace</code>, <code>Serif</code> e <code>Sans-Serif</code>.",
+            "No entanto, quando uma fonte não está disponível, podemos dizer ao navegador que \"degrade\" a outro tipo de fonte.",
+            "Por exemplo, se você deseja que um elemento use a fonte <code>Helvetica</code>, e que degrade para a fonte <code>Sans-Serif</code> quando a <code>Helvetica</code> não estiver disponível, você pode utilizar o seguinte CSS:",
+            "<code>p {</code>",
+            "<code>&nbsp;&nbsp;font-family: Helvetica, Sans-Serif;</code>",
+            "<code>}</code>",
+            "<hr>",
+            "Agora, comente o seu chamado para a fonte do Google, para que a fonte <code>Lobster</code> não esteja disponível. Note como a fonte degrada para <code>Monospace</code>."
+          ]
+        },
+        "ru": {
+          "title": "Укажите порядок деградации шрифтов",
+          "description": [
+            "Существует несколько стандартных шрифтов, которые доступны во всех браузерах. Среди них <code>Monospace</code>, <code>Serif</code> и <code>Sans-Serif</code>",
+            "Когда один шрифт недоступен, вы можете сообщить браузеру \"деградировать\" до другого шрифта.",
+            "Например, если бы вы хотели, чтобы элемент использовал шрифт <code>Helvetica</code>, но также деградировал до шрифта <code>Sans-Serif</code>, когда <code>Helvetica</code> недоступен, вы могли бы использовать этот CSS-стиль:",
+            "<blockquote>p {<br>&nbsp;&nbsp;font-family: Helvetica, Sans-Serif;<br>}</blockquote>",
+            "<hr>",
+            "Теперь закомментируйте ваш запрос к Google Fonts, таким образом шрифт <code>Lobster</code> становится недоступен. Обратите внимание как происходит деградация до шрифта <code>Monospace</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9acdf08812",
+      "title": "Size Your Images",
+      "description": [
+        "CSS has a property called <code>width</code> that controls an element's width. Just like with fonts, we'll use <code>px</code> (pixels) to specify the image's width.",
+        "For example, if we wanted to create a CSS class called <code>larger-image</code> that gave HTML elements a width of 500 pixels, we'd use:",
+        "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.larger-image {<br>&nbsp;&nbsp;&nbsp;&nbsp;width: 500px;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+        "<hr>",
+        "Create a class called <code>smaller-image</code> and use it to resize the image so that it's only 100 pixels wide.",
+        "<strong>Note</strong><br>Due to browser implementation differences, you may need to be at 100% zoom to pass the tests on this challenge."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"img[src='https://bit.ly/fcc-relaxing-cat']\").attr('class') === \"smaller-image\", 'message: Your <code>img</code> element should have the class <code>smaller-image</code>.');",
+        "assert($(\"img\").width() === 100, 'message: Your image should be 100 pixels wide. Browser zoom should be at 100%.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Die Breite eines Elements wird mit dem CSS Attribut <code>width</code> kontrolliert. Wie bei Schriftarten verwenden wir Pixel <code>px</code> um die Größe zu definieren.",
+            "Wenn wir also die CSS Klasse <code>larger-image</code> erstellen wollen, um HTML Elementen eine Breite von 500 Pixeln zu verleihen, verwenden wir:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.larger-image {<br>&nbsp;&nbsp;&nbsp;&nbsp;width: 500px;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "<hr>",
+            "Erstelle eine Klasse mit dem Namen <code>smaller-image</code> und verwende sie, um dein Bild auf 100 Pixel zu skalieren.",
+            "<strong>Notiz</strong><br>Aufgrund verschiedener Brower Implementierungen, könnte es sein dass du auf 100% Zoom sein musst um die Tests zu bestehen."
+          ]
+        },
+        "fr": {
+          "title": "Redimensionner vos images",
+          "description": [
+            "Le CSS a une propriété nommé <code>width</code> qui contrôle la largeur d'un élément. Comme pour les polices, nous utiliserons <code>px</code> (pixels) pour déterminer la largeur d'une image.",
+            "Par exemple, si nous voulons créer une classe CSS nommée <code>larger-image</code> qui donnne aux éléments une largeur de 500 pixels, nous utilisons :",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.larger-image {<br>&nbsp;&nbsp;&nbsp;&nbsp;width: 500px;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "<hr>",
+            "Créez une classe nommée <code>smaller-image</code> et utilisez la pour redimensionner l'image pour qu'elle ai 100 pixels de large.",
+            "<strong>Prenez note</strong><br>Dû aux différences entre les navigateurs Web, votre niveau de zoom devrait être à 100% pour passer les tests de ce défi."
+          ]
+        },
+        "pt-br": {
+          "title": "Dê um Tamanho para suas Imagens",
+          "description": [
+            "O CSS possui uma propriedade chamada <code>width</code>, que controla a largura de um elemento. Da mesma forma que com as fontes, vamos utilizar <code>px</code> (pixels) como medida para especificar a largura de nossa imagem.",
+            "Por exemplo, se queremos criar uma classe CSS chamada <code>larger-image</code> que dê aos elementos HTML uma largura de 500px, vamos usar:",
+            "<code>&#60;estilo&#62;</code>",
+            "<code>&nbsp;&nbsp;.larger-image{</code>",
+            "<code>&nbsp;&nbsp;&nbsp;&nbsp;width: 500px;</code>",
+            "<code>&nbsp;&nbsp;}</code>",
+            "<code>&#60;/style&#62;</code>",
+            "<hr>",
+            "Crie uma classe chamada <code>smaller-image</code> e a utilize para mudar o tamanho da imagem para que ela tenha apenas 100 pixels de largura."
+          ]
+        },
+        "ru": {
+          "title": "Установите размер ваших изображений",
+          "description": [
+            "В CSS есть свойтсво, называемое <code>width</code>, которе управляет шириной элемента. По аналогии со шрифтами, мы используем <code>px</code> (пиксели) для указания ширины изображения.",
+            "Например, если бы мы хотели создать CSS-класс <code>larger-image</code>, который присваивал бы HTML-эементам ширину равную 500 пикселей, мы бы использовали:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.larger-image {<br>&nbsp;&nbsp;&nbsp;&nbsp;width: 500px;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "<hr>",
+            "Создайте класс <code>smaller-image</code> и используйте его для изменения размера изображений до 100 пикселей в ширину.",
+            "<strong>Внимание</strong><br>По причине разницы в реализации браузеров, вам может понадобиться установить 100% масштаб окна браузера для прохождения этого испытания."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9bedf08813",
+      "title": "Add Borders Around Your Elements",
+      "description": [
+        "CSS borders have properties like <code>style</code>, <code>color</code> and <code>width</code>",
+        "For example, if we wanted to create a red, 5 pixel border around an HTML element, we could use this class:",
+        "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.thin-red-border {<br>&nbsp;&nbsp;&nbsp;&nbsp;border-color: red;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-width: 5px;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-style: solid;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+        "<hr>",
+        "Create a class called <code>thick-green-border</code> that puts a 10-pixel-wide green border with a style of <code>solid</code> around an HTML element, and apply that class to your cat photo.",
+        "Remember that you can apply multiple classes to an element by separating each class with a space within its <code>class</code> attribute. For example:",
+        "<code>&lt;img class=\"class1 class2\"&gt;</code>"
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"img\").hasClass(\"smaller-image\"), 'message: Your <code>img</code> element should have the class <code>smaller-image</code>.');",
+        "assert($(\"img\").hasClass(\"thick-green-border\"), 'message: Your <code>img</code> element should have the class <code>thick-green-border</code>.');",
+        "assert($(\"img\").hasClass(\"thick-green-border\") && parseInt($(\"img\").css(\"border-top-width\"), 10) >= 8 && parseInt($(\"img\").css(\"border-top-width\"), 10) <= 12, 'message: Give your image a border width of <code>10px</code>.');",
+        "assert($(\"img\").css(\"border-right-style\") === \"solid\", 'message: Give your image a border style of <code>solid</code>.');",
+        "assert($(\"img\").css(\"border-left-color\") === \"rgb(0, 128, 0)\", 'message: The border around your <code>img</code> element should be green.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "CSS Rahmen haben Attribute wie <code>style</code>, <code>color</code> und <code>width</code>",
+            "Wenn wir nun einen roten, 5 Pixel dicken Rahmen um ein HTML Element setzen wollen, könnten wir diese Klasse verwenden:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.thin-red-border {<br>&nbsp;&nbsp;&nbsp;&nbsp;border-color: red;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-width: 5px;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-style: solid;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "<hr>",
+            "Erstelle die Klasse <code>thick-green-border</code>, welche einen 10 Pixel dicken, grünen Rahmen mit dem Style <code>solid</code> um ein HTML Element setzt. Füge diese Klasse deinem Katzenfoto hinzu.",
+            "Vergiss nicht, dass du einem Element mehrere Klassen geben kannst indem du jede Klasse mit einem Leerzeichen im <code>class</code> Attribut trennst. Zum Beispiel:",
+            "<code>&lt;img class=\"class1 class2\"&gt;</code>"
+          ]
+        },
+        "fr": {
+          "title": "Ajouter des bordures autour de vos éléments",
+          "description": [
+            "Les bordures CSS ont des propriétés comme <code>style</code>, <code>color</code> et <code>width</code>",
+            "Par exemple, si nous voulons créer une bordure de 5 pixel rouge autour d'un élément HTML, nous pouvons utiliser cette classe :",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.thin-red-border {<br>&nbsp;&nbsp;&nbsp;&nbsp;border-color: red;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-width: 5px;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-style: solid;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "<hr>",
+            "Créer une classe nommée <code>thick-green-border</code> qui ajoute une bordure verte de 10 pixel avec un style <code>solid</code> autour d'un élément HTML. Appliquez ensuite cette classe sur votre photo de chat.",
+            "Souvenez-vous que vous pouvez appliquer plus d'une classe sur un élément en les séparant par un espace, le tout dans l'attribut <code>class</code> de l'élément. Par exemple :",
+            "<code>&lt;img class=\"class1 class2\"&gt;</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Adicione Bordas ao Redor de seus Elementos",
+          "description": [
+            "As bordas em CSS possuem propriedades como <code>style</code>, <code>color</code> e <code>width</code>",
+            "Por exemplo, se queremos criar uma borda com tamanho de 5 pixels de cor vermelha ao redor de um elemento HTML, podemos utilizar esta classe:",
+            "<code>&#60;style&#62;</code>",
+            "<code>&nbsp;&nbsp;.thin-red-border {</code>",
+            "<code>&nbsp;&nbsp;&nbsp;&nbsp;border-color: red;</code>",
+            "<code>&nbsp;&nbsp;&nbsp;&nbsp;border-width: 5px;</code>",
+            "<code>&nbsp;&nbsp;&nbsp;&nbsp;border-style: solid;</code>",
+            "<code>&nbsp;&nbsp;}</code>",
+            "<code>&#60;/style&#62;</code>",
+            "<hr>",
+            "Crie uma classe chamada <code>thick-green-border</code> que insira uma borda verde de 10 pixels de largura com um estilo <code>solid</code> ao redor de um elemento HTML, e então adicione essa classe em sua foto com o gato.",
+            "Lembre que você pode aplicar diversas classes a um elemento separando cada uma das classes com um espaço, dentro do atributo <code>class</code>. Por exemplo:",
+            "<code>&lt;img class=\"clase1 clase2\"&gt;</code>"
+          ]
+        },
+        "ru": {
+          "title": "Дбавьте границы вокруг ваших элементов",
+          "description": [
+            "CSS-границы имеют свойства: <code>style</code>, <code>color</code> и <code>width</code>",
+            "Например, если бы мы хотели создать красную границу шириной в 5 пикселей вокруг HTML-элемента, мы могли бы использовать этот класс:",
+            "<blockquote>&#60;style&#62;<br>&nbsp;&nbsp;.thin-red-border {<br>&nbsp;&nbsp;&nbsp;&nbsp;border-color: red;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-width: 5px;<br>&nbsp;&nbsp;&nbsp;&nbsp;border-style: solid;<br>&nbsp;&nbsp;}<br>&#60;/style&#62;</blockquote>",
+            "<hr>",
+            "Создайте класс <code>thick-green-border</code>, который добавляет зелёную границу шириной в 10 пикселей со стилем <code>solid</code> вокруг HTML-элемента и примените этот класс к вашему фото кота.",
+            "Помните, что вы можете может применить множество классов к одному элементу путём разделения их с помощью пробела внутри атрибута <code>class</code>. Например:",
+            "<code>&lt;img class=\"class1 class2\"&gt;</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08814",
+      "title": "Add Rounded Corners with border-radius",
+      "description": [
+        "Your cat photo currently has sharp corners. We can round out those corners with a CSS property called <code>border-radius</code>.",
+        "<hr>",
+        "You can specify a <code>border-radius</code> with pixels. Give your cat photo a <code>border-radius</code> of <code>10px</code>.",
+        "Note: this waypoint allows for multiple possible solutions. For example, you may add <code>border-radius</code> to either the <code>.thick-green-border</code> class or <code>.smaller-image</code> class."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"img\").hasClass(\"thick-green-border\"), 'message: Your image element should have the class \"thick-green-border\".');",
+        "assert(parseInt($(\"img\").css(\"border-top-left-radius\")) > 8, 'message: Your image should have a border radius of <code>10px</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Füge abgerundete Ecken mit border-radius hinzu",
+          "description": [
+            "Dein Katzenfoto hat momentan spitze Ecken. Wir können diese Ecken mit dem CSS Attribut <code>border-radius</code> abrunden.",
+            "<hr>",
+            "Du kannst einen <code>border-radius</code> mit Pixeln deklarieren. Gib deinem Katzenfoto einen <code>border-radius</code> von <code>10px</code>.",
+            "Beachte dass es für diese Challenge verschiedene mögliche Lösungsansätze gibt. Zum Beispiel könntest du einen <code>border-radius</code> zu der <code>.thick-green-border</code> oder <code>.smaller-image</code> Klasse hinzufügen."
+          ]
+        },
+        "es": {
+          "title": "Agrega esquinas redondeadas usando border-radius",
+          "description": [
+            "Tu foto del gato tiene actualmente esquinas angulares. Podemos redondear esas esquinas con una propiedad CSS llamada <code>border-radius</code>.",
+            "<hr>",
+            "Puedes especificar <code>border-radius</code> usando pixeles. Dale a tu foto del gato un <code>border-radius</code> de <code>10px</code>.",
+            "Nota: este desafío acepta múltiples soluciones. Por ejemplo, puedes agregar <code>border-radius</code> ya sea a la clase <code>.thick-green-border</code> o a la clase <code>.smaller-image</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Insira Bordas Arredondadas com o border-radius",
+          "description": [
+            "Sua foto com o gato possui cantos pontiagudos. Podemos arredondar os cantos com uma propriedade CSS chamado <code>border-radius</code>.",
+            "<hr>",
+            "Você pode especificar um <code>border-radius</code> com pixels. Adicione um <code>border-radius</code> de <code>10px</code> para a sua foto.",
+            "Nota: Este desafio permite várias soluções possíveis. Por exemplo, você pode adicionar o <code>border-radius</code> tanto para a classe <code>.thick-green-border</code> como para a classe <code>.smaller-image</code>."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте скруглённые углы с помощью радиуса границы",
+          "description": [
+            "У вашего фото кота сейчас острые углы. Мы можем скруглить углы используя CSS-свойство <code>border-radius</code>.",
+            "<hr>",
+            "Вы можете указать значения <code>border-radius</code> в пикселях. Присвойте вашему фото кота свойство <code>border-radius</code> со значением <code>10px</code>.",
+            "Внимание: это задание подразумевает наличие нескольких возможных решений. Например, вы можете добавить <code>border-radius</code> как к классу <code>.thick-green-border</code>, так и к классу <code>.smaller-image</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08815",
+      "title": "Make Circular Images with a border-radius",
+      "description": [
+        "In addition to pixels, you can also specify a <code>border-radius</code> using a percentage.",
+        "<hr>",
+        "Give your cat photo a <code>border-radius</code> of <code>50%</code>."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 10px;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(parseInt($(\"img\").css(\"border-top-left-radius\")) > 48, 'message: Your image should have a border radius of <code>50%</code>, making it perfectly circular.');",
+        "assert(code.match(/50%/g), 'message: Be sure to use a percentage value of <code>50%</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle runde Bilder mit einem border-radius",
+          "description": [
+            "Du kannst einem <code>border-radius</code> neben Pixeln auch Prozentwerte zuweisen.",
+            "<hr>",
+            "Gib deinem Katzenfoto einen <code>border-radius</code> von <code>50%</code>."
+          ]
+        },
+        "es": {
+          "title": "Crea imágenes circulares usando border-radius",
+          "description": [
+            "Además de pixeles, puedes especificar un <code>border-radius</code> usando porcentajes.",
+            "<hr>",
+            "Dale a tu foto del gato un <code>border-radius</code> de <code>50%</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Deixe as Imagens Circulares com o border-radius",
+          "description": [
+            "Assim como pixels, você também pode usar o <code>border-radius</code> com porcentagens.",
+            "<hr>",
+            "Dê para a sua foto de gato um <code>border-radius</code> de <code>50%</code>."
+          ]
+        },
+        "ru": {
+          "title": "Сделайте круглые изображения с помощью радиуса границы",
+          "description": [
+            "В дополнение к пикселям, вы также может использовать проценты для указания значения свойства <code>border-radius</code>.",
+            "<hr>",
+            "Присвойте вашему фото кота свойство <code>border-radius</code> со значением <code>50%</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fed1348bd9aede07836",
+      "title": "Give a Background Color to a div Element",
+      "description": [
+        "You can set an element's background color with the <code>background-color</code> property.",
+        "For example, if you wanted an element's background color to be <code>green</code>, you'd put this within your <code>style</code> element:",
+        "<blockquote>.green-background {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+        "<hr>",
+        "Create a class called <code>silver-background</code> with the <code>background-color</code> of silver. Assign this class to your <code>div</code> element."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div>",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"div\").hasClass(\"silver-background\"), 'message: Give your <code>div</code> element the class <code>silver-background</code>.');",
+        "assert($(\".silver-background\").css(\"background-color\") === \"rgb(192, 192, 192)\", 'message: Your <code>div</code> element should have a silver background.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Gib einem div Element eine Hintergrundfarbe",
+          "description": [
+            "Du kannst die Hintergrundfarbe von einem Element mit dem <code>background-color</code> Attribut setzen",
+            "Wenn du zum Beispiel die Hintergrundfarbe von einem Element <code>green</code> machen willst, schreibe dies in dein <code>style</code> Element:",
+            "<blockquote>.green-background {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+            "<hr>",
+            "Erstelle eine Klasse namens <code>silver-background</code> mit der <code>background-color</code> grau (silver). Füge diese Klasse deinem <code>div</code> Element hinzu"
+          ]
+        },
+        "es": {
+          "title": "Da un color de fondo a un elemento div",
+          "description": [
+            "Puedes fijar el color de fondo de un elemento con la propiedad <code>background-color</code>.",
+            "Por ejemplo, si quieres que el color de fondo de un elemento sea verde (<code>green</code>), dentro de tu elemento <code>style</code> pondrías:",
+            "<blockquote>.green-background {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+            "<hr>",
+            "Crea una clase llamada <code>silver-background</code> con la propiedad <code>background-color</code> en gris (<code>silver</code>). Asigna esta clase a tu elemento <code>div</code> ."
+          ]
+        },
+        "pt-br": {
+          "title": "Dê uma Cor de Fundo a um Elemento div",
+          "description": [
+            "Você pode acrescentar uma cor de fundo de um elemento com a propriedade <code>background-color</code>.",
+            "Por exemplo, se você quiser que a cor de fundo de um elemento seja verde (<code>green</code>), dentro de seu elemento <code>style</code> seria assim:",
+            "<code>.green-background {</code>",
+            "<code>&nbsp;&nbsp;background-color: green;</code>",
+            "<code>}</code>",
+            "<hr>",
+            "Crie uma classe chamada <code>silver-background</code> com a propriedade <code>background-color</code> em cinza (<code>silver</code>). Depois, adicione essa classe ao seu elemento <code>div</code>."
+          ]
+        },
+        "ru": {
+          "title": "Присвойте цвет фона элементу div",
+          "description": [
+            "Вы можете установить цвет фона элемента с помощью свойства <code>background-color</code>.",
+            "Например, если бы вы хотели установить цвет фона элемента <code>зелёным</code>, вы бы использовали следующий стиль внутри вашего элемента <code>style</code>:",
+            "<blockquote>.green-background {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+            "<hr>",
+            "Создайте класс <code>silver-background</code> со значением свойства <code>background-color</code> равным <code>silver</code>. Назначьте этот класс вашему элементу <code>div</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87eee1348bd9aede07836",
+      "title": "Set the id of an Element",
+      "description": [
+        "In addition to classes, each HTML element can also have an <code>id</code> attribute.",
+        "There are several benefits to using <code>id</code> attributes: You can use an <code>id</code> to style a single element and later you'll learn that you can use them to select and modify specific elements with JavaScript.",
+        "<code>id</code> attributes should be unique. Browsers won't enforce this, but it is a widely agreed upon best practice. So please don't give more than one element the same <code>id</code> attribute.",
+        "Here's an example of how you give your <code>h2</code> element the id of <code>cat-photo-app</code>:",
+        "<code>&#60;h2 id=\"cat-photo-app\"></code>",
+        "<hr>",
+        "Give your <code>form</code> element the id <code>cat-photo-form</code>."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "",
+        "  .silver-background {",
+        "    background-color: silver;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div class=\"silver-background\">",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"form\").attr(\"id\") === \"cat-photo-form\", 'message: Give your <code>form</code> element the id of <code>cat-photo-form</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Setze die ID von einem Element",
+          "description": [
+            "Zusätzlich zu Klassen, kann jedes HTML Element auch ein <code>id</code> Attribut haben.",
+            "Es hat mehrere Vorteile <code>id</code> Attribute zu verwenden und du wirst mehr über diese erfahren wenn du anfängst mit jQuery zu arbeiten.",
+            "<code>id</code> Attribute sollten eindeutig sein. Browser werden das nicht durchsetzen, aber es ist eine weit verbreitete und erprobte Herangehensweise. Also gib bitte nie mehr als einem Element das gleiche <code>id</code> Attribut.",
+            "Hier ist ein Beispiel wie du deinem <code>h2</code> Element die Id <code>cat-photo-app</code> gibst:",
+            "<code>&#60;h2 id=\"cat-photo-app\"></code>",
+            "<hr>",
+            "Gib deinem <code>form</code> Element die Id <code>cat-photo-form</code>."
+          ]
+        },
+        "es": {
+          "title": "Establecer el ID de un elemento",
+          "description": [
+            "Además de las clases, cada elemento HTML también puede tener un atributo de identificación <code>id</code>.",
+            "Hay varias ventajas al usar atributos <code>id</code>, y aprenderás más sobre estas cuando comiences a usar jQuery.",
+            "Los atributos <code>id</code> deben ser únicos. Los navegadores no obligarán esto, pero es ampliamente reconocido como una de las mejores prácticas. Así que por favor no le des a más de un elemento un mismo atributo <code>id</code>. ",
+            "He aquí un ejemplo de cómo le das la identificación <code>cat-photo-app</code> a tu elemento <code>h2</code>:",
+            "<code>&#60;h2 id=\"cat-photo-app\"></code>",
+            "<hr>",
+            "Dale a tu elemento <code>form</code> la id <code>cat-photo-form</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Estabeleça a ID de um Elemento",
+          "description": [
+            "Além das classes, cada elemento HTML também pode ter um atributo de identificação chamado <code>id</code>.",
+            "Existem várias vantagens ao utilizar atributos <code>id</code>, e você aprenderá mais sobre elas quando começar a utilizar jQuery.",
+            "Os atributos <code>id</code> devem ser únicos. Os navegadores não o obrigarão a isso, mas isso é amplamente reconhecido como uma boa prática. Assim, não dê um mesmo atributo <code>id</code> a mais de um elemento.",
+            "Veja aqui um exemplo de como dar a id <code>cat-photo-app</code> ao seu elemento code>h2</code>:",
+            "<code>&#60;h2 id=\"cat-photo-app\"></code>",
+            "<hr>",
+            "Dê ao seu elemento <code>form</code> a id <code>cat-photo-form</code>."
+          ]
+        },
+        "ru": {
+          "title": "Установите id элемента",
+          "description": [
+            "В дополнение к классам, каждый HTML-элемент может также иметь атрибут <code>id</code>.",
+            "Есть некоторые преимущества использования атрибутов <code>id</code>, вы узнаете о них больше, когда начнёте использовать jQuery.",
+            "Атрибутам <code>id</code> следует быть уникальными. Браузеры не принуждают к этому, но широкой общественностью это признано лучшей практикой. Поэтому, пожалуйста, не присваивайте множеству элементов одинаковое значение атрибута <code>id</code>.",
+            "Вот пример того, как вы можете присвоить вашему элементу <code>h2</code> значение атрибута <code>id</code> равное <code>cat-photo-app</code>:",
+            "<code>&#60;h2 id=\"cat-photo-app\"></code>",
+            "<hr>",
+            "Присвойте вашему элементу <code>form</code> атрибут <code>id</code> со значением <code>cat-photo-form</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87dee1348bd9aede07836",
+      "title": "Use an id Attribute to Style an Element",
+      "description": [
+        "One cool thing about <code>id</code> attributes is that, like classes, you can style them using CSS.",
+        "However, an <code>id</code> is not reusable and should only be applied to one element. An <code>id</code> also has a higher specificity (importance) than a class so if both are applied to the same element and have conflicting styles, the styles of the <code>id</code> will be applied.",
+        "Here's an example of how you can take your element with the <code>id</code> attribute of <code>cat-photo-element</code> and give it the background color of green. In your <code>style</code> element:",
+        "<blockquote>#cat-photo-element {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+        "Note that inside your <code>style</code> element, you always reference classes by putting a <code>.</code> in front of their names. You always reference ids by putting a <code>#</code> in front of their names.",
+        "<hr>",
+        "Try giving your form, which now has the <code>id</code> attribute of <code>cat-photo-form</code>, a green background."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "",
+        "  .silver-background {",
+        "    background-color: silver;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div class=\"silver-background\">",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\" id=\"cat-photo-form\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"form\").attr(\"id\") === \"cat-photo-form\", 'message: Give your <code>form</code> element the id of <code>cat-photo-form</code>.');",
+        "assert($(\"#cat-photo-form\").css(\"background-color\") === \"rgb(0, 128, 0)\", 'message: Your <code>form</code> element should have the <code>background-color</code> of green.');",
+        "assert(code.match(/<form.*cat-photo-form.*>/gi) && code.match(/<form.*cat-photo-form.*>/gi).length > 0, 'message: Make sure your <code>form</code> element has an <code>id</code> attribute.');",
+        "assert(!code.match(/<form.*style.*>/gi) && !code.match(/<form.*class.*>/gi), 'message: Do not give your <code>form</code> any <code>class</code> or <code>style</code> attributes.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Benutze ein ID Attribute um ein Element zu stylen",
+          "description": [
+            "Eine coole Eigenschaft von <code>id</code> Attributen ist, dass du sie, genauso wie Klassen, mit CSS stylen kannst.",
+            "Hier ist ein Beispiel wie du einem Element mit dem <code>id</code> Attribut <code>cat-photo-element</code> eine grüne Hintergrundfarbe geben kannst. In deinem <code>style</code> Element:",
+            "<blockquote>#cat-photo-element {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+            "Beachte, dass du in deinem <code>style</code> Element Klassen immer mit einem <code>.</code> vor deren Namen ansprichst. Ids sprichst du immer mit <code>#</code> vor deren Namen an.",
+            "<hr>",
+            "Versuche deinem Formular, das jetzt das <code>id</code> Attribut <code>cat-photo-form</code> hat, einen grünen Hintergrund zu geben."
+          ]
+        },
+        "es": {
+          "title": "Usa un atributo ID para dar estilo a un elemento",
+          "description": [
+            "Una cosa buena sobre los atributos <code>id</code> es que, al igual que con clases, puedes darles estilo usando CSS.",
+            "He aquí un ejemplo de cómo puedes tomar tu elemento con atributo <code>id</code> de <code>cat-photo-element</code> y ponerle el color de fondo verde. En tu elemento <code>style</code>: ",
+            "<blockquote>#cat-photo-element {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+            "Ten en cuenta que dentro de tu elemento <code>style</code>, siempre referencias clases poniendo un <code>.</code> en frente de sus nombres. Y siempre referencias identificaciones poniendo un <code>#</code> frente a sus nombres. ",
+            "<hr>",
+            "Trata de darle a tu formulario, que ahora tiene el atributo <code>id</code> en <code>cat-photo-form</code>, un fondo verde."
+          ]
+        },
+        "pt-br": {
+          "title": "Use um Atributo ID para Estilizar um Elemento",
+          "description": [
+            "Algo interessante sobre os atributos <code>id</code> é que, da mesma forma que com as classes, é possível dar estilos a eles usando CSS.",
+            "Aqui está um exemplo de como você pode usar seu elemento com atributo <code>id</code> em <code>cat-photo-element</code> e dar a ele a cor de fundo verde.",
+            "<code>#cat-photo-element {</code>",
+            "<code>&nbsp;&nbsp;background-color: green;</code>",
+            "<code>}</code>",
+            "Note que dentro de seu elemento <code>style</code>, você deve sempre referenciar uma classe colocando um <code>.</code> logo antes de seu nome. Já com uma id, você deve referenciar colocando um <code>#</code> antes de seu nome.",
+            "<hr>",
+            "Dê ao seu formulário, que agora possui o atributo code>id</code> em <code>cat-photo-form</code>, um fundo verde."
+          ]
+        },
+        "ru": {
+          "title": "Используйте атрибут id для стилизации элемента",
+          "description": [
+            "Одной из замечательных вещей в отношении атрибута <code>id</code> является то, что, как и с классами, вы можете стилизовать их с помощью CSS.",
+            "Вот пример того как вы можете присвоить вашему элементу со значением атрибута <code>id</code> равным <code>cat-photo-element</code> зелёный цвет фона. В вашем элементе <code>style</code>:",
+            "<blockquote>#cat-photo-element {<br>&nbsp;&nbsp;background-color: green;<br>}</blockquote>",
+            "Обратите внимание, что внутри вашего элемента <code>style</code> вы ссылаетесь на классы используя <code>.</code> перед их именами. При этом вы всегда ссылаетесь на идентификаторы вставляя <code>#</code> перед их именами.",
+            "<hr>",
+            "Попробуйте установить для своей формы, которая теперь имеет атрибут <code>id</code> равный <code>cat-photo-form</code>, зелёный в качестве цвета фона."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad88fee1348bd9aedf08825",
+      "title": "Adjust the Padding of an Element",
+      "description": [
+        "Now let's put our Cat Photo App away for a little while and learn more about styling HTML.",
+        "You may have already noticed this, but all HTML elements are essentially little rectangles.",
+        "Three important properties control the space that surrounds each HTML element: <code>padding</code>, <code>margin</code>, and <code>border</code>.",
+        "An element's <code>padding</code> controls the amount of space between the element's content and its <code>border</code>.",
+        "Here, we can see that the green box and the red box are nested within the yellow box. Note that the red box has more <code>padding</code> than the green box.",
+        "When you increase the green box's <code>padding</code>, it will increase the distance between the text <code>padding</code> and the border around it.",
+        "<hr>",
+        "Change the <code>padding</code> of your green box to match that of your red box."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 10px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    padding: 20px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "    padding: 10px;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"padding-top\") === \"20px\", 'message: Your <code>green-box</code> class should give elements <code>20px</code> of <code>padding</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Justiere den Innenabstand eines Elements",
+          "description": [
+            "Lass uns jetzt mal unsere Katzenfoto App kurz beiseite legen um mehr über HTML Styling zu lernen",
+            "Du hast vielleicht schon bemerkt, dass alle HTML Elemente im Prinzip kleine Rechtecke sind.",
+            "Drei wichtige CSS-Eigenschaften beeinflussen den Platz den jedes HTML Element umgibt: <code>padding</code>, <code>margin</code> und <code>border</code>.",
+            "<code>padding</code> kontrolliert den Raum oder Abstand zwischen dem Inhalt eines Elements und dessen Rahmen – <code>border</code>",
+            "Wir sehen in diesem Beispiel, dass sich die grüne Box und die rote Box innerhalb der gelben Box befinden. Beachte, dass die rote Box mehr <code>padding</code> hat als die grüne Box.",
+            "<hr>",
+            "Ändere das <code>padding</code> der grünen Box um es an die rote Box anzugleichen."
+          ]
+        },
+        "es": {
+          "title": "Ajusta el relleno de un elemento",
+          "description": [
+            "Ahora vamos a dejar de lado nuestra aplicación de fotos de gatos por un tiempo, y aprenderemos más sobre dar estilo a HTML",
+            "Ya habrás notado esto, pero todos los elementos HTML son esencialmente pequeños rectángulos.",
+            "Tres propiedades importantes controlan el espacio que rodea a cada elemento HTML: relleno (<code>padding</code>), margen (<code>margin</code>) y borde (<code>border</code>)",
+            "El relleno (<code>padding</code>) de un elemento controla la cantidad de espacio entre el elemento y su borde (<code>border</code>).",
+            "Aquí, podemos ver que el cuadro verde y el cuadro rojo se anidan dentro del cuadro amarillo. Ten en cuenta que el cuadro rojo tiene más relleno (<code>padding</code>) que el cuadro verde. ",
+            "Cuando aumentes el relleno de la caja verde, aumentará la distancia entre el texto <code>padding</code> y el borde alrededor de este.",
+            "<hr>",
+            "Cambia el relleno (<code>padding</code>) de la caja verde para que coincida con el de tu cuadro rojo."
+          ]
+        },
+        "pt-br": {
+          "title": "Ajuste o Preenchimento de um Elemento",
+          "description": [
+            "Agora vamos deixar nosso aplicativo de fotos de gatos um pouco de lado, e aprender mais sobre dar estilos em HTML.",
+            "Você provavelmente já deve ter notado, mas todos os elementos HTML são, essencialmente, pequenos retângulos.",
+            "Três propriedades importantes controlam o espaço ao redor de cada elemento HTML: preenchimento (<code>padding</code>), margem (<code>margin</code>) e borda (<code>border</code>).",
+            "O preenchimento (<code>padding</code>) de um elemento controla a quantidade de espaço entre o elemento e sua borda (<code>border</code>).",
+            "Aqui, podemos ver que o quadro verde e o quadro vermelho se aninham dentro do quadro amarelo. Leve em conta que o quadro vermelho tem mais preenchimento (<code>padding</code>) que o quadro verde.",
+            "Quando você aumenta o preenchimento da caixa verde, a distância entre o texto <code>padding</code> e a borda ao seu redor também será maior.",
+            "<hr>",
+            "Mude o preenchimento (<code>padding</code>) da caixa verde para que coincida com a de seu quadrado vermelho."
+          ]
+        },
+        "ru": {
+          "title": "Настройка отступа содержимого для элемента",
+          "description": [
+            "Теперь давайте отложим наше фото кота на некоторое время и изучим стилизацию HTML.",
+            "Вы могли уже заметить это, но все HTML-элеметы в приницпе являются небольшими прямоугольниками.",
+            "Пространство вокруг каждого HTML-элемента контролируют три важных свойства: <code>padding</code>, <code>margin</code>, <code>border</code>.",
+            "Свойство элемента <code>padding</code> управляет размером пространства между элементом и его границей <code>border</code>.",
+            "Тут мы можем видеть, что зелёный и красный прямоугольник вложены в жёлтый прямоугольник. Обратите внимание на то, что красный прямоугольник имеет больший отступ содержимого <code>padding</code>, чем зелёный прямоугольник.",
+            "Когда вы увеличиваете <code>padding</code> зелёного прямоугольника, увеличивается расстояние между границей содержимого и границей самого элемента <code>border</code>.",
+            "<hr>",
+            "Измените значение свойства <code>padding</code> вашего зелёного прямоугольника, чтобы он был равен соответствующему значению красного прямоугольника."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08822",
+      "title": "Adjust the Margin of an Element",
+      "description": [
+        "An element's <code>margin</code> controls the amount of space between an element's <code>border</code> and surrounding elements.",
+        "Here, we can see that the green box and the red box are nested within the yellow box. Note that the red box has more <code>margin</code> than the green box, making it appear smaller.",
+        "When you increase the green box's <code>margin</code>, it will increase the distance between its border and surrounding elements.",
+        "<hr>",
+        "Change the <code>margin</code> of the green box to match that of the red box."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 10px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    padding: 20px;",
+        "    margin: 20px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "    padding: 20px;",
+        "    margin: 10px;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"margin-top\") === \"20px\", 'message: Your <code>green-box</code> class should give elements <code>20px</code> of <code>margin</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Passe den Außenabstand eines Elements an",
+          "description": [
+            "<code>margin</code> kontrolliert den Abstand zwischen dem Rahmen - <code>border</code> - eines Elements und den benachbarten Elementen.",
+            "In diesem Beispiel sehen wir die grüne und die rote Box die sich beide innerhalb der gelben Box befinden. Beachte, dass die rote Box mehr <code>margin</code> aufweist als die grüne Box, wodurch sie kleiner wirkt.",
+            "Wenn du den Außenabstand – <code>margin</code> – der grünen Box erhöhst, wird sich der Abstand zwischen ihrem Rahmen und den benachbarten Elementen vergrößern.",
+            "<hr>",
+            "Gleiche den Außenabstand – <code>margin</code> der grünen Box dem der roten Box an."
+          ]
+        },
+        "es": {
+          "title": "Ajusta el margen de un elemento",
+          "description": [
+            "El margen (<code>margin</code>) de un elemento controla la cantidad de espacio entre el borde (<code>border</code>) y los elementos alrededor.",
+            "Aquí, podemos ver que la caja verde y la caja roja se anidan dentro de la caja amarilla. Ten en cuenta que la caja roja tiene más margen (<code>margin</code>) que la caja verde, haciendo que parezca más pequeña. ",
+            "Cuando aumentes el margen (<code>margin</code>) de la caja verde, aumentará la distancia entre su borde y los elementos que la rodean.",
+            "<hr>",
+            "Cambia el margen (<code>margin</code>) de la caja verde para que coincida con el de la caja roja."
+          ]
+        },
+        "pt-br": {
+          "title": "Ajuste a Margem de um Elemento",
+          "description": [
+            "A margem (<code>margin</code>) de um elemento controla a quantidade de espaço entre a borda (<code>border</code>) e os elementos ao seu redor.",
+            "Aqui, podemos ver que a caixa verde e a caixa vermelha se aninham dentro da caixa amarela. Note que a caixa vermelha possui a margem maior que a caixa verde, fazendo com que ela pareça menor.",
+            "Quando você aumenta a margem (<code>margin</code>) da caixa verde, a distância entre a borda e os elementos ao seu redor também aumentará.",
+            "<hr>",
+            "Mude a margem (<code>margin</code>) da caixa verde para que coincida com a margem da caixa vermelha."
+          ]
+        },
+        "ru": {
+          "title": "Настройка отступа элемента",
+          "description": [
+            "Значение свойства <code>margin</code> контролирует размер отступа между границей <code>border</code> элемента и его окружением.",
+            "Тут мы можем видеть, что зелёный прямоугольник и красный прямоугольник вложены в жёлтый прямоугольник. Обратите внимание на то, что красный прямоугольник имеет больший отступ <code>margin</code>, чем зелёный прямоугольник, что делает его визуально меньше.",
+            "Когда вы увеличиваете отступ <code>margin</code> зелёного прямоугольника, увеличивается расстояние между его границей и окружающими элементами.",
+            "<hr>",
+            "Измените значение отступа <code>margin</code> зелёного прямоугольника так, чтобы оно равнялось соответствующему значению красного прямоугольника."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08823",
+      "title": "Add a Negative Margin to an Element",
+      "description": [
+        "An element's <code>margin</code> controls the amount of space between an element's <code>border</code> and surrounding elements.",
+        "If you set an element's <code>margin</code> to a negative value, the element will grow larger.",
+        "<hr>",
+        "Try to set the <code>margin</code> to a negative value like the one for the red box.",
+        "Change the <code>margin</code> of the green box to <code>-15px</code>, so it fills the entire horizontal width of the yellow box around it."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 10px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    padding: 20px;",
+        "    margin: -15px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "    padding: 20px;",
+        "    margin: 20px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"margin-top\") === \"-15px\", 'message: Your <code>green-box</code> class should give elements <code>-15px</code> of <code>margin</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Füge einem Element negativen Außenabstand hinzu",
+          "description": [
+            "<code>margin</code> kontrolliert den Abstand zwischen dem Rahmen - <code>border</code> - eines Elements und den benachbarten Elementen.",
+            "Wenn du dem Außenabstand - <code>margin</code> - eines Elements einen negativen Wert zuweist, wird das Element größer.",
+            "<hr>",
+            "Versuche den Außenabstand - <code>margin</code> - auf einen negativen Wert, wie bei der roten Box, zu setzen.",
+            "Ändere den Außenabstand – <code>margin</code> – der grünen Box auf <code>-15px</code>, damit sie die gelbe Box horizontal ausfüllt."
+          ]
+        },
+        "es": {
+          "title": "Agregar un margen negativo a un elemento",
+          "description": [
+            "El margen de un elemento controla la cantidad de espacio entre el borde del elemento y los elementos que lo rodean.",
+            "Si estableces el margen de un elemento en un valor negativo, el elemento se hará más grande.",
+            "<hr>",
+            "Trata de establecer el margen (<code>margin</code>) a un valor negativo como el de la caja roja.",
+            "Cambia el margen (<code>margin</code>) de la caja verde a <code>-15px</code>, de forma que ocupe todo el ancho horizontal de la caja amarilla que lo rodea."
+          ]
+        },
+        "pt-br": {
+          "title": "Adicione uma Margem Negativa a um Elemento",
+          "description": [
+            "A margem de um elemento controla a quantidade de espaço entre a borda do elemento e os elementos ao seu redor.",
+            "Se você estabelece a margem de um elemento com um valor negativo, o elemento ficará maior.",
+            "<hr>",
+            "Tente estabelecer a margem (<code>margin</code>) a um valor negativo como o da caixa vermelha.",
+            "Mude a margem (<code>margin</code>) da caixa verde para <code>-15px</code>, de forma que ocupe toda a largura horizontal da caixa amarela que a rodeia."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте отрицательный отступ к элементу",
+          "description": [
+            "Значение свойства <code>margin</code> контролирует размер отступа между границей <code>border</code> элемента и его окружением.",
+            "Если вы установите значение свойства <code>margin</code> элемента отрицательным, то элемент будет становиться больше.",
+            "<hr>",
+            "Попробуйте установить значение свойства <code>margin</code> зелёного прямоугольника отрицательным, по аналогии с красным прямоугольником.",
+            "Измените значение свойства <code>margin</code> зелёного прямоугольника на <code>-15px</code>, таким образом он занимает всю ширину окружающего жёлтого прямоугольника."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08824",
+      "title": "Add Different Padding to Each Side of an Element",
+      "description": [
+        "Sometimes you will want to customize an element so that it has different <code>padding</code> on each of its sides.",
+        "CSS allows you to control the <code>padding</code> of an element on all four sides with <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code>, and <code>padding-left</code> properties.",
+        "<hr>",
+        "Give the green box a <code>padding</code> of <code>40px</code> on its top and left side, but only <code>20px</code> on its bottom and right side."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 10px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    padding-top: 40px;",
+        "    padding-right: 20px;",
+        "    padding-bottom: 20px;",
+        "    padding-left: 40px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"padding-top\") === \"40px\", 'message: Your <code>green-box</code> class should give the top of the elements <code>40px</code> of <code>padding</code>.');",
+        "assert($(\".green-box\").css(\"padding-right\") === \"20px\", 'message: Your <code>green-box</code> class should give the right of the elements <code>20px</code> of <code>padding</code>.');",
+        "assert($(\".green-box\").css(\"padding-bottom\") === \"20px\", 'message: Your <code>green-box</code> class should give the bottom of the elements <code>20px</code> of <code>padding</code>.');",
+        "assert($(\".green-box\").css(\"padding-left\") === \"40px\", 'message: Your <code>green-box</code> class should give the left of the elements <code>40px</code> of <code>padding</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Gib jeder Seite eines Elements einen unterschiedlichen Innenabstand",
+          "description": [
+            "Manchmal wirst du einem Element auf jeder Seite unterschiedliche Innenabstände – also <code>padding</code> – geben wollen.",
+            "CSS erlaubt dir den Innenabstand - <code>padding</code> - eines Elements auf allen Seiten einzeln mit den Eigenschaften <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code> und <code>padding-left</code> zu steuern.",
+            "<hr>",
+            "Verleihe der grünen Box einen Innenabstand – <code>padding</code> – von <code>40px</code> auf der oberen und linken Seite, aber nur <code>20px</code> auf der unteren und rechten Seite."
+          ]
+        },
+        "es": {
+          "title": "Añade relleno diferente a cada lado de un elemento",
+          "description": [
+            "A veces querrás personalizar un elemento para que tenga diferente relleno (<code>padding</code>) en cada uno de sus lados.",
+            "CSS te permite controlar el relleno (<code>padding</code>) de un elemento en los cuatro lados superior, derecho, inferior e izquierdo con las propiedades <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code> y <code>padding-left</code>. ",
+            "<hr>",
+            "Da a la caja verde un relleno (<code>padding</code>) de <code>40px</code> en las partes superior e izquierda, pero sólo <code>20px</code> en sus partes inferior y derecha."
+          ]
+        },
+        "pt-br": {
+          "title": "Dê Valores Diferentes de Preenchimento a Cada Lado de um Elemento",
+          "description": [
+            "As vezes pode ser que você queira personalizar um elemento para que tenha um preenchimento (<code>padding</code>) diferente em cada um de seus lados.",
+            "O CSS permite controlar o preenchimento (<code>padding</code>) de um elemento em todos os quatro lados: superior, direito, inferior e esquerdo, com as propriedades <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code> e <code>padding-left</code>.",
+            "<hr>",
+            "Dê para a caixa verde um preenchimento (<code>padding</code>) de <code>40px</code> nas partes superior e esquerda, e de apenas <code>20px</code> em suas partes inferior e direita."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте разный отступ содердимого с каждой стороны элемента",
+          "description": [
+            "Иногда вам может потребоваться изменить элемент таким образом, чтобы отступ содержимого <code>padding</code> с каждой из сторон был разным.",
+            "CSS позволяет вам контролировать значение свойства <code>padding</code> элемента со всех сторон с помощью свойств: <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code>, <code>padding-left</code>.",
+            "<hr>",
+            "Присвойте зелёному прямоугольнику <code>padding</code> равный <code>40px</code> сверху и слева, но только <code>20px</code> снизу и справа."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1248bd9aedf08824",
+      "title": "Add Different Margins to Each Side of an Element",
+      "description": [
+        "Sometimes you will want to customize an element so that it has a different <code>margin</code> on each of its sides.",
+        "CSS allows you to control the <code>margin</code> of an element on all four sides with <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code>, and <code>margin-left</code> properties.",
+        "<hr>",
+        "Give the green box a <code>margin</code> of <code>40px</code> on its top and left side, but only <code>20px</code> on its bottom and right side."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 10px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    margin-top: 40px;",
+        "    margin-right: 20px;",
+        "    margin-bottom: 20px;",
+        "    margin-left: 40px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"margin-top\") === \"40px\", 'message: Your <code>green-box</code> class should give the top of elements <code>40px</code> of <code>margin</code>.');",
+        "assert($(\".green-box\").css(\"margin-right\") === \"20px\", 'message: Your <code>green-box</code> class should give the right of elements <code>20px</code> of <code>margin</code>.');",
+        "assert($(\".green-box\").css(\"margin-bottom\") === \"20px\", 'message: Your <code>green-box</code> class should give the bottom of elements <code>20px</code> of <code>margin</code>.');",
+        "assert($(\".green-box\").css(\"margin-left\") === \"40px\", 'message: Your <code>green-box</code> class should give the left of elements <code>40px</code> of <code>margin</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Füge jeder Seite eines Elements einen unterschiedlichen Außenabstand hinzu",
+          "description": [
+            "Manchmal wirst du einem Element auf jeder Seite einen unterschiedlichen Außenabstand - <code>margin</code> - geben wollen.",
+            "CSS erlaubt dir ebenfalls den Außenabstand - <code>margin</code> - eines Elements auf jeder Seite einzeln mit den Eigenschaften <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code> und <code>margin-left</code> zu steuern.",
+            "<hr>",
+            "Gib der grünen Box einen Außenabstand – <code>margin</code> – von <code>40px</code> auf der oberen und linken Seite, aber nur <code>20px</code> auf der unteren und rechten Seite."
+          ]
+        },
+        "es": {
+          "title": "Añade márgenes diferentes a cada lado de un elemento",
+          "description": [
+            "A veces querrás personalizar un elemento para que tenga un margen (<code>margin</code>) diferente en cada uno de sus lados.",
+            "CSS te permite controlar el margen de un elemento en los cuatro lados superior, derecho, inferior e izquierdo con las propiedades <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code> y <code>margin-left</code>. ",
+            "<hr>",
+            "Da a la caja verde un margen (<code>margin</code>) de <code>40px</code> en las partes superior e izquierda, pero sólo <code>20px</code> en su parte inferior y al lado derecho."
+          ]
+        },
+        "pt-br": {
+          "title": "Dê Valores Diferentes de Margem a Cada Lado de um Elemento",
+          "description": [
+            "Talvez você queira personalizar um elemento para que possua uma margem (<code>margin</code>) diferente em cada um de seus lados.",
+            "O CSS permite controlar a margem de um elemento em todos os seus quatro lados: superior, direito, inferior e esquerdo, com as propriedades <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code> e <code>margin-left</code>.",
+            "<hr>",
+            "Dê para a caixa verde uma margem (<code>margin</code>) de <code>40px</code> nas partes superior e esquerda, e de apenas <code>20px</code> nas partes inferior e direita."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте разный отступ для элемента",
+          "description": [
+            "Иногда вам может потребоваться изменить элемент, установив разный отступ <code>margin</code> с каждой из его сторон.",
+            "CSS позволяет вам контролировать отступ <code>margin</code> элемента с каждой из его сторон с помощью свойств: <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code>, <code>margin-left</code>.",
+            "<hr>",
+            "Присвойте красному прямоугольнику значение <code>margin</code> равное <code>40px</code> сверху и слева, но только <code>20px</code> снизу и справа."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08826",
+      "title": "Use Clockwise Notation to Specify the Padding of an Element",
+      "description": [
+        "Instead of specifying an element's <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code>, and <code>padding-left</code> properties, you can specify them all in one line, like this:",
+        "<code>padding: 10px 20px 10px 20px;</code>",
+        "These four values work like a clock: top, right, bottom, left, and will produce the exact same result as using the side-specific padding instructions.",
+        "<hr>",
+        "Use Clockwise Notation to give the \".green-box\" class a <code>padding</code> of <code>40px</code> on its top and left side, but only <code>20px</code> on its bottom and right side."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 20px 40px 20px 40px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    padding: 20px 40px 20px 40px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"padding-top\") === \"40px\", 'message: Your <code>green-box</code> class should give the top of elements <code>40px</code> of <code>padding</code>.');",
+        "assert($(\".green-box\").css(\"padding-right\") === \"20px\", 'message: Your <code>green-box</code> class should give the right of elements <code>20px</code> of <code>padding</code>.');",
+        "assert($(\".green-box\").css(\"padding-bottom\") === \"20px\", 'message: Your <code>green-box</code> class should give the bottom of elements <code>20px</code> of <code>padding</code>.');",
+        "assert($(\".green-box\").css(\"padding-left\") === \"40px\", 'message: Your <code>green-box</code> class should give the left of elements <code>40px</code> of <code>padding</code>.');",
+        "assert(!/padding-top|padding-right|padding-bottom|padding-left/.test(code), 'message: You should use the clockwise notation to set the padding of <code>green-box</code> class.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Nutze die Notation im Uhrzeigersinn um den Innenabstand eines Elements zu bestimmen",
+          "description": [
+            "Anstatt die Eigenschaften <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code> und <code>padding-left</code> zu verwenden, kannst du sie alle in einer Zeile schreiben:",
+            "<code>padding: 10px 20px 10px 20px;</code>",
+            "Diese vier Werte funktionieren wie eine Uhr: oben, rechts, unten und links. Sie bewirken exakt dasselbe wie die seitenspezifischen Anweisungen.",
+            "<hr>",
+            "Gib der Klasse \".green-box\" mit einer Notation im Uhrzeigersinn einen Innenabstand – <code>padding</code> – von <code>40px</code> auf der oberen und linken Seite, aber nur <code>20px</code> auf der unteren und rechten Seite."
+          ]
+        },
+        "es": {
+          "title": "Utiliza notación en sentido horario para especificar el relleno de un elemento",
+          "description": [
+            "En lugar de especificar las propiedades <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code> y <code>padding-left</code> de un elemento, puedes especificar todas en una sóla línea, así: ",
+            "<code>padding: 10px 20px 10px 20px;</code>",
+            "Estos cuatro valores funcionan como un reloj: arriba, derecha, abajo, izquierda, y producirán exactamente el mismo resultado de las cuatro instrucciones de relleno.",
+            "<hr>",
+            "Usa la notación en sentido horario para dar a la clase \"<code>.green-box</code>\" un relleno de <code>40px</code> en las partes superior e izquierda, pero sólo <code>20px</code> en su parte inferior y al lado derecho ."
+          ]
+        },
+        "pt-br": {
+          "title": "Use Notação em Sentido Horário para Especificar o Preenchimento de um Elemento",
+          "description": [
+            "Ao invés de especificar as propriedades <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code> e <code>padding-left</code> de um elemento, você pode especificar todas elas em uma só linha, assim:",
+            "<code>padding: 10px 20px 10px 20px;</code>",
+            "Estes quatro valores funcionam como um relógio: cima, direita, baixo e esquerda, e produzirão o mesmo resultado das quatro instruções de preenchimento.",
+            "<hr>",
+            "Use a <code>notação em sentido horário</code> para dar para a classe \"<code>.green-box</code>\" um preenchimento de <code>40px</code> nas partes superior e esquerda, mas de apenas <code>20px</code> em sua parte inferior e ao lado direito."
+          ]
+        },
+        "ru": {
+          "title": "Используйте систему ссылок по часовой стрелке для установки отступа содержмого элемента",
+          "description": [
+            "Вместо указания свойств элемента: <code>padding-top</code>, <code>padding-right</code>, <code>padding-bottom</code>, <code>padding-left</code>, вы можете указать их в строку, например:",
+            "<code>padding: 10px 20px 10px 20px;</code>",
+            "Установка значений работает по часовой стрелке: сверху, справа, снизу, слева, и приводит к ровно такому же результату, как и использование других инструкций.",
+            "<hr>",
+            "Используйте систему ссылок по часовой стрелке для установки для класса \".green-box\" значения отступа содержимого <code>padding</code> равное <code>40px</code> сверху и слева, но только <code>20px</code> снизу и справа."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9afdf08726",
+      "title": "Use Clockwise Notation to Specify the Margin of an Element",
+      "description": [
+        "Let's try this again, but with <code>margin</code> this time.",
+        "Instead of specifying an element's <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code>, and <code>margin-left</code> properties, you can specify them all in one line, like this:",
+        "<code>margin: 10px 20px 10px 20px;</code>",
+        "These four values work like a clock: top, right, bottom, left, and will produce the exact same result as using the side-specific margin instructions.",
+        "<hr>",
+        "Use <code>Clockwise Notation</code> to give the element with the <code>green-box</code> class a margin of <code>40px</code> on its top and left side, but only <code>20px</code> on its bottom and right side."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 20px 40px 20px 40px;",
+        "  }",
+        "  ",
+        "  .red-box {",
+        "    background-color: red;",
+        "    margin: 20px 40px 20px 40px;",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".green-box\").css(\"margin-top\") === \"40px\", 'message: Your <code>green-box</code> class should give the top of elements <code>40px</code> of <code>margin</code>.');",
+        "assert($(\".green-box\").css(\"margin-right\") === \"20px\", 'message: Your <code>green-box</code> class should give the right of elements <code>20px</code> of <code>margin</code>.');",
+        "assert($(\".green-box\").css(\"margin-bottom\") === \"20px\", 'message: Your <code>green-box</code> class should give the bottom of elements <code>20px</code> of <code>margin</code>.');",
+        "assert($(\".green-box\").css(\"margin-left\") === \"40px\", 'message: Your <code>green-box</code> class should give the left of elements <code>40px</code> of <code>margin</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Nutze die Notation im Uhrzeigersinn um den Außenabstand eines Elements zu bestimmen",
+          "description": [
+            "Versuchen wir das noch einmal, aber diesmal mit dem Außenabstand – also <code>margin</code>.",
+            "Anstatt die Eigenschaften <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code> und <code>margin-left</code> zu verwenden, kannst du alle in eine Zeile schreiben:",
+            "<code>margin: 10px 20px 10px 20px;</code>",
+            "Diese vier Werte funktionieren wieder wie eine Uhr: oben, rechts, unten und links. Sie bewirken exakt das Gleiche wie die seitenspezifischen Anweisungen.",
+            "<hr>",
+            "Nutze die Notation im Uhrzeigersinn – auch <code>Clockwise Notation</code> genannt – um dem Element mit der Klasse <code>green-box</code> <code>40px</code> Außenabstand auf der oberen und linken Seite, aber nur <code>20px</code> auf der unteren und rechten Seite zu verleihen."
+          ]
+        },
+        "es": {
+          "title": "Utiliza notación en sentido horario para especificar el margen de un elemento",
+          "description": [
+            "Vamos a intentar esto de nuevo, pero esta vez con el margen (<code>margin</code>).",
+            "En lugar de especificar las propiedades <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code>, y <code>margin-left</code> de un elemento, puedes especificarlas en una sóla línea así: ",
+            "<code>margin: 10px 20px 10px 20px;</code>",
+            "Estos cuatro valores funcionan como un reloj: arriba, derecha, abajo, izquierda, y producirán exactamente el mismo resultado de las cuatro instrucciones que especifican el margen.",
+            "<hr>",
+            "Usa <code>notación en sentido horario</code> para dar al elemento con la clase <code>green-box</code> un margen de <code>40px</code> en las partes superior e izquierda, pero sólo <code>20px</code> en su parte inferior y al lado derecho ."
+          ]
+        },
+        "pt-br": {
+          "title": "Use Notação em Sentido Horário para Especificar a Margem de um Elemento",
+          "description": [
+            "Vamos praticar isso outra vez, mas desta vez será com a margem (<code>margin</code>).",
+            "Ao invés de especificar as propriedades <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code>, e <code>margin-left</code> de um elemento, você pode especificar todas elas em apenas uma linha assim:",
+            "<code>margin: 10px 20px 10px 20px;</code>",
+            "Estes quatro valores funcionam como um relógio: cima, direita, baixo e esquerda, e produzirão o mesmo resultado das quatro instruções de margem.",
+            "<hr>",
+            "Use a <code>notação em sentido horário</code> para dar para a classe \"<code>.green-box</code>\" uma margem de <code>40px</code> nas partes superior e esquerda, mas de apenas <code>20px</code> em sua parte inferior e ao lado direito."
+          ]
+        },
+        "ru": {
+          "title": "Используйте систему ссылок по часовой стрелке для установки отступа элемента",
+          "description": [
+            "Давайте попробуем то же самое, но со свойством <code>margin</code> на этот раз.",
+            "Вмето указания свойств элемента: <code>margin-top</code>, <code>margin-right</code>, <code>margin-bottom</code>, <code>margin-left</code>, вы можете указать их в строку, например:",
+            "<code>margin: 10px 20px 10px 20px;</code>",
+            "Установка значений работает по часовой стрелке: сверху, справа, снизу, слева, и приводит к ровно такому же результату, как и использование других инструкций.",
+            "<hr>",
+            "Используйте систему ссылок по часовой стрелке для установки для класса <code>green-box</code> значения отступа <code>margin</code> равное <code>40px</code> сверху и слева, но только <code>20px</code> снизу и справа."
+          ]
+        }
+      }
+    },
+    {
+      "id": "58c383d33e2e3259241f3076",
+      "title": "Use Attribute Selectors to Style Elements",
+      "description": [
+        "You have been giving <code>id</code> or <code>class</code> attributes to elements that you wish to specifically style. These are known as ID and class selectors. There are other CSS Selectors you can use to select custom groups of elements to style.",
+        "Let's bring out CatPhotoApp again to practice using CSS Selectors.",
+        "For this challenge, you will use the <code>[attr=value]</code> attribute selector to style the checkboxes in CatPhotoApp. This selector matches and style elements with a specific attribute value. For example, the below code changes the margins of all elements with the attribute <code>type</code> and a corresponding value of <code>radio</code>:",
+        "<blockquote>[type='radio'] {<br>  margin: 20px 0px 20px 0px;<br>}</blockquote>",
+        "<hr>",
+        "Using the <code>type</code> attribute selector, try to give the checkboxes in CatPhotoApp a top margin of 10px and a bottom margin of 15px."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "",
+        "  .silver-background {",
+        "    background-color: silver;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "<main>",
+        "  <p class=\"red-text\">Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <div class=\"silver-background\">",
+        "    <p>Things cats love:</p>",
+        "    <ul>",
+        "      <li>cat nip</li>",
+        "      <li>laser pointers</li>",
+        "      <li>lasagna</li>",
+        "    </ul>",
+        "    <p>Top 3 things cats hate:</p>",
+        "    <ol>",
+        "      <li>flea treatment</li>",
+        "      <li>thunder</li>",
+        "      <li>other cats</li>",
+        "    </ol>",
+        "  </div>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\" id=\"cat-photo-form\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(code.match(/<style>[\\s\\S]*?\\[type=(\"|')checkbox\\1\\]\\s*?{[\\s\\S]*?}[\\s\\S]*?<\\/style>/gi),'message: The <code>type</code> attribute selector should be used to select the checkboxes.');",
+        "assert((function() {var count=0; $(\"[type='checkbox']\").each(function() { if($(this).css('marginTop') === '10px') {count++;}});return (count===3)}()),'message: The top margins of the checkboxes should be 10px.');",
+        "assert((function() {var count=0; $(\"[type='checkbox']\").each(function() { if($(this).css('marginBottom') === '15px') {count++;}});return (count===3)}()),'message: The bottom margins of the checkboxes should be 15px.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "bad82fee1322bd9aedf08721",
+      "title": "Understand Absolute versus Relative Units",
+      "description": [
+        "The last several challenges all set an element's margin or padding with pixels (<code>px</code>). Pixels are a type of length unit, which is what tells the browser how to size or space an item. In addition to <code>px</code>, CSS has a number of different length unit options that you can use.",
+        "The two main types of length units are absolute and relative. Absolute units tie to physical units of length. For example, <code>in</code> and <code>mm</code> refer to inches and millimeters, respectively. Absolute length units approximate the actual measurement on a screen, but there are some differences depending on a screen's resolution.",
+        "Relative units, such as <code>em</code> or <code>rem</code>, are relative to another length value. For example, <code>em</code> is based on the size of an element's font. If you use it to set the <code>font-size</code> property itself, it's relative to the parent's <code>font-size</code>.",
+        "<strong>Note</strong><br>There are several relative unit options that are tied to the size of the viewport. They are covered in the Responsive Web Design Principles section.",
+        "<hr>",
+        "Add a <code>padding</code> property to the element with class <code>red-box</code> and set it to <code>1.5em</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .injected-text {",
+        "    margin-bottom: -25px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .box {",
+        "    border-style: solid;",
+        "    border-color: black;",
+        "    border-width: 5px;",
+        "    text-align: center;",
+        "  }",
+        "",
+        "  .yellow-box {",
+        "    background-color: yellow;",
+        "    padding: 20px 40px 20px 40px;",
+        "  }",
+        "",
+        "  .red-box {",
+        "    background-color: red;",
+        "    margin: 20px 40px 20px 40px;",
+        "    ",
+        "  }",
+        "",
+        "  .green-box {",
+        "    background-color: green;",
+        "    margin: 40px 20px 20px 40px;",
+        "  }",
+        "</style>",
+        "<h5 class=\"injected-text\">margin</h5>",
+        "",
+        "<div class=\"box yellow-box\">",
+        "  <h5 class=\"box red-box\">padding</h5>",
+        "  <h5 class=\"box green-box\">padding</h5>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('.red-box').css('padding-top') != '0px' && $('.red-box').css('padding-right') != '0px' && $('.red-box').css('padding-bottom') != '0px' && $('.red-box').css('padding-left') != '0px', 'message: Your <code>red-box</code> class should have a <code>padding</code> property.');",
+        "assert(code.match(/\\.red-box\\s*?{\\s*?.*?\\s*?.*?\\s*?padding:\\s*?1\\.5em/gi), 'message: Your <code>red-box</code> class should give elements 1.5em of <code>padding</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "bad87fee1348bd9aedf08736",
+      "title": "Style the HTML Body Element",
+      "description": [
+        "Now let's start fresh and talk about CSS inheritance.",
+        "Every HTML page has a <code>body</code> element.",
+        "<hr>",
+        "We can prove that the <code>body</code> element exists here by giving it a <code>background-color</code> of black.",
+        "We can do this by adding the following to our <code>style</code> element:",
+        "<blockquote>body {<br>&nbsp;&nbsp;background-color: black;<br>}</blockquote>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "",
+        "</style>"
+      ],
+      "tests": [
+        "assert($(\"body\").css(\"background-color\") === \"rgb(0, 0, 0)\", 'message: Give your <code>body</code> element the <code>background-color</code> of black.');",
+        "assert(code.match(/<style>\\s*body\\s*\\{\\s*background.*\\s*:\\s*.*;\\s*\\}\\s*<\\/style>/i), 'message: Make sure your CSS rule is properly formatted with both opening and closing curly brackets.');",
+        "assert(code.match(/<style>\\s*body\\s*\\{\\s*background.*\\s*:\\s*.*;\\s*\\}\\s*<\\/style>/i), 'message: Make sure your CSS rule ends with a semi-colon.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Style das HTML Body Element",
+          "description": [
+            "Lass uns jetzt frisch beginnen und über CSS Vererbung reden.",
+            "Jede HTML Seite hat ein <code>body</code> Element.",
+            "<hr>",
+            "Wir können sehen dass es das <code>body</code> Element gibt wenn wir ihm eine schwarze (black) <code>background-color</code> geben",
+            "Das bewerkstelligen wir indem wir folgendes unserem <code>style</code> Element hinzufügen:",
+            "<blockquote>body {<br>&nbsp;&nbsp;background-color: black;<br>}</blockquote>"
+          ]
+        },
+        "es": {
+          "title": "Da estilo en HTML al elemento cuerpo",
+          "description": [
+            "Ahora vamos a empezar de nuevo y hablaremos de herencia CSS.",
+            "Cada página HTML tiene un cuerpo (<code>body</code>).",
+            "<hr>",
+            "Podemos demostrar que el elemento (<code>body</code>) existe aquí, dandole un color de fondo (<code>background-color</code>) negro.",
+            "Podemos hacer esto añadiendo lo siguiente a nuestro elemento <code>style</code>:",
+            "<blockquote>body {<br>&nbsp;&nbsp;background-color: black;<br>}</blockquote>"
+          ]
+        },
+        "pt-br": {
+          "title": "Dê Estilo ao Elemento Body em HTML",
+          "description": [
+            "Agora vamos recomeçar e falar sobre herança em CSS.",
+            "Cada página HTML possui um corpo (<code>body</code>).",
+            "<hr>",
+            "Podemos demonstrar que o elemento (<code>body</code>) existe aqui, ao dar a ele uma cor de fundo (<code>background-color</code>) preta.",
+            "Podemos fazer isso adicionando o seguinte ao nosso elemento <code>style</code>:",
+            "<code>body {</code>",
+            "<code>&nbsp;&nbsp;background-color: black;</code>",
+            "<code>}</code>"
+          ]
+        },
+        "ru": {
+          "title": "Стилизуйте HTML-элемент body",
+          "description": [
+            "Теперь давайте начнём с нуля и поговорим о наследовании в CSS.",
+            "Каждая HTML-страница имеет элемент <code>body</code>.",
+            "<hr>",
+            "Мы можем доказать существование элемента <code>body</code> тут, присвоив его свойству <code>background-color</code> значение <code>black</code>.",
+            "Мы можем это сделать добавлением следующего к нашему элементу <code>style</code>:",
+            "<blockquote>body {<br>&nbsp;&nbsp;background-color: black;<br>}</blockquote>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08746",
+      "title": "Inherit Styles from the Body Element",
+      "description": [
+        "Now we've proven that every HTML page has a <code>body</code> element, and that its <code>body</code> element can also be styled with CSS.",
+        "Remember, you can style your <code>body</code> element just like any other HTML element, and all your other elements will inherit your <code>body</code> element's styles.",
+        "<hr>",
+        "First, create a <code>h1</code> element with the text <code>Hello World</code>",
+        "Then, let's give all elements on your page the color of <code>green</code> by adding <code>color: green;</code> to your <code>body</code> element's style declaration.",
+        "Finally, give your <code>body</code> element the font-family of <code>Monospace</code> by adding <code>font-family: Monospace;</code> to your <code>body</code> element's style declaration."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "  }",
+        "",
+        "</style>"
+      ],
+      "tests": [
+        "assert(($(\"h1\").length > 0), 'message: Create an <code>h1</code> element.');",
+        "assert(($(\"h1\").length > 0 && $(\"h1\").text().match(/hello world/i)), 'message: Your <code>h1</code> element should have the text <code>Hello World</code>.');",
+        "assert(code.match(/<\\/h1>/g) && code.match(/<h1/g) && code.match(/<\\/h1>/g).length === code.match(/<h1/g).length, 'message: Make sure your <code>h1</code> element has a closing tag.');",
+        "assert(($(\"body\").css(\"color\") === \"rgb(0, 128, 0)\"), 'message: Give your <code>body</code> element the <code>color</code> property of <code>green</code>.');",
+        "assert(($(\"body\").css(\"font-family\").match(/Monospace/i)), 'message: Give your <code>body</code> element the <code>font-family</code> property of <code>Monospace</code>.');",
+        "assert(($(\"h1\").length > 0 && $(\"h1\").css(\"font-family\").match(/monospace/i)), 'message: Your <code>h1</code> element should inherit the font <code>Monospace</code> from your <code>body</code> element.');",
+        "assert(($(\"h1\").length > 0 && $(\"h1\").css(\"color\") === \"rgb(0, 128, 0)\"), 'message: Your <code>h1</code> element should inherit the color green from your <code>body</code> element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erbe Styles vom Body Element",
+          "description": [
+            "Jetzt haben wir bewiesen dass jede HTML Seite ein <code>body</code> Element besitzt und dass dieses <code>body</code> Element ebenfalls mit CSS gestylt werden kann.",
+            "Vergiss nicht, dass du dein <code>body</code> Element wie jedes andere HTML Element stylen kannst und dass alle anderen Elemente von deinem <code>body</code> Element Styles erben werden.",
+            "<hr>",
+            "Erstelle zuerst ein <code>h1</code> Element mit dem Text <code>Hello World</code>",
+            "Dann gib allen Elementen auf deiner Seite die Farbe <code>green</code> indem du <code>color:green;</code> deinen <code>body</code> Element Styles hinzufügst.",
+            "Gib deinem <code>body</code> Element abschließend die Schriftart <code>Monospace</code> indem du <code>font-family: Monospace;</code> deinen <code>body</code> Element Styles hinzufügst."
+          ]
+        },
+        "es": {
+          "title": "Hereda estilos del elemento cuerpo",
+          "description": [
+            "Ya hemos demostrado que cada página HTML tiene un cuerpo (<code>body</code>), y que puede dársele estilo CSS.",
+            "Recuerda que puedes dar estilo de tu elemento <code>body</code> como a cualquier otro elemento HTML, y que todos tus otros elementos heredarán sus estilos de tu elemento <code>body</code>.",
+            "<hr>",
+            "En primer lugar, crea un elemento <code>h1</code> con el texto <code>Hello World</code>",
+            "Después, vamos a darle a todos los elementos de tu página el color verde (<code>green</code>) añadiendo <code>color: green;</code> a la declaración de estilo de tu elemento <code>body</code>.",
+            "Por último, da a tu elemento <code>body</code> el tipo de letra <code>Monospace</code> añadiendo <code>font-family: Monospace;</code> a la declaración del estilo de tu elemento <code>body</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Herde Estilos do Elemento Body",
+          "description": [
+            "Já demonstramos que cada página HTML possui um corpo (<code>body</code>), e que podemos dar estilo a ele através do CSS.",
+            "Observe que você pode dar estilo ao seu elemento <code>body</code> como a qualquer outro elemento HTML, e que todos os outros elementos herdarão os estilos de seu elemento <code>body</code>.",
+            "<hr>",
+            "Em primeiro lugar, crie um elemento <code>h1</code> com o texto <code>Hello World</code>",
+            "Depois, dê a todos os elementos de sua página uma cor verde (<code>green</code>) adicionando <code>color: green;</code> na declaração de estilo de seu elemento <code>body</code>.",
+            "Por último, dê ao seu elemento <code>body</code> o tipo de fonte <code>Monospace</code> adicionando <code>font-family: Monospace;</code> na declaração de estilo de seu elemento <code>body</code>."
+          ]
+        },
+        "ru": {
+          "title": "Наследование стилей от элемента Body",
+          "description": [
+            "Мы доказали наличие у каждой HTML-страницы элемента <code>body</code> и то, что этот элемент <code>body</code> можно стилизовать с помощью CSS.",
+            "Не забывайте, что вы можете стилизовать ваш элемент <code>body</code> так же как и любой другой HTML-элемент, а все остальные элементы унаследуют стили элемента <code>body</code>.",
+            "<hr>",
+            "Для начала, создайте элемент <code>h1</code> с текстом <code>Hello World</code>",
+            "Затем присвойте всем элементам на вашей странице <code>зелёный</code> цвет путём добавления <code>color: green;</code> к свойствам, указанным в объявлении стилей для элемента <code>body</code>.",
+            "В завершении, присвойте вашему элементу <code>body</code> свойство семейства шрифтов равное <code>Monospace</code> путём добавления <code>font-family: Monospace;</code> к свойствам, указанным в объявлении стилей для элемента <code>body</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08756",
+      "title": "Prioritize One Style Over Another",
+      "description": [
+        "Sometimes your HTML elements will receive multiple styles that conflict with one another.",
+        "For example, your <code>h1</code> element can't be both green and pink at the same time.",
+        "Let's see what happens when we create a class that makes text pink, then apply it to an element. Will our class <em>override</em> the <code>body</code> element's <code>color: green;</code> CSS property?",
+        "<hr>",
+        "Create a CSS class called <code>pink-text</code> that gives an element the color pink.",
+        "Give your <code>h1</code> element the class of <code>pink-text</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "    font-family: Monospace;",
+        "    color: green;",
+        "  }",
+        "</style>",
+        "<h1>Hello World!</h1>"
+      ],
+      "tests": [
+        "assert($(\"h1\").hasClass(\"pink-text\"), 'message: Your <code>h1</code> element should have the class <code>pink-text</code>.');",
+        "assert(code.match(/\\.pink-text\\s*\\{\\s*color\\s*:\\s*.+\\s*;\\s*\\}/g), 'message: Your <code>&#60;style&#62;</code> should have a <code>pink-text</code> CSS class that changes the <code>color</code>.');",
+        "assert($(\"h1\").css(\"color\") === \"rgb(255, 192, 203)\", 'message: Your <code>h1</code> element should be pink.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Ziehe einen Style einem Anderen vor",
+          "description": [
+            "Manchmal werden deine HTML Elemente mehrere Styles erhalten die sich gegenseitig widersprechen.",
+            "Zum Beispiel könnte dein <code>h1</code> Element nicht gleichzeitig grün und pink sein.",
+            "<hr>",
+            "Schauen wir uns an was passiert wenn wir eine Klasse erstellen die Text pink macht und dann einem Element hinzufügen. Wird unsere Klasse die <code>color:green;</code> Eigenschaft unseres <code>body</code> Elements überschreiben - <em>override</em> - ?"
+          ]
+        },
+        "es": {
+          "title": "Priorizar un estilo sobre otro",
+          "description": [
+            "A veces los elementos HTML recibirán múltiples estilos que entran en conflicto entre sí.",
+            "Por ejemplo, el elemento <code>h1</code> no puede ser verde y rosa al mismo tiempo.",
+            "Vamos a ver lo que sucede cuando creamos una clase que hace rosado el texto y luego lo aplicamos a un elemento. ¿Anulará (<em>override</em>) nuestra clase la propiedad CSS <code>color: green</code> del elemento <code>body</code>?",
+            "<hr>",
+            "Crea una clase CSS llamada <code>pink-text</code> que le da a un elemento el color rosado.",
+            "Ponle a tu elemento <code>h1</code> la clase de <code>pink-text</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Priorize um Estilo Sobre o Outro",
+          "description": [
+            "As vezes os elementos HTML recebem múltiplos estilos que entram em conflito entre si.",
+            "Por exemplo, o elemento <code>h1</code> não pode ser verde e rosa ao mesmo tempo.",
+            "Vamos ver o que acontece quando criamos uma classe que faz com que o texto seja rosa e então o aplicamos a um elemento. Isso irá sobrepor (<em>override</em>) a propriedade CSS <code>color: green</code> do elemento <code>body</code> de nossa classe?",
+            "<hr>",
+            "Crie uma classe CSS chamada <code>pink-text</code>, que dê a cor rosa a um elemento.",
+            "Depois, adicione a classe <code>pink-text</code> ao seu elemento <code>h1</code>."
+          ]
+        },
+        "ru": {
+          "title": "Установите приоритет одного стиля над другим",
+          "description": [
+            "Иногда вашим HTML-элементам будут присвоены множественные стили, конфликтующие друг с другом.",
+            "Например, ваш элемент <code>h1</code> не может быть одновременно зелёным и розовым.",
+            "Давайте посмотрим, что произойдёт, когда мы создадим класс, который делает текст розовым, затем присвоим его элементу. <em>Переопределит</em> ли наш класс значение CSS-свойства элемента <code>body</code> равное <code>color: green;</code>?",
+            "<hr>",
+            "Создайте CSS-класс <code>pink-text</code>, который назначает элементу розовый в качестве цвета.",
+            "Назначьте вашему элементу <code>h1</code> класс <code>pink-text</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf04756",
+      "title": "Override Styles in Subsequent CSS",
+      "description": [
+        "Our \"pink-text\" class overrode our <code>body</code> element's CSS declaration!",
+        "We just proved that our classes will override the <code>body</code> element's CSS. So the next logical question is, what can we do to override our <code>pink-text</code> class?",
+        "<hr>",
+        "Create an additional CSS class called <code>blue-text</code> that gives an element the color blue. Make sure it's below your <code>pink-text</code> class declaration.",
+        "Apply the <code>blue-text</code> class to your <code>h1</code> element in addition to your <code>pink-text</code> class, and let's see which one wins.",
+        "Applying multiple class attributes to a HTML element is done with a space between them like this:",
+        "<code>class=\"class1 class2\"</code>",
+        "Note: It doesn't matter which order the classes are listed in the HTML element.",
+        "However, the order of the <code>class</code> declarations in the <code>&#60;style&#62;</code> section are what is important. The second declaration will always take precedence over the first. Because <code>.blue-text</code> is declared second, it overrides the attributes of <code>.pink-text</code>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "    font-family: Monospace;",
+        "    color: green;",
+        "  }",
+        "  .pink-text {",
+        "    color: pink;",
+        "  }",
+        "</style>",
+        "<h1 class=\"pink-text\">Hello World!</h1>"
+      ],
+      "tests": [
+        "assert($(\"h1\").hasClass(\"pink-text\"), 'message: Your <code>h1</code> element should have the class <code>pink-text</code>.');",
+        "assert($(\"h1\").hasClass(\"blue-text\"), 'message: Your <code>h1</code> element should have the class <code>blue-text</code>.');",
+        "assert($(\".pink-text\").hasClass(\"blue-text\"), 'message: Both <code>blue-text</code> and <code>pink-text</code> should belong to the same <code>h1</code> element.');",
+        "assert($(\"h1\").css(\"color\") === \"rgb(0, 0, 255)\", 'message: Your <code>h1</code> element should be blue.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Überschreibe Styles mit nachträglichen CSS",
+          "description": [
+            "Unsere \"pink-text\" Klasse hat unsere CSS Angaben des <code>body</body> Elements überschrieben!",
+            "Wir haben gerade bewiesen, dass unsere Klassen das CSS des <code>body</body> Elements überschreiben. Die logische nächste Frage ist also was wir tun können um unsere <code>pink-text</code> Klasse zu überschreiben?",
+            "<hr>",
+            "Erstelle eine weitere CSS Klasse namens <code>blue-text</code>, die deinem Element eine blaue Farbe gibt. Stelle sicher dass sie unter deiner <code>pink-text</code> Klassen-Deklaration steht.",
+            "Füge die <code>blue-text</code> Klasse deinem <code>h1</code> Element zusätzlich zur <code>pink-text</code> Klasse hinzu und schau welche gewinnt.",
+            "Einem HTML Element mehrere Klassen Attribute zu geben funktioniert mit einem Leerzeichen dazwischen:",
+            "<code>class=\"class1 class2\"</code>",
+            "Notiz: Es ist egal in welcher Reihenfolge die Klassen in einem HTML Element angeordnet sind.",
+            "Allerdings ist die Reihenfolge der <code>class</code> Deklarationen im <code>&#60;style&#62;</code> Abschnitt durchaus wichtig. Die zweite Deklaration wird immer Vorzug gegenüber der Ersten erhalten. Weil <code>.blue-text</code> als zweites deklariert wird, überschreibt es die Attribute von <code>.pink-text</code>"
+          ]
+        },
+        "es": {
+          "title": "Anula estilos con CSS posterior",
+          "description": [
+            "¡Nuestra clase \"pink-text\" anuló la declaración CSS de nuestro elemento <code>body</code>!",
+            "Acabamos de demostrar que nuestras clases anularán el CSS del elemento <code>body</code>. Así que la siguiente pregunta lógica es: ¿qué podemos hacer para anular nuestra clase <code>pink-text</code>?",
+            "<hr>",
+            "Crea una clase CSS adicional llamada <code>texto-azul</code> que le de a un elemento el color azul. Asegúrate de que está debajo de tu declaración de la clase <code>pink-text</code>. ",
+            "Aplica la clase <code>blue-text</code> a tu elemento <code>h1</code> además de tu clase <code>pink-text</code> y veamos cuál gana.",
+            "La aplicación de múltiples atributos de clase a un elemento HTML se hace usando espacios entre ellos así:",
+            "<code>class=\"clase1 clase2\"</code>",
+            "Nota: No importa el orden en que las clases aparecen en el HTML.",
+            "Sin embargo, el orden de las declaraciones <code>class</code> en la sección <code>&#60;style&#62;</code> sí son importantes. La segunda declaración siempre precederá a la primera. Debido a que <code>.blue-text</code> es declarada después, esta anula los atributos de <code>.pink-text</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Sobreponha Estilos com CSS Posterior",
+          "description": [
+            "Nossa classe \"pink-text\" anulou a declaração CSS de nosso elemento <code>body</code>!",
+            "Acabamos de demonstrar que nossas classes irão sobrepor o CSS do elemento <code>body</code>. Sendo assim, nossa seguinte pergunta lógica é: O que podemos fazer para sobrepor a nossa classe <code>pink-text</code>?",
+            "<hr>",
+            "Crie uma classe tradicional com CSS chamada <code>texto-azul</code>, que possa dar a um elemento a cor azul. Tenha a certeza de deixá-la abaixo de sua declaração da classe <code>pink-text</code>.",
+            "Aplique a classe <code>blue-text</code> ao seu elemento <code>h1</code>, além da classe <code>pink-text</code>, e vamos ver qual delas ganhará.",
+            "Lembre que a adição de vários atributos de classe a um elemento HTML se faz utilizando espaços entre ambos, assim:",
+            "<code>class=\"class1 class2\"</code>",
+            "Nota: A ordem em que as classes são listadas em HTML não tem importância.",
+            "Contudo, a ordem de declarações de <code>classe</code> no <code>&#60;style&#62;</code> é importante. A segunda declaração sempre terá precedência pela primeira. Já que <code>.blue-text</code> é declarado depois, ele irá sobrepor os atributos de <code>.pink-text</code>."
+          ]
+        },
+        "ru": {
+          "title": "Преопределите стили последующим CSS",
+          "description": [
+            "Наш класс \"pink-text\" переопределил объявленное CSS-свойство элемента <code>body</code>!",
+            "Мы только что доказали, что наши классы переопределяют CSS-свойства, обявленные в элементе <code>body</code>. Следующим вопросом по логике дожно быть: можем ли мы переопределить наш класс <code>pink-text</code> class?",
+            "<hr>",
+            "Создайте дополнительный CSS-класс <code>blue-text</code>, который присваивает элементу синий цвет. Убедитесь, что он расположен ниже объявления вашего класса <code>pink-text</code>.",
+            "Примените класс <code>blue-text</code> к вашему элементу <code>h1</code> в дополнение к вашему классу <code>pink-text</code>, и давайте посмотрим какой выиграет.",
+            "Применение множественных классов к атрибуту <code>class</code> HTML-элемента осуществляется через пробел:",
+            "<code>class=\"class1 class2\"</code>",
+            "Внимание: порядок, в котором указаны классы HTML-элемента неважен.",
+            "Однако, порядок, в котором <code>классы</code> указаны в элементе <code>&#60;style&#62;</code> важен. Последующее объявление будет всегда иметь приоритет над предшествующим. Поскольку <code>.blue-text</code> объявлен последним, он переопрпделяет значения заданные атрибутом <code>.pink-text</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd8aedf06756",
+      "title": "Override Class Declarations by Styling ID Attributes",
+      "description": [
+        "We just proved that browsers read CSS from top to bottom. That means that, in the event of a conflict, the browser will use whichever CSS declaration came last.",
+        "But we're not done yet. There are other ways that you can override CSS. Do you remember id attributes?",
+        "Let's override your <code>pink-text</code> and <code>blue-text</code> classes, and make your <code>h1</code> element orange, by giving the <code>h1</code> element an id and then styling that id.",
+        "<hr>",
+        "Give your <code>h1</code> element the <code>id</code> attribute of <code>orange-text</code>. Remember, id styles look like this:",
+        "<code>&#60;h1 id=\"orange-text\"&#62;</code>",
+        "Leave the <code>blue-text</code> and <code>pink-text</code> classes on your <code>h1</code> element.",
+        "Create a CSS declaration for your <code>orange-text</code> id in your <code>style</code> element. Here's an example of what this looks like:",
+        "<blockquote>#brown-text {<br>&nbsp;&nbsp;color: brown;<br>}</blockquote>",
+        "Note: It doesn't matter whether you declare this CSS above or below pink-text class, since id attribute will always take precedence."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "    font-family: Monospace;",
+        "    color: green;",
+        "  }",
+        "  .pink-text {",
+        "    color: pink;",
+        "  }",
+        "  .blue-text {",
+        "    color: blue;",
+        "  }",
+        "</style>",
+        "<h1 class=\"pink-text blue-text\">Hello World!</h1>"
+      ],
+      "tests": [
+        "assert($(\"h1\").hasClass(\"pink-text\"), 'message: Your <code>h1</code> element should have the class <code>pink-text</code>.');",
+        "assert($(\"h1\").hasClass(\"blue-text\"), 'message: Your <code>h1</code> element should have the class <code>blue-text</code>.');",
+        "assert($(\"h1\").attr(\"id\") === \"orange-text\", 'message: Give your <code>h1</code> element the id of <code>orange-text</code>.');",
+        "assert(($(\"h1\").length === 1), 'message: There should be only one <code>h1</code> element.');",
+        "assert(code.match(/#orange-text\\s*{/gi), 'message: Create a CSS declaration for your <code>orange-text</code> id');",
+        "assert(!code.match(/<h1.*style.*>/gi), 'message: Do not give your <code>h1</code> any <code>style</code> attributes.');",
+        "assert($(\"h1\").css(\"color\") === \"rgb(255, 165, 0)\", 'message: Your <code>h1</code> element should be orange.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Überschreibe Klassen Deklarationen mit Styling von ID Attributen",
+          "description": [
+            "Wir haben gerade bewiesen, dass der Browser CSS von oben nach unten liest. Das bedeuted, dass im Falle eines Konflikts der Browser immer die letzte CSS Deklaration verwenden wird.",
+            "Aber damit sind wir noch nicht fertig. Es gibt andere Wege um CSS zu überschreiben. Erinnerst du dich an Id Attribute?",
+            "Überschreiben wir jetzt unsere <code>pink-text</code> und <code>blue-text</code> Klasse und machen unser <code>h1</code> Element orange, indem wir dem <code>h1</code> Element eine Id geben und diese dann stylen.",
+            "<hr>",
+            "Gib deinem <code>h1</code> Element das <code>id</code> Attribute <code>orange-text</code>. Vergiss nicht, Id Styles sehen so aus:",
+            "<code>&#60;h1 id=\"orange-text\"&#62;</code>",
+            "Erstelle eine CSS Deklaration für deine <code>orange-text</code> Id in deinem <code>style</code> Element. Hier siehst du ein Beispiel wie sowas aussieht:",
+            "<blockquote>#brown-text {<br>&nbsp;&nbsp;color: brown;<br>}</blockquote>",
+            "Notiz: Es ist egal ob du dies vor oder nach deiner \"pink-text\" Klasse schreibst, da Id Attribute immer bevorzugt werden."
+          ]
+        },
+        "es": {
+          "title": "Anula la declaración de clases dando estilo a los atributos ID",
+          "description": [
+            "Acabamos de demostrar que los navegadores leen CSS de arriba hacia abajo. Eso significa que, en el caso de un conflicto, el navegador utilizará la última declaración CSS. ",
+            "Pero no hemos terminado todavía. Hay otras maneras con las que puedes anular CSS. ¿Te acuerdas de los atributos id?",
+            "Anulemos tus clases <code>pink-text</code> y <code>blue-text</code>, y pongamos anaranjado tu elemento <code>h1</code>, dándole una identificación al elemento <code>h1</code> y poniéndole estilo a esa identificación (<code>id</code>).",
+            "<hr>",
+            "Dale a tu elemento <code>h1</code> el atributo <code>id</code> con valor <code>orange-text</code>. Recuerda, los atributos id se ven así: ",
+            "<code>&#60;h1 id=\"orange-text\"&#62;</code>",
+            "Deja las clases <code>blue-text</code> y <code>pink-text</code> de tu elemento <code>h1</code>.",
+            "Crea una declaración CSS para tu identificación <code>orange-text</code> en tu elemento <code>style</code>. He aquí un ejemplo de como se ve esto: ",
+            "<blockquote>#brown-text {<br>&nbsp;&nbsp;color: brown;<br>}</blockquote>",
+            "Nota: No importa si usted declara este CSS encima o debajo de la clase de texto de color rosa, ya atributo id siempre tendrá prioridad."
+          ]
+        },
+        "pt-br": {
+          "title": "Sobreponha a Declaração de Classes Estilizando Atributos ID",
+          "description": [
+            "Acabamos de demonstrar que os navegadores fazem a leitura do CSS de cima para baixo. Isso significa que, em caso de um conflito, o navegador utilizará a última declaração CSS.",
+            "Mas ainda não terminamos, pois existem outras formas para sobrepor CSS. Você se lembra dos atributos <code>id</code>?",
+            "Vamos sobrepor suas classes <code>pink-text</code> e <code>blue-text</code>, e fazer com que seu elemento <code>h1</code> seja laranja. Faremos isso aplicando uma <code>id</code> para o elemento <code>h1</code> e então estilizando essa <code>id</code>.",
+            "<hr>",
+            "Dê ao seu elemento <code>h1</code> o atributo <code>id</code> de nome <code>orange-text</code>. Relembre que os atributos id são assim:",
+            "<code>#brown-text {</code>",
+            "<code>&nbsp;&nbsp;color: brown;</code>",
+            "<code>}</code>",
+            "Nota: Não importa se você declara este CSS acima ou abaixo da classe de texto cor de rosa, já que atributos id sempre terão prioridade."
+          ]
+        },
+        "ru": {
+          "title": "Переопределите значения свойств классов стилизацией атрибутов id",
+          "description": [
+            "Мы только что доказали, что браузеры читают CSS сверху-вниз. Это значит, что в случае конфликта значений будет установлено то, которое было объявлено в последнюю очередь.",
+            "Но мы ещё не закончилил. Есть и другие способы переопределения CSS. Помните атрибуты id?",
+            "Давайте переопределим ваши классы <code>pink-text</code> и <code>blue-text</code>, и сделаем ваш элемент <code>h1</code> оранжевым, назначив элементу <code>h1</code> зна��ение атрибута <code>id</code> и его последующей стилизацией.",
+            "<hr>",
+            "Назначьте вашему элементу <code>h1</code> значение атрибута <code>id</code> равное <code>orange-text</code>. Помните, что стилизация атрибута <code>id</code> выглядит так:",
+            "<code>&#60;h1 id=\"orange-text\"&#62;</code>",
+            "Оставьте классы <code>blue-text</code> и <code>pink-text</code> присвоенными вашему элементу <code>h1</code>.",
+            "Объявите свойства вашего атрибута <code>id</code> с названием <code>orange-text</code> в вашем элементе <code>style</code>. Вот пример того, как это выглядит:",
+            "<blockquote>#brown-text {<br>&nbsp;&nbsp;color: brown;<br>}</blockquote>",
+            "Внимание: Не имеет значения объявите ли вы стиль выше или ниже класса <code>pink-text</code>, так как атрибут <code>id</code> всегда имеет приоритет."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf06756",
+      "title": "Override Class Declarations with Inline Styles",
+      "description": [
+        "So we've proven that id declarations override class declarations, regardless of where they are declared in your <code>style</code> element CSS.",
+        "There are other ways that you can override CSS. Do you remember inline styles?",
+        "<hr>",
+        "Use an <code>inline style</code> to try to make our <code>h1</code> element white. Remember, in line styles look like this:",
+        "<code>&#60;h1 style=\"color: green\"&#62;</code>",
+        "Leave the <code>blue-text</code> and <code>pink-text</code> classes on your <code>h1</code> element."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "    font-family: Monospace;",
+        "    color: green;",
+        "  }",
+        "  #orange-text {",
+        "    color: orange;",
+        "  }",
+        "  .pink-text {",
+        "    color: pink;",
+        "  }",
+        "  .blue-text {",
+        "    color: blue;",
+        "  }",
+        "</style>",
+        "<h1 id=\"orange-text\" class=\"pink-text blue-text\">Hello World!</h1>"
+      ],
+      "tests": [
+        "assert($(\"h1\").hasClass(\"pink-text\"), 'message: Your <code>h1</code> element should have the class <code>pink-text</code>.');",
+        "assert($(\"h1\").hasClass(\"blue-text\"), 'message: Your <code>h1</code> element should have the class <code>blue-text</code>.');",
+        "assert($(\"h1\").attr(\"id\") === \"orange-text\", 'message: Your <code>h1</code> element should have the id of <code>orange-text</code>.');",
+        "assert(document.querySelector('h1[style]'), 'message: Give your <code>h1</code> element an inline style.');",
+        "assert($(\"h1\").css(\"color\") === \"rgb(255, 255, 255)\", 'message: Your <code>h1</code> element should be white.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Überschreibe deine Klassen Deklarationen mit Inline Styles",
+          "description": [
+            "Wir haben also gesehen dass Id Deklarationen die von Klassen überschreiben, egal wo sie in deinem <code>style</code> Element CSS stehen.",
+            "Es gibt noch andere Wege CSS zu überschreiben. Erinnerst du dich an Inline Styles?",
+            "<hr>",
+            "Benutze <code>inline style</code> um dein <code>h1</code> Element weiß zu machen. Vergiss nicht, Inline Styles sehen so aus:",
+            "<code>&#60;h1 style=\"color: green\"&#62;</code>",
+            "Lasse die <code>blue-text</code> und <code>pink-text</code> Klassen auf deinem <code>h1</code> Element."
+          ]
+        },
+        "es": {
+          "title": "Anula declaraciones de clase con estilos en línea",
+          "description": [
+            "Así que hemos demostrado que las declaraciones de identificadores anulan las declaraciones de clase, independientemente del lugar donde se declaran en tu elemento de estilo CSS <code>style</code>.",
+            "Hay otras maneras en las que puedes anular CSS. ¿Te acuerdas de los estilos en línea?",
+            "<hr>",
+            "Utiliza un <code>estilo en línea</code> para tratar de hacer blanco nuestro elemento <code>h1</code>. Recuerda, los estilos en línea se ven así: ",
+            "<code>&#60;h1 style=\"color: green\"&#62;</code>",
+            "Deja las clases <code>blue-text</code> y <code>pink-text</code> en tu elemento <code>h1</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Sobreponha a Declaração de Classes com Estilos Inline",
+          "description": [
+            "Certo, nós demonstramos que declarações de id sobrepoem as declarações de classe, independente do lugar onde são declarados em seu elemento <code>style</code> no CSS.",
+            "Existem outras formas em que você pode sobrepor CSS. Você se lembra de estilos inline?",
+            "<hr>",
+            "Use um estilo <code>inline</code> para tentar fazer com que nosso elemento <code>h1</code> tenha a cor branca. Relembre que estilos inline são assim:",
+            "<code>&#60;h1 style=\"color: green\"&#62;</code>",
+            "Deixe as classes <code>blue-text</code> e <code>pink-text</code> em seu elemento <code>h1</code>."
+          ]
+        },
+        "ru": {
+          "title": "Переопределите значения свойств классов встроенными стилями",
+          "description": [
+            "Итак, мы доказали, что объявление атрибута <code>id</code> переопределяет значения свойств, определённые в значениях атрибута <code>class</code>, независимо от того, были ли они объявлены в вашем элементе <code>style</code>.",
+            "Есть и другие способы переопределения CSS. Помните встроенные стили?",
+            "<hr>",
+            "Используйте <code>встроенный стиль</code>, чтобы попробовать сделать наш элемент <code>h1</code> белым. Помните, что встроенные стили выглядят следующим образом:",
+            "<code>&#60;h1 style=\"color: green\"&#62;</code>",
+            "Оставьте классы <code>blue-text</code> и <code>pink-text</code> назначенными вашему элементу <code>h1</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf07756",
+      "title": "Override All Other Styles by using Important",
+      "description": [
+        "Yay! We just proved that inline styles will override all the CSS declarations in your <code>style</code> element.",
+        "But wait. There's one last way to override CSS. This is the most powerful method of all. But before we do it, let's talk about why you would ever want to override CSS.",
+        "In many situations, you will use CSS libraries. These may accidentally override your own CSS. So when you absolutely need to be sure that an element has specific CSS, you can use <code>!important</code>",
+        "Let's go all the way back to our <code>pink-text</code> class declaration. Remember that our <code>pink-text</code> class was overridden by subsequent class declarations, id declarations, and inline styles.",
+        "<hr>",
+        "Let's add the keyword <code>!important</code> to your pink-text element's color declaration to make 100% sure that your <code>h1</code> element will be pink.",
+        "An example of how to do this is:",
+        "<code>color: red !important;</code>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "    font-family: Monospace;",
+        "    color: green;",
+        "  }",
+        "  #orange-text {",
+        "    color: orange;",
+        "  }",
+        "  .pink-text {",
+        "    color: pink;",
+        "  }",
+        "  .blue-text {",
+        "    color: blue;",
+        "  }",
+        "</style>",
+        "<h1 id=\"orange-text\" class=\"pink-text blue-text\" style=\"color: white\">Hello World!</h1>"
+      ],
+      "tests": [
+        "assert($(\"h1\").hasClass(\"pink-text\"), 'message: Your <code>h1</code> element should have the class <code>pink-text</code>.');",
+        "assert($(\"h1\").hasClass(\"blue-text\"), 'message: Your <code>h1</code> element should have the class <code>blue-text</code>.');",
+        "assert($(\"h1\").attr(\"id\") === \"orange-text\", 'message: Your <code>h1</code> element should have the id of <code>orange-text</code>.');",
+        "assert(code.match(/<h1.*style/gi) && code.match(/<h1.*style.*color\\s*?:/gi), 'message: Your <code>h1</code> element should have the inline style of <code>color&#58; white</code>.');",
+        "assert(code.match(/\\.pink-text\\s*?\\{[\\s\\S]*?color:.*pink.*!important\\s*;?[^\\.]*\\}/g), 'message: Your <code>pink-text</code> class declaration should have the <code>!important</code> keyword to override all other declarations.');",
+        "assert($(\"h1\").css(\"color\") === \"rgb(255, 192, 203)\", 'message: Your <code>h1</code> element should be pink.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Überschreibe alle anderen Styles mit Important",
+          "description": [
+            "Juhu! Wir haben bewiesen dass Inline Styles alle CSS Deklarationen aus deinem <code>style</code> Element überschreiben.",
+            "Aber warte. Es gibt eine letzte Art CSS zu überschreiben. Dabei handelt es sich um die mächtigste Methode von allen. Aber bevor wir dazu kommen, sehen wir uns an warum du überhaupt CSS überschreiben wollen würdest.",
+            "In vielen Situationen wirst du sogenannte \"CSS libraries\" (CSS Bibliotheken) verwenden. Diese könnten versehentlich dein eigenes CSS überschreiben. Wenn du also absolut sicher sein musst dass ein Element einen bestimmten Style hat, kannst du <code>!important</code> verwenden.",
+            "Gehen wir zurück zu unserer <code>pink-text</code> Klassendeklaration. Wie du dich vielleicht erinnerst wurde unsere <code>pink-text</code> Klasse von darauffolgenden Klassen, Ids und Inline Styles überschrieben.",
+            "<hr>",
+            "Füge das Schlüsselwort <code>!important</code> zu der Farbe deines \"pink-text\" Elements hinzu um 100% sicher zu gehen dass das <code>h1</code> Element pink ist.",
+            "Hier ist ein Beispiel wie man das macht:",
+            "<code>color: red !important;</code>"
+          ]
+        },
+        "es": {
+          "title": "Anula todos los demás estilos utilizando Important",
+          "description": [
+            "¡Hurra! Demostramos que los estilos en línea anularán todas las declaraciones CSS de tu elemento <code>style</code>. ",
+            "¡Pero espera! Hay una última forma de anular CSS. Este es el método más poderoso de todos. Pero antes de hacerlo, vamos a hablar de por qué puedes querer anular CSS. ",
+            "En muchas situaciones, usarás bibliotecas CSS. Estas pueden anular accidentalmente tu propio CSS. Por eso, cuando necesitas estar seguro de que un elemento tiene un CSS específico puedes usar <code>!important</code>",
+            "Regresemos a nuestra declaración de clase <code>pink-text</code>. Recuerda que nuestra clase <code>pink-text</code> fue anulada por declaraciones de clases posteriores, declaraciones id, y estilos en línea. ",
+            "<hr>",
+            "Vamos a añadir la palabra clave <code>!important</code> a tu declaración del color de <code>pink-text</code> para estar 100% seguros que tu elemento <code>h1</code> será rosado.",
+            "Un ejemplo de cómo hacer esto es:",
+            "<code>color: red !important;</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Sobreponha Todos os Outros Elementos Utilizando Important",
+          "description": [
+            "Isso! Demonstramos que os estilos inline irão sobrepor todas as declarações CSS de seu elemento <code>style</code>.",
+            "Mas, espere! Há uma última forma de sobrepor com CSS. Este é o método mais poderoso de todos. Contudo, antes de colocá-lo em prática, vamos falar sobre os motivos que podem fazer você querer sobrepor CSS.",
+            "Em diversas situações, você usará bibliotecas CSS. Pode ser que essas bibliotecas sobreponham acidentalmente o seu próprio CSS. Por isso, quando você precisar estar seguro de que um elemento possui um CSS específico, você poderá utilizar <code>!important</code>.",
+            "Certo, vamos voltar para a nossa declaração de classe <code>pink-text</code>. Relembre que nossa classe <code>pink-text</code> foi sobreposta pelas declarações de classe posteriores, por declarações id e por estilos inline.",
+            "<hr>",
+            "Vamos adicionar nossa palavra-clave <code>!important</code> para sua declaração de cor de <code>pink-text</code> para que possamos estar 100% seguros que seu elemento <code>h1</code> será sempre cor de rosa.",
+            "Um exemplo para fazer isso é:",
+            "<code>color: red !important;</code>"
+          ]
+        },
+        "ru": {
+          "title": "Переопределите все другие стили применив important",
+          "description": [
+            "Ура! Мы только что доказали, что встроенные стили переопределяют все другие объявления CSS-свойств в вашем элементе <code>style</code>.",
+            "Но подождите. Есть ещё один последний способ переопределения CSS. Это наиболее существенный способ из всех. Но перед тем, как мы его попробует, давайте поговорим о том, зачем вам может понадобиться переопрелить CSS.",
+            "Во множестве ситуаций вы будете использовать CSS-библиотеки. Это может переопределить ваш собственный CSS. Таким образом, когда вам требуется быть абсолютно уверенными в том, что элемент будет обладать определёнными CSS-свойствами, вы можете использовать <code>!important</code>",
+            "Давайте вернёмся к объявлению нашего класса <code>pink-text</code>. Помните, что наш класс <code>pink-text</code> был переопределён последующим классом, стилизацией атрибута <code>id</code>, встроенным стилем.",
+            "<hr>",
+            "Давайте добавим ключевое слово <code>!important</code> к вашему объявлению текста розовым, чтобы убедиться на 100%, что ваш элемент <code>h1</code> будет розовый.",
+            "Пример того, как это можено сделать:",
+            "<code>color: red !important;</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08726",
+      "title": "Use Hex Code for Specific Colors",
+      "description": [
+        "Did you know there are other ways to represent colors in CSS? One of these ways is called hexadecimal code, or <code>hex code</code> for short.",
+        "We usually use <code>decimals</code>, or base 10 numbers, which use the symbols 0 to 9 for each digit. <code>Hexadecimals</code> (or <code>hex</code>) are base 16 numbers. This means it uses sixteen distinct symbols. Like decimals, the symbols 0-9 represent the values zero to nine. Then A,B,C,D,E,F represent the values ten to fifteen. Altogether, 0 to F can represent a digit in <code>hexadecimal</code>, giving us 16 total possible values. You can find more information about <a target='_blank' href='https://en.wikipedia.org/wiki/Hexadecimal'>hexadecimal numbers here</a>.",
+        "In CSS, we can use 6 hexadecimal digits to represent colors, two each for the red (R), green (G), and blue (B) components. For example, <code>#000000</code> is black and is also the lowest possible value. You can find more information about the <a target='_blank' href='https://en.wikipedia.org/wiki/RGB_color_model'>RGB color system here</a>.",
+        "<blockquote>body {<br>  color: #000000;<br>}</blockquote>",
+        "<hr>",
+        "Replace the word <code>black</code> in our <code>body</code> element's background-color with its <code>hex code</code> representation, <code>#000000</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: black;",
+        "  }",
+        "</style>"
+      ],
+      "tests": [
+        "assert($(\"body\").css(\"background-color\") === \"rgb(0, 0, 0)\", 'message: Give your <code>body</code> element the background-color of black.');",
+        "assert(code.match(/body\\s*{(([\\s\\S]*;\\s*?)|\\s*?)background.*\\s*:\\s*?#000(000)?((\\s*})|(;[\\s\\S]*?}))/gi), 'message: Use the <code>hex code</code> for the color black instead of the word <code>black</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verwende hexadezimal Code für spezifische Farben",
+          "description": [
+            "Wusstest du dass es andere Möglichkeiten gibt Farben in CSS darzustellen? Eine dieser Möglichkeiten ist \"Hexadezimal Code\" genannt, oder kurz <code>hex code</code>.",
+            "Wir verwenden üblicherweise <code>decimals</code> (Dezimalen), oder Zehnersystem, das für jede Ziffer eine Symbol von 0 bis 9 verwendet. <code>Hexadecimals</code> (Hexadezimalzahlen oder <code>hex</code>) beruhen auf einer 16er Basis. Das bedeuted dass sie 16 verschiedene Symbole verwenden. Wie auch Dezimalzahlen, repräsentiern die Symbole \"0\"-\"9\" Null bis Neun. Dann allerdings geht es weiter mit A,B,C,D,E,F für die Zahlen 10-15. Alles in Allem kann eine einzige Ziffer, mit 0 bis F, in <code>hexadecimal</code> 16 mögliche Werte ausdrücken. Mehr Informationen über das Hexadezimalsystem kannst du <a target='_blank' href='https://de.wikipedia.org/wiki/Hexadezimalsystem'>hier</a> finden.",
+            "In CSS können wir 6 Hexadezimalziffern verwenden um eine Farbe auszudrücken, je zwei für den Rot- (R), Grün (G)- und Blauanteil (B). <code>#000000</code> ist zum Beispiel schwarz und der niedrigst mögliche Wert. Mehr Information über den RGB Farbraum findest du <a target:'_blank' href='https://de.wikipedia.org/wiki/RGB-Farbraum'>hier</a>.",
+            "<hr>",
+            "Ersetzte das Wort <code>black</code> in der Hintergrundfarbe deines <code>body</code> Elements mit dem <code>hex code</code> <code>#000000</code>."
+          ]
+        },
+        "es": {
+          "title": "Usa el código hexadecimal para especificar colores",
+          "description": [
+            "¿Sabías que hay otras maneras de representar los colores en CSS? Una de estas formas es llamada código hexadecimal o <code>código hex</code> para abreviar. ",
+            "El sistema <code>Decimal</code> se refiere al que nos permite representar cantidades empleando los dígitos del cero al nueve - los números que la gente usa en la vida cotidiana. El sistema <code>Hexadecimal</code> incluye estos 10 dígitos más las letras A, B, C, D, E y F. Esto significa que Hexadecimal tiene un total de 16 dígitos posibles, en lugar de las 10 posibles que nos da nuestro sistema numérico normal en base 10. ",
+            "Con CSS, utilizamos 6 dígitos hexadecimales para representar los colores. Por ejemplo, <code>#000000</code> es el valor más bajo posible, y representa el color negro. ",
+            "<hr>",
+            "Reemplaza la palabra <code>black</code> en el color de fondo (<code>background-color</code>) de nuestro elemento <code>body</code> por su representación hexadecimal <code>#000000</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Use Código Hexadecimal para Especificar Cores",
+          "description": [
+            "Você sabia que existem outras formas para representar as cores em CSS? Uma dessas formas é com o que chamamos de código hexadecimal, ou <code>código hex</code> para abreviar.",
+            "O sistema <code>Decimal</code> nos permite representar quantidades numéricas com os dígitos de zero a nove - assim como nós os utilizamos durante o nosso dia a dia. Já o sistema <code>Hexadecimal</code> inclui estes 10 dígitos e também as letras A, B, C, D, E e F. Isso significa que o Hexadecimal possui um total de 16 dígitos possíveis, ao invés dos 10 possíveis que podemos usar com nosso sistema numérico normal de base 10.",
+            "No CSS, utilizamos 6 dígitos hexadecimais para representar as cores. Por exemplo, <code>#000000</code> é o valor mais baixo possível, e representa a cor preta.",
+            "<hr>",
+            "Substitua a palavra <code>black</code> na cor de fundo (<code>background-color</code>) de nosso elemento <code>body</code> pela sua representação hexadecimal <code>#000000</code>."
+          ]
+        },
+        "ru": {
+          "title": "Используйте hex-цвета для выбора определённых цветов",
+          "description": [
+            "Знали ли вы, что существуют другие способы представления цветов в CSS? Одним из этих способов является шестнадцатиричный код, <code>hex-код</code>, если короче.",
+            "Обычно мы используем <code>десятки</code>, или десятичную систему счисления, в основе которой лежит число 10, которая использует символы от 0 до 9 для каждого числа. В основе <code>Шестнадцатиричной</code> системы лежит число 16. Это значит, что она использует шестнадцать различных символов. Как в десятичной, символы 0-9 соответствуют значениям от нуля до девяти. Далее A,B,C,D,E,F соответствуют значениям от десяти до пятнадцати. Вместе, от 0 до F, с их помощью можно представить число в <code>шестнадцатиричной</code> системе счисления, что даёт нам в целом 16 возможных значений. Вы можете найти больше информации о <a target='_blank' href='https://ru.wikipedia.org/wiki/%D0%A8%D0%B5%D1%81%D1%82%D0%BD%D0%B0%D0%B4%D1%86%D0%B0%D1%82%D0%B5%D1%80%D0%B8%D1%87%D0%BD%D0%B0%D1%8F_%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC%D0%B0_%D1%81%D1%87%D0%B8%D1%81%D0%BB%D0%B5%D0%BD%D0%B8%D1%8F'>шестнадцатиричной системе счисления тут</a>.",
+            "В CSS, мы можем использовать 6 шестнадцатиричных чисел для представления цвета, по два на каждый компонент: красный (R), зелёный (G), синий (B). Например, <code>#000000</code> - черный цвет и минимальное значение. Вы можете найти больше информации о <a target='_blank' href='https://ru.wikipedia.org/wiki/RGB'>цветовой модели RGB</a>.",
+            "<hr>",
+            "Замените слово <code>black</code> в свойстве <code>background-color</code> нашего элемента <code>body</code> на представление в виде <code>hex-кода</code>, <code>#000000</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08721",
+      "title": "Use Hex Code to Mix Colors",
+      "description": [
+        "To review, hex codes use 6 hexadecimal digits to represent colors, two each for red (R), green (G), and blue (B) components.",
+        "From these three pure colors (red, green, and blue), we can vary the amounts of each to create over 16 million other colors!",
+        "For example, orange is pure red, mixed with some green, and no blue. In hex code, this translates to being <code>#FFA500</code>.",
+        "The digit <code>0</code> is the lowest number in hex code, and represents a complete absence of color.",
+        "The digit <code>F</code> is the highest number in hex code, and represents the maximum possible brightness.",
+        "<hr>",
+        "Replace the color words in our <code>style</code> element with their correct hex codes.",
+        "<table class='table table-striped'><tr><th>Color</th><th>Hex Code</th></tr><tr><td>Dodger Blue</td><td><code>#1E90FF</code></td></tr><tr><td>Green</td><td><code>#00FF00</code></td></tr><tr><td>Orange</td><td><code>#FFA500</code></td></tr><tr><td>Red</td><td><code>#FF0000</code></td></tr></table>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: black;",
+        "  }",
+        "  .green-text {",
+        "    color: black;",
+        "  }",
+        "  .dodger-blue-text {",
+        "    color: black;",
+        "  }",
+        "  .orange-text {",
+        "    color: black;",
+        "  }",
+        "</style>",
+        "",
+        "<h1 class=\"red-text\">I am red!</h1>",
+        "",
+        "<h1 class=\"green-text\">I am green!</h1>",
+        "",
+        "<h1 class=\"dodger-blue-text\">I am dodger blue!</h1>",
+        "",
+        "<h1 class=\"orange-text\">I am orange!</h1>"
+      ],
+      "tests": [
+        "assert($('.red-text').css('color') === 'rgb(255, 0, 0)', 'message: Give your <code>h1</code> element with the text <code>I am red!</code> the <code>color</code> red.');",
+        "assert(code.match(/\\.red-text\\s*?{\\s*?color:\\s*?#FF0000\\s*?;\\s*?}/gi), 'message: Use the <code>hex code</code> for the color red instead of the word <code>red</code>.');",
+        "assert($('.green-text').css('color') === 'rgb(0, 255, 0)', 'message: Give your <code>h1</code> element with the text <code>I am green!</code> the <code>color</code> green.');",
+        "assert(code.match(/\\.green-text\\s*?{\\s*?color:\\s*?#00FF00\\s*?;\\s*?}/gi), 'message: Use the <code>hex code</code> for the color green instead of the word <code>green</code>.');",
+        "assert($('.dodger-blue-text').css('color') === 'rgb(30, 144, 255)', 'message: Give your <code>h1</code> element with the text <code>I am dodger blue!</code> the <code>color</code> dodger blue.');",
+        "assert(code.match(/\\.dodger-blue-text\\s*?{\\s*?color:\\s*?#1E90FF\\s*?;\\s*?}/gi), 'message: Use the <code>hex code</code> for the color dodger blue instead of the word <code>dodgerblue</code>.');",
+        "assert($('.orange-text').css('color') === 'rgb(255, 165, 0)', 'message: Give your <code>h1</code> element with the text <code>I am orange!</code> the <code>color</code> orange.');",
+        "assert(code.match(/\\.orange-text\\s*?{\\s*?color:\\s*?#FFA500\\s*?;\\s*?}/gi), 'message: Use the <code>hex code</code> for the color orange instead of the word <code>orange</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verwende Hexadezimal Code um Farben zu mischen",
+          "description": [
+            "Mit diesen drei puren Farben (Rot, Grün und Blau) können wir 16 Millionen andere Farben erzeugen.",
+            "Orange, zum Beispiel, ist pures Rot, gemischt mit ein bisschen Grün und keinem Blau",
+            "<hr>",
+            "Gib dem <code>body</code> Element eine orange Hintergrundfarbe indem du den Hexadezimal Code <code>#FFA500</code> verwendest."
+          ]
+        },
+        "es": {
+          "title": "Usa código hex para mezclar colores",
+          "description": [
+            "A partir de estos tres colores puros (rojo, verde y azul), podemos crear 16 millones de colores.",
+            "Por ejemplo, el naranja es rojo puro, mezclado con un poco de verde, y sin azul.",
+            "<hr>",
+            "Haz que el color de fondo del elemento <code>body</code> sea anaranjado, dándole el código hexadecimal <code>#FFA500</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Use Código Hexadecimal para Misturar Cores",
+          "description": [
+            "A partir dessas três cores puras (vermelho, verde e azul), podemos criar 16 milhões de cores.",
+            "Por exemplo, o laranja é vermelho puro misturado com um pouco de verde, e sem nada de azul.",
+            "<hr>",
+            "Faça com que a cor de fundo do elemento <code>body</code> seja alaranjada, usando o código hexadecimal <code>#FFA500</code>."
+          ]
+        },
+        "ru": {
+          "title": "Используйте hex-код, чтобы смешивать цвета",
+          "description": [
+            "Из этих трёх чистых цветов (красного, зелёного и синего), мы можем создать 16 миллионов других цветов.",
+            "Например, оранжевый - смесь чистого красного с примесью зелёного, но без синего.",
+            "<hr>",
+            "Сделайте цвет фона элемента <code>body</code> оранжевым, присвоив его соответствующему свойству значение hex-кода равное <code>#FFA500</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08719",
+      "title": "Use Abbreviated Hex Code",
+      "description": [
+        "Many people feel overwhelmed by the possibilities of more than 16 million colors. And it's difficult to remember hex code. Fortunately, you can shorten it.",
+        "For example, red's hex code <code>#FF0000</code> can be shortened to <code>#F00</code>. This shortened form gives one digit for red, one digit for green, and one digit for blue.",
+        "This reduces the total number of possible colors to around 4,000. But browsers will interpret <code>#FF0000</code> and <code>#F00</code> as exactly the same color.",
+        "<hr>",
+        "Go ahead, try using the abbreviated hex codes to color the correct elements.",
+        "<table class='table table-striped'><tr><th>Color</th><th>Short Hex Code</th></tr><tr><td>Cyan</td><td><code>#0FF</code></td></tr><tr><td>Green</td><td><code>#0F0</code></td></tr><tr><td>Red</td><td><code>#F00</code></td></tr><tr><td>Fuchsia</td><td><code>#F0F</code></td></tr></table>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: #000000;",
+        "  }",
+        "  .fuchsia-text {",
+        "    color: #000000;",
+        "  }",
+        "  .cyan-text {",
+        "    color: #000000;",
+        "  }",
+        "  .green-text {",
+        "    color: #000000;",
+        "  }",
+        "</style>",
+        "",
+        "<h1 class=\"red-text\">I am red!</h1>",
+        "",
+        "<h1 class=\"fuchsia-text\">I am fuchsia!</h1>",
+        "",
+        "<h1 class=\"cyan-text\">I am cyan!</h1>",
+        "",
+        "<h1 class=\"green-text\">I am green!</h1>"
+      ],
+      "tests": [
+        "assert($('.red-text').css('color') === 'rgb(255, 0, 0)', 'message: Give your <code>h1</code> element with the text <code>I am red!</code> the <code>color</code> red.');",
+        "assert(code.match(/\\.red-text\\s*?{\\s*?color:\\s*?#F00\\s*?;\\s*?}/gi), 'message: Use the abbreviate <code>hex code</code> for the color red instead of the hex code <code>#FF0000</code>.');",
+        "assert($('.green-text').css('color') === 'rgb(0, 255, 0)', 'message: Give your <code>h1</code> element with the text <code>I am green!</code> the <code>color</code> green.');",
+        "assert(code.match(/\\.green-text\\s*?{\\s*?color:\\s*?#0F0\\s*?;\\s*?}/gi), 'message: Use the abbreviated <code>hex code</code> for the color green instead of the hex code <code>#00FF00</code>.');",
+        "assert($('.cyan-text').css('color') === 'rgb(0, 255, 255)', 'message: Give your <code>h1</code> element with the text <code>I am cyan!</code> the <code>color</code> cyan.');",
+        "assert(code.match(/\\.cyan-text\\s*?{\\s*?color:\\s*?#0FF\\s*?;\\s*?}/gi), 'message: Use the abbreviated <code>hex code</code> for the color cyan instead of the hex code <code>#00FFFF</code>.');",
+        "assert($('.fuchsia-text').css('color') === 'rgb(255, 0, 255)', 'message: Give your <code>h1</code> element with the text <code>I am fuchsia!</code> the <code>color</code> fuchsia.');",
+        "assert(code.match(/\\.fuchsia-text\\s*?{\\s*?color:\\s*?#F0F\\s*?;\\s*?}/gi), 'message: Use the abbreviated <code>hex code</code> for the color fuchsia instead of the hex code <code>#FF00FF</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verwende abgekürzten Hexadezimal Code",
+          "description": [
+            "Viele Leute fühlen sich mit der Auswahl aus über 16 Millionen Farben überfordert. Außerdem ist es schwierig sich Hexadezimal Codes zu merken. Zum Glück kannst du sie abkürzen.",
+            "Rot, zum Beispiel, mit dem Hexadezimal Code von <code>#FF0000</code> kannst du mit <code>#F00</code> abkürzen. Das bedeuted eine Ziffer für Rot, eine für Grün und eine für Blau",
+            "Das reduziert die Gesamtsumme an möglichen Farben auf ungefähr 4.000. Aber Browser interpretieren <code>#FF0000</code> und <code>#F00</code> als exakt die gleiche Farbe.",
+            "<hr>",
+            "Probiere <code>#F00</code> aus um die Hintergrundfarbe des <code>body</code> Elements rot zu färben."
+          ]
+        },
+        "es": {
+          "title": "Uso código hex abreviado",
+          "description": [
+            "Mucha gente se siente abrumada por las posibilidades de más de 16 millones de colores. Y es difícil recordar el código hexadecimal. Afortunadamente puedes acortarlo. ",
+            "Por ejemplo, el rojo, que es <code>#FF0000</code> en código hexadecimal, se puede abreviar a <code>#F00</code>. Es decir, un dígito para el rojo, un dígito para el verde, un dígito para el azul. ",
+            "Esto reduce el número total de posibles colores a alrededor de 4.000. Pero los navegadores interpretarán <code>#FF0000</code> y <code>#F00</code> como exactamente el mismo color. ",
+            "<hr>",
+            "Adelante, intenta usar <code>#F00</code> para volver rojo el color de fondo del elemento <code>body</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Use Código Hexadecimal Abreviado",
+          "description": [
+            "Muitas pessoas se sentem confusas com as possibilidades de mais de 16 milhões de cores. Além disso, é difícil lembrar de códigos hexadecimais. Por sorte, podemos abreviá-lo.",
+            "Por exemplo, o vermelho que é <code>#FF0000</code> em código hexadecimal pode ser abreviado a <code>#F00</code>. Isso quer dizer que podemos usar um dígito para vermelho, um dígito para verde e um dígito para azul.",
+            "Fazer isso reduz o número total de possíveis cores para ao redor de 4.000. Apesar disso, os navegadores interpretarão <code>#FF0000</code> e <code>#F00</code> exatamente como a mesma cor.",
+            "<hr>",
+            "Continue, tente usar <code>#F00</code> para fazer com que a cor de fundo do elemento <code>body</code> seja vermelha."
+          ]
+        },
+        "ru": {
+          "title": "Используйте аббревиатуры hex-кода",
+          "description": [
+            "Множество людей обременяет возможность применения более 16-ти миллионов цветов. И hex-коды достаточно сложно запоминать. К счастью, вы можете использовать укороченные выражения.",
+            "Например, красный, который имеет значение <code>#FF0000</code> в виде hex-кода, может быть укорочен до <code>#F00</code>. В укороченном виде: одна цифра представляет красный, одна - зелёный, одна - синий.",
+            "Это уменьшает общее количество возможных цветов до порядка 4,000. Но браузеры будут интерпретировать <code>#FF0000</code> и <code>#F00</code> как один и тот же цвет.",
+            "<hr>",
+            "Вперёд, попробуйте применить значение <code>#F00</code>, чтобы сделать цвет фона элемента <code>body</code> красным."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aede08718",
+      "title": "Use RGB values to Color Elements",
+      "description": [
+        "Another way you can represent colors in CSS is by using <code>RGB</code> values.",
+        "The RGB value for black looks like this:",
+        "<code>rgb(0, 0, 0)</code>",
+        "The RGB value for white looks like this:",
+        "<code>rgb(255, 255, 255)</code>",
+        "Instead of using six hexadecimal digits like you do with hex code, with <code>RGB</code> you specify the brightness of each color with a number between 0 and 255.",
+        "If you do the math, the two digits for one color equal 16 times 16, which gives us 256 total values. So <code>RGB</code>, which starts counting from zero, has the exact same number of possible values as hex code.",
+        "Here's an example of how you'd change the body background to orange using its RGB code.",
+        "<blockquote>body {<br>  background-color: rgb(255, 165, 0);<br>}</blockquote>",
+        "<hr>",
+        "Let's replace the hex code in our <code>body</code> element's background color with the RGB value for black: <code>rgb(0, 0, 0)</code>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    background-color: #F00;",
+        "  }",
+        "</style>"
+      ],
+      "tests": [
+        "assert($(\"body\").css(\"background-color\") === \"rgb(0, 0, 0)\", 'message: Your <code>body</code> element should have a black background.');",
+        "assert(code.match(/rgb\\s*\\(\\s*0\\s*,\\s*0\\s*,\\s*0\\s*\\)/ig), 'message: Use <code>rgb</code> to give your <code>body</code> element a color of black.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verwende RGB Werte um Elemente zu färben",
+          "description": [
+            "Ein anderer Weg um Farben in CSS darzustellen ist <code>rgb</code> Werte zu verwenden.",
+            "Der RGB Wert für Schwarz sieht so aus:",
+            "<code>rgb(0, 0, 0)</code>",
+            "Der RGB Wert für Weiß sieht so aus:",
+            "<code>rgb(255, 255, 255)</code>",
+            "Anstatt sechs Hexadezimalziffern zu verwenden, legst du mit <code>rgb</code> die Helligkeit jeder einzelner Farbe mit einer Zahl zwischen 0 und 255 fest.",
+            "Wenn du nachrechnest, 16 mal 16 ist 256 Werte. Also hat <code>rgb</code>, das mit Null hochzuzählen beginnt, die gleiche Anzahl an möglichen Farben wie Hexadezimal Code.",
+            "<hr>",
+            "Ersetzte jetzt den Hexadezimal Code der Hintergrundfarbe deines <code>body</code> Elements mit dem RGB Wert für Schwarz: <code>rgb(0, 0, 0)</code>"
+          ]
+        },
+        "es": {
+          "title": "Usa RGB para colorear elementos",
+          "description": [
+            "Otra forma en la que puedes representar colores en CSS es usando valores <code>rgb</code>.",
+            "El valor RGB para el negro, luce así:",
+            "<code>rgb(0, 0, 0)</code>",
+            "El valor RGB para el blanco, se ve así:",
+            "<code>rgb(255, 255, 255)</code>",
+            "En lugar de utilizar seis dígitos hexadecimales, con <code>rgb</code> especificas el brillo de cada color con un número entre 0 y 255.",
+            "Si haces la matemática, 16 veces 16 es 256 valores totales.  Así que <code>rgb</code>, que comienza a contar desde cero, tiene exactamente el mismo número de valores posibles que el código hexadecimal.",
+            "<hr>",
+            "Remplacemos el código hexadecimal del color de fondo de nuestro elemento <code>body</code> por el valor RGB para el negro: <code>rgb(0, 0, 0)</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Use Valores RBG para Colorir Elementos",
+          "description": [
+            "Outra forma em que você pode representar cores em CSS é utilizando valores <code>rgb</code>.",
+            "O valor RGB para preto é assim:",
+            "<code>rgb(0, 0, 0)</code>",
+            "O valor RGB para branco é assim:",
+            "<code>rgb(255, 255, 255)</code>",
+            "Ao invés de utilizar 6 dígitos hexadecimais, com <code>rgb</code> você especifica o brilho de cada cor com um número entre 0 e 255.",
+            "Se você fizer a matemática, 16 vezes 16 é igual a 256 valores totais. Sendo assim, o <code>rgb</code>, que começa a contar desde zero, tem exatamente o mesmo número de valores possíveis que o código hexadecimal.",
+            "<hr>",
+            "Vamos substituir o código hexadecimal da cor de fundo do nosso elemento <code>body</code> pelo valor RGB para preto: <code>rgb(0, 0, 0)</code>."
+          ]
+        },
+        "ru": {
+          "title": "Используйте формат RGB для придания цвета элементам",
+          "description": [
+            "Другим способом представления цветов в CSS является применение значений <code>rgb</code>.",
+            "Значение RGB для чёрного цвета выглядит следующим образом:",
+            "<code>rgb(0, 0, 0)</code>",
+            "Значение RGB для белого выглядит так:",
+            "<code>rgb(255, 255, 255)</code>",
+            "Вместо использования шести шестнадцатиразрядных цифр, как вы делаете, когда применяете hex-код, применяя <code>rgb</code> вы указываете значение яркости каждого цвета в диапазоне от 0 до 255.",
+            "Если вы посчитаете, 16 раз по 16 - это 256 различных значений. Таким образом <code>rgb</code>, где счёт начинается с нуля, имеет ровно то же число возможных значений, что и hex-код.",
+            "<hr>",
+            "Давайте заменим hex-код в цвете фона нашего элемента <code>body</code> на значение в формате RGB для получения чёрного: <code>rgb(0, 0, 0)</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad82fee1348bd9aedf08721",
+      "title": "Use RGB to Mix Colors",
+      "description": [
+        "Just like with hex code, you can mix colors in RGB by using combinations of different values.",
+        "<hr>",
+        "Replace the hex codes in our <code>style</code> element with their correct RGB values.",
+        "<table class='table table-striped'><tr><th>Color</th><th>RGB</th></tr><tr><td>Blue</td><td><code>rgb(0, 0, 255)</code></td></tr><tr><td>Red</td><td><code>rgb(255, 0, 0)</code></td></tr><tr><td>Orchid</td><td><code>rgb(218, 112, 214)</code></td></tr><tr><td>Sienna</td><td><code>rgb(160, 82, 45)</code></td></tr></table>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .red-text {",
+        "    color: #000000;",
+        "  }",
+        "  .orchid-text {",
+        "    color: #000000;",
+        "  }",
+        "  .sienna-text {",
+        "    color: #000000;",
+        "  }",
+        "  .blue-text {",
+        "    color: #000000;",
+        "  }",
+        "</style>",
+        "",
+        "<h1 class=\"red-text\">I am red!</h1>",
+        "",
+        "<h1 class=\"orchid-text\">I am orchid!</h1>",
+        "",
+        "<h1 class=\"sienna-text\">I am sienna!</h1>",
+        "",
+        "<h1 class=\"blue-text\">I am blue!</h1>"
+      ],
+      "tests": [
+        "assert($('.red-text').css('color') === 'rgb(255, 0, 0)', 'message: Give your <code>h1</code> element with the text <code>I am red!</code> the <code>color</code> red.');",
+        "assert(code.match(/\\.red-text\\s*?{\\s*?color:\\s*?rgb\\(\\s*?255\\s*?,\\s*?0\\s*?,\\s*?0\\s*?\\)\\s*?;\\s*?}/gi), 'message: Use <code>rgb</code> for the color red.');",
+        "assert($('.orchid-text').css('color') === 'rgb(218, 112, 214)', 'message: Give your <code>h1</code> element with the text <code>I am orchid!</code> the <code>color</code> orchid.');",
+        "assert(code.match(/\\.orchid-text\\s*?{\\s*?color:\\s*?rgb\\(\\s*?218\\s*?,\\s*?112\\s*?,\\s*?214\\s*?\\)\\s*?;\\s*?}/gi), 'message: Use <code>rgb</code> for the color orchid.');",
+        "assert($('.blue-text').css('color') === 'rgb(0, 0, 255)', 'message: Give your <code>h1</code> element with the text <code>I am blue!</code> the <code>color</code> blue.');",
+        "assert(code.match(/\\.blue-text\\s*?{\\s*?color:\\s*?rgb\\(\\s*?0\\s*?,\\s*?0\\s*?,\\s*?255\\s*?\\)\\s*?;\\s*?}/gi), 'message: Use <code>rgb</code> for the color blue.');",
+        "assert($('.sienna-text').css('color') === 'rgb(160, 82, 45)', 'message: Give your <code>h1</code> element with the text <code>I am sienna!</code> the <code>color</code> sienna.');",
+        "assert(code.match(/\\.sienna-text\\s*?{\\s*?color:\\s*?rgb\\(\\s*?160\\s*?,\\s*?82\\s*?,\\s*?45\\s*?\\)\\s*?;\\s*?}/gi), 'message: Use <code>rgb</code> for the color sienna.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verwende RGB um Farben zu mischen",
+          "description": [
+            "Wie auch mit Hexadezimal Code, kannst du Farben in RGB mischen indem du Kombination von verschiedenen Werten nimmst.",
+            "<hr>",
+            "Ändere die Hintergrundfarbe des <code>body</code> Elements zum RGB Wert von Orange: <code>rgb(255, 165, 0)</code>"
+          ]
+        },
+        "es": {
+          "title": "Usa RGB para mezclar colores",
+          "description": [
+            "Al igual que con el código hexadecimal, puedes mezclar los colores en RGB mediante el uso de combinaciones de diferentes valores.",
+            "<hr>",
+            "Cambia el color de fondo del elemento <code>body</code> a anaranjado usando su valor RGB: <code>rgb(255, 165, 0)</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Use Valores RBG para Misturar Cores",
+          "description": [
+            "Assim como com código hexadecimal, você pode misturar as cores com RGB através do uso de combinações de valores diferentes.",
+            "<hr>",
+            "Mude a cor de fundo do elemento <code>body</code> para alaranjado usando seu valor RGB: <code>rgb(255, 165, 0)</code>."
+          ]
+        },
+        "ru": {
+          "title": "Используйте формат RGB, чтобы смешивать цвета",
+          "description": [
+            "Так же как и с hex-кодом, вы можете смешивать цвета в формате RGB, используя комбинации различных значений.",
+            "<hr>",
+            "Измените цвет фона элемента <code>body</code> на значение в формате RGB соответствующее оранжевому: <code>rgb(255, 165, 0)</code>"
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/01-responsive-web-design/basic-html-and-html5.json b/seed/math-challenges/01-responsive-web-design/basic-html-and-html5.json
new file mode 100644
index 0000000000..65811ad429
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/basic-html-and-html5.json
@@ -0,0 +1,2134 @@
+{
+  "name": "Basic HTML and HTML5",
+  "order": 0,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d774b367417c4c2512a9b",
+      "title": "Introduction to the Basic HTML and HTML5 Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "HTML, or HyperText Markup Language, is a markup language to describe the structure of a web page. It uses a special syntax of elements to organize and give information about your content to the browser. Elements usually have opening and closing tags that surround and give meaning to content. For example, there are different tag options to place around text to show whether it's a heading, a paragraph, or a list.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "The HyperText part of HTML comes from the early days of the web. Pages usually contained static documents that connected to other documents with hypertext links. As web pages and web applications grow more complex, the W3 Consortium updates HTML. The latest version, or specification, is HTML5.<br><br>This section introduces how to use HTML elements to give structure and meaning to your web content.",
+          ""
+        ]
+      ],
+      "releasedOn": "",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {
+        "pt-br": {
+          "title": "Introdução aos desafios básicos de HTML e HTML5",
+          "description": [
+            [
+              "",
+              "",
+              "HTML, do inglês HyperText Markup Language (Linguagem de Marcação de Hipertexto), é uma linguagem de marcação usada para descrever a estrutura de uma página da web. Ela usa uma sintaxe especial de elementos para organizar seu conteúdo e dar ao seu navegador informações sobre ele. Esses elementos geralmente possuem tags (marcadores) de abertura e fechamento que delimitam uma parte do conteúdo e dão significado a ela. Por exemplo, para delimitar texto, existem diferentes opções de tags que mostram se esse texto é um título, um parágrafo ou uma lista.",
+              ""
+            ],
+            [
+              "",
+              "",
+              "A parte de \"hipertexto\" do HTML vem dos primórdios da web. As páginas geralmente eram documentos estáticos que se conectavam a outros documentos por meio de links de hipertexto. Conforme as páginas e aplicações web ficam mais complexas, o consórcio W3 atualiza o HTML. A última versão, ou especificação, é o HTML5.<br><br>Essa seção apresenta como usar os elementos do HTML para dar estrutura e significado ao seu conteúdo na web.",
+              ""
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c8c441eddfaeb5bdef",
+      "title": "Say Hello to HTML Elements",
+      "description": [
+        "Welcome to freeCodeCamp's coding challenges. These will walk you through web development step-by-step.",
+        "We recommend you do these in order, but feel free to skip around by clicking the map in the menu above.",
+        "Also, if you want to save your progress, you should join our community by creating an account. In just a few minutes, you can join our chat room, forum, and even a local study group in your city.",
+        "First, you'll start by building a simple web page using HTML. You can edit <code>code</code> in your <code>text editor</code>, which is embedded into this web page.",
+        "Do you see the code in your text editor that says <code>&#60;h1&#62;Hello&#60;/h1&#62;</code>? That's an HTML <code>element</code>.",
+        "Most HTML elements have an <code>opening tag</code> and a <code>closing tag</code>.",
+        "Opening tags look like this:",
+        "<code>&#60;h1&#62;</code>",
+        "Closing tags look like this:",
+        "<code>&#60;/h1&#62;</code>",
+        "The only difference between opening and closing tags is the forward slash after the opening bracket of a closing tag.",
+        "Each challenge has tests you can run at any time by clicking the \"Run tests\" button. When you pass all tests, you'll be prompted to submit your solution and go to the next coding challenge.",
+        "<hr>",
+        "To pass the test on this challenge, change your <code>h1</code> element's text to say \"Hello World\"."
+      ],
+      "challengeSeed": [
+        "<h1>Hello</h1>"
+      ],
+      "tests": [
+        {
+          "text": "Your <code>h1</code> element should have the text \"Hello World\".",
+          "testString": "assert.isTrue((/hello(\\s)+world/gi).test($('h1').text()), 'Your <code>h1</code> element should have the text \"Hello World\".');"
+        }
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Willkommen bei der ersten Programmier-Challenge von freeCodeCamp!",
+            "Mithilfe des eingebauten <code>text editor</code> kannst du den <code>code</code> bearbeiten.",
+            "Siehst du den Code <code>&#60;h1&#62;Hallo&#60;/h1&#62;</code> im Editor? Das ist ein HTML <code>element</code>",
+            "Die meisten HTML Elemente haben einen <code>opening tag</code> und einen <code>closing tag</code>.",
+            "Öffnende Tags sehen so aus:",
+            "<code>&#60;h1&#62;</code>",
+            "Schließende Tags so:",
+            "<code>&#60;/h1&#62;</code>",
+            "Beachte, dass der einzige Unterschied zwischen öffnenden und schließenden Tags ist, das schließende Tags ein Slash nach der sich öffnenden spitzen Klammer folgt.",
+            "Jede Challenge hat Tests die du jederzeit starten kannst indem du den \"Run tests\" Button drückst. Wenn alle Tests bestehen kannst du mit der nächsten Challenge fortfahren.",
+            "<hr>",
+            "Um den Test dieser Challenge zu bestehen, ändere den Text deines <code>h1</code> Elements von \"Hello\" zu \"Hello World\". Klicke dann den \"Run tests\" Button."
+          ]
+        },
+        "fr": {
+          "title": "Dites bonjour aux éléments HTML",
+          "description": [
+            "Bienvenue au premier défi de code de freeCodeCamp.",
+            "Vous pouvez modifier le <code>code</code> dans votre <code>éditeur texte</code>, lequel est disponible dans cette page.",
+            "Voyez-vous le code dans l'éditeur texte qui dit <code>&#60;h1&#62;Hello&#60;/h1&#62;</code>? C'est un <code>élément</code> HTML.",
+            "La plupart des éléments HTML ont une <code>balise ouvrante</code> et une <code>balise fermante</code>",
+            "Les balises ouvrantes ont cette apparence :",
+            "<code>&#60;h1&#62;</code>",
+            "Les balises fermantes ont cette apparence :",
+            "<code>&#60;/h1&#62;</code>",
+            "Notez que la seule différence entre une balise ouvrante et fermante est que la balise fermante a une barre oblique après son chevron ouvrant.",
+            "Chaque défi contient des tests que vous pouvez éxécuter en cliquant sur le bouton \"Run tests\". Lorsque tous les tests sont réussis, vous pouvez poursuivre avec le défi suivant.",
+            "<hr>",
+            "Pour réussir le test de ce défi, changez le texte de l'élément <code>h1</code> pour \"Hello World\" plutôt que \"Hello\". Cliquez ensuite sur le bouton \"Run tests\"."
+          ]
+        },
+        "pt-br": {
+          "title": "Diga oi para os elementos HTML",
+          "description": [
+            "Bem-vindo(a) aos desafios de programação do freeCodeCamp. Eles vão te guiar pelo desenvolvimento web passo a passo.",
+            "Nós recomendamos que você os resolva em ordem, mas fique à vontade para navegar pelos desafios clicando em \"map\" no menu acima.",
+            "Além disso, se você quiser salvar seu progresso, você deve entrar para nossa comunidade criando uma conta. Em apenas alguns minutos, você pode entrar na nossa sala de chat, fórum e até mesmo em um grupo de estudos da sua cidade.",
+            "Primeiramente, você vai começar construindo uma página da web simples com HTML. Você pode editar o <code>código</code> no seu <code>editor de texto</code>, que está embutido nessa página.",
+            "Você está vendo o código no seu editor de texto que contém <code>&#60;h1&#62;Hello&#60;/h1&#62;</code>? Esse é um <code>elemento</code> HTML.",
+            "A maioria dos elementos HTML têm uma <code>tag de abertura</code> e uma <code>tag de fechamento</code>.",
+            "As tags de abertura são assim:",
+            "<code>&#60;h1&#62;</code>",
+            "As tags de fechamento são assim:",
+            "<code>&#60;/h1&#62;</code>",
+            "A única diferença entre tags de abertura e fechamento é que as tags de fechamento possuem uma barra (/) depois do sinal de menor (<).",
+            "Cada desafio possui testes que você pode rodar a qualquer momento clicando no botão \"Run tests\". Quando seu código passar em todos os testes, você poderá enviar sua solução e avançar para o próximo desafio.",
+            "<hr>",
+            "Para passar no teste desse desafio, mude o texto do seu elemento <code>h1</code> para \"Hello World\"."
+          ]
+        },
+        "ru": {
+          "title": "Скажи привет HTML-элементам",
+          "description": [
+            "Добро пожаловать на первое программное испытание freeCodeCamp.",
+            "Вы можете редактировать <code>код</code> в вашем <code>текстовом редакторе</code>, который мы встроили в эту web-страницу.",
+            "Видите этот код в вашем текстовом редакторе: <code>&#60;h1&#62;Hello&#60;/h1&#62;</code>? Это HTML <code>элемент</code>.",
+            "Большинство HTML-элементов имеют <code>открывающую метку</code> <code>закрывающую метку</code>.",
+            "Открывающие метки выглядят так:",
+            "<code>&#60;h1&#62;</code>",
+            "Закрывающие метки выглядят следующим образом:",
+            "<code>&#60;/h1&#62;</code>",
+            "Обратите внимание, что единственная разница между открывающими и закрывающими метками заключается в наличии косой черты после открывающей треугольной скобки.",
+            "Каждое испытание имеет функцию проверки решения, которую вы можете запустить в любой момент нажатием на кнопку \"Run tests\". Как только ваше решение будет удовлетворять всем требованиям, вы сможете перейти к следующему испытанию.",
+            "<hr>",
+            "Для прохождения этого испытания измените текст элемента <code>h1</code> с \"Hello\" на \"Hello World\". Затем нажмите кнопку \"Run tests\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf0887a",
+      "title": "Headline with the h2 Element",
+      "description": [
+        "Over the next two sections, we'll build an HTML5 app that will look something like this:",
+        "<a href=\"//i.imgur.com/jOc1JF1.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/jOc1JF1.png\" title=\"Click to enlarge\" alt=\"A screen shot of our finished Cat Photo App\"></a>",
+        "The <code>h2</code> element you enter will create an <code>h2</code> element on the website.",
+        "This element tells the browser about the structure of your website. <code>h1</code> elements are often used for main headings, while <code>h2</code> elements are generally used for subheadings. There are also <code>h3</code>, <code>h4</code>, <code>h5</code> and <code>h6</code> elements to indicate different and new sections.",
+        "<hr>",
+        "Add an <code>h2</code> tag that says \"CatPhotoApp\" to create a second HTML <code>element</code> below your \"Hello World\" <code>h1</code> element."
+      ],
+      "challengeSeed": [
+        "<h1>Hello World</h1>"
+      ],
+      "tests": [
+        "assert(($(\"h2\").length > 0), 'message: Create an <code>h2</code> element.');",
+        "assert(code.match(/<\\/h2>/g) && code.match(/<\\/h2>/g).length === code.match(/<h2>/g).length, 'message: Make sure your <code>h2</code> element has a closing tag.');",
+        "assert.isTrue((/cat(\\s)?photo(\\s)?app/gi).test($(\"h2\").text()), 'message: Your <code>h2</code> element should have the text \"CatPhotoApp\".');",
+        "assert.isTrue((/hello(\\s)+world/gi).test($(\"h1\").text()), 'message: Your <code>h1</code> element should have the text \"Hello World\".');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "In den nächsten Challenges werden wir eine HTML5 App entwickeln die ungefähr so aussehen wird:",
+            "<a href=\"//i.imgur.com/jOc1JF1.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/jOc1JF1.png\" title=\"Klicke zum Vergrößern\" alt=\"Ein Screenshot von unserer beendeted Katzenfoto App\"></a>",
+            "Das eingetragene <code>h2</code> Element wird ein <code>h2</code> Element auf der Website erzeugen.",
+            "Dieses Element sagt dem Browser, wie die Struktur deiner Website aufgebaut ist. <code>h1</code> Elemente werden oft für Hauptüberschriften verwendet, während <code>h2</code> Elemente üblicherweise für Zwischenüberschriften verwendet werden. Es gibt auch <code>h3</code>, <code>h4</code>, <code>h5</code> und <code>h6</code> Elemente die verschiedene und neue Bereiche kennzeichnen.",
+            "<hr>",
+            "Füge unter <code>h1</code> \"Hello World\" ein zweites HTML Element <code>h2</code> hinzu, in dem \"CatPhotoApp\" steht."
+          ]
+        },
+        "fr": {
+          "title": "Un titre avec l'élément h2",
+          "description": [
+            "Pour les quelques prochains défis, nous construirons une application HTML5 qui ressemblera à ceci :",
+            "<a href=\"//i.imgur.com/jOc1JF1.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/jOc1JF1.png\" title=\"Cliquez pour agrandir\" alt=\"Une capture écran de notre application de photo de chats\"></a>",
+            "L'élément <code>h2</code> que vous entrerez créera un élément <code>h2</code> sur le site.",
+            "Cet élément renseigne votre navigateur sur la structure de votre site. Les éléments <code>h1</code> sont souvent utilisés comme titre, tandis que les éléments <code>h2</code> sont généralement utilisés comme sous-titres. Il existe également les éléments <code>h3</code>, <code>h4</code>, <code>h5</code> et <code>h6</code> qui indiquent une nouvelle et différente section.",
+            "<hr>",
+            "Ajoutez une balise <code>h2</code> contenant \"CatPhotoApp\" pour créer un second <code>élément</code> HTML sous l'élément <code>h1</code> contenant \"Hello World\"."
+          ]
+        },
+        "pt-br": {
+          "title": "Título com o elemento h2",
+          "description": [
+            "Nas próximas duas seções, nós vamos construir um app HTML5 que vai ficar mais ou menos assim:",
+            "<a href=\"//i.imgur.com/jOc1JF1.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/jOc1JF1.png\" title=\"Clique para ampliar\" alt=\"Um screenshot do app de fotos de gatos terminado\"></a>",
+            "O elemento <code>h2</code> que você vai adicionar vai criar um elemento <code>h2</code> na página.",
+            "Esse elemento indica ao navegador a estrutura do seu site. Elementos <code>h1</code> são geralmente usados para os títulos principais, enquanto elementos <code>h2</code> são usados para subtítulos. Também existem os elementos <code>h3</code>, <code>h4</code>, <code>h5</code> e <code>h6</code>, que indicam seções novas e diferentes.",
+            "<hr>",
+            "Adicione uma tag <code>h2</code> com o texto \"CatPhotoApp\" para criar um segundo <code>elemento</code> HTML abaixo do seu elemento <code>h1</code> com o texto \"Hello World\"."
+          ]
+        },
+        "ru": {
+          "title": "Заголовок с применением элемента h2",
+          "description": [
+            "В результате прохождения нескольких следующих испытаний, мы построим HTML5 приложение, которое будет похоже на это:",
+            "<a href=\"//i.imgur.com/jOc1JF1.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/jOc1JF1.png\" title=\"Click to enlarge\" alt=\"A screen shot of our finished Cat Photo App\"></a>",
+            "Вводимый вами элемент <code>h2</code> создаст соответствующий элемент <code>h2</code> на web-странице.",
+            "Этот элемент сообщает браузеру о структуре вашего web-сайта. Элементы <code>h1</code> часто применяют в качестве главных заголовков, в то время как элементы <code>h2</code> обычно используют для обозначения позаголовков. Также существуют элементы <code>h3</code>, <code>h4</code>, <code>h5</code> и <code>h6</code> для обозначения отдельных секций.",
+            "<hr>",
+            "Добавьте метку <code>h2</code> с текстом \"CatPhotoApp\" для создания второго HTML <code>элемента</code> под вашим элементом <code>h1</code> с текстом \"Hello World\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08801",
+      "title": "Inform with the Paragraph Element",
+      "description": [
+        "<code>p</code> elements are the preferred element for normal-sized paragraph text on websites. P is short for \"paragraph\".",
+        "You can create a <code>p</code> element like this:",
+        "<code>&#60;p&#62;I'm a p tag!&#60;/p&#62;</code>",
+        "<hr>",
+        "Create a <code>p</code> element below your <code>h2</code> element, and give it the text \"Hello Paragraph\"."
+      ],
+      "challengeSeed": [
+        "<h1>Hello World</h1>",
+        "<h2>CatPhotoApp</h2>"
+      ],
+      "tests": [
+        "assert(($(\"p\").length > 0), 'message: Create a <code>p</code> element.');",
+        "assert.isTrue((/hello(\\s)+paragraph/gi).test($(\"p\").text()), 'message: Your <code>p</code> element should have the text \"Hello Paragraph\".');",
+        "assert(code.match(/<\\/p>/g) && code.match(/<\\/p>/g).length === code.match(/<p/g).length, 'message: Make sure your <code>p</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "<code>p</code> Elemente sind das bevorzugte Element für normale Paragraphentexte auf einer Website. P ist die Abkürzung für \"Paragraph\".",
+            "Du kannst ein <code>p</code> Element so erzeugen:",
+            "<code>&#60;p&#62;Ich bin ein p Element!&#60;/p&#62;</code>",
+            "<hr>",
+            "Erstelle ein <code>p</code> Element unter deinem <code>h2</code> Element und füge den Text \"Hello Paragraph\" ein."
+          ]
+        },
+        "fr": {
+          "title": "Informez avec l'élément paragraphe",
+          "description": [
+            "L'élément <code>p</code> est le préféré pour les textes de paragraphes de taille normale. P est l'acronyme de \"paragraphe\",",
+            "Vous pouvez créer un élément <code>p</code> comme ceci :",
+            "<code>&#60;p&#62;Je suis une balise p!&#60;/p&#62;</code>",
+            "<hr>",
+            "Créez un élément <code>p</code> sous votre élément <code>h2</code> et inscrivez-y le texte \"Hello Paragraph\"."
+          ]
+        },
+        "pt-br": {
+          "title": "Informe com o elemento de parágrafo",
+          "description": [
+            "Elementos <code>p</code> são os elementos preferenciais para parágrafos de texto de tamanho normal em sites. P é a abreviação de \"parágrafo\".",
+            "Você pode criar um elemento <code>p</code> assim:",
+            "<code>&#60;p&#62;Eu sou uma tag p!&#60;/p&#62;</code>",
+            "<hr>",
+            "Crie um elemento <code>p</code> abaixo do seu elemento <code>h2</code>, e dê a ele o texto \"Hello Paragraph\"."
+          ]
+        },
+        "ru": {
+          "title": "Проинформируйте с применением элемента p",
+          "description": [
+            "Элементы <code>p</code> предпочтительно использовать для обозначения параграфов с текстом нормального размера в web-сайтах. P - сокращение от \"paragraph\".",
+            "Вы можете создать элемент <code>p</code> следующим образом:",
+            "<code>&#60;p&#62;Я метка p!&#60;/p&#62;</code>",
+            "<hr>",
+            "Создайте элемент <code>p</code> под вашим элементом <code>h2</code> и присвойте ему текст \"Hello Paragraph\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08833",
+      "title": "Fill in the Blank with Placeholder Text",
+      "description": [
+        "Web developers traditionally use <code>lorem ipsum text</code> as placeholder text. The 'lorem ipsum' text is randomly scraped from a famous passage by Cicero of Ancient Rome.",
+        "Lorem ipsum text has been used as placeholder text by typesetters since the 16th century, and this tradition continues on the web.",
+        "Well, 5 centuries is long enough. Since we're building a CatPhotoApp, let's use something called <code>kitty ipsum text</code>.",
+        "<hr>",
+        "Replace the text inside your <code>p</code> element with the first few words of this kitty ipsum text: <code>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</code>"
+      ],
+      "challengeSeed": [
+        "<h1>Hello World</h1>",
+        "",
+        "<h2>CatPhotoApp</h2>",
+        "",
+        "<p>Hello Paragraph</p>"
+      ],
+      "tests": [
+        "assert.isTrue((/Kitty(\\s)+ipsum/gi).test($(\"p\").text()), 'message: Your <code>p</code> element should contain the first few words of the provided <code>kitty ipsum text</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Webentwickler nutzen für gewöhnlich \"Lorem Ipsum Text\" als Platzhalter. Es heißt \"Lorem Ipsum\", weil es die ersten zwei Wörter aus einer bekannten Passage von Cicero des alten Roms sind.",
+            "\"Lorem Ipsum\" Text wurde seit dem 16. Jahrhundert von Schriftsetzern als Platzhalter verwendet. Und diese Tradition setzt sich im Web fort.",
+            "Nun gut, fünf Jahrhunderte sind lange genug. Da wir eine CatPhotoApp entwickeln, lass uns stattdessen lieber <code>kitty ipsum text</code> nutzen.",
+            "<hr>",
+            "Ersetze den Text in deinem <code>p</code> Element mit den ersten Wörtern des \"Kitty Ipsum\" Textes: <code>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</code>"
+          ]
+        },
+        "fr": {
+          "title": "Remplissez les blancs avec du faux-texte",
+          "description": [
+            "Les développeurs Web utilisent traditionnellement du <code>lorem ipsum</code> comme texte de substitution. Le texte lorem ipsum provient d'un extrait de Cicero, de la Rome antique.",
+            "Le texte lorem ipsum a été utilisé comme faux-texte par des typographes depuis le 16<sup>ème</sup> siècle et cette tradition se poursuit sur le Web.",
+            "Enfin, 5 siècles est suffisament long. Étant donné que nous fabriquons une application de photos de chats, utilisons plutôt du texte <code>Kitty ipsum</code>.",
+            "<hr>",
+            "Remplacez le texte à l'intérieur des éléments <code>p</code> avec ces quelques mots du texte Kitty ipsum : <code>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Preencha o vazio com texto de exemplo",
+          "description": [
+            "Desenvolvedores web tradicionalmente usam <code>lorem ipsum</code> como texto de exemplo. Os textos 'lorem ipsum' são partes retiradas aleatoriamente de uma passagem famosa escrita por Cícero na Roma Antiga.",
+            "Esses textos têm sido usados como texto de exemplo por tipógrafos desde o século 16, e essa tradição continua na web.",
+            "Bem, 5 séculos é tempo suficiente. Já que estamos construindo um app de fotos de gatos, vamos usar um novo texto chamado de <code>gatinho ipsum</code>.",
+            "<hr>",
+            "Substitua o texto dentro do seu elemento <code>p</code> com as primeiras palavras desse gatinho ipsum: <code>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</code>"
+          ]
+        },
+        "ru": {
+          "title": "Заполните пустоты замещающим текстом",
+          "description": [
+            "Традиционно web-разработчики используют текст <code>lorem ipsum</code> в качестве замещающего текста. Он называется тектсом <code>lorem ipsum</code> по первым двум словам известного пассажа Цицерона из Древнего Рима.",
+            "Текст <code>lorem ipsum</code> применяется в качестве замещающего текста наборщиками с 16-го века, и эта традиция продолжается в сети.",
+            "5 веков довольно долгий период. Так как мы строим приложение CatPhotoApp, давайте используем нечто называемое текстом <code>kitty ipsum</code>.",
+            "<hr>",
+            "Замените текст внутри вашего элемента <code>p</code> первыми двумя словами текста <code>kitty ipsum</code>: <code>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08802",
+      "title": "Uncomment HTML",
+      "description": [
+        "Commenting is a way that you can leave comments within your code without affecting the code itself.",
+        "Commenting is also a convenient way to make code inactive without having to delete it entirely.",
+        "You can start a comment with <code>&#60;!--</code> and end a comment with <code>--&#62;</code>",
+        "<hr>",
+        "Uncomment your <code>h1</code>, <code>h2</code> and <code>p</code> elements."
+      ],
+      "challengeSeed": [
+        "<!--",
+        "<h1>Hello World</h1>",
+        "",
+        "<h2>CatPhotoApp</h2>",
+        "",
+        "<p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "-->"
+      ],
+      "tests": [
+        "assert($(\"h1\").length > 0, 'message: Make your <code>h1</code> element visible on your page by uncommenting it.');",
+        "assert($(\"h2\").length > 0, 'message: Make your <code>h2</code> element visible on your page by uncommenting it.');",
+        "assert($(\"p\").length > 0, 'message: Make your <code>p</code> element visible on your page by uncommenting it.');",
+        "assert(!/[^fc]-->/gi.test(code.replace(/ *<!--[^fc]*\\n/g,'')), 'message: Be sure to delete all trailing comment tags&#44; i.e. <code>--&#62;</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Kommentieren erlaubt dir Kommentare innerhalb des Codes zu hinterlassen, ohne diesen selbst zu beeinflussen.",
+            "Dies ist auch ein guter Weg, um Code inaktiv zu machen ohne diesen komplett löschen zu müssen.",
+            "Du kannst einen Kommentar mit <code>&#60;!--</code> starten und ihn mit <code>--&#62;</code> wieder beenden.",
+            "<hr>",
+            "Entkommentiere deine <code>h1</code>, <code>h2</code> und <code>p</code> Elemente."
+          ]
+        },
+        "fr": {
+          "title": "Décommenter du HTML",
+          "description": [
+            "Commenter est une façon de laisser des commentaires dans votre code sans affecter le fonctionnement du code.",
+            "Commenter est aussi un moyen pratique de rendre du code inactif sans devoir le supprimer entièrement.",
+            "Vous pouvez débuter un commentaire avec <code>&#60;!--</code> et le terminer avec <code>--&#62;</code>.",
+            "<hr>",
+            "Décommenter vos éléments <code>h1</code>, <code>h2</code> et <code>p</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Descomente o HTML",
+          "description": [
+            "Comentar é uma forma de deixar comentários no meio do seu código sem afetar o código em si.",
+            "Comentar também é uma forma conveniente de deixar uma parte do código inativa sem ter que deletá-la completamente.",
+            "Você pode começar um comentário com <code>&#60;!--</code> e terminá-lo com <code>--&#62;</code>",
+            "<hr>",
+            "Descomente seus elementos <code>h1</code>, <code>h2</code> e <code>p</code>."
+          ]
+        },
+        "ru": {
+          "title": "Раскомментируйте HTML",
+          "description": [
+            "Комментирование - способ хранения заметок по коду без воздействия на сам код.",
+            "Также комментирование - неплохой метод отключения части кода без необходимости его удаления.",
+            "Вы можете начать комментарий с <code>&#60;!--</code> и закончить его <code>--&#62;</code>",
+            "<hr>",
+            "Раскомментируйте свои элементы <code>h1</code>, <code>h2</code> и <code>p</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08804",
+      "title": "Comment out HTML",
+      "description": [
+        "Remember that in order to start a comment, you need to use <code>&#60;!--</code> and to end a comment, you need to use <code>--&#62;</code>",
+        "Here you'll need to end the comment before your <code>h2</code> element begins.",
+        "<hr>",
+        "Comment out your <code>h1</code> element and your <code>p</code> element, but leave your <code>h2</code> element uncommented."
+      ],
+      "challengeSeed": [
+        "<!--",
+        "<h1>Hello World</h1>",
+        "",
+        "<h2>CatPhotoApp</h2>",
+        "",
+        "<p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "-->"
+      ],
+      "tests": [
+        "assert(($(\"h1\").length === 0), 'message: Comment out your <code>h1</code> element so that it is not visible on your page.');",
+        "assert(($(\"h2\").length > 0), 'message: Leave your <code>h2</code> element uncommented so that it is visible on your page.');",
+        "assert(($(\"p\").length === 0), 'message: Comment out your <code>p</code> element so that it is not visible on your page.');",
+        "assert(code.match(/[^fc]-->/g).length > 1, 'message: Be sure to close each of your comments with <code>--&#62;</code>.');",
+        "assert((code.match(/<([a-z0-9]){1,2}>/g)[0]===\"<h1>\" && code.match(/<([a-z0-9]){1,2}>/g)[1]===\"<h2>\" && code.match(/<([a-z0-9]){1,2}>/g)[2]===\"<p>\") , 'message: Do not change the order of the <code>h1</code> <code>h2</code> or <code>p</code> in the code.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Denk daran, dass du einen Kommentar mit <code>&#60;!--</code> anfangen und mit <code>--&#62;</code> wieder beenden werden.",
+            "Hier wirst du deinen Kommentar vor dem <code>h2</code> Element beenden müssen.",
+            "<hr>",
+            "Kommentiere die <code>h1</code> und <code>p</code> Elemente aus, aber lasse dein <code>h2</code> Element unkommentiert."
+          ]
+        },
+        "fr": {
+          "title": "Commentez du HTML",
+          "description": [
+            "Souvenez-vous que pour débuter un commentaire, vous devez utiliser <code>&#60;!--</code> et que pour le terminer, vous devez utiliser <code>--&#62;</code>.",
+            "Ici vous devrez terminer le commentaire juste avant que l'élément <code>h2</code> commence.",
+            "<hr>",
+            "Commentez les éléments <code>h1</code> et <code>p</code>, mais laissez l'élément <code>h2</code> tel quel."
+          ]
+        },
+        "pt-br": {
+          "title": "Comente o HTML",
+          "description": [
+            "Lembre-se de que, para começar um comentário, você precisa usar <code>&#60;!--</code> e para terminá-lo, você precisa usar <code>--&#62;</code>",
+            "Aqui, você vai precisar terminar o comentário antes do começo do seu elemento <code>h2</code>.",
+            "<hr>",
+            "Comente seus elementos <code>h1</code> e <code>p</code>, mas deixe seu elemento <code>h2</code> descomentado."
+          ]
+        },
+        "ru": {
+          "title": "Закомментируйте HTML",
+          "description": [
+            "Помните, что для начала комментария вам необходимо использовать <code>&#60;!--</code>, а для завершения комментария - <code>--&#62;</code>",
+            "Тут вам необходимо завершить комментарий до начала вашего элемента <code>h2</code>.",
+            "<hr>",
+            "Закомментируйте ваши элементы <code>h1</code> и <code>p</code>, но оставьте ваш элемент <code>h2</code> раскомментированным."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fed1348bd9aedf08833",
+      "title": "Delete HTML Elements",
+      "description": [
+        "Our phone doesn't have much vertical space.",
+        "Let's remove the unnecessary elements so we can start building our CatPhotoApp.",
+        "<hr>",
+        "Delete your <code>h1</code> element so we can simplify our view."
+      ],
+      "challengeSeed": [
+        "<h1>Hello World</h1>",
+        "",
+        "<h2>CatPhotoApp</h2>",
+        "",
+        "<p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>"
+      ],
+      "tests": [
+        "assert(($(\"h1\").length == 0), 'message: Delete your <code>h1</code> element.');",
+        "assert(($(\"h2\").length > 0), 'message: Leave your <code>h2</code> element on the page.');",
+        "assert(($(\"p\").length > 0), 'message: Leave your <code>p</code> element on the page.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Unser Smartphone hat nicht sehr viel vertikalen Platz.",
+            "Lass uns die unwichtigen Elemente entfernen, damit wir unsere CatPhotoApp entwickeln können.",
+            "<hr>",
+            "Lösche die Elemente <code>h1</code>, damit wir etwas Ordnung schaffen."
+          ]
+        },
+        "fr": {
+          "title": "Supprimer des éléments HTML",
+          "description": [
+            "Notre téléphone n'a pas beaucoup d'espace vertical.",
+            "Enlevons les éléments superflus pour débuter la construction de notre application de photos de chats.",
+            "<hr>",
+            "Supprimez l'élément <code>h1</code> afin de simplifier l'affichage."
+          ]
+        },
+        "pt-br": {
+          "title": "Delete elementos HTML",
+          "description": [
+            "Nosso celular não tem muito espaço vertical.",
+            "Vamos remover os elementos desnecessários para podermos começar a construir nosso app de fotos de gatinhos.",
+            "<hr>",
+            "Delete seu elemento <code>h1</code> para podermos simplificar nossa tela."
+          ]
+        },
+        "ru": {
+          "title": "Удалите HTML-элементы",
+          "description": [
+            "Наш телефон не очень большой по-вертикали.",
+            "Давайте удалим некоторые ненужные элементы, чтобы мы могли приступить к созданию приложения CatPhotoApp.",
+            "<hr>",
+            "Удалите ваш <code>h1</code> элемент, чтобы упростить общий вид."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aecf08801",
+      "title": "Introduction to HTML5 Elements",
+      "description": [
+        "HTML5 introduces more descriptive HTML tags. These include <code>header</code>, <code>footer</code>, <code>nav</code>, <code>video</code>, <code>article</code>, <code>section</code> and others.",
+        "These tags make your HTML easier to read, and also help with Search Engine Optimization (SEO) and accessibility.",
+        "The <code>main</code> HTML5 tag helps search engines and other developers find the main content of your page.",
+        "<strong>Note</strong><br>Many of the new HTML5 tags and their benefits are covered in the Applied Accessibility section.",
+        "<hr>",
+        "Create a second <code>p</code> element after the existing <code>p</code> element with the following kitty ipsum text: <code>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</code>",
+        "Wrap the paragraphs with an opening and closing <code>main</code> tag."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "",
+        "<p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>"
+      ],
+      "tests": [
+        "assert($(\"p\").length > 1, 'message: You need 2 <code>p</code> elements with Kitty Ipsum text.');",
+        "assert(code.match(/<\\/p>/g) && code.match(/<\\/p>/g).length === code.match(/<p/g).length, 'message: Make sure each of your <code>p</code> elements has a closing tag.');",
+        "assert.isTrue((/Purr\\s+jump\\s+eat/gi).test($(\"p\").text()), 'message: Your <code>p</code> element should contain the first few words of the provided additional <code>kitty ipsum text</code>.');",
+        "assert($('main').length === 1, 'message: Your code should have one <code>main</code> element.');",
+        "assert($(\"main\").children(\"p\").length === 2, 'message: The <code>main</code> element should have two paragraph elements as children.');",
+        "assert(code.match(/<main>\\s*?<p>/g), 'message: The opening <code>main</code> tag should come before the first paragraph tag.');",
+        "assert(code.match(/<\\/p>\\s*?<\\/main>/g), 'message: The closing <code>main</code> tag should come after the second closing paragraph tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "pt-br": {
+          "title": "Introdução aos elementos HTML5",
+          "description": [
+            "O HTML5 introduziu tags mais descritivas, como <code>header</code> (cabeçalho), <code>footer</code> (rodapé), <code>nav</code> (navegação), <code>video</code> (vídeo), <code>article</code> (artigo), <code>section</code> (seção), entre outras.",
+            "Essas tags deixam seu HTML mais fácil de ler e também ajudam na otimização para motores de busca (SEO) e acessibilidade.",
+            "A tag HTML5 <code>main</code> (principal) ajuda mecanismos de busca e outros desenvolvedores a encontrar o conteúdo principal da sua página.",
+            "<strong>Nota</strong><br>Várias das novas tags HTML5 e seus benefícios são discutidos na seção de Acessibilidade aplicada.",
+            "<hr>",
+            "Crie um segundo elemento <code>p</code> depois dos elementos <code>p</code> existentes com o seguinte texto gatinho ipsum: <code>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</code>",
+            "Coloque tags <code>main</code> de abertura e fechamento ao redor dos parágrafos."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08812",
+      "title": "Add Images to Your Website",
+      "description": [
+        "You can add images to your website by using the <code>img</code> element, and point to a specific image's URL using the <code>src</code> attribute.",
+        "An example of this would be:",
+        "<code>&#60img src=\"https://www.your-image-source.com/your-image.jpg\"&#62</code>",
+        "Note that in most cases, <code>img</code> elements are self-closing.",
+        "All <code>img</code> elements <strong>must</strong> have an <code>alt</code> attribute. The text inside an <code>alt</code> attribute is used for screen readers to improve accessibility and is displayed if the image fails to load.",
+        "Let's add an <code>alt</code> attribute to our <code>img</code> example above:",
+        "<code>&#60img src=\"https://www.your-image-source.com/your-image.jpg\" alt=\"Author standing on a beach with two thumbs up.\"&#62</code>",
+        "<hr>",
+        "Let's try to add an image to our website:",
+        "Insert an <code>img</code> tag, before the <code>h2</code> element.",
+        "Now set the <code>src</code> attribute so that it points to this url:",
+        "<code>https://bit.ly/fcc-relaxing-cat</code>",
+        "Finally don't forget to give your image an <code>alt</code> text."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  ",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"img\").length > 0, 'message: Your page should have an image element.');",
+        "assert(new RegExp(\"\\/\\/bit.ly\\/fcc-relaxing-cat|\\/\\/s3.amazonaws.com\\/freecodecamp\\/relaxing-cat.jpg\", \"gi\").test($(\"img\").attr(\"src\")), 'message: Your image should have a <code>src</code> attribute that points to the kitten image.');",
+        "assert(code.match(/alt\\s*?=\\s*?(\\\"|\\').*(\\\"|\\')/), 'message: Your image element <strong>must</strong> have an <code>alt</code> attribute.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "description": [
+            "Du kannst <code>img</code> Elemente verwenden, um Bilder in deine Website einzubauen. Um zur URL des Bildes zu verweisen, benutzt du das <code>src</code> Attribut.",
+            "Ein Beispiel dafür wäre:",
+            "<code>&#60img src=\"https://www.deine-bild-quelle.com/dein-bild.jpg\"&#62</code>",
+            "Beachte dass in den meisten Fällen <code>img<code> Elemente selbstschließend sind.",
+            "<hr>",
+            "Versuche es mit diesem Bild:",
+            "<code>https://bit.ly/fcc-relaxing-cat</code>"
+          ]
+        },
+        "fr": {
+          "title": "Ajouter des images à votre site Web",
+          "description": [
+            "Vous pouvez ajouter des images à votre site Web en utilisant l'élément <code>img</code> et pointer vers une URL d'image spécifique en utilisant l'attribut <code>src</code>.",
+            "Un exemple de cette procédure serait :",
+            "<code>&#60img src=\"https://www.your-image-source.com/your-image.jpg\"&#62</code>",
+            "Note that in most cases, <code>img</code> elements are self-closing.",
+            "Prenez note que dans la plupart des cas, les éléments <code>img</code> sont auto-fermants.",
+            "<hr>",
+            "Essayez avec cette image :",
+            "<code>https://bit.ly/fcc-relaxing-cat</code>"
+          ]
+        },
+        "pt-br": {
+          "title": "Adicione imagens à sua página web",
+          "description": [
+            "Você pode adicionar imagens ao seu site usando o elemento <code>img</code> e apontando para a URL de uma imagem específica no atributo <code>src</code>.",
+            "Um exemplo disso seria:",
+            "<code>&#60img src=\"https://www.a-fonte-da-sua-imagem.com/sua-imagem.jpg\"&#62</code>",
+            "Note que na maioria dos casos, elementos <code>img</code> possuem auto-fechamento (não precisam de tag de fechamento).",
+            "Todos os elementos <code>img</code> <strong>devem</strong> ter um atributo <code>alt</code>. O texto do atributo <code>alt</code> é usado por leitores de tela para melhorar a acessibilidade e é mostrado no lugar da imagem se ela não puder ser carregada.",
+            "Vamos adicionar um atributo <code>alt</code> ao nosso exemplo acima:",
+            "<code>&#60img src=\"https://www.a-fonte-da-sua-imagem.com/sua-imagem.jpg\" alt=\"Autor numa praia fazendo joinha.\"&#62</code>",
+            "<hr>",
+            "Vamos tentar adicionar uma imagem ao nosso site:",
+            "Insira uma tag <code>img</code>, antes do elemento <code>h2</code>.",
+            "Agora coloque essa URL no seu atributo <code>src</code>:",
+            "<code>https://bit.ly/fcc-relaxing-cat</code>",
+            "Finalmente, não esqueça de dar à sua imagem um texto <code>alt</code>."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте изображения к вашему сайту",
+          "description": [
+            "Вы можете добавлять изображения к вашему сайту с помощью элемента <code>img</code> и указывать ссылки определённых изображений с помощтю атрибута <code>src</code>.",
+            "Примером добавления мзображения может служить:",
+            "<code>&#60img src=\"https://www.your-image-source.com/your-image.jpg\"&#62</code>",
+            "Обратите внимание, что в большинстве случаев элементы <code>img</code> являются самозакрывающимися.",
+            "<hr>",
+            "Попробуйте добавить изображение используя следующую ссылку:",
+            "<code>https://bit.ly/fcc-relaxing-cat</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08816",
+      "title": "Link to External Pages with Anchor Elements",
+      "description": [
+        "<code>a</code> elements, also known as <code>anchor</code> elements, are used to link to content outside of the current page.",
+        "Here's a diagram of an <code>a</code> element. In this case, the <code>a</code> element is used in the middle of a paragraph element, which means the link will appear in the middle of a sentence.",
+        "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Click to enlarge\" alt=\"a diagram of how anchor tags are composed with the same text as on the following line\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+        "Here's an example:",
+        "<code>&#60;p&#62;Here's a &#60;a href=\"http://freeCodeCamp.com\"&#62; link to freeCodeCamp.com&#60;/a&#62; for you to follow.&#60;/p&#62;</code>",
+        "<hr>",
+        "Create an <code>a</code> element that links to <code>http://freecatphotoapp.com</code> and has \"cat photos\" as its <code>anchor text</code>."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  ",
+        "  ",
+        "  ",
+        "  <img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\">",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "</main>"
+      ],
+      "tests": [
+        "assert((/cat photos/gi).test($(\"a\").text()), 'message: Your <code>a</code> element should have the <code>anchor text</code> of \"cat photos\".');",
+        "assert(/http:\\/\\/(www\\.)?freecatphotoapp\\.com/gi.test($(\"a\").attr(\"href\")), 'message: You need an <code>a</code> element that links to <code>http&#58;//freecatphotoapp<wbr>.com</code>');",
+        "assert(code.match(/<\\/a>/g) && code.match(/<\\/a>/g).length === code.match(/<a/g).length, 'message: Make sure your <code>a</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verlinke externe Seiten mit Anker Elementen",
+          "description": [
+            "<code>a</code> Elemente, auch bekannt als <code>anchor</code> (Anker) Elemente, werden verwendet um auf Inhalte außerhalb der aktuellen Seite zu verlinken.",
+            "So sieht ein <code>a</code> Element aus. In diesem Fall wird es innerhalb eines Paragraphen Elements verwendet. Das bedeutet dein Link wird innerhalb des Satzes erscheinen.",
+            "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Click to enlarge\" alt=\"Eine Darstellung wie man Anker Elemente geschrieben werden mit dem gleichen Text wie in der folgenden Zeile\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+            "Hier ist ein Beispiel:",
+            "<code>&#60;p&#62;Hier ist ein &#60;a href=\"http://freeCodeCamp.com\"&#62; Link zu freeCodeCamp&#60;/a&#62; dem du folgen kannst.&#60;/p&#62;</code>",
+            "<hr>",
+            "Erstelle ein <code>a</code> Element, das auf <code>http://freecatphotoapp.com</code> verlinkt und den \"cat photos\" als <code>anchor text</code> (Link-Text) beinhaltet."
+          ]
+        },
+        "es": {
+          "title": "Enlaza páginas externas con elementos ancla",
+          "description": [
+            "Los elementos <code>a</code>, también conocidos como elementos <code>ancla</code>, se utilizan para enlazar a contenido fuera de la página actual.",
+            "Aquí está un diagrama de un elemento <code>a</code>. En este caso, el elemento <code>a</code> se utiliza en el medio de un elemento de párrafo, lo que significa que el enlace aparecerá en el medio de una frase. ",
+            "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"> <img class=\"img-responsive\" title=\"Haz clic para ampliar\" alt=\"un diagrama de cómo las etiquetas de ancla se componen con el mismo texto, como en la siguiente línea\" src=\"//i.imgur.com/hviuZwe.png\"></a> ",
+            "He aquí un ejemplo:",
+            "<code>&#60;p&#62;Aquí está un &#60;a href=\"https://freeCodeCamp.com\"&#62; enlace a freeCodeCamp&#60;/a&#62; para que lo sigas.&#60;/p&#62;</code>",
+            "<hr>",
+            "Crea un elemento <code>a</code> que se vincule a <code>http://freecatphotoapp.com</code> y tenga como <code>texto de ancla</code> \"fotos de gatos\"."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie links para páginas externas com elementos âncora",
+          "description": [
+            "Elementos <code>a</code>, também conhecidos como elementos <code>âncora</code>, são usados para criar links para conteúdo de fora da página atual.",
+            "Aqui está um diagrama de um elemento <code>a</code>. Nesse caso, o elemento <code>a</code> é usado no meio de um elemento de parágrafo, o que significa que esse link vai aparecer no meio de uma frase.",
+            "<a href=\"//i.imgur.com/QSCIiNH.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Clique para ampliar\" alt=\"um diagrama de como tags âncora são compostas com o mesmo texto assim como na linha seguinte\" src=\"//i.imgur.com/QSCIiNH.png\"></a>",
+            "Aqui está um exemplo:",
+            "<code>&#60;p&#62;Aqui está um &#60;a href=\"http://freeCodeCamp.com\"&#62; link para o freeCodeCamp.com&#60;/a&#62; para você clicar.&#60;/p&#62;</code>",
+            "<hr>",
+            "Crie um elemento <code>a</code> que vá para <code>http://freecatphotoapp.com</code> e tenha \"cat photos\" como seu <code>texto âncora</code>."
+          ]
+        },
+        "ru": {
+          "title": "Присоедините внешние страницы с помощью якорных элементов",
+          "description": [
+            "Элементы <code>a</code>, также известные как <code>якорные</code> элементы, применяют для связи с содержимым вне текущей страницы.",
+            "Вот диаграмма элемента <code>a</code>. В этом случае, элемент <code>a</code> использован в середине элемента параграфа, что значит, что ссылка появится в середине предложения.",
+            "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Click to enlarge\" alt=\"a diagram of how anchor tags are composed with the same text as on the following line\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+            "Вот пример:",
+            "<code>&#60;p&#62;Вот &#60;a href=\"http://freeCodeCamp.com\"&#62; ссылка на freeCodeCamp&#60;/a&#62; для перехода на ресурс.&#60;/p&#62;</code>",
+            "<hr>",
+            "Создайте элемент <code>a</code>, который присоединяет <code>http://freecatphotoapp.com</code> и имеет значение \"cat photos\" в качестве <code>текста якоря</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad88fee1348bd9aedf08816",
+      "title": "Link to Internal Sections of a Page with Anchor Elements",
+      "description": [
+        "Anchor elements can also be used to create internal links to jump to different sections within a webpage.",
+        "To create an internal link, you assign a link's <code>href</code> attribute to a hash symbol <code>#</code> plus the value of the <code>id</code> attribute for the element that you want to internally link to, usually further down the page. You then need to add the same <code>id</code> attribute to the element you are linking to. An <code>id</code> is an attribute that uniquely describes an element.",
+        "Below is an example of an internal anchor link and its target element:",
+        "<blockquote>&lt;a href=\"#contacts-header\"&gt;Contacts&lt;/a&gt;<br>...<br>&lt;h2 id=\"contacts-header\"&gt;Contacts&lt;/h2&gt;</blockquote>",
+        "When users click the <u>Contacts</u> link, they'll be taken to the section of the webpage with the <b>Contacts</b> header element.",
+        "<hr>",
+        "Change your external link to an internal link by changing the <code>href</code> attribute to \"#footer\" and the text from \"cat photos\" to \"Jump to Bottom\".",
+        "Remove the <code>target=\"_blank\"</code> attribute from the anchor tag since this causes the linked document to open in a new window tab.",
+        "Then add an <code>id</code> attribute with a value of \"footer\" to the <code>&lt;footer&gt;</code> element at the bottom of the page."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  ",
+        "  <a href=\"http://freecatphotoapp.com\" target=\"_blank\">cat photos</a>",
+        "  ",
+        "  <img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\">",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff. Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched. Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched. Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff. Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "  <p>Meowwww loved it, hated it, loved it, hated it yet spill litter box, scratch at owner, destroy all furniture, especially couch or lay on arms while you're using the keyboard. Missing until dinner time toy mouse squeak roll over. With tail in the air lounge in doorway. Man running from cops stops to pet cats, goes to jail.</p>",
+        "  <p>Intently stare at the same spot poop in the plant pot but kitten is playing with dead mouse. Get video posted to internet for chasing red dot leave fur on owners clothes meow to be let out and mesmerizing birds leave fur on owners clothes or favor packaging over toy so purr for no reason. Meow to be let out play time intently sniff hand run outside as soon as door open yet destroy couch.</p>",
+        "  ",
+        "</main>",
+        "  ",
+        "<footer>Copyright Cat Photo App</footer>"
+      ],
+      "tests": [
+        "assert($('a').length == 1, 'message: There should be only one anchor tag on your page.');",
+        "assert($('footer').length == 1, 'message: There should be only one <code>footer</code> tag on your page.');",
+        "assert($('a').eq(0).attr('href') == \"#footer\", 'message: The <code>a</code> tag should have an <code>href</code> attribute set to \"#footer\".');",
+        "assert(typeof $('a').eq(0).attr('target') == typeof undefined || $('a').eq(0).attr('target') == true, 'message: The <code>a</code> tag should not have a <code>target</code> attribute');",
+        "assert($('a').eq(0).text().match(/Jump to Bottom/gi), 'message: The <code>a</code> text should be \"Jump to Bottom\".');",
+        "assert($('footer').eq(0).attr('id') == \"footer\", 'message: The <code>footer</code> tag should have an <code>id</code> attribute set to \"footer\".');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "pt-br": {
+          "title": "Crie links para seções internas de uma página com elementos âncora",
+          "description": [
+            "Além de criar links externos, elementos âncora também podem ser usados para criar links internos, que são links que pulam para diferentes seções dentro de uma mesma página.",
+            "O formato é parecido com um link externo, só que, ao invés de uma URL no atributo <code>href</code>, você usa o símbolo <code>#</code> e uma palavra para descrever a seção para a qual você quer pular.",
+            "Aqui está um exemplo:",
+            "<code>&lt;a href=\"#contact\"&gt;Ir para a seção de contato&lt;/a&gt;</code>",
+            "Em seguida, você precisa criar no seu HTML um elemento âncora correspondente no lugar em que você quer que seus usuários cheguem quando clicarem no seu link interno. Ao invés de usar o atributo <code>href</code>, você deve usar o atributo <code>name</code>. Aqui está um exemplo:",
+            "<blockquote>&lt;h1&gt;Contato&lt;/h1&gt;<br>&lt;a name=\"contact\"&gt;&lt;/a&gt;</blockquote>",
+            "Agora, quando seus usuários clicarem no link \"Ir para a seção de contato\", eles serão levados para a seção da página em que está o elemento âncora que tenha \"contact\" no seu atributo <code>name</code>.",
+            "<hr>",
+            "Mude seu link externo para um link interno trocando seu atributo <code>href</code> para \"#bottom\" e o texto âncora de \"cat photos\" para \"Pular para o final\".",
+            "Então, adicione um elemento âncora com o atributo <code>name</code> como \"bottom\" depois do último parágrafo.",
+            "<strong>Nota</strong><br>Adicionamos mais texto gatinho ipsum para os parágrafos para mostrar melhor o efeito de clicar no link interno para pular para o final da página. Além disso, essa mudança só vai se aplicar para esse desafio. O próximo desafio vai voltar a mostrar seu link externo."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aede08817",
+      "title": "Nest an Anchor Element within a Paragraph",
+      "description": [
+        "Again, here's a diagram of an <code>a</code> element for your reference:",
+        "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Click to enlarge\" alt=\"a diagram of how anchor tags are composed with the same text as on the following line\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+        "Here's an example:",
+        "<code>&#60;p&#62;Here's a &#60;a href=\"https://freeCodeCamp.com\"&#62; link to freeCodeCamp&#60;/a&#62; for you to follow.&#60;/p&#62;</code>",
+        "<code>Nesting</code> just means putting one element inside of another element.",
+        "<hr>",
+        "Now nest your existing <code>a</code> element within a new <code>p</code> element (just after the existing <code>main</code> 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."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  ",
+        "  <a href=\"http://freecatphotoapp.com\" target=\"_blank\">cat photos</a>",
+        "  ",
+        "  <img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\">",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "</main>"
+      ],
+      "tests": [
+        "assert(($(\"a[href=\\\"http://freecatphotoapp.com\\\"]\").length > 0 || $(\"a[href=\\\"http://www.freecatphotoapp.com\\\"]\").length > 0), 'message: You need an <code>a</code> element that links to \"http://freecatphotoapp.com\".');",
+        "assert($(\"a\").text().match(/cat\\sphotos/gi), 'message: Your <code>a</code> element should have the anchor text of \"cat photos\"');",
+        "assert($(\"p\") && $(\"p\").length > 2, 'message: Create a new <code>p</code> element around your <code>a</code> element. There should be at least 3 total <code>p</code> tags in your HTML code.');",
+        "assert(($(\"a[href=\\\"http://freecatphotoapp.com\\\"]\").parent().is(\"p\") || $(\"a[href=\\\"http://www.freecatphotoapp.com\\\"]\").parent().is(\"p\")), 'message: Your <code>a</code> element should be nested within your new <code>p</code> element.');",
+        "assert(($(\"a[href=\\\"http://freecatphotoapp.com\\\"]\").parent().text().match(/View\\smore\\s/gi) || $(\"a[href=\\\"http://www.freecatphotoapp.com\\\"]\").parent().text().match(/View\\smore\\s/gi)), 'message: Your <code>p</code> element should have the text \"View more \" (with a space after it).');",
+        "assert(!$(\"a\").text().match(/View\\smore/gi), 'message: Your <code>a</code> element should <em>not</em> have the text \"View more\".');",
+        "assert(code.match(/<\\/p>/g) && code.match(/<p/g) && code.match(/<\\/p>/g).length === code.match(/<p/g).length, 'message: Make sure each of your <code>p</code> elements has a closing tag.');",
+        "assert(code.match(/<\\/a>/g) && code.match(/<a/g) && code.match(/<\\/a>/g).length === code.match(/<a/g).length, 'message: Make sure each of your <code>a</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Umschließe ein Anker Element mit einem Paragraphen",
+          "description": [
+            "Hier ist nochmal ein Beispiel für ein <code>a</code> Element:",
+            "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Klick zum Vergrößern\" alt=\"Eine Darstellung wie Anker Elemente geschrieben werden mit dem gleichen Text wie in der folgenden Zeile\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+            "Hier ist ein Beispiel:",
+            "<code>&#60;p&#62;Hier ist ein &#60;a href=\"https://freeCodeCamp.com\"&#62; Link zu freeCodeCamp&#60;/a&#62; dem du folgen kannst.&#60;/p&#62;</code>",
+            "<code>Nesting</code> bedeuted ein Element innerhalb eines anderen Elements zu schreiben",
+            "<hr>",
+            "Jetzt umschließe dein <code>a</code> Element mit einem neuen <code>p</code> Element (direkt nach dem bereits existierenden <code>main</code> Element) indem steht \"View more cat photos\", wo allerdings nur \"cat photos\" ein Link ist und der Rest normaler Text."
+          ]
+        },
+        "es": {
+          "title": "Anida un elemento de ancla dentro de un párrafo",
+          "description": [
+            "Una vez más, aquí está un diagrama de un elemento <code>a</code> para tu referencia:",
+            "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Pulse para ampliar\" alt=\"un diagrama de como se componen las etiquetas de anclaje con el texto como en la siguiente línea\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+            "He aquí un ejemplo:",
+            "<code>&#60;p&#62;Aquí hay un &#60;a href=\"https://freeCodeCamp.com\"&#62; enlace a freeCodeCamp&#60;/a&#62; para que lo sigas.&#60;/p&#62;</code>",
+            "<code>Anidamiento</code> simplemente significa poner un elemento dentro de otro elemento.",
+            "<hr>",
+            "Ahora anida el elemento <code>a</code> existente dentro de un nuevo elemento <code>p</code> (justo después del elemento <code>main</code> 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 ."
+          ]
+        },
+        "pt-br": {
+          "title": "Aninhe um elemento âncora a um parágrafo",
+          "description": [
+            "Novamente, aqui está um diagrama de um elemento <code>a</code> para você usar como referência:",
+            "<a href=\"//i.imgur.com/QSCIiNH.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Clique para ampliar\" alt=\"um diagrama de como tags âncora são compostas com o mesmo texto assim como na linha seguinte\" src=\"//i.imgur.com/QSCIiNH.png\"></a>",
+            "Veja um exemplo:",
+            "<code>&#60;p&#62;Aqui está um &#60;a href=\"https://freeCodeCamp.com\"&#62; link para o freeCodeCamp&#60;/a&#62; para você clicar.&#60;/p&#62;</code>",
+            "<code>Aninhar</code> significa colocar um elemento dentro de outro.",
+            "<hr>",
+            "Agora, aninhe seu elemento <code>a</code> existente a um novo elemento <code>p</code> (logo em seguida do elemento <code>main</code> existente), de forma que o parágrafo ao redor tenha o texto \"View more cat photos\", mas apenas a parte \"cat photos\" seja um link e o resto seja apenas texto."
+          ]
+        },
+        "ru": {
+          "title": "Создайте вложенный якорный элемент внутри параграфа",
+          "description": [
+            "Вот диаграмма элемента <code>a</code>:",
+            "<a href=\"//i.imgur.com/hviuZwe.png\" target=\"_blank\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" title=\"Click to enlarge\" alt=\"a diagram of how anchor tags are composed with the same text as on the following line\" src=\"//i.imgur.com/hviuZwe.png\"></a>",
+            "Вот пример:",
+            "<code>&#60;p&#62;Вот &#60;a href=\"https://freeCodeCamp.com\"&#62; ссылка на freeCodeCamp&#60;/a&#62; для перехода на ресурс.&#60;/p&#62;</code>",
+            "<code>Вложенность</code> значит установку одного элемента внутрь друго элемента.",
+            "<hr>",
+            "Теперь вложите ваш существующий элемент <code>a</code> внутрь нового элемента <code>p</code> (сразу после существующего элемента <code>main</code>) таким образом, что добавляемый параграф сообщает: \"View more cat photos\", но где только \"cat photos\" является ссылкой, а остальной текст обычный."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08817",
+      "title": "Make Dead Links Using the Hash Symbol",
+      "description": [
+        "Sometimes you want to add <code>a</code> elements to your website before you know where they will link.",
+        "This is also handy when you're changing the behavior of a link using <code>jQuery</code>, which we'll learn about later.",
+        "<hr>",
+        "The current value of the <code>href</code> attribute is a link that points to \"http://freecatphotoapp.com\". Replace the <code>href</code> attribute value with a <code>#</code>, also known as a hash symbol, to create a dead link.",
+        "For example: <code>href=\"#\"</code>"
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"http://freecatphotoapp.com\" target=\"_blank\">cat photos</a>.</p>",
+        "  ",
+        "  <img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\">",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"a\").attr(\"href\") === \"#\", 'message: Your <code>a</code> element should be a dead link with the value of the <code>href</code> attribute set to \"#\".');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle tote Links mit dem Hash Symbol",
+          "description": [
+            "Manchmal wirst du <code>a</code> Elemente zu deiner Website hinzufügen möchten, ohne dass du das Ziel des Links kennst.",
+            "Das ist auch nützlich, wenn du die Funktion eines Links mit <code>jQuery</code> verändern willst. Das werden wir später noch behandeln.",
+            "<hr>",
+            "Ersetze den Inhalt des <code>href</code> Attributs deines <code>a</code> Elements mit einem <code>#</code>, auch bekannt als Hash Symbol, um einen toten Link zu erzeugen."
+          ]
+        },
+        "es": {
+          "title": "Haz vínculos muertos utilizando el símbolo de numero",
+          "description": [
+            "A veces quieres agregar elementos <code>a</code> a tu sitio web antes de saber qué enlazarán.",
+            "Esto también es útil cuando estás cambiando el comportamiento de un enlace usando <code>jQuery</code>, lo cual aprenderemos más adelante.",
+            "<hr>",
+            "Reemplaza el atributo <code>href</code> de tu elemento <code>a</code> con un <code>#</code>, también conocido como un símbolo de número o de <em>hash</em>, para convertirlo en un vínculo muerto."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie links mortos com hashtags",
+          "description": [
+            "Às vezes você vai querer adicionar elementos <code>a</code> ao seu site antes de saber para onde eles vão linkar.",
+            "Isso também é útil para quando você está mudando o comportamento de um link usando <code>jQuery</code>, que nós vamos aprender mais tarde.",
+            "<hr>",
+            "O valor atual do atributo <code>href</code> é \"http://freecatphotoapp.com\". Substitua esse valor por <code>#</code>, também conhecido como hashtag, para criar um link morto."
+          ]
+        },
+        "ru": {
+          "title": "Создайте мёртвые ссылки используя хэш-символ",
+          "description": [
+            "Иногда вам нужно добавить элементы <code>a</code> к вашему сайту до того, как вы знаете куда будут вести ссылки.",
+            "Также это может оказаться полезно, когда вы меняете поведение ссылки используя <code>jQuery</code>, что мы изучим позже.",
+            "<hr>",
+            "Замените значение атрибута <code>href</code> вашего элемента <code>a</code> на <code>#</code>, известное как хэш-символ, для превращения элемента в мёртвую ссылку."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08820",
+      "title": "Turn an Image into a Link",
+      "description": [
+        "You can make elements into links by nesting them within an <code>a</code> element.",
+        "Nest your image within an <code>a</code> element. Here's an example:",
+        "<code>&#60;a href=\"#\"&#62;&#60;img src=\"https://bit.ly/fcc-running-cats\" alt=\"Three kittens running towards the camera.\"&#62;&#60;/a&#62;</code>",
+        "Remember to use <code>#</code> as your <code>a</code> element's <code>href</code> property in order to turn it into a dead link.",
+        "<hr>",
+        "Place the existing image element within an anchor element.",
+        "Once you've done this, hover over your image with your cursor. Your cursor's normal pointer should become the link clicking pointer. The photo is now a link."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\">",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"a\").children(\"img\").length > 0, 'message: Nest the existing <code>img</code> element within an <code>a</code> element.');",
+        "assert(new RegExp(\"#\").test($(\"a\").children(\"img\").parent().attr(\"href\")), 'message: Your <code>a</code> element should be a dead link with a <code>href</code> attribute set to <code>#</code>.');",
+        "assert(code.match(/<\\/a>/g) && code.match(/<a/g) && code.match(/<\\/a>/g).length === code.match(/<a/g).length, 'message: Make sure each of your <code>a</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verlinke ein Bild",
+          "description": [
+            "Du kannst jedes Element in einen Link verwandeln, indem du es mit einem <code>a</code> Element umschließt.",
+            "<hr>",
+            "Umschließe dein Bild mit einem <code>a</code> Element. Hier ist ein Beispiel:",
+            "<code>&#60;a href=\"#\"&#62;&#60;img src=\"https://bit.ly/fcc-running-cats\"&#62;&#60;/a&#62;</code>",
+            "Vergewissere dich, dass du ein <code>#</code> innerhalb des <code>href</code> Attributs des <code>a</code> Elements nutzt, um daraus einen toten Link zu machen.",
+            "Sobald du das gemacht hast, kannst du mit der Maus über dein Bild fahren. Der normale Mauszeiger sollte nun zu einer Hand für Links werden. Das Bild ist jetzt ein Link."
+          ]
+        },
+        "es": {
+          "title": "Convierte una imagen en un vínculo",
+          "description": [
+            "Puedes convertir elementos en enlaces al anidarlos dentro de un elemento <code>a</code>.",
+            "<hr>",
+            "Anida tu imagen dentro de un elemento <code>a</code>. He aquí un ejemplo: ",
+            "<code>&#60;a href=\"#\"&#62;&#60;img src=\"https://bit.ly/fcc-running-cats\"/&#62;&#60;/a&#62;</code>",
+            "Recuerda usar <code>#</code> como atributo <code>href</code> de tu elemento <code>a</code> con el fin de convertirlo en un vínculo muerto.",
+            "Una vez hayas hecho esto, coloca el cursor sobre tu imagen. El puntero normal de tu cursor debería convertirse en el puntero de enlace. La foto es ahora un vínculo ."
+          ]
+        },
+        "pt-br": {
+          "title": "Transforme uma imagem em um link",
+          "description": [
+            "Você pode transformar elementos em links aninhando-os a um elemento <code>a</code>.",
+            "Aninhe sua imagem a um elemento <code>a</code>. Aqui está um exemplo:",
+            "<code>&#60;a href=\"#\"&#62;&#60;img src=\"https://bit.ly/fcc-running-cats\" alt=\"Três gatinhos correndo em direção à câmera.\"&#62;&#60;/a&#62;</code>",
+            "Lembre-se de usar <code>#</code> no atributo <code>href</code> do seu elemento <code>a</code> para que o link esteja morto.",
+            "<hr>",
+            "Coloque a imagem existente dentro de um elemento âncora.",
+            "Depois de fazer isso, coloque o cursor do mouse sobre sua imagem. O seu cursor normal deve virar um cursor de clique. A foto agora é um link."
+          ]
+        },
+        "ru": {
+          "title": "Превратите изображение в ссылку",
+          "description": [
+            "Вы можете превратить элементы в ссылки путём их вложения внутрь элементов <code>a</code>.",
+            "<hr>",
+            "Вложите ваше изображение в элемент <code>a</code>. Вот пример:",
+            "<code>&#60;a href=\"#\"&#62;&#60;img src=\"https://bit.ly/fcc-running-cats\"&#62;&#60;/a&#62;</code>",
+            "Не забывайте использовать <code>#</code> в качестве значения атрибута <code>href</code> вашего элемента <code>a</code> для превращения ссылки в мёртвую.",
+            "Как только вы это сделаете, наведите курсор мыши на ваше изображение. При этом курсор должен изменить вид с обычного на используемый при наведении на ссылки. Ваше фото теперь является ссылкой."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08827",
+      "title": "Create a Bulleted Unordered List",
+      "description": [
+        "HTML has a special element for creating <code>unordered lists</code>, or bullet point-style lists.",
+        "Unordered lists start with a <code>&#60;ul&#62;</code> element. Then they contain some number of <code>&#60;li&#62;</code> elements.",
+        "For example: ",
+        "<blockquote>&#60;ul&#62;<br>&nbsp;&nbsp;&#60;li&#62;milk&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;cheese&#60;/li&#62;<br>&#60;/ul&#62;</blockquote>",
+        "would create a bullet point-style list of \"milk\" and \"cheese\".",
+        "<hr>",
+        "Remove the last two <code>p</code> elements and create an unordered list of three things that cats love at the bottom of the page."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  <p>Purr jump eat the grass rip the couch scratched sunbathe, shed everywhere rip the couch sleep in the sink fluffy fur catnip scratched.</p>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"ul\").length > 0, 'message: Create a <code>ul</code> element.');",
+        "assert($(\"ul li\").length > 2, 'message: You should have three <code>li</code> elements within your <code>ul</code> element.');",
+        "assert(code.match(/<\\/ul>/gi) && code.match(/<ul/gi) && code.match(/<\\/ul>/gi).length === code.match(/<ul/gi).length, 'message: Make sure your <code>ul</code> element has a closing tag.');",
+        "assert(code.match(/<\\/li>/gi) && code.match(/<li[\\s>]/gi) && code.match(/<\\/li>/gi).length === code.match(/<li[\\s>]/gi).length, 'message: Make sure your <code>li</code> elements have closing tags.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle eine ungeordnete Liste",
+          "description": [
+            "HTML hat ein spezielles Element zum Erstellen von <code>unordered lists</code> (ungeordneten Listen).",
+            "Ungeordnete Listen starten mit einem <code>&#60;ul&#62;</code> Element. Dann beinhalten sie eine gewisse Anzahl an <code>&#60;li&#62;</code> Elementen.",
+            "Zum Beispiel:",
+            "<blockquote>&#60;ul&#62;<br>&nbsp;&nbsp;&#60;li&#62;Milch&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;Käse&#60;/li&#62;<br>&#60;/ul&#62;</blockquote>",
+            "würde eine ungeordnete Liste für \"Milch\" und \"Käse\" erstellen.",
+            "<hr>",
+            "Entferne die letzten zwei <code>p</code> Elemente und erstelle eine ungeordnete Liste von drei Dingen die Katzen lieben am Ende der Seite"
+          ]
+        },
+        "es": {
+          "title": "Crea una lista no ordenada con viñetas",
+          "description": [
+            "HTML tiene un elemento especial para la creación de <code>listas no ordenadas</code>, o listas con estilo viñeta.",
+            "Las listas no ordenadas comienzan con un elemento <code>&#60;ul&#62;</code>. A continuación contienen una cantidad de elementos <code>&#60;li&#62;.</code>",
+            "Por ejemplo: ",
+            "<blockquote>&#60;ul&#62;<br>&nbsp;&nbsp;&#60;li&#62;leche&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;queso&#60;/li&#62;<br>&#60;/ul&#62;</blockquote>",
+            "creará una lista con viñetas y con elementos \"leche\" y \"queso\".",
+            "<hr>",
+            "Elimina los dos últimos elementos <code>p</code> y en la parte inferior de la página crea una lista no ordenada de tres cosas que los gatos aman."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie uma lista não ordenada com marcadores",
+          "description": [
+            "O HTML tem um elemento especial para criar <code>listas não ordenadas</code>, ou listas com marcadores.",
+            "Listas não ordenadas começam com um elemento <code>ul</code> e contêm diversos elementos <code>li</code> aninhados a ele.",
+            "Por exemplo: ",
+            "<blockquote>&#60;ul&#62;<br>&nbsp;&nbsp;&#60;li&#62;leite&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;queijo&#60;/li&#62;<br>&#60;/ul&#62;</blockquote>",
+            "criaria uma lista com marcadores contendo \"leite\" e \"queijo\".",
+            "<hr>",
+            "Remova os dois últimos elementos <code>p</code> e crie no final da página uma lista não ordenada de três coisas que gatos adoram."
+          ]
+        },
+        "ru": {
+          "title": "Создайте ненумерованный неупорядоченный список",
+          "description": [
+            "В HTML есть специальный элемент для создания <code>неупорядоченного списка</code>, или списка с точками в виде меток элементов.",
+            "Неупорядоченные списки начинаются с элемента <code>&#60;ul&#62;</code>. Затем они содержат некоторе количество элементов <code>&#60;li&#62;</code>.",
+            "Например: ",
+            "<blockquote>&#60;ul&#62;<br>&nbsp;&nbsp;&#60;li&#62;milk&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;cheese&#60;/li&#62;<br>&#60;/ul&#62;</blockquote>",
+            "создаст ненумерованный список из \"milk\" и \"cheese\".",
+            "<hr>",
+            "Удалите последние два элемента <code>p</code> и создайте неупорядоченный список из трёх вещей, которые любят кошки."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08828",
+      "title": "Create an Ordered List",
+      "description": [
+        "HTML has a special element for creating <code>ordered lists</code>, or numbered-style lists.",
+        "Ordered lists start with a <code>&#60;ol&#62;</code> element. Then they contain some number of <code>&#60;li&#62;</code> elements.",
+        "For example:",
+        "<blockquote>&#60;ol&#62;<br>&nbsp;&nbsp;&#60;li&#62;Garfield&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;Sylvester&#60;/li&#62;<br>&#60;/ol&#62;</blockquote>",
+        "would create a numbered list of \"Garfield\" and \"Sylvester\".",
+        "<hr>",
+        "Create an ordered list of the top 3 things cats hate the most."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  ",
+        "</main>"
+      ],
+      "tests": [
+        "assert((/Top 3 things cats hate:/i).test($(\"ol\").prev().text()), 'message: You should have an ordered list for \"Top 3 things cats hate:\"');",
+        "assert((/Things cats love:/i).test($(\"ul\").prev().text()), 'message: You should have an unordered list for \"Things cats love:\"');",
+        "assert.equal($(\"ul\").length, 1, 'message: You should have only one <code>ul</code> element.');",
+        "assert.equal($(\"ol\").length, 1, 'message: You should have only one <code>ol</code> element.');",
+        "assert.equal($(\"ul li\").length, 3, 'message: You should have three <code>li</code> elements within your <code>ul</code> element.');",
+        "assert.equal($(\"ol li\").length, 3, 'message: You should have three <code>li</code> elements within your <code>ol</code> element.');",
+        "assert(code.match(/<\\/ul>/g) && code.match(/<\\/ul>/g).length === code.match(/<ul>/g).length, 'message: Make sure your <code>ul</code> element has a closing tag.');",
+        "assert(code.match(/<\\/ol>/g) && code.match(/<\\/ol>/g).length === code.match(/<ol>/g).length, 'message: Make sure your <code>ol</code> element has a closing tag.');",
+        "assert(code.match(/<\\/li>/g) && code.match(/<li>/g) && code.match(/<\\/li>/g).length === code.match(/<li>/g).length, 'message: Make sure your <code>li</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle eine geordnete Liste",
+          "description": [
+            "HTML beinhaltet ein spezielles Element für <code>ordered lists</code> (geordnete Listen).",
+            "Geordnete Listen starten mit einem <code>&#60;ol&#62;</code> Element. Dann enthalten sie eine gewisse Anzahl an <code>&#60;li&#62;</code> Elementen.",
+            "Zum Beispiel:",
+            "<blockquote>&#60;ol&#62;<br>&nbsp;&nbsp;&#60;li&#62;Garfield&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;Sylvester&#60;/li&#62;<br>&#60;/ol&#62;</blockquote>",
+            "würde eine nummerierte Liste mit \"Garfield\" und \"Sylvester\" erstellen.",
+            "<hr>",
+            "Erstelle eine geordnete Liste von den drei Dingen, die Katzen am meisten hassen."
+          ]
+        },
+        "es": {
+          "title": "Crear una lista ordenada",
+          "description": [
+            "HTML tiene un elemento especial para la creación de <code>listas ordenadas</code>, o listas de estilo numerado.",
+            "Las listas ordenadas comienzan con un elemento <code>&#60;ol&#62;</code>. Luego contienen un número de elementos <code>&#60;li&#62;.</code>",
+            "Por ejemplo:",
+            "<blockquote>&#60;ol&#62;<br>&nbsp;&nbsp;&#60;li&#62;Garfield&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;Sylvester&#60;/li&#62;<br>&#60;/ol&#62;</blockquote>",
+            "creará una lista numerada con \"Garfield\" y \"Sylvester\".",
+            "<hr>",
+            "Crea una lista ordenada de los 3 cosas que más odian los gatos."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie uma lista ordenada",
+          "description": [
+            "O HTML tem um elemento especial para criar <code>listas ordenadas</code>, ou listas numeradas.",
+            "Listas ordenadas começam com um elemento <code>ol</code> e contêm diversos elementos <code>li</code> aninhados a ele.",
+            "Por exemplo:",
+            "<blockquote>&#60;ol&#62;<br>&nbsp;&nbsp;&#60;li&#62;Garfield&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;Frajola&#60;/li&#62;<br>&#60;/ol&#62;</blockquote>",
+            "criaria uma lista numerada contendo \"Garfield\" e \"Frajola\".",
+            "<hr>",
+            "Crie uma lista ordenada com as 3 coisas que os gatos mais odeiam."
+          ]
+        },
+        "ru": {
+          "title": "Создайте упорядоченный список",
+          "description": [
+            "В HTML есть специальный элемент для создания <code>упорядоченных списков</code>, или списков с номерами в качестве меток элементов.",
+            "Упорядоченные списки начинаются с элемента <code>&#60;ol&#62;</code>. Далее они содержат некоторое количество элементов <code>&#60;li&#62;</code>.",
+            "Например:",
+            "<blockquote>&#60;ol&#62;<br>&nbsp;&nbsp;&#60;li&#62;Garfield&#60;/li&#62;<br>&nbsp;&nbsp;&#60;li&#62;Sylvester&#60;/li&#62;<br>&#60;/ol&#62;</blockquote>",
+            "создаст нумерованный список из \"Garfield\" и \"Sylvester\".",
+            "<hr>",
+            "Создайте нумерованный список из 3-х вещей, который кошки больше всего ненавидят."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08829",
+      "title": "Create a Text Field",
+      "description": [
+        "Now let's create a web form.",
+        "Text inputs are a convenient way to get input from your user.",
+        "You can create one like this:",
+        "<code>&#60;input type=\"text\"&#62;</code>",
+        "Note that <code>input</code> elements are self-closing.",
+        "<hr>",
+        "Create an <code>input</code> element of type <code>text</code> below your lists."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  ",
+        "  ",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"input[type=text]\").length > 0, 'message: Your app should have an <code>input</code> element of type <code>text</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle ein Textfeld",
+          "description": [
+            "Nun erstellen wir ein Web Formular.",
+            "Eingabefelder sind eine bewährte Möglichkeit um Daten von Usern zu erhalten.",
+            "So kannst du eines erstellen:",
+            "<code>&#60;input type=\"text\"&#62;</code>",
+            "Beachte, dass <code>input</code> Elemente selbstschließend sind.",
+            "<hr>",
+            "Erstelle ein <code>input</code> Element des Typ (\"type\") <code>text</code> unter deinen Listen."
+          ]
+        },
+        "es": {
+          "title": "Crea un campo de texto",
+          "description": [
+            "Ahora vamos a crear un formulario web.",
+            "Los campos de texto son una manera conveniente de obtener retroalimentación de tu usuario.",
+            "Puedes crear uno como este:",
+            "<code>&#60;input type=\"text\"&#62;</code>",
+            "Ten en cuenta que los elementos <code>input</code> son de cierre automático.",
+            "<hr>",
+            "Crea un elemento <code>input</code> de tipo <code>text</code> debajo de tus listas."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie um campo de texto",
+          "description": [
+            "Agora vamos criar um formulário web.",
+            "Campos de texto são uma forma conveniente de obter dados do seu usuário.",
+            "Você pode criar um assim:",
+            "<code>&#60;input type=\"text\"&#62;</code>",
+            "Note que elementos <code>input</code> têm auto-fechamento.",
+            "<hr>",
+            "Crie um elemento <code>input</code> de tipo <code>text</code> abaixo das suas listas."
+          ]
+        },
+        "ru": {
+          "title": "Создайте текстовое поле",
+          "description": [
+            "Теперь давайте создадим web-форму.",
+            "Поля текстового ввода - удобный способ получения данных от пользователя.",
+            "Вы можете создать текстовое поле следующим образом:",
+            "<code>&#60;input type=\"text\"&#62;</code>",
+            "Обратите внимание, что элементы <code>input</code> самозакрывающиеся.",
+            "<hr>",
+            "Создайте элемент <code>input</code> типа <code>text</code> под вашими списками."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08830",
+      "title": "Add Placeholder Text to a Text Field",
+      "description": [
+        "Your placeholder text is what appears in your text <code>input</code> before your user has input anything.",
+        "You can create placeholder text like so:",
+        "<code>&#60;input type=\"text\" placeholder=\"this is placeholder text\"&#62;</code>",
+        "<hr>",
+        "Set the <code>placeholder</code> value of your text <code>input</code> to \"cat photo URL\"."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <input type=\"text\">",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"input[placeholder]\").length > 0, 'message: Add a <code>placeholder</code> attribute to the existing text <code>input</code> element.');",
+        "assert($(\"input\") && $(\"input\").attr(\"placeholder\") && $(\"input\").attr(\"placeholder\").match(/cat\\s+photo\\s+URL/gi), 'message: Set the value of your placeholder attribute to \"cat photo URL\".');",
+        "assert($(\"input[type=text]\").length > 0 && code.match(/<input((\\s+\\w+(\\s*=\\s*(?:\".*?\"|'.*?'|[\\^'\">\\s]+))?)+\\s*|\\s*)\\/?>/gi), 'message: The finished <code>input</code> element should have valid syntax.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Füge Platzhalter zu einem Textfeld hinzu",
+          "description": [
+            "Platzhaltertexte erscheinen in deinen <code>input</code> Feldern, bevor der Nutzer etwas eingibt.",
+            "Du kannst Platzhalter auf folgende Weise erstellen:",
+            "<code>&#60;input type=\"text\" placeholder=\"Das ist ein Platzhalter.\"&#62;</code>",
+            "<hr>",
+            "Setze bei deinem <code>input</code> Element den Wert für <code>placeholder</code> auf \"cat photo URL\"."
+          ]
+        },
+        "es": {
+          "title": "Agrega un texto de relleno a un campo de texto",
+          "description": [
+            "El texto de relleno es el que aparece en un campo de texto antes de que un usuario haya ingresado datos.",
+            "Puedes crear un texto de relleno de esta manera:",
+            "<code>&#60;input type=\"text\" placeholder=\"este es un texto de relleno\"&#62;</code>",
+            "<hr>",
+            "Establece el valor del <code>texto de relleno</code> de tu campo de texto como \"cat photo URL\"."
+          ]
+        },
+        "pt-br": {
+          "title": "Adicione um placeholder a um campo de texto",
+          "description": [
+            "O placeholder é o texto que aparece no seu <code>input</code> quando ele está vazio.",
+            "Você pode adicionar um placeholder ao seu campo de texto assim:",
+            "<code>&#60;input type=\"text\" placeholder=\"esse é o placeholder\"&#62;</code>",
+            "<hr>",
+            "Coloque o placeholder \"cat photo URL\" no seu <code>input</code> de texto."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте замещающий текст к текстовому полю",
+          "description": [
+            "Ваш замещающий текст - это то, что отображается в виде текста внутри <code>input</code> пока пользователь не ввёл туда что-либо.",
+            "Вы можете создать замещающий текст следующим образом:",
+            "<code>&#60;input type=\"text\" placeholder=\"это замещающий текст\"&#62;</code>",
+            "<hr>",
+            "Установите значение атрибута <code>placeholder</code> вашего текстового поля <code>input</code> равными \"cat photo URL\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aede08830",
+      "title": "Create a Form Element",
+      "description": [
+        "You can build web forms that actually submit data to a server using nothing more than pure HTML. You can do this by specifying an action on your <code>form</code> element.",
+        "For example:",
+        "<code>&#60;form action=\"/url-where-you-want-to-submit-form-data\"&#62;&#60;/form&#62;</code>",
+        "<hr>",
+        "Nest your text field in a <code>form</code> element. Add the <code>action=\"/submit-cat-photo\"</code> attribute to this form element."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <input type=\"text\" placeholder=\"cat photo URL\">",
+        "<main>"
+      ],
+      "tests": [
+        "assert($(\"form\") && $(\"form\").children(\"input\") && $(\"form\").children(\"input\").length > 0, 'message: Nest your text input element within a <code>form</code> element.');",
+        "assert($(\"form\").attr(\"action\") === \"/submit-cat-photo\", 'message: Make sure your <code>form</code> has an <code>action</code> attribute which is set to <code>/submit-cat-photo</code>');",
+        "assert(code.match(/<\\/form>/g) && code.match(/<form [^<]*>/g) && code.match(/<\\/form>/g).length === code.match(/<form [^<]*>/g).length, 'message: Make sure your <code>form</code> element has well-formed open and close tags.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle ein Formular",
+          "description": [
+            "Du kannst Web Formulare bauen, die Daten zu einem Server übertragen – und das nur mit HTML. Das wird möglich, indem du eine Aktion für dein <code>form</code> Element bestimmst.",
+            "Zum Beispiel:",
+            "<code>&#60;form action=\"/url-wohin-du-deine-formular-daten-senden-willst\"&#62;&#60;/form&#62;</code>",
+            "<hr>",
+            "Umschließe dein Textfeld mit einem <code>form</code> Element. Füge anschließend das Attribut <code>action=\"/submit-cat-photo\"</code> hinzu."
+          ]
+        },
+        "es": {
+          "title": "Crea un elemento de formulario",
+          "description": [
+            "Puedes construir formularios web que realmente envíen datos a un servidor usando nada más que HTML puro. Puedes hacerlo especificando una acción en tu elemento <code>form</code>.",
+            "Por ejemplo:",
+            "<code>&#60;form action=\"/url-al-que-quieres-enviar-los-datos-del-formulario\"&#62;&#60;/form&#62;</code>",
+            "<hr>",
+            "Anida tu campo de texto en un elemento <code>form</code>. Agrega el atributo <code>action=\"/submit-cat-photo\"</code> a este elemento de formulario."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie um elemento de formulário",
+          "description": [
+            "Você pode construir formulários web que realmente enviam dados para um servidor usando nada mais que HTML puro. Para isso, você precisa especificar uma URL no atributo <code>action</code> do seu elemento <code>form</code>.",
+            "Por exemplo:",
+            "<code>&#60;form action=\"/url-para-onde-voce-quer-enviar-os-dados\"&#62;&#60;/form&#62;</code>",
+            "<hr>",
+            "Aninhe o seu campo de texto a um elemento <code>form</code>. Adicione o atributo <code>action=\"/submit-cat-photo\"</code> a esse <code>form</code>."
+          ]
+        },
+        "ru": {
+          "title": "Создайте элемент типа форма",
+          "description": [
+            "Вы можете строить web-формы, которые отправляют данные серверу, не ипользуя ничего кроме HTML. Вы можете достичь этого указанием действия в атрибутах элемента <code>form</code>.",
+            "Например:",
+            "<code>&#60;form action=\"/url-куда-вы-хотите-отправить-данные-формы\"&#62;&#60;/form&#62;</code>",
+            "<hr>",
+            "Вложите ваше текстовое поле в элемент <code>form</code>. Добавьте атрибут <code>action=\"/submit-cat-photo\"</code> к этому элементу формы."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedd08830",
+      "title": "Add a Submit Button to a Form",
+      "description": [
+        "Let's add a <code>submit</code> button to your form. Clicking this button will send the data from your form to the URL you specified with your form's <code>action</code> attribute.",
+        "Here's an example submit button:",
+        "<code>&#60;button type=\"submit\"&#62;this button submits the form&#60;/button&#62;</code>",
+        "<hr>",
+        "Add a submit button to your <code>form</code> element with type <code>submit</code> and \"Submit\" as its text."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <input type=\"text\" placeholder=\"cat photo URL\">",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"form\").children(\"button\").length > 0, 'message: Your form should have a button inside it.');",
+        "assert($(\"button\").attr(\"type\") === \"submit\", 'message: Your submit button should have the attribute <code>type</code> set to <code>submit</code>.');",
+        "assert($(\"button\").text().match(/^\\s*submit\\s*$/gi), 'message: Your submit button should only have the text \"Submit\".');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure your <code>button</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Füge eine Button zum Senden hinzu",
+          "description": [
+            "Lass uns nun einen <code>submit</code> Button hinzufügen. Durch einen Klick auf diesen Button werden die Daten des Formulars an die URL gesendet, welche du in dem <code>action</code> Attribut deines Formulars angegeben hast.",
+            "Hier ist ein Beispiel einen solchen Button:",
+            "<code>&#60;button type=\"submit\"&#62;Dieser Button überträgt die Daten des Formulars.&#60;/button&#62;</code>",
+            "<hr>",
+            "Füge einen Button zum Senden mit dem Typ <code>submit</code> und \"Submit\" als Text zu deinem <code>form</code> Element hinzu."
+          ]
+        },
+        "es": {
+          "title": "Agrega un botón Enviar a un formulario",
+          "description": [
+            "Añadamos un elemento <code>submit</code> a tu formulario. Al hacer clic en este botón enviará los datos del formulario a la URL especificada en el atributo <code>action</code> de tu formulario. ",
+            "He aquí un ejemplo de un botón de envío:",
+            "<code>&#60;button type=\" submit\"&#62;este botón envía el formulario&#60;/botón&#62;</code>",
+            "<hr>",
+            "Agrega un botón de enviar a tu elemento <code>form</code> con el tipo <code>submit</code> y con el texto \"Submit\"."
+          ]
+        },
+        "pt-br": {
+          "title": "Adicione um botão de enviar a um formulário",
+          "description": [
+            "Vamos adicionar um botão de enviar (<code>submit</code>) ao seu formulário. Quando seu usuário clicar nesse botão, os dados do formulário serão enviados para a URL que você especificou no atributo <code>action</code> do seu formulário.",
+            "Aqui está um botão de exemplo:",
+            "<code>&#60;button type=\"submit\"&#62;esse botão envia o formulário&#60;/button&#62;</code>",
+            "<hr>",
+            "Adicione um botão de enviar ao seu elemento <code>form</code> com tipo <code>submit</code> e com texto \"Submit\"."
+          ]
+        },
+        "ru": {
+          "title": "Добавьте кнопку отправки к форме",
+          "description": [
+            "Давайте добавим кнопку отправки <code>submit</code> к вашей форме. Нажатие на эту кнопку отправит данные из вашей формы по адресу, указанному в атрибуте <code>action</code> вашей формы.",
+            "Вот пример кнопки отправки:",
+            "<code>&#60;button type=\"submit\"&#62;эта кнопка отправляет данные формы&#60;/button&#62;</code>",
+            "<hr>",
+            "Добавьте кнопку отправки к вашему элементу <code>form</code> с указанием типа <code>submit</code> и \"Submit\" в качестве отображаемого текста."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedc08830",
+      "title": "Use HTML5 to Require a Field",
+      "description": [
+        "You can require specific form fields so that your user will not be able to submit your form until he or she has filled them out.",
+        "For example, if you wanted to make a text input field required, you can just add the word <code>required</code> within your <code>input</code> element, like this: <code>&#60;input type=\"text\" required&#62;</code>",
+        "<hr>",
+        "Make your text <code>input</code> a <code>required</code> field, so that your user can't submit the form without completing this field.",
+        "Then try to submit the form without inputting any text. See how your HTML5 form notifies you that the field is required?",
+        "<strong>Note</strong><br>This field may not work in Safari Browser."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <input type=\"text\" placeholder=\"cat photo URL\">",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"input\").prop(\"required\"), 'message: Your text <code>input</code> element should have the <code>required</code> attribute.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Nutze HTML5 um ein Pflichtfeld zu erstellen",
+          "description": [
+            "Du kannst bestimmte Felder eines Formulars zu Pflichtfeldern erklären. Damit ist es deinen Usern nicht mehr möglich, das Formular abzuschicken, ohne die Pflichtfelder auszufüllen.",
+            "Um zum Beispiel ein Textfeld zum Pflichtfeld zu erklären, kannst du einfach ein <code>required</code> innerhalb deines <code>input</code> Elements hinzufügen: <code>&#60;input type=\"text\" required&#62;</code>",
+            "<hr>",
+            "Mache aus deinem <code>input</code> Feld ein Pflichtfeld – \"required\" – damit deine Nutzer das Formular nicht abschicken können, ohne dieses Feld auszufüllen.",
+            "Probier dann dein Formular ohne einen Text abzuschicken. Siehst du wie dein HTML5 Formular dich darauf hinweißt dass das Feld verpflichtend ist?",
+            "Beachte: dieses Feld funktioniert nicht in Safari."
+          ]
+        },
+        "es": {
+          "title": "Utiliza HTML5 para especificar campos obligatorios",
+          "description": [
+            "Puedes especificar un campo obligatorio en un formulario para que tu usuario no pueda enviar el formulario hasta que lo haya llenado.",
+            "Por ejemplo, si quieres requerir obligatoriamente un campo de texto, puedes agregar la palabra <code>required</code> dentro de tu elemento <code>input</code>, usarías: <code>&#60;input type=\"text\" required&#62;</code> ",
+            "<hr>",
+            "Haz de tu campo de texto un campo obligatorio, de manera que tu usuario no pueda enviar el formulario sin completar este campo.",
+            "Luego, intenta enviar el formulario sin ingresar texto alguno. ¿Ves cómo tu formulario HTML5 te notifica que el campo es obligatorio?",
+            "Nota: Este campo no funciona en Safari."
+          ]
+        },
+        "pt-br": {
+          "title": "Use HTML5 para tornar campos obrigatórios",
+          "description": [
+            "Você pode tornar obrigatórios campos específicos do seu formulário, assim seu usuário não conseguirá enviar os dados sem preencher esses campos.",
+            "Por exemplo, se você quiser que um campo de texto seja obrigatório, basta adicionar a palavra <code>required</code> ao seu elemento <code>input</code>, assim: <code>&#60;input type=\"text\" required&#62;</code>",
+            "<hr>",
+            "Torne seu campo de texto obrigatório, de forma que seu usuário não consiga enviar o formulário sem preencher esse campo.",
+            "Então, tente enviar o formulário sem preencher esse campo. Viu como o formulário HTML5 avisa que o campo é obrigatório?",
+            "<strong>Nota</strong><br>Esse campo não funciona no Safari."
+          ]
+        },
+        "ru": {
+          "title": "Используйте HTML5, чтобы сделать заполнение поля обязательным",
+          "description": [
+            "Вы можете требовать заполнения определённых полей формы, таким образом пользователь не сможет отправить данные формы до их заполнения.",
+            "Например, если бы вы хотели сделать заполнение текстового поля обязательным, вы могли бы добавить слово <code>required</code> внутрь вашего элемента <code>input</code>: <code>&#60;input type=\"text\" required&#62;</code>",
+            "<hr>",
+            "Сделайте ваше текстовое поле <code>input</code> обязательным <code>required</code> для заполнения, чтобы пользователь не мог отправить данные формы без заполнения этого поля.",
+            "Далее попробуйте отправить данные формы без ввода какого-либо текста. Видите как ваша HTML5-форма уведомляет вас о том, что поле обязательное для заполнения?",
+            "Внимание: это поле не работает в Safari."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08834",
+      "title": "Create a Set of Radio Buttons",
+      "description": [
+        "You can use <code>radio buttons</code> for questions where you want the user to only give you one answer out of multiple options.",
+        "Radio buttons are a type of <code>input</code>",
+        "Each of your radio buttons should be nested within its own <code>label</code> element.",
+        "All related radio buttons should have the same <code>name</code> attribute.",
+        "Here's an example of a radio button:",
+        "<code>&#60;label&#62;&#60;input type=\"radio\" name=\"indoor-outdoor\"&#62; Indoor&#60;/label&#62;</code>",
+        "<hr>",
+        "Add a pair of radio buttons to your form. One should have the option of <code>indoor</code> and the other should have the option of <code>outdoor</code>. Both should share the <code>name</code> attribute of <code>indoor-outdoor</code>."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($('input[type=\"radio\"]').length > 1, 'message: Your page should have two radio button elements.');",
+        "assert($('label > input[type=\"radio\"]').filter(\"[name='indoor-outdoor']\").length > 1, 'message: Give your radio buttons the <code>name</code> attribute of <code>indoor-outdoor</code>.');",
+        "assert($('label > input[type=\"radio\"]:only-child').length > 1, 'message: Each of your two radio button elements should be nested in its own <code>label</code> element.');",
+        "assert((code.match(/<\\/label>/g) && code.match(/<label/g) && code.match(/<\\/label>/g).length === code.match(/<label/g).length), 'message: Make sure each of your <code>label</code> elements has a closing tag.');",
+        "assert($(\"label\").text().match(/indoor/gi), 'message: One of your radio buttons should have the label <code>indoor</code>.');",
+        "assert($(\"label\").text().match(/outdoor/gi), 'message: One of your radio buttons should have the label <code>outdoor</code>.');",
+        "assert($(\"label\").parent().get(0).tagName.match('FORM'), 'message: Each of your radio button elements should be added within the <code>form</code> tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle ein Set von Radiobuttons",
+          "description": [
+            "Du kannst Optionsfelder, <code>radio buttons</code>, für Fragen verwenden, auf die der Nutzer nur eine Antwort geben soll.",
+            "Radiobuttons sind lediglich ein weiterer Typ von <code>input</code> Elementen.",
+            "Jeder deiner Radiobuttons sollte innerhalb eines eigenen <code>label</code> Elements liegen.",
+            "Alle Radiobuttons mit Bezug zueinander sollten das gleiche <code>name</code> Attribut teilen.",
+            "Ein Beispiel eines Radiobuttons:",
+            "<code>&#60;label&#62;&#60;input type=\"radio\" name=\"indoor-outdoor\"&#62; Indoor&#60;/label&#62;</code>",
+            "<hr>",
+            "Füge ein Paar Radiobuttons zu deinem Formular hinzu. Einer sollte die Option <code>indoor</code> und der andere die Option <code>outdoor</code> haben."
+          ]
+        },
+        "es": {
+          "title": "Crea un Conjunto de botones de radio",
+          "description": [
+            "Puedes usar <code>botones de radio</code> para las preguntas en las que deseas que el usuario sólo pueda dar una respuesta.",
+            "Los botones de radio son un tipo del elemento <code>input</code>",
+            "Cada uno de los botones de radio debe estar anidado dentro de su propio elemento <code>label</code>.",
+            "Todos los botones de radio relacionados deben tener el mismo atributo <code>name</code>.",
+            "He aquí un ejemplo de un botón de radio:",
+            "<code>&#60;label&#62;&#60;input type=\"radio\" name=\"dentro-fuera\"&#62; Dentro&#60;/label&#62;</code>",
+            "<hr>",
+            "Agrega un par de botones de radio a tu formulario. Uno debe tener la opción de <code>indoor</code> y el otro debe tener la opción <code>outdoor</code>. "
+          ]
+        },
+        "pt-br": {
+          "title": "Crie um conjunto de botões de opção",
+          "description": [
+            "Você pode usar <code>botões de opção</code> (botões de rádio) para perguntas em que você quer dar opções ao usuário, mas quer que ele escolha apenas uma.",
+            "Botões de opção são um tipo de <code>input</code>.",
+            "Cada um dos botões de opção deve ser aninhado ao seu elemento <code>label</code>.",
+            "Todos os botões de opção relacionados devem ter o mesmo atributo <code>name</code>.",
+            "Aqui está um exemplo de um botão de opção:",
+            "<code>&#60;label&#62;&#60;input type=\"radio\" name=\"indoor-outdoor\"&#62; Indoor&#60;/label&#62;</code>",
+            "<hr>",
+            "Adicione um par de botões de opção ao seu formulário. Um deles deve ser a opção <code>indoor</code> e o outro deve ser a opção <code>outdoor</code>. Ambos devem ter o atributo <code>name</code> de <code>indoor-outdoor</code>."
+          ]
+        },
+        "ru": {
+          "title": "Создайте набор радио-кнопок",
+          "description": [
+            "Вы можете использовать <code>радио кнопки</code> для вопросов, которые требуют выбора одного варианта ответа из множества.",
+            "Радио-кнопки относятся к типу <code>input</code>",
+            "Каждая из ваших радио-кнопок должна быть вложена внутрь своего собственного элемента <code>label</code>.",
+            "Все относящиеся друг к другу, формирующие группу, радио-кнопки должны иметь один и тот же атрибут <code>name</code>.",
+            "Вот пример радио-кнопки:",
+            "<code>&#60;label&#62;&#60;input type=\"radio\" name=\"indoor-outdoor\"&#62; Indoor&#60;/label&#62;</code>",
+            "<hr>",
+            "Добавьте пару радио-кнопок к вашей форме. Одна должна соответствовать варианту <code>indoor</code>, а другая - <code>outdoor</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08835",
+      "title": "Create a Set of Checkboxes",
+      "description": [
+        "Forms commonly use <code>checkboxes</code> for questions that may have more than one answer.",
+        "Checkboxes are a type of <code>input</code>",
+        "Each of your checkboxes should be nested within its own <code>label</code> element.",
+        "All related checkbox inputs should have the same <code>name</code> attribute.",
+        "Here's an example of a checkbox:",
+        "<code>&#60;label&#62;&#60;input type=\"checkbox\" name=\"personality\"&#62; Loving&#60;/label&#62;</code>",
+        "<hr>",
+        "Add to your form a set of three checkboxes. Each checkbox should be nested within its own <code>label</code> element. All three should share the <code>name</code> attribute of <code>personality</code>."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($('input[type=\"checkbox\"]').length > 2, 'message: Your page should have three checkbox elements.');",
+        "assert($('label > input[type=\"checkbox\"]:only-child').length > 2, 'message: Each of your three checkbox elements should be nested in its own <code>label</code> element.');",
+        "assert(code.match(/<\\/label>/g) && code.match(/<label/g) && code.match(/<\\/label>/g).length === code.match(/<label/g).length, 'message: Make sure each of your <code>label</code> elements has a closing tag.');",
+        "assert($('label > input[type=\"checkbox\"]').filter(\"[name='personality']\").length > 2, 'message: Give your checkboxes the <code>name</code> attribute of <code>personality</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Erstelle ein paar Checkboxen",
+          "description": [
+            "Formulare nutzen Kontrollkästchen, <code>checkboxes</code> meistens für Fragen, die mehrerer Antworten bedürfen.",
+            "Checkboxen sind eine Art von <code>input</code> Elementen",
+            "Jedes deiner Checkboxen sollte innerhalb eines eigenen <code>label</code> Elements liegen.",
+            "Alle zusammengehörende Checkboxes sollten das gleiche <code>name</code> Attribut haben.",
+            "Hier ist ein Beispiel für eine Checkbox:",
+            "<code>&#60;label&#62;&#60;input type=\"checkbox\" name=\"personality\"&#62; Loving&#60;/label&#62;</code>",
+            "<hr>",
+            "Füge deinem Formular drei Checkboxen hinzu. Jedes dieser Elemente sollte innerhalb seines eigenen <code>label</code> Elements liegen. Alle sollten das gleiche <code>name</code> Attribut <code>personality</code> teilen."
+          ]
+        },
+        "es": {
+          "title": "Crea un conjunto de casillas de verificación",
+          "description": [
+            "Los formularios suelen usar <code>casillas de verificación</code> para preguntas que pueden tener más de una respuesta.",
+            "Las casillas de verificación son un tipo del elemento <code>input</code>",
+            "Cada una de tus casillas de verificación debe ser anidada dentro de su propio elemento <code>label</code>.",
+            "Todas las entradas de casillas de verificación relacionadas deben tener el mismo atributo <code>name</code>.",
+            "He aquí un ejemplo de una casilla de verificación:",
+            "<code>&#60;label&#62;&#60;input type=\"checkbox\" name=\"personalidad\"&#62; Cariñoso&#60;/label&#62;</code>",
+            "<hr>",
+            "Añade a tu formulario un conjunto de tres casillas de verificación. Cada casilla de verificación debe estar anidada dentro de su propio elemento <code>label</code>. Las tres deben tener <code>personality</code> como su atributo <code>name</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Crie um conjunto de caixas de seleção",
+          "description": [
+            "Formulários geralmente usam <code>caixas de seleção</code> (checkboxes) para perguntas que podem ter mais de uma resposta.",
+            "Caixas de seleção são um tipo de <code>input</code>.",
+            "Cada uma das suas caixas de seleção deve estar aninhada a seu próprio elemento <code>label</code>.",
+            "Todas as caixas de seleção relacionadas devem ter o mesmo atributo <code>name</code>.",
+            "Aqui está um exemplo de uma caixa de seleção: ",
+            "<code>&#60;label&#62;&#60;input type=\"checkbox\" name=\"personality\"&#62; Amável&#60;/label&#62;</code>",
+            "<hr>",
+            "Adicione ao seu formulário um conjunto de três caixas de seleção. Cada caixa deve estar aninhada a seu próprio elemento <code>label</code>. Todas elas devem ter o mesmo atributo <code>name</code> de <code>personality</code>."
+          ]
+        },
+        "ru": {
+          "title": "Создайте набор флаговых кнопок",
+          "description": [
+            "Обычно формы используют <code>флаги (флаговые кнопки)</code> для вопросов, к которым может относиться несколько вариантов ответов.",
+            "Флаги относятся к типу <code>input</code>",
+            "Каждый из ваших флагов должен быть вложен в собственный элемент <code>label</code>.",
+            "Все относящиеся друг к другу флаги должны иметь одинаковый атрибут <code>name</code>.",
+            "Вот пример флаговой кнопки:",
+            "<code>&#60;label&#62;&#60;input type=\"checkbox\" name=\"personality\"&#62; Loving&#60;/label&#62;</code>",
+            "<hr>",
+            "Добавьте набор из трёх флаговых кнопок к вашей форме. Каждый флаг должен быть вложен внутрь собственного элемента <code>label</code>. Все три флага должны иметь одинаковый атрибут <code>name</code>, значение которго равно <code>personality</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedd08835",
+      "title": "Check Radio Buttons and Checkboxes by Default",
+      "description": [
+        "You can set a checkbox or radio button to be checked by default using the <code>checked</code> attribute.",
+        "To do this, just add the word \"checked\" to the inside of an input element. For example:",
+        "<code>&#60;input type=\"radio\" name=\"test-name\" checked&#62;</code>",
+        "<hr>",
+        "Set the first of your <code>radio buttons</code> and the first of your <code>checkboxes</code> to both be checked by default."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($('input[type=\"radio\"]').prop(\"checked\"), 'message: Your first radio button on your form should be checked by default.');",
+        "assert($('input[type=\"checkbox\"]').prop(\"checked\"), 'message: Your first checkbox on your form should be checked by default.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Standardmäßig ausgewählte Radiobuttons und Checkboxen",
+          "description": [
+            "Du kannst Checkboxen und Radiobuttons standardmäßig markiert machen, indem du das <code>checked</code> Attribut verwendest.",
+            "Das kannst du erreichen, indem du das Word \"checked\" innerhalb des Inputelements eingefügst. Zum Beispiel so:",
+            "<code>&#60;input type=\"radio\" name=\"test-name\" checked&#62;</code>",
+            "<hr>",
+            "Stelle sicher, dass jeweils deine ersten Radiobuttons und Checkboxen standardmäßig markiert sind."
+          ]
+        },
+        "es": {
+          "title": "Marca botones de radio y casillas de verificación por omisión",
+          "description": [
+            "Puedes marcar por omisión una casilla de verificación o un botón de radio usando el atributo <code>checked</code>.",
+            "Para ello, sólo tienes que añadir la palabra \"checked\" en el interior de un elemento <code>input</code>. Por ejemplo:",
+            "<code>&#60;input type=\"radio\" name=\"nombre-de-prueba\" checked&#62;</code>",
+            "<hr>",
+            "Establece como marcados por omisión el primero de tus <code>botones de radio</code> y la primera <code>casilla de verificación</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Faça botões de opção e caixas de seleção estarem marcados por padrão",
+          "description": [
+            "Você pode fazer uma caixa de seleção ou botão de opção estar marcado por padrão usando o atributo <code>checked</code>.",
+            "Para fazer isso, apenas insira a palavra \"checked\" em um elemento <code>input</code>. Por exemplo:",
+            "<code>&#60;input type=\"radio\" name=\"test-name\" checked&#62;</code>",
+            "<hr>",
+            "Faça o primeiro dos seus <code>botões de opção</code> e a primeira das suas <code>caixas de seleção</code> estarem ambos marcados por padrão."
+          ]
+        },
+        "ru": {
+          "title": "Отметьте радио-кнопки и флаговые кнопки по-умолчанию",
+          "description": [
+            "Вы можете установить флаг или радио-кнопку отмеченной по-умолчанию с помощью атрибута <code>checked</code>.",
+            "Для этого добавьте слово \"checked\" в качестве атрибута элемента input. Например:",
+            "<code>&#60;input type=\"radio\" name=\"test-name\" checked&#62;</code>",
+            "<hr>",
+            "Установите первую <code>радио-кнопку</code> и первый <code>флаг</code> из наборов отмеченными по-умолчанию."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aede08835",
+      "title": "Nest Many Elements within a Single div Element",
+      "description": [
+        "The <code>div</code> element, also known as a division element, is a general purpose container for other elements.",
+        "The <code>div</code> element is probably the most commonly used HTML element of all.",
+        "Just like any other non-self-closing element, you can open a <code>div</code> element with <code>&#60;div&#62;</code> and close it on another line with <code>&#60;/div&#62;</code>.",
+        "<hr>",
+        "Nest your \"Things cats love\" and \"Things cats hate\" lists all within a single <code>div</code> element.",
+        "Hint: Try putting your opening <code>div</code> tag above your \"Things cats love\" <code>p</code> element and your closing <code>div</code> tag after your closing <code>ol</code> tag so that both of your lists are within one <code>div</code>."
+      ],
+      "challengeSeed": [
+        "<h2>CatPhotoApp</h2>",
+        "<main>",
+        "  <p>Click here to view more <a href=\"#\">cat photos</a>.</p>",
+        "  ",
+        "  <a href=\"#\"><img src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "  ",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  ",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\" checked> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label><br>",
+        "    <label><input type=\"checkbox\" name=\"personality\" checked> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Energetic</label><br>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</main>"
+      ],
+      "tests": [
+        "assert($(\"div\").children(\"p\").length > 1, 'message: Nest your <code>p</code> elements inside your <code>div</code> element.');",
+        "assert($(\"div\").children(\"ul\").length > 0, 'message: Nest your <code>ul</code> element inside your <code>div</code> element.');",
+        "assert($(\"div\").children(\"ol\").length > 0, 'message: Nest your <code>ol</code> element inside your <code>div</code> element.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<\\/div>/g).length === code.match(/<div>/g).length, 'message: Make sure your <code>div</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Umschließe viele Elemente mit einem einzigen div Element",
+          "description": [
+            "Das <code>div</code> Element oder \"Division\" ist ein allgemeiner Container für andere Elemente.",
+            "Das <code>div</code> Element ist wahrscheinlich das am häufigsten verwendete HTML Element.",
+            "Wie jedes andere Element – das sich nicht selbst schließt –  kannst du ein <code>div</code> Element mit <code>&#60;div&#62;</code> öffnen und mit <code>&#60;/div&#62;</code> wieder schließen.",
+            "<hr>",
+            "Versuche dein öffnendes <code>div</code> Element überhalb des <code>p</code> Elements von  \"Things cats love\" und das schließende <code>div</code> unterhalb des schließenden <code>ol</code> Elements zu platzieren. Damit befinden sich beide Listen innerhalb eines <code>div</code>",
+            "Umschließe deine \"Thins cats love\" und \"Things cats hate\" Listen mit einem einzelnen <code>div</code> Element."
+          ]
+        },
+        "es": {
+          "title": "Anida muchos elementos dentro de una sólo elemento div",
+          "description": [
+            "El elemento <code>div</code>, también conocido como un elemento de división, es un contenedor de propósito general para otros elementos.",
+            "El elemento <code>div</code> es probablemente el elemento HTML más utilizado.",
+            "Al igual que cualquier otro elemento sin cierre automático, puedes abrir una etiqueta <code>div</code> con <code>&#60;div&#62;</code> y cerrarla en otra línea con <code>&#60;/div&#62;</code> .",
+            "<hr>",
+            "Trata de poner tu etiqueta de apertura <code>div</code> por encima de elemento <code>p</code> \"Things cat love\", y tu etiqueta de cierre de <code>div</code> después de tu etiqueta de cierre de <code>ol</code>, para que cada una de tus listas estén dentro de un <code>div</code>. ",
+            "Anida tus listas \"Things cats love\" y \"Things cats hate\" dentro de un solo elemento <code>div</code>."
+          ]
+        },
+        "pt-br": {
+          "title": "Aninhe diversos elementos a um único elemento div",
+          "description": [
+            "O elemento <code>div</code>, também conhecido como elemento de divisão, é um contâiner de propósito geral para outros elementos.",
+            "O elemento <code>div</code> provavelmente é o elemento HTML mais usado de todos.",
+            "Da mesma forma que qualquer outro elemento que não tem auto-fechamento, você pode abrir um elemento <code>div</code> com <code>&#60;div&#62;</code> e fechá-lo em outra linha com <code>&#60;/div&#62;</code>.",
+            "<hr>",
+            "Tente colocar sua tag <code>div</code> de abertura acima do seu elemento <code>p</code> \"Things cats love\" e sua tag <code>div</code> de fechamento depois da sua tag <code>ol</code> de fechamento, de forma que ambas as suas listas estejam dentro da mesma <code>div</code>.",
+            "Aninhe as listas \"Things cats love\" e \"Things cats hate\" dentro do mesmo elemento <code>div</code>."
+          ]
+        },
+        "ru": {
+          "title": "Вложите множество элементов внутрь одного элемента div",
+          "description": [
+            "Элемент <code>div</code>, известный как элемент раздела, является контейнером общего назначения для других элементов.",
+            "Элемент <code>div</code> возможно наиболее широко используемый HTML элемент из всех возможных.",
+            "Как и с любым другим несамозакрывающимся элементом, вы можете открыть элемент <code>div</code> меткой <code>&#60;div&#62;</code> и закрыть на следующей строке меткой <code>&#60;/div&#62;</code>.",
+            "<hr>",
+            "Попробуйте разместить открывающую метку <code>div</code> над вашим элементом <code>p</code> с текстом \"Things cats love\", а закрывающую метку <code>div</code> после закрытия элемента <code>ol</code>, таким образом оба ваших списка оказываются внутри одного элемента <code>div</code>.",
+            "Вложите ваши списки \"Things cats love\" и \"Things cats hate\" внутрь одного элемента <code>div</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "587d78aa367417b2b2512aed",
+      "title": "Declare the Doctype of an HTML Document",
+      "description": [
+        "The challenges so far have covered specific HTML tags and their uses. However, there are a few elements that give overall structure to your page, and should be included in every HTML document.",
+        "At the top of your document, you need to tell the browser which version of HTML your page is using. HTML is an evolving language, and is updated regularly. Most major browsers support the latest specification, which is HTML5. However, older web pages may use previous versions of the language.",
+        "You tell the browser this information by adding the <code>&lt;!DOCTYPE ...&gt;</code> tag on the first line, where the \"<code>...</code>\" part is the version of HTML. For HTML5, you use <code>&lt;!DOCTYPE html&gt;</code>.",
+        "The <code>!</code> and uppercase <code>DOCTYPE</code> is important, especially for older browsers. The <code>html</code> is not case sensitive.",
+        "Next, the rest of your HTML code needs to be wrapped in <code>html</code> tags. The opening <code>&lt;html&gt;</code> goes directly below the <code>&lt;!DOCTYPE html&gt;</code> line, and the closing <code>&lt;/html&gt;</code> goes at the end of the page.",
+        "Here's an example of the page structure:",
+        "<blockquote>&lt;!DOCTYPE html&gt;<br>&lt;html&gt;<br>  &lt;!-- Your HTML code goes here --&gt;<br>&lt;/html&gt;</blockquote>",
+        "<hr>",
+        "Add a <code>DOCTYPE</code> tag for HTML5 to the top of the blank HTML document in the code editor. Under it, add opening and closing <code>html</code> tags, which wrap around an <code>h1</code> element. The heading can include any text."
+      ],
+      "challengeSeed": [
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(code.match(/<!DOCTYPE\\s+?html\\s*?>/gi), 'message: Your code should include a <code>&lt;!DOCTYPE html&gt;</code> tag.');",
+        "assert($('html').length == 1, 'message: There should be one <code>html</code> element.');",
+        "assert(code.match(/<html>\\s*?<h1>\\s*?.*?\\s*?<\\/h1>\\s*?<\\/html>/gi), 'message: The <code>html</code> tags should wrap around one <code>h1</code> element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "pt-br": {
+          "title": "Declare o DOCTYPE de um documento HTML",
+          "description": [
+            "Os desafios até agora trataram de tags HTML específicas e seus usos. No entanto, há alguns elementos que determinam a estrutura geral da sua página e devem ser incluídos em todos os documentos HTML.",
+            "No começo do seu documento, você precisa dizer ao navegador qual versão do HTML sua página está usando. O HTML é uma linguagem em evolução e é atualizado regularmente. A maioria dos navegadores mais populares suporta a última especificação, que é o HTML5. No entanto, páginas mais antigas podem estar usando versões anteriores da linguagem.",
+            "Você pode dar ao navegador essa informação adicionando a tag <code>&lt;!DOCTYPE ...&gt;</code> na primeira linha, onde a parte \"<code>...</code>\" é a versão do HTML. Para o HTML5, o código é <code>&lt;!DOCTYPE html&gt;</code>.",
+            "O <code>!</code> e o <code>DOCTYPE</code> todo em maiúsculas são importantes, especialmente para navegadores mais velhos. O <code>html</code> não é sensível a maiúsculas e minúsculas.",
+            "Em seguida, o resto do seu código HTML deve estar delimitado por tags <code>html</code>. A tag <code>&lt;html&gt;</code> vai diretamente abaixo da linha <code>&lt;!DOCTYPE html&gt;</code>, e a tag <code>&lt;/html&gt;</code> vai no final da página.",
+            "Aqui está um exemplo da estrutura de uma página:",
+            "<blockquote>&lt;!DOCTYPE html&gt;<br>&lt;html&gt;<br>  &lt;!-- Seu código HTML vai aqui --&gt;<br>&lt;/html&gt;</blockquote>",
+            "<hr>",
+            "Adicione uma tag <code>DOCTYPE</code> para HTML5 no topo do documento HTML em branco no editor de texto. Abaixo dela, adicione tags <code>html</code> de abertura e fechamento, ao redor de um elemento <code>h1</code>. O texto do <code>h1</code> pode ser qualquer um."
+          ]
+        }
+      }
+    },
+    {
+      "id": "587d78aa367417b2b2512aec",
+      "title": "Define the Head and Body of an HTML Document",
+      "description": [
+        "You can add another level of organization in your HTML document within the <code>html</code> tags with the <code>head</code> and <code>body</code> elements. Any markup with information about your page would go into the <code>head</code> tag. Then any markup with the content of the page (what displays for a user) would go into the <code>body</code> tag.",
+        "Metadata elements, such as <code>link</code>, <code>meta</code>, <code>title</code>, and <code>style</code>, typically go inside the <code>head</code> element.",
+        "Here's an example of a page's layout:",
+        "<blockquote>&lt;!DOCTYPE html&gt;<br>&lt;html&gt;<br>  &lt;head&gt;<br>    &lt;!-- metadata elements --&gt;<br>  &lt;/head&gt;<br>  &lt;body&gt;<br>    &lt;!-- page contents --&gt;<br>  &lt;/body&gt;<br>&lt;/html&gt;</blockquote>",
+        "<hr>",
+        "Edit the markup so there's a <code>head</code> and a <code>body</code>. The <code>head</code> element should only include the <code>title</code>, and the <code>body</code> element should only include the <code>h1</code> and <code>p</code>."
+      ],
+      "challengeSeed": [
+        "<!DOCTYPE html>",
+        "<html>",
+        "  <title>The best page ever</title>",
+        "  ",
+        "  <h1>The best page ever</h1>",
+        "  <p>Cat ipsum dolor sit amet, jump launch to pounce upon little yarn mouse, bare fangs at toy run hide in litter box until treats are fed. Go into a room to decide you didn't want to be in there anyway. I like big cats and i can not lie kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff. Meow i could pee on this if i had the energy for slap owner's face at 5am until human fills food dish yet scamper. Knock dish off table head butt cant eat out of my own dish scratch the furniture. Make meme, make cute face. Sleep in the bathroom sink chase laser but pee in the shoe. Paw at your fat belly licks your face and eat grass, throw it back up kitty ipsum dolor sit amet, shed everywhere shed everywhere stretching attack your ankles chase the red dot, hairball run catnip eat the grass sniff.</p>",
+        "  ",
+        "</html>  "
+      ],
+      "tests": [
+        "assert($('head').length == 1, 'message: There should be only one <code>head</code> element on the page.');",
+        "assert($('body').length == 1, 'message: There should be only one <code>body</code> element on the page.');",
+        "assert($('html').children('head').length == 1, 'message: The <code>head</code> element should be a child of the <code>html</code> element.');",
+        "assert($('html').children('body').length == 1, 'message: The <code>body</code> element should be a child of the <code>html</code> element.');",
+        "assert(code.match(/<head>\\s*?<title>\\s*?.*?\\s*?<\\/title>\\s*?<\\/head>/gi), 'message: The <code>head</code> element should wrap around the <code>title</code> element.');",
+        "assert($('body').children('h1').length == 1 && $('body').children('p').length == 1, 'message: The <code>body</code> element should wrap around both the <code>h1</code> and <code>p</code> elements.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "pt-br": {
+          "title": "Defina cabeça e corpo de um documento HTML",
+          "description": [
+            "Você pode adicionar mais um nível de organização ao seu documento HTML dentro da tag <code>html</code> com os elementos <code>head</code> (cabeça) e <code>body</code> (corpo). Qualquer código com informações sobre a sua página deve estar dentro da tag <code>head</code>. Assim, qualquer código com o conteúdo da sua página (o que aparece para o usuário) deve estar dentro da tag <code>body</code>.",
+            "Elementos de metadados, como <code>link</code>, <code>meta</code>, <code>title</code> e <code>style</code>, tipicamente aparecem dentro do elemento <code>head</code>.",
+            "Aqui está um exemplo da estrutura de uma página:",
+            "<blockquote>&lt;!DOCTYPE html&gt;<br>&lt;html&gt;<br>  &lt;head&gt;<br>    &lt;!-- elementos de metadados --&gt;<br>  &lt;/head&gt;<br>  &lt;body&gt;<br>    &lt;!-- conteúdo da página --&gt;<br>  &lt;/body&gt;<br>&lt;/html&gt;</blockquote>",
+            "<hr>",
+            "Edite o código para que tenha uma <code>head</code> e um <code>body</code>. O elemento <code>head</code> deve incluir apenas o <code>title</code>, e o elemento <code>body</code> deve conter apenas o <code>h1</code> e o <code>p</code>."
+          ]
+        }
+      },
+      "ru": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/01-responsive-web-design/claim-your-responsive-web-design-certificate.json b/seed/math-challenges/01-responsive-web-design/claim-your-responsive-web-design-certificate.json
new file mode 100644
index 0000000000..4fa65f0555
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/claim-your-responsive-web-design-certificate.json
@@ -0,0 +1,108 @@
+{
+  "name": "Claim Your Responsive Web Design Certificate",
+  "order": 13,
+  "time": "5 minutes",
+  "challenges": [
+    {
+      "id": "587d78aa367417b2b2512aee",
+      "title": "Claim Your Responsive Web Design Certificate",
+      "description": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "An image of our Responsive Web Design Certificate",
+          "This challenge will give you your verified Responsive Web Design Certificate. Before we issue your certificate, we must verify that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. You must also accept our Academic Honesty Pledge. Click the button below to start this process.",
+          ""
+        ],
+        [
+          "//i.imgur.com/uLPsUko.jpg",
+          "The definition of plagiarism: Plagiarism (noun) - copying someone else’s work and presenting it as your own without crediting them",
+          "By clicking below, you pledge that all of your submitted code A) is code you or your pair personally wrote, or B) comes from open source libraries like jQuery, or C) has been clearly attributed to its original authors. You also give us permission to audit your challenge solutions and revoke your certificate if we discover evidence of plagiarism.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/UedoV2G.jpg",
+          "An image of the text \"Front End Development Certificate requirements\"",
+          "Let's confirm that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. Click the button below to verify this.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/Q5Za9U6.jpg",
+          "An image of the word \"Congratulations\"",
+          "Congratulations! We've added your Responsive Web Design Certificate to your portfolio page. Unless you choose to hide your solutions, this certificate will remain publicly visible and verifiable.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        {
+          "properties": [
+            "isHonest",
+            "isFrontEndCert"
+          ],
+          "apis": [
+            "/certificate/honest",
+            "/certificate/verify/front-end"
+          ],
+          "stepIndex": [
+            1,
+            2
+          ]
+        }
+      ],
+      "tests": [
+        {
+          "id": "587d78af367417b2b2512b03",
+          "title": "Build a Survey Form"
+        },
+        {
+          "id": "bd7158d8c442eddfaeb5bd18",
+          "title": "Build a Tribute Page"
+        },
+        {
+          "id": "587d78af367417b2b2512b04",
+          "title": "Build a Product Landing Page"
+        },
+        {
+          "id": "587d78b0367417b2b2512b05",
+          "title": "Build a Technical Documentation Page"
+        },
+        {
+          "id": "bd7158d8c242eddfaeb5bd13",
+          "title": "Build a Personal Portfolio Webpage"
+        }
+      ],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "es": {
+          "title": "Reclama tu certificado de Desarrollo de interfaces",
+          "description": [
+            [
+              "//i.imgur.com/k8btNUB.jpg",
+              "Una imagen que muestra nuestro certificado de Desarrollo de interfaces",
+              "Este desafío te otorga tu certificado autenticado de Desarrollo de interfaces. Antes de que podamos emitir tu certificado, debemos verificar que has completado todos los desafíos básicos e intermedios de diseño de algoritmos, y todos los proyectos básicos e intermedios de desarrollo de interfaces. También debes aceptar nuestro Juramento de honestidad académica. Pulsa el botón siguiente para iniciar este proceso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/HArFfMN.jpg",
+              "Plagio (nombre): acción y efecto de plagiar. Plagiar (verbo) - copiar en lo sustancial obras ajenas, dándolas como propias.",
+              "Al pulsar el botón siguiente, juras que todo el código en tus soluciones a los desafíos A) es código que tú o tu compañero escribieron personalmente, o B) proviene de librerías de código abierto como jQuery, o C) ha sido claramente atribuido a sus autores originales. También nos otorgas el permiso para auditar tus soluciones a los desafíos y revocar tu certificado si encontramos evidencia de plagio.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/14F2Van.jpg",
+              "Una imagen del texto \"Front End Development Certificate requirements\"",
+              "Confirmemos que has completado todos nuestros desafíos básicos e intermedios de diseño de algoritmos, y todos nuestros proyectos básicos e intermedios de desarrollo de interfaces. Pulsa el botón siguiente para hacer la verificación.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/16SIhHO.jpg",
+              "Una imagen de la palabra \"Congratulations\"",
+              "¡Felicitaciones! Hemos agregado tu certificado de Desarrollo de interfaces a tu portafolio. A menos que elijas no mostrar tus soluciones, este certificado será públicamente visible y verificable.",
+              ""
+            ]
+          ]
+        }
+      }
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/01-responsive-web-design/css-flexbox.json b/seed/math-challenges/01-responsive-web-design/css-flexbox.json
new file mode 100644
index 0000000000..4c0dad298f
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/css-flexbox.json
@@ -0,0 +1,1161 @@
+{
+  "name": "CSS Flexbox",
+  "order": 5,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d78aa367417b2b2512aef",
+      "title": "Introduction to the CSS Flexbox Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "A website's User Interface (\"UI\") has two components. First, there are the visual elements, such as colors, fonts, and images. Second, there is the placement or positioning of those elements. In Responsive Web Design, a UI layout must accommodate many different browsers and devices accessing the content.<br><br>CSS3 introduced Flexible Boxes, or flexbox, to create page layouts for a dynamic UI. It is a layout mode that arranges elements in a predictable way for different screen sizes and browsers. While somewhat new, all popular modern browsers support flexbox. This section covers how to use flexbox and the different layout options it offers.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d78ab367417b2b2512af0",
+      "title": "Use display: flex to Position Two Boxes",
+      "description": [
+        "This section uses alternating challenge styles to show how to use CSS to position elements in a flexible way. First, a challenge will explain theory, then a practical challenge using a simple tweet component will apply the flexbox concept.",
+        "Placing the CSS property <code>display: flex;</code> on an element allows you to use other flex properties to build a responsive page.",
+        "<hr>",
+        "Add the CSS property <code>display</code> to <code>#box-container</code> and set its value to flex."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    ",
+        "  }",
+        "  ",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 50%;",
+        "    height: 50%;",
+        "    ",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 50%;",
+        "    height: 50%;",
+        "    ",
+        "  }",
+        "</style>",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-container').css('display') == 'flex', 'message: <code>#box-container</code> should have the <code>display</code> property set to a value of flex.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ab367417b2b2512af1",
+      "title": "Add Flex Superpowers to the Tweet Embed",
+      "description": [
+        "To the right is the tweet embed that will be used as the practical example. Some of the elements would look better with a different layout. The last challenge demonstrated <code>display: flex</code>. Here you'll add it to several components in the tweet embed to start adjusting their positioning.",
+        "<hr>",
+        "Add the CSS property <code>display: flex</code> to all of the following items - note that the selectors are already set up in the CSS:",
+        "<code>header</code>, the header's <code>.profile-name</code>, the header's <code>.follow-btn</code>, the header's <code>h3</code> and <code>h4</code>, the <code>footer</code>, and the footer's <code>.stats</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    font-family: Arial, sans-serif;",
+        "  }",
+        "  header {",
+        "    ",
+        "  }",
+        "  header .profile-thumbnail {",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    border-radius: 4px;",
+        "  }",
+        "  header .profile-name {",
+        "    ",
+        "    margin-left: 10px;",
+        "  }",
+        "  header .follow-btn {",
+        "    ",
+        "    margin: 0 0 0 auto;",
+        "  }",
+        "  header .follow-btn button {",
+        "    border: 0;",
+        "    border-radius: 3px;",
+        "    padding: 5px;",
+        "  }",
+        "  header h3, header h4 {",
+        "    ",
+        "    margin: 0;",
+        "  }",
+        "  #inner p {",
+        "    margin-bottom: 10px;",
+        "    font-size: 20px;",
+        "  }",
+        "  #inner hr {",
+        "    margin: 20px 0;",
+        "    border-style: solid;",
+        "    opacity: 0.1;",
+        "  }",
+        "  footer {",
+        "    ",
+        "  }",
+        "  footer .stats {",
+        "    ",
+        "    font-size: 15px;",
+        "  }",
+        "  footer .stats strong {",
+        "    font-size: 18px;",
+        "  }",
+        "  footer .stats .likes {",
+        "    margin-left: 10px;",
+        "  }",
+        "  footer .cta {",
+        "    margin-left: auto;",
+        "  }",
+        "  footer .cta button {",
+        "    border: 0;",
+        "    background: transparent;",
+        "  }",
+        "</style>",
+        "<header>",
+        "  <img src=\"https://pbs.twimg.com/profile_images/378800000147359764/54dc9a5c34e912f34db8662d53d16a39_400x400.png\" alt=\"Quincy Larson's profile picture\" class=\"profile-thumbnail\">",
+        "  <div class=\"profile-name\">",
+        "    <h3>Quincy Larson</h3>",
+        "    <h4>@ossia</h4>",
+        "  </div>",
+        "  <div class=\"follow-btn\">",
+        "    <button>Follow</button>",
+        "  </div>",
+        "</header>",
+        "<div id=\"inner\">",
+        "  <p>How would you describe to a layperson the relationship between Node, Express, and npm in a single tweet? An analogy would be helpful.</p>",
+        "  <span class=\"date\">7:24 PM - 17 Aug 2016</span>",
+        "  <hr>",
+        "</div>",
+        "<footer>",
+        "  <div class=\"stats\">",
+        "    <div class=\"retweets\">",
+        "      <strong>56,203</strong> RETWEETS",
+        "    </div>",
+        "    <div class=\"likes\">",
+        "      <strong>84,703</strong> LIKES",
+        "    </div>",
+        "  </div>",
+        "  <div class=\"cta\">",
+        "    <button class=\"share-btn\">Share</button>",
+        "    <button class=\"retweet-btn\">Retweet</button>",
+        "    <button class=\"like-btn\">Like</button>",
+        "  </div>",
+        "</footer>"
+      ],
+      "tests": [
+        "assert($('header').css('display') == 'flex', 'message: Your <code>header</code> should have a <code>display</code> property set to flex.');",
+        "assert($('footer').css('display') == 'flex', 'message: Your <code>footer</code> should have a <code>display</code> property set to flex.');",
+        "assert($('h3').css('display') == 'flex', 'message: Your <code>h3</code> should have a <code>display</code> property set to flex.');",
+        "assert($('h4').css('display') == 'flex', 'message: Your <code>h4</code> should have a <code>display</code> property set to flex.');",
+        "assert($('.profile-name').css('display') == 'flex', 'message: Your <code>.profile-name</code> should have a <code>display</code> property set to flex.');",
+        "assert($('.follow-btn').css('display') == 'flex', 'message: Your <code>.follow-btn</code> should have a <code>display</code> property set to flex.');",
+        "assert($('.stats').css('display') == 'flex', 'message: Your <code>.stats</code> should have a <code>display</code> property set to flex.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ab367417b2b2512af2",
+      "title": "Use the flex-direction Property to Make a Row",
+      "description": [
+        "Adding <code>display: flex</code> to an element turns it into a flex container. This makes it possible to align any children of that element into rows or columns. You do this by adding the <code>flex-direction</code> property to the parent item and setting it to row or column. Creating a row will align the children horizontally, and creating a column will align the children vertically.",
+        "Other options for <code>flex-direction</code> are row-reverse and column-reverse.",
+        "<strong>Note</strong><br>The default value for the <code>flex-direction</code> property is row.",
+        "<hr>",
+        "Add the CSS property <code>flex-direction</code> to the <code>#box-container</code> element, and give it a value of row-reverse."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    ",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 50%;",
+        "    height: 50%;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 50%;",
+        "    height: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-container').css('flex-direction') == 'row-reverse', 'message: The <code>#box-container</code> element should have a <code>flex-direction</code> property set to row-reverse.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ab367417b2b2512af3",
+      "title": "Apply the flex-direction Property to Create Rows in the Tweet Embed",
+      "description": [
+        "The <code>header</code> and <code>footer</code> in the tweet embed example have child items that could be arranged as rows using the <code>flex-direction</code> property. This tells CSS to align the children horizontally.",
+        "<hr>",
+        "Add the CSS property <code>flex-direction</code> to both the <code>header</code> and <code>footer</code> and set the value to row."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    font-family: Arial, sans-serif;",
+        "  }",
+        "  header {",
+        "    display: flex;",
+        "    ",
+        "  }",
+        "  header .profile-thumbnail {",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    border-radius: 4px;",
+        "  }",
+        "  header .profile-name {",
+        "    display: flex;",
+        "    margin-left: 10px;",
+        "  }",
+        "  header .follow-btn {",
+        "    display: flex;",
+        "    margin: 0 0 0 auto;",
+        "  }",
+        "  header .follow-btn button {",
+        "    border: 0;",
+        "    border-radius: 3px;",
+        "    padding: 5px;",
+        "  }",
+        "  header h3, header h4 {",
+        "    display: flex;",
+        "    margin: 0;",
+        "  }",
+        "  #inner p {",
+        "    margin-bottom: 10px;",
+        "    font-size: 20px;",
+        "  }",
+        "  #inner hr {",
+        "    margin: 20px 0;",
+        "    border-style: solid;",
+        "    opacity: 0.1;",
+        "  }",
+        "  footer {",
+        "    display: flex;",
+        "    ",
+        "  }",
+        "  footer .stats {",
+        "    display: flex;",
+        "    font-size: 15px;",
+        "  }",
+        "  footer .stats strong {",
+        "    font-size: 18px;",
+        "  }",
+        "  footer .stats .likes {",
+        "    margin-left: 10px;",
+        "  }",
+        "  footer .cta {",
+        "    margin-left: auto;",
+        "  }",
+        "  footer .cta button {",
+        "    border: 0;",
+        "    background: transparent;",
+        "  }",
+        "</style>",
+        "<header>",
+        "  <img src=\"https://pbs.twimg.com/profile_images/378800000147359764/54dc9a5c34e912f34db8662d53d16a39_400x400.png\" alt=\"Quincy Larson's profile picture\" class=\"profile-thumbnail\">",
+        "  <div class=\"profile-name\">",
+        "    <h3>Quincy Larson</h3>",
+        "    <h4>@ossia</h4>",
+        "  </div>",
+        "  <div class=\"follow-btn\">",
+        "    <button>Follow</button>",
+        "  </div>",
+        "</header>",
+        "<div id=\"inner\">",
+        "  <p>How would you describe to a layperson the relationship between Node, Express, and npm in a single tweet? An analogy would be helpful.</p>",
+        "  <span class=\"date\">7:24 PM - 17 Aug 2016</span>",
+        "  <hr>",
+        "</div>",
+        "<footer>",
+        "  <div class=\"stats\">",
+        "    <div class=\"retweets\">",
+        "      <strong>56,203</strong> RETWEETS",
+        "    </div>",
+        "    <div class=\"likes\">",
+        "      <strong>84,703</strong> LIKES",
+        "    </div>",
+        "  </div>",
+        "  <div class=\"cta\">",
+        "    <button class=\"share-btn\">Share</button>",
+        "    <button class=\"retweet-btn\">Retweet</button>",
+        "    <button class=\"like-btn\">Like</button>",
+        "  </div>",
+        "</footer>"
+      ],
+      "tests": [
+        "assert(code.match(/header\\s*?{\\s*?.*?\\s*?.*?\\s*?flex-direction:\\s*?row;/g), 'message: The <code>header</code> should have a <code>flex-direction</code> property set to row.');",
+        "assert(code.match(/footer\\s*?{\\s*?.*?\\s*?.*?\\s*?flex-direction:\\s*?row;/g), 'message: The <code>footer</code> should have a <code>flex-direction</code> property set to row.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ac367417b2b2512af4",
+      "title": "Use the flex-direction Property to Make a Column",
+      "description": [
+        "The last two challenges used the <code>flex-direction</code> property set to row. This property can also create a column by vertically stacking the children of a flex container.",
+        "<hr>",
+        "Add the CSS property <code>flex-direction</code> to the <code>#box-container</code> element, and give it a value of column."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    ",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 50%;",
+        "    height: 50%;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 50%;",
+        "    height: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-container').css('flex-direction') == 'column', 'message: The <code>#box-container</code> element should have a <code>flex-direction</code> property set to column.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ac367417b2b2512af5",
+      "title": "Apply the flex-direction Property to Create a Column in the Tweet Embed",
+      "description": [
+        "The tweet embed <code>header</code> and <code>footer</code> used the <code>flex-direction</code> property earlier with a row value. Similarly, the items inside the <code>.profile-name</code> element would work well stacked as a column.",
+        "<hr>",
+        "Add the CSS property <code>flex-direction</code> to the header's <code>.profile-name</code> element and set the value to column."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    font-family: Arial, sans-serif;",
+        "  }",
+        "  header, footer {",
+        "    display: flex;",
+        "    flex-direction: row;",
+        "  }",
+        "  header .profile-thumbnail {",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    border-radius: 4px;",
+        "  }",
+        "  header .profile-name {",
+        "    display: flex;",
+        "    ",
+        "    margin-left: 10px;",
+        "  }",
+        "  header .follow-btn {",
+        "    display: flex;",
+        "    margin: 0 0 0 auto;",
+        "  }",
+        "  header .follow-btn button {",
+        "    border: 0;",
+        "    border-radius: 3px;",
+        "    padding: 5px;",
+        "  }",
+        "  header h3, header h4 {",
+        "    display: flex;",
+        "    margin: 0;",
+        "  }",
+        "  #inner p {",
+        "    margin-bottom: 10px;",
+        "    font-size: 20px;",
+        "  }",
+        "  #inner hr {",
+        "    margin: 20px 0;",
+        "    border-style: solid;",
+        "    opacity: 0.1;",
+        "  }",
+        "  footer .stats {",
+        "    display: flex;",
+        "    font-size: 15px;",
+        "  }",
+        "  footer .stats strong {",
+        "    font-size: 18px;",
+        "  }",
+        "  footer .stats .likes {",
+        "    margin-left: 10px;",
+        "  }",
+        "  footer .cta {",
+        "    margin-left: auto;",
+        "  }",
+        "  footer .cta button {",
+        "    border: 0;",
+        "    background: transparent;",
+        "  }",
+        "</style>",
+        "<header>",
+        "  <img src=\"https://pbs.twimg.com/profile_images/378800000147359764/54dc9a5c34e912f34db8662d53d16a39_400x400.png\" alt=\"Quincy Larson's profile picture\" class=\"profile-thumbnail\">",
+        "  <div class=\"profile-name\">",
+        "    <h3>Quincy Larson</h3>",
+        "    <h4>@ossia</h4>",
+        "  </div>",
+        "  <div class=\"follow-btn\">",
+        "    <button>Follow</button>",
+        "  </div>",
+        "</header>",
+        "<div id=\"inner\">",
+        "  <p>How would you describe to a layperson the relationship between Node, Express, and npm in a single tweet? An analogy would be helpful.</p>",
+        "  <span class=\"date\">7:24 PM - 17 Aug 2016</span>",
+        "  <hr>",
+        "</div>",
+        "<footer>",
+        "  <div class=\"stats\">",
+        "    <div class=\"retweets\">",
+        "      <strong>56,203</strong> RETWEETS",
+        "    </div>",
+        "    <div class=\"likes\">",
+        "      <strong>84,703</strong> LIKES",
+        "    </div>",
+        "  </div>",
+        "  <div class=\"cta\">",
+        "    <button class=\"share-btn\">Share</button>",
+        "    <button class=\"retweet-btn\">Retweet</button>",
+        "    <button class=\"like-btn\">Like</button>",
+        "  </div>",
+        "</footer>"
+      ],
+      "tests": [
+        "assert($('.profile-name').css('flex-direction') == 'column', 'message: The <code>.profile-name</code> element should have a <code>flex-direction</code> property set to column.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ac367417b2b2512af6",
+      "title": "Align Elements Using the justify-content Property",
+      "description": [
+        "Sometimes the flex items within a flex container do not fill all the space in the container. It is common to want to tell CSS how to align and space out the flex items a certain way. Fortunately, the <code>justify-content</code> property has several options to do this. But first, there is some important terminology to understand before reviewing those options.",
+        "<a href=\"https://www.w3.org/TR/css-flexbox-1/images/flex-direction-terms.svg\" target=\"_blank\">Here is a useful image showing a row to illustrate the concepts below.</a>",
+        "Recall that setting a flex container as a row places the flex items side-by-side from left-to-right. A flex container set as a column places the flex items in a vertical stack from top-to-bottom. For each, the direction the flex items are arranged is called the <strong>main axis</strong>. For a row, this is a horizontal line that cuts through each item. And for a column, the main axis is a vertical line through the items.",
+        "There are several options for how to space the flex items along the line that is the main axis. One of the most commonly used is <code>justify-content: center;</code>, which aligns all the flex items to the center inside the flex container. Others options include:",
+        "<ul><li><code>flex-start</code>: aligns items to the start of the flex container. For a row, this pushes the items to the left of the container. For a column, this pushes the items to the top of the container.</li><li><code>flex-end</code>: aligns items to the end of the flex container. For a row, this pushes the items to the right of the container. For a column, this pushes the items to the bottom of the container.</li><li><code>space-between</code>: aligns items to the center of the main axis, with extra space placed between the items. The first and last items are pushed to the very edge of the flex container. For example, in a row the first item is against the left side of the container, the last item is against the right side of the container, then the other items between them are spaced evenly.</li><li><code>space-around</code>: similar to <code>space-between</code> but the first and last items are not locked to the edges of the container, the space is distributed around all the items</li></ul>",
+        "<hr>",
+        "An example helps show this property in action. Add the CSS property <code>justify-content</code> to the <code>#box-container</code> element, and give it a value of center.",
+        "<strong>Bonus</strong><br>Try the other options for the <code>justify-content</code> property in the code editor to see their differences. But note that a value of center is the only one that will pass this challenge."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    background: gray;",
+        "    display: flex;",
+        "    height: 500px;",
+        "    ",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 25%;",
+        "    height: 100%;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 25%;",
+        "    height: 100%;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-container').css('justify-content') == 'center', 'message: The <code>#box-container</code> element should have a <code>justify-content</code> property set to a value of center.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ac367417b2b2512af7",
+      "title": "Use the justify-content Property in the Tweet Embed",
+      "description": [
+        "The last challenge showed an example of the <code>justify-content</code> property. For the tweet embed, this property can be applied to align the items in the <code>.profile-name</code> element.",
+        "<hr>",
+        "Add the CSS property <code>justify-content</code> to the header's <code>.profile-name</code> element and set the value to any of the options from the last challenge."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    font-family: Arial, sans-serif;",
+        "  }",
+        "  header, footer {",
+        "    display: flex;",
+        "    flex-direction: row;",
+        "  }",
+        "  header .profile-thumbnail {",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    border-radius: 4px;",
+        "  }",
+        "  header .profile-name {",
+        "    display: flex;",
+        "    flex-direction: column;",
+        "    ",
+        "    margin-left: 10px;",
+        "  }",
+        "  header .follow-btn {",
+        "    display: flex;",
+        "    margin: 0 0 0 auto;",
+        "  }",
+        "  header .follow-btn button {",
+        "    border: 0;",
+        "    border-radius: 3px;",
+        "    padding: 5px;",
+        "  }",
+        "  header h3, header h4 {",
+        "    display: flex;",
+        "    margin: 0;",
+        "  }",
+        "  #inner p {",
+        "    margin-bottom: 10px;",
+        "    font-size: 20px;",
+        "  }",
+        "  #inner hr {",
+        "    margin: 20px 0;",
+        "    border-style: solid;",
+        "    opacity: 0.1;",
+        "  }",
+        "  footer .stats {",
+        "    display: flex;",
+        "    font-size: 15px;",
+        "  }",
+        "  footer .stats strong {",
+        "    font-size: 18px;",
+        "  }",
+        "  footer .stats .likes {",
+        "    margin-left: 10px;",
+        "  }",
+        "  footer .cta {",
+        "    margin-left: auto;",
+        "  }",
+        "  footer .cta button {",
+        "    border: 0;",
+        "    background: transparent;",
+        "  }",
+        "</style>",
+        "<header>",
+        "  <img src=\"https://pbs.twimg.com/profile_images/378800000147359764/54dc9a5c34e912f34db8662d53d16a39_400x400.png\" alt=\"Quincy Larson's profile picture\" class=\"profile-thumbnail\">",
+        "  <div class=\"profile-name\">",
+        "    <h3>Quincy Larson</h3>",
+        "    <h4>@ossia</h4>",
+        "  </div>",
+        "  <div class=\"follow-btn\">",
+        "    <button>Follow</button>",
+        "  </div>",
+        "</header>",
+        "<div id=\"inner\">",
+        "  <p>How would you describe to a layperson the relationship between Node, Express, and npm in a single tweet? An analogy would be helpful.</p>",
+        "  <span class=\"date\">7:24 PM - 17 Aug 2016</span>",
+        "  <hr>",
+        "</div>",
+        "<footer>",
+        "  <div class=\"stats\">",
+        "    <div class=\"retweets\">",
+        "      <strong>56,203</strong> RETWEETS",
+        "    </div>",
+        "    <div class=\"likes\">",
+        "      <strong>84,703</strong> LIKES",
+        "    </div>",
+        "  </div>",
+        "  <div class=\"cta\">",
+        "    <button class=\"share-btn\">Share</button>",
+        "    <button class=\"retweet-btn\">Retweet</button>",
+        "    <button class=\"like-btn\">Like</button>",
+        "  </div>",
+        "</footer>"
+      ],
+      "tests": [
+        "assert(code.match(/header\\s.profile-name\\s*{\\s*?.*?\\s*?.*?\\s*?\\s*?.*?\\s*?justify-content\\s*:\\s*(center|flex-start|flex-end|space-between|space-around)\\s*;/g), 'message: The <code>.profile-name</code> element should have the <code>justify-content</code> property set to any of these values: center, flex-start, flex-end, space-between, or space-around.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ad367417b2b2512af8",
+      "title": "Align Elements Using the align-items Property",
+      "description": [
+        "The <code>align-items</code> property is similar to <code>justify-content</code>. Recall that the <code>justify-content</code> property aligned flex items along the main axis. For rows, the main axis is a horizontal line and for columns it is a vertical line.",
+        "Flex containers also have a <strong>cross axis</strong> which is the opposite of the main axis. For rows, the cross axis is vertical and for columns, the cross axis is horizontal.",
+        "CSS offers the <code>align-items</code> property to align flex items along the cross axis. For a row, it tells CSS how to push the items in the entire row up or down within the container. And for a column, how to push all the items left or right within the container.",
+        "The different values available for <code>align-items</code> include:",
+        "<ul><li><code>flex-start</code>: aligns items to the start of the flex container. For rows, this aligns items to the top of the container. For columns, this aligns items to the left of the container.</li><li><code>flex-end</code>: aligns items to the end of the flex container. For rows, this aligns items to the bottom of the container. For columns, this aligns items to the right of the container.</li><li><code>center</code>: align items to the center. For rows, this vertically aligns items (equal space above and below the items). For columns, this horizontally aligns them (equal space to the left and right of the items).</li><li><code>stretch</code>: stretch the items to fill the flex container. For example, rows items are stretched to fill the flex container top-to-bottom.</li><li><code>baseline</code>: align items to their baselines. Baseline is a text concept, think of it as the line that the letters sit on.</li></ul>",
+        "<hr>",
+        "An example helps show this property in action. Add the CSS property <code>align-items</code> to the <code>#box-container</code> element, and give it a value of center.",
+        "<strong>Bonus</strong><br>Try the other options for the <code>align-items</code> property in the code editor to see their differences. But note that a value of center is the only one that will pass this challenge."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    background: gray;",
+        "    display: flex;",
+        "    ",
+        "    height: 500px;",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 200px;",
+        "    font-size: 24px;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 200px;",
+        "    font-size: 18px;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"><p>Hello</p></div>",
+        "  <div id=\"box-2\"><p>Goodbye</p></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-container').css('align-items') == 'center', 'message: The <code>#box-container</code> element should have an <code>align-items</code> property set to a value of center.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ad367417b2b2512af9",
+      "title": "Use the align-items Property in the Tweet Embed",
+      "description": [
+        "The last challenge introduced the <code>align-items</code> property and gave an example. This property can be applied to a few tweet embed elements to align the flex items inside them.",
+        "<hr>",
+        "Add the CSS property <code>align-items</code> to the header's <code>.follow-btn</code> element, the header's <code>h3</code>, and the header's <code>h4</code>. Set the value to center."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  body {",
+        "    font-family: Arial, sans-serif;",
+        "  }",
+        "  header, footer {",
+        "    display: flex;",
+        "    flex-direction: row;",
+        "  }",
+        "  header .profile-thumbnail {",
+        "    width: 50px;",
+        "    height: 50px;",
+        "    border-radius: 4px;",
+        "  }",
+        "  header .profile-name {",
+        "    display: flex;",
+        "    flex-direction: column;",
+        "    justify-content: center;",
+        "    margin-left: 10px;",
+        "  }",
+        "  header .follow-btn {",
+        "    display: flex;",
+        "    ",
+        "    margin: 0 0 0 auto;",
+        "  }",
+        "  header .follow-btn button {",
+        "    border: 0;",
+        "    border-radius: 3px;",
+        "    padding: 5px;",
+        "  }",
+        "  header h3, header h4 {",
+        "    display: flex;",
+        "    ",
+        "    margin: 0;",
+        "  }",
+        "  #inner p {",
+        "    margin-bottom: 10px;",
+        "    font-size: 20px;",
+        "  }",
+        "  #inner hr {",
+        "    margin: 20px 0;",
+        "    border-style: solid;",
+        "    opacity: 0.1;",
+        "  }",
+        "  footer .stats {",
+        "    display: flex;",
+        "    font-size: 15px;",
+        "  }",
+        "  footer .stats strong {",
+        "    font-size: 18px;",
+        "  }",
+        "  footer .stats .likes {",
+        "    margin-left: 10px;",
+        "  }",
+        "  footer .cta {",
+        "    margin-left: auto;",
+        "  }",
+        "  footer .cta button {",
+        "    border: 0;",
+        "    background: transparent;",
+        "  }",
+        "</style>",
+        "<header>",
+        "  <img src=\"https://pbs.twimg.com/profile_images/378800000147359764/54dc9a5c34e912f34db8662d53d16a39_400x400.png\" alt=\"Quincy Larson's profile picture\" class=\"profile-thumbnail\">",
+        "  <div class=\"profile-name\">",
+        "    <h3>Quincy Larson</h3>",
+        "    <h4>@ossia</h4>",
+        "  </div>",
+        "  <div class=\"follow-btn\">",
+        "    <button>Follow</button>",
+        "  </div>",
+        "</header>",
+        "<div id=\"inner\">",
+        "  <p>How would you describe to a layperson the relationship between Node, Express, and npm in a single tweet? An analogy would be helpful.</p>",
+        "  <span class=\"date\">7:24 PM - 17 Aug 2016</span>",
+        "  <hr>",
+        "</div>",
+        "<footer>",
+        "  <div class=\"stats\">",
+        "    <div class=\"retweets\">",
+        "      <strong>56,203</strong> RETWEETS",
+        "    </div>",
+        "    <div class=\"likes\">",
+        "      <strong>84,703</strong> LIKES",
+        "    </div>",
+        "  </div>",
+        "  <div class=\"cta\">",
+        "    <button class=\"share-btn\">Share</button>",
+        "    <button class=\"retweet-btn\">Retweet</button>",
+        "    <button class=\"like-btn\">Like</button>",
+        "  </div>",
+        "</footer>"
+      ],
+      "tests": [
+        "assert($('.follow-btn').css('align-items') == 'center', 'message: The <code>.follow-btn</code> element should have the <code>align-items</code> property set to a value of center.');",
+        "assert($('h3').css('align-items') == 'center', 'message: The <code>h3</code> element should have the <code>align-items</code> property set to a value of center.');",
+        "assert($('h4').css('align-items') == 'center', 'message: The <code>h4</code> element should have the <code>align-items</code> property set to a value of center.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ad367417b2b2512afa",
+      "title": "Use the flex-wrap Property to Wrap a Row or Column",
+      "description": [
+        "CSS flexbox has a feature to split a flex item into multiple rows (or columns). By default, a flex container will fit all flex items together. For example, a row will all be on one line.",
+        "However, using the <code>flex-wrap</code> property, it tells CSS to wrap items. This means extra items move into a new row or column. The break point of where the wrapping happens depends on the size of the items and the size of the container.",
+        "CSS also has options for the direction of the wrap:",
+        "<ul><li><code>nowrap</code>: this is the default setting, and does not wrap items.</li><li><code>wrap</code>: wraps items from left-to-right if they are in a row, or top-to-bottom if they are in a column.</li><li><code>wrap-reverse</code>: wraps items from right-to-left if they are in a row, or bottom-to-top if they are in a column.</li></ul>",
+        "<hr>",
+        "The current layout has too many boxes for one row. Add the CSS property <code>flex-wrap</code> to the <code>#box-container</code> element, and give it a value of wrap."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    background: gray;",
+        "    display: flex;",
+        "    height: 100%;",
+        "      ",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 25%;",
+        "    height: 50%;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 25%;",
+        "    height: 50%;",
+        "  }",
+        "  #box-3 {",
+        "    background-color: violet;",
+        "    width: 25%;",
+        "    height: 50%;",
+        "  }",
+        "  #box-4 {",
+        "    background-color: yellow;",
+        "    width: 25%;",
+        "    height: 50%;",
+        "  }",
+        "  #box-5 {",
+        "    background-color: green;",
+        "    width: 25%;",
+        "    height: 50%;",
+        "  }",
+        "  #box-6 {",
+        "    background-color: black;",
+        "    width: 25%;",
+        "    height: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "  <div id=\"box-3\"></div>",
+        "  <div id=\"box-4\"></div>",
+        "  <div id=\"box-5\"></div>",
+        "  <div id=\"box-6\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-container').css('flex-wrap') == 'wrap', 'message: The <code>#box-container</code> element should have the <code>flex-wrap</code> property set to a value of wrap.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ad367417b2b2512afb",
+      "title": "Use the flex-shrink Property to Shrink Items",
+      "description": [
+        "So far, all the properties in the challenges apply to the flex container (the parent of the flex items). However, there are several useful properties for the flex items.",
+        "The first is the <code>flex-shrink</code> property. When it's used, it allows an item to shrink if the flex container is too small. Items shrink when the width of the parent container is smaller than the combined widths of all the flex items within it.",
+        "The <code>flex-shrink</code> property takes numbers as values. The higher the number, the more it will shrink compared to the other items in the container. For example, if one item has a <code>flex-shrink</code> value of 1 and the other has a <code>flex-shrink</code> value of 3, the one with the value of 3 will shrink three times as much as the other.",
+        "<hr>",
+        "Add the CSS property <code>flex-shrink</code> to both <code>#box-1</code> and <code>#box-2</code>. Give <code>#box-1</code> a value of 1 and <code>#box-2</code> a value of 2."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    height: 500px;",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    width: 100%;",
+        "    height: 200px;",
+        "    ",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    width: 100%;",
+        "    height: 200px;",
+        "    ",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-1').css('flex-shrink') == '1', 'message: The <code>#box-1</code> element should have the <code>flex-shrink</code> property set to a value of 1.');",
+        "assert($('#box-2').css('flex-shrink') == '2', 'message: The <code>#box-2</code> element should have the <code>flex-shrink</code> property set to a value of 2.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ae367417b2b2512afc",
+      "title": "Use the flex-grow Property to Expand Items",
+      "description": [
+        "The opposite of <code>flex-shrink</code> is the <code>flex-grow</code> property. Recall that <code>flex-shrink</code> controls the size of the items when the container shrinks. The <code>flex-grow</code> property controls the size of items when the parent container expands.",
+        "Using a similar example from the last challenge, if one item has a <code>flex-grow</code> value of 1 and the other has a <code>flex-grow</code> value of 3, the one with the value of 3 will grow three times as much as the other.",
+        "<hr>",
+        "Add the CSS property <code>flex-grow</code> to both <code>#box-1</code> and <code>#box-2</code>. Give <code>#box-1</code> a value of 1 and <code>#box-2</code> a value of 2."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    height: 500px;",
+        "  }",
+        "  ",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    height: 200px;",
+        "    ",
+        "  }",
+        "  ",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    height: 200px;",
+        "    ",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-1').css('flex-grow') == '1', 'message: The <code>#box-1</code> element should have the <code>flex-grow</code> property set to a value of 1.');",
+        "assert($('#box-2').css('flex-grow') == '2', 'message: The <code>#box-2</code> element should have the <code>flex-grow</code> property set to a value of 2.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ae367417b2b2512afd",
+      "title": "Use the flex-basis Property to Set the Initial Size of an Item",
+      "description": [
+        "The <code>flex-basis</code> property specifies the initial size of the item before CSS makes adjustments with <code>flex-shrink</code> or <code>flex-grow</code>.",
+        "The units used by the <code>flex-basis</code> property are the same as other size properties (<code>px</code>, <code>em</code>, <code>%</code>, etc.). The value <code>auto</code> sizes items based on the content.",
+        "<hr>",
+        "Set the initial size of the boxes using <code>flex-basis</code>. Add the CSS property <code>flex-basis</code> to both <code>#box-1</code> and <code>#box-2</code>. Give <code>#box-1</code> a value of <code>10em</code> and <code>#box-2</code> a value of <code>20em</code>."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    height: 500px;",
+        "  }",
+        "  ",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    height: 200px;",
+        "    ",
+        "  }",
+        "  ",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    height: 200px;",
+        "    ",
+        "  }",
+        "</style>",
+        "  ",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-1').css('flex-basis') != 'auto', 'message: The <code>#box-1</code> element should have a <code>flex-basis</code> property.');",
+        "assert(code.match(/#box-1\\s*?{\\s*?.*?\\s*?.*?\\s*?flex-basis:\\s*?10em;/g), 'message: The <code>#box-1</code> element should have a <code>flex-basis</code> value of <code>10em</code>.');",
+        "assert($('#box-2').css('flex-basis') != 'auto', 'message: The <code>#box-2</code> element should have the <code>flex-basis</code> property.');",
+        "assert(code.match(/#box-2\\s*?{\\s*?.*?\\s*?.*?\\s*?flex-basis:\\s*?20em;/g), 'message: The <code>#box-2</code> element should have a <code>flex-basis</code> value of <code>20em</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ae367417b2b2512afe",
+      "title": "Use the flex Shorthand Property",
+      "description": [
+        "There is a shortcut available to set several flex properties at once. The <code>flex-grow</code>, <code>flex-shrink</code>, and <code>flex-basis</code> properties can all be set together by using the <code>flex</code> property.",
+        "For example, <code>flex: 1 0 10px;</code> will set the item to <code>flex-grow: 1;</code>, <code>flex-shrink: 0;</code>, and <code>flex-basis: 10px;</code>.",
+        "The default property settings are <code>flex: 0 1 auto;</code>.",
+        "<hr>",
+        "Add the CSS property <code>flex</code> to both <code>#box-1</code> and <code>#box-2</code>. Give <code>#box-1</code> the values so its <code>flex-grow</code> is 2, its <code>flex-shrink</code> is 2, and its <code>flex-basis</code> is 150px. Give <code>#box-2</code> the values so its <code>flex-grow</code> is 1, its <code>flex-shrink</code> is 1, and its <code>flex-basis</code> is 150px.",
+        "These values will cause <code>#box-1</code> to be twice the size of <code>#box-2</code> when the container is greater than 300px and half the size of #box-2 when the container is less than 300px. 300px is the combined size of the <code>flex-basis</code> values of the two boxes."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    height: 500px;",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    ",
+        "    height: 200px;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    ",
+        "    height: 200px;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-1').css('flex-grow') == '2' && $('#box-1').css('flex-shrink') == '2' && $('#box-1').css('flex-basis') == '150px', 'message: The <code>#box-1</code> element should have the <code>flex</code> property set to a value of 2 2 150px.');",
+        "assert($('#box-2').css('flex-grow') == '1' && $('#box-2').css('flex-shrink') == '1' && $('#box-2').css('flex-basis') == '150px', 'message: The <code>#box-2</code> element should have the <code>flex</code> property set to a value of 1 1 150px.');",
+        "assert(code.match(/flex:\\s*?\\d\\s+?\\d\\s+?150px;/g).length == 2, 'message: Your code should use the <code>flex</code> property for <code>#box-1</code> and <code>#box-2</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78ae367417b2b2512aff",
+      "title": "Use the order Property to Rearrange Items",
+      "description": [
+        "The <code>order</code> property is used to tell CSS the order of how flex items appear in the flex container. By default, items will appear in the same order they come in the source HTML. The property takes numbers as values, and negative numbers can be used.",
+        "<hr>",
+        "Add the CSS property <code>order</code> to both <code>#box-1</code> and <code>#box-2</code>. Give <code>#box-1</code> a value of 2 and give <code>#box-2</code> a value of 1."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    height: 500px;",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    ",
+        "    height: 200px;",
+        "    width: 200px;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    ",
+        "    height: 200px;",
+        "    width: 200px;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-1').css('order') == '2', 'message: The <code>#box-1</code> element should have the <code>order</code> property set to a value of 2.');",
+        "assert($('#box-2').css('order') == '1', 'message: The <code>#box-2</code> element should have the <code>order</code> property set to a value of 1.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d78af367417b2b2512b00",
+      "title": "Use the align-self Property",
+      "description": [
+        "The final property for flex items is <code>align-self</code>. This property allows you to adjust each item's alignment individually, instead of setting them all at once. This is useful since other common adjustment techniques using the CSS properties <code>float</code>, <code>clear</code>, and <code>vertical-align</code> do not work on flex items.",
+        "<code>align-self</code> accepts the same values as <code>align-items</code> and will override any value set by the <code>align-items</code> property.",
+        "<hr>",
+        "Add the CSS property <code>align-self</code> to both <code>#box-1</code> and <code>#box-2</code>. Give <code>#box-1</code> a value of center and give <code>#box-2</code> a value of flex-end."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  #box-container {",
+        "    display: flex;",
+        "    height: 500px;",
+        "  }",
+        "  #box-1 {",
+        "    background-color: dodgerblue;",
+        "    ",
+        "    height: 200px;",
+        "    width: 200px;",
+        "  }",
+        "",
+        "  #box-2 {",
+        "    background-color: orangered;",
+        "    ",
+        "    height: 200px;",
+        "    width: 200px;",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"box-container\">",
+        "  <div id=\"box-1\"></div>",
+        "  <div id=\"box-2\"></div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('#box-1').css('align-self') == 'center', 'message: The <code>#box-1</code> element should have the <code>align-self</code> property set to a value of center.');",
+        "assert($('#box-2').css('align-self') == 'flex-end', 'message: The <code>#box-2</code> element should have the <code>align-self</code> property set to a value of flex-end.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/01-responsive-web-design/responsive-web-design-projects.json b/seed/math-challenges/01-responsive-web-design/responsive-web-design-projects.json
new file mode 100644
index 0000000000..969fb6b00b
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/responsive-web-design-projects.json
@@ -0,0 +1,319 @@
+{
+  "name": "Applied Responsive Web Design Projects",
+  "order": 6,
+  "time": "150 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d78af367417b2b2512b02",
+      "title": "Get Set for our Responsive Web Design Projects",
+      "description": [
+        [
+          "//i.imgur.com/OAD6SJz.png",
+          "An image of a Simon game, one our front end projects.",
+          "Our front end development projects will give you a chance to apply the front end skills you've developed up to this point. We'll use a popular browser-based code editor called CodePen.",
+          ""
+        ],
+        [
+          "//i.imgur.com/WBetuBa.jpg",
+          "A programmer punching through his laptop screen in frustration.",
+          "These projects are hard. It takes most campers several days to build each project. You will get frustrated. But don't quit. This gets easier with practice.",
+          ""
+        ],
+        [
+          "//i.imgur.com/p2TpOQd.jpg",
+          "A cute dog jumping over a hurdle and winking and pointing his paw at you.",
+          "When you get stuck, just use the Read-Search-Ask methodology. Don't worry - you've got this.",
+          ""
+        ],
+        [
+          "//i.imgur.com/G1saeDt.gif",
+          "A gif showing how to create a Codepen account.",
+          "For our front end project challenges, we'll use a popular browser-based code editor called CodePen. Click the \"Open link in new tab\" button below to open CodePen's signup page. Fill out the form and click \"Sign up\". <br><div class=\"small\">Note: If you already have a CodePen account, you can skip this step by clicking \"Open link in new tab\", closing the new tab that opens, then clicking \"go to my next step\". We removed our \"skip step\" button because many people would just click it repeatedly without doing these important steps.</div>",
+          "https://codepen.io/accounts/signup/user/free"
+        ],
+        [
+          "//i.imgur.com/U4y9RJ1.gif",
+          "A gif showing that you can type \"hello world\" will output \"hello world\" in the preview window. You can also drag windows to resize them, and change their orientation.",
+          "In the HTML box, create an <code>h1</code> element with the text \"Hello World\". You can drag the frames around to resize them. You can also click the \"Change View\" button and change the orientation of the frames.",
+          ""
+        ],
+        [
+          "//i.imgur.com/xHoCEt2.gif",
+          "A gif showing the process of adding Bootstrap to your pen.",
+          "Click the gear in the upper left hand corner of the CSS box, then copy this link <code>https://maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css</code> inside the text box. Now give your <code>h1</code> element the class of <code>text-primary</code> to change its color and prove that Bootstrap is now available. Note that by using the dropdown menu and selecting \"Bootstrap\", the Alpha v.4 will be added instead.",
+          ""
+        ],
+        [
+          "//i.imgur.com/m0pWik2.gif",
+          "A gif showing the process of turning off auto update preview",
+          "When using CodePen and Ajax, it is a good idea to turn off automatic preview updating so API calls are not made too often. Too many API calls can sometimes lead to temporary blockages, and may require waiting periods before they can be used again. <br> <div class=\"small\"> To disable automatic preview updating click the \"Settings\" button at the top of the page, then click the \"Behavior\" tab. At the bottom of the page, un-check \"AUTO UPDATE PREVIEW\". Now press \"Run\" at the top of the page to update the preview, and click \"Save\".</div>",
+          ""
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "isRequired": false,
+      "challengeType": 7,
+      "translations": {
+        "es": {
+          "title": "Prepárate para los Proyectos de Desarrollo de Interfaces",
+          "description": [
+            [
+              "//i.imgur.com/OAD6SJz.png",
+              "Una imagen del juego Simón, uno de nuestros proyectos de interfaz.",
+              "Nuestros proyectos de desarrollo de interfaces te darán oportunidad de aplicar las habilidades con interfaces que has desarrollado hasta este momento.  Usaremos un editor de código basado en el navegador llamado CodePen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WBetuBa.jpg",
+              "Un programador frustado golpeando la pantalla de su computador.",
+              "Nuestros desafíos sobre algoritmos son difíciles.  Algunos pueden requerir muchas horas para resolverse.  Podrás frustarte, pero no te rindas. Se vuelve fácil con práctica.",
+              ""
+            ],
+            [
+              "//i.imgur.com/p2TpOQd.jpg",
+              "Un tierno perro que salta sobre un obstáculo, pica el ojo y te apunta con su pata.",
+              "Cuando te atasques, usa la metodología Leer-Buscar-Preguntar. No te preocupes -  lo tienes resuelto.",
+              ""
+            ],
+            [
+              "//i.imgur.com/G1saeDt.gif",
+              "Un gif que muestra cómo crear una cuenta en Codepen.",
+              "Para nuestros desafíos de interfaces, usaremos un editor de código basado en el navegador que es muy famoso llamado Codepen. Pulsa en el botón de abajo \"Open link in new tab\" para abrir la página de registro de CodePen. Rellena el formulario y pulsa \"Sign up\". <br><div class=\"small\">Nota: Si ya tienes una cuenta de CodePen, puedes omitir este paso pulsando \"Open link in new tab\", cierra la nueva pestaña que se abre, entonces pulsa \"go to my next step\". Eliminamos nuestro botón \"skip step\" porque mucha gente solamente pulsa el botón sin realizar estos importantes pasos.</div>",
+              "https://codepen.io/accounts/signup/user/free"
+            ],
+            [
+              "//i.imgur.com/U4y9RJ1.gif",
+              "Un gif que muestra que puedes escribir \"hello world\" en el editor, lo cual escribirá \"hello world\" en la ventana de vista previa. También puedes mover las ventanas para cambiar su tamaño, y cambiar su orientación.",
+              "En la ventana de HTML, crea un elemento h1 con el texto \"Hola mundo\". Puedes arrastrar los bordes de las ventanas para cambiar su tamaño. También puedes pulsar el botón de \"Change View\" para cambiar la orientación de las ventanas.",
+              ""
+            ],
+            [
+              "//i.imgur.com/G9KFQDL.gif",
+              "Un gif que muestra el proceso de agregar Bootstrap a tu proyecto.",
+              "Pulsa el engrane en la esquina superior izquierda de la ventana de CSS, luego ve hacia abajo hasta donde dice \"Quick add\" y elige Bootstrap. Ahora dale a tu elemento h1 la clase \"text-primary\" para cambiar su color y verificar que Bootstrap está activado.",
+              ""
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Prepare-se para nossos Projetos de Desenvolvimento Front End",
+          "description": [
+            [
+              "//i.imgur.com/OAD6SJz.png",
+              "A imagem de um jogo Simon, um de nossos projetos front end.",
+              "Nossos projetos de Desenvolvimento front end vão dar a você a chance de aplicar as habilidades front end que você desenvolveu até esse ponto. Nós vamos usar um editor popular chamado CodePen que funciona direto no navegador.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WBetuBa.jpg",
+              "Um programador atravessando a tela de seu laptop com um soco em frustração.",
+              "Esses projetos são difíceis. A maioria dos campistas leva alguns dias para contruir cada projeto. Você vai ficar frustrado. Mas não desista. Isso fica mais fácil com a prática.",
+              ""
+            ],
+            [
+              "//i.imgur.com/p2TpOQd.jpg",
+              "Um cachorro fofo pulando sobre um obstáculo, piscando e apontando sua pata a você.",
+              "Quando ficar travado, use a metodologia Ler-Buscar-Perguntar. Não se preocupe - você consegue.",
+              ""
+            ],
+            [
+              "//i.imgur.com/G1saeDt.gif",
+              "Um gif mostrando com criar uma conta CodePen.",
+              "Para nossos projetos front end, usaremos um popular editor de código baseado em navegador chamado CodePen. Clique no botão \"Open link in new tab\" abaixo para abrir a página de resgistro do CodePen. Preencha o formulário e clique em \"Sign up\". <br><div class=\"small\">Nota: Se você já tem uma conta CodePen, você pode pular esse passo clicando em \"Open link in new tab\", fechando a nova aba que abrir, e clicando em \"go to my next step\". Nós removemos nosso botão \"skip step\" pois muitas pessoas iam simplesmente clicar nele repetidamente sem passar por esses passos importantes.</div>",
+              "https://codepen.io/accounts/signup/user/free"
+            ],
+            [
+              "//i.imgur.com/U4y9RJ1.gif",
+              "Um gif mostrando que você pode digitar \"hello world\" e será mostrado \"hello world\" na janela de visualização. Você também pode arrastar janelas para redimensioná-las e mudar a orientação das mesmas.",
+              "Na caixa do HTML, crie um elemento <code>h1</code> com o texto \"Hello World\". Você pode arrastar as bordas para redimensioná-las. Você pode também clicar no botão \"Change View\" e mudar a orientação das janelas.",
+              ""
+            ],
+            [
+              "//i.imgur.com/G9KFQDL.gif",
+              "Um gif mostrando como adicionar o Bootstrap à sua pen.",
+              "Clique na engrenagem no canto superior esquerdo da caixa do CSS, então role para baixo até \"Quick add\" e escolha Bootstrap. Agora adicione ao seu elemento <code>h1</code> a classe <code>text-primary</code> para mudar sua cor e provar que o Bootstrap agora está disponível.",
+              ""
+            ],
+            [
+              "//i.imgur.com/m0pWik2.gif",
+              "Um gif mostrando o processo de desativar o update automático da janela de visualização",
+              "Ao usar CodePen e Ajax, é uma boa idea desativar o update automático da janela de visualização para que as chamadas para as APIs não sejam feitas a todo momento. Muitas chamadas para API pode levar à bloqueios temporários e podem requerer períodos de esperar para que possam ser usadas novamente. <br> <div class=\"small\"> Para desativar o update automático da janela de visualização clique no botão \"Settings\" no topo da página, então clique na aba \"Behavior\". No final da página, desmarque \"AUTO UPDATE PREVIEW\". Agora clique em \"Run\" no topo da página para atualizar a janela de visualização e clique \"Save\".</div>",
+              ""
+            ]
+          ]
+        },
+        "ru": {
+          "title": "Приготовьтесь к разработке фронтенд проектов",
+          "description": [
+            [
+              "//i.imgur.com/OAD6SJz.png",
+              "Игра Саймона - один из фронтенд проектов.",
+              "Наши фронтенд проекты дадут вам шанс применить полученные к этому моменту знания по фронтенд разработке. Мы будем использовать популярный браузерный редактор кода - CodePen.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WBetuBa.jpg",
+              "Программист от отчаяния кулаком пробивает экран своего ноутбука.",
+              "Это трудные проекты. Разработка каждого занимает у большинства кэмперов несколько дней. У вас может возникнуть чувство отчаяния. Несмотря на это не сдавайтесь. С практикой этот процесс станет проще.",
+              ""
+            ],
+            [
+              "//i.imgur.com/p2TpOQd.jpg",
+              "Милый пес, прыгающий через препятствие, указывает на вас лапой и подмигивает.",
+              "Если что-то не получается, воспользуйтесь Read-Search-Ask. Не волнуйтесь - вы сможете это сделать.",
+              ""
+            ],
+            [
+              "//i.imgur.com/G1saeDt.gif",
+              "Гифка показывающая как зарегистрироваться на CodePen.",
+              "Для заданий по фронтенд разработке, мы будем использовать популярный браузерный редактор кода под названием CodePen. Откройте страницу регистрации на сайте CodePen, нажав на расположенную чуть ниже кнопку \"Open link in new tab\". Заполните форму и нажмите \"Sign up\". <br><div class=\"small\">Замечание: Если у вас уже есть аккаунт CodePen, то этот шаг можно пропустить: нажмите на кнопку \"Open link in new tab\", закройте появившуюся вкладку и затем кликните \"go to my next step\". Мы убрали кнопку \"skip step\", ввиду того что большинство людей просто нажимали бы ее несколько раз подряд и пропускали бы эти важные инструкции.</div>",
+              "https://codepen.io/accounts/signup/user/free"
+            ],
+            [
+              "//i.imgur.com/U4y9RJ1.gif",
+              "Гифка показывающая набор в редакторе заголовка с текстом \"hello world\", который затем отображается в окошке предпросмотра. А также указывающая как изменить размер окон редактора или поменять их расположение.",
+              "В окошке HTML создайте элемент h1 с текстом \"Hello World\". Ухватив края окон можно изменить их размер. А нажав на кнопку \"Change View\" поменять их расположение.",
+              ""
+            ],
+            [
+              "//i.imgur.com/G9KFQDL.gif",
+              "Гифка показывающая как в CodePen добавить к проекту Bootstrap.",
+              "Нажмите на звездочку в левом верхнем углу окошка CSS, найдите внизу поле \"Quick add\" и выберите в нем Bootstrap. Добавьте к элементу h1 класс \"text-primary\", чтобы изменить его цвет и удостовериться, что Bootstrap подключен.",
+              ""
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eddfaeb5bd18",
+      "title": "Build a Tribute Page",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/zNqgVx' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>.",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+"Nk0DzQi"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Construye una página Tributo",
+          "description": []
+        },
+        "pt-br": {
+          "title": "Construa uma Página Tributo",
+          "description": []
+        },
+        "ru": {
+          "title": "Создайте страницу посвященную тому что вас вдохновляет",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "587d78af367417b2b2512b03",
+      "title": "Build a Survey Form",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/VPaoNP' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "releasedOn": "January 15, 2017",
+      "challengeSeed": [
+        "A7Pn5zw"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {}
+    },
+    {
+      "id": "587d78af367417b2b2512b04",
+      "title": "Build a Product Landing Page",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/RKRbwL' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/full/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "releasedOn": "January 15, 2017",
+      "challengeSeed": [
+        "ExCJjAT"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {}
+    },
+    {
+      "id": "587d78b0367417b2b2512b05",
+      "title": "Build a Technical Documentation Page",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/NdrKKL' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "releasedOn": "January 15, 2017",
+      "challengeSeed": [
+        "cDIfODs"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {}
+    },
+    {
+      "id": "587d78b0367417b2b2512b06",
+      "title": "Build a Personal Portfolio Webpage",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/zNBOYG' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "challengeSeed": [
+        "Uw6sYKY"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Construye una página web para tu portafolio",
+          "description": []
+        },
+        "pt-br": {
+          "title": "Construa uma Página de Portfólio Pessoal",
+          "description": [
+          ]
+        },
+        "ru": {
+          "title": "Создайте сайт-портфолио",
+          "description": [
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/01-responsive-web-design/responsive-web-design.json b/seed/math-challenges/01-responsive-web-design/responsive-web-design.json
new file mode 100644
index 0000000000..2f338794af
--- /dev/null
+++ b/seed/math-challenges/01-responsive-web-design/responsive-web-design.json
@@ -0,0 +1,247 @@
+{
+  "name": "Responsive Web Design Principles",
+  "order": 4,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d78b0367417b2b2512b07",
+      "title": "Introduction to the Responsive Web Design Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "Today, there are many types of devices that can access the web. They range from large desktop computers to small mobile phones. These devices have different screen sizes, resolutions, and processing power.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Responsive Web Design is an approach to designing web content that responds to the constraints of different devices. The page structure and CSS rules should be flexible to accommodate these differences.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "In general, design the page's CSS to your target audience. If you expect most of your traffic to be from mobile users, take a 'mobile-first' approach. Then add conditional rules for larger screen sizes. If your visitors are desktop users, then design for larger screens with conditional rules for smaller sizes.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "CSS gives you the tools to write different style rules, then apply them depending on the device displaying the page. This section will cover the basic ways to use CSS for Responsive Web Design.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {
+        "pt-br": {
+          "title": "Introdução aos Desafios de Web Design Responsivo",
+          "description": [
+            [
+              "",
+              "",
+              "Hoje em dia há muitos dispositivos que podem acessar a web. Eles vão de computadores grandes de mesa até os pequenos celulares. Estes dispositivos tem diferentes tamanhos de tela, resoluções e capacidade de processamento.",
+              ""
+            ],
+            [
+              "",
+              "",
+              "O Web Design Responsivo é uma abordagem para o design the conteúdo para a web que responde às limitações dos diferentes dispositivos. A estrutura das páginas e as regras CSS devem ser flexíveis para acomodar estas diferenças.",
+              ""
+            ],
+            [
+              "",
+              "",
+              "Em geral, foque o design do CSS de sua página em seu público alvo. Se você espera que a maior parte dos seus usuários utilizem seus celulares, use uma abordagem 'mobile-first.' E então adicione regras condicionais para as telas maiores. Se seus usuários utilizam computadores de mesa, foque o design em telas maiores e utilize regras condicionais para tamanhos menores.",
+              ""
+            ],
+            [
+              "",
+              "",
+              "CSS lhe dá as ferramentas para escrever regras de estilo diversas, e então aplicá-las dependendo do dispositivo que estiver acessando a página. Esta seção cobrirá as maneiras básicas de utilizar CSS para o Web Design Responsivo.",
+              ""
+            ]
+          ]
+
+        }
+      }
+    },
+    {
+      "id": "587d78b0367417b2b2512b08",
+      "title": "Create a Media Query",
+      "description": [
+        "Media Queries are a new technique introduced in CSS3 that change the presentation of content based on different viewport sizes. The viewport is a user's visible area of a web page, and is different depending on the device used to access the site.",
+        "Media Queries consist of a media type, and if that media type matches the type of device the document is displayed on, the styles are applied. You can have as many selectors and styles inside your media query as you want.",
+        "Here's an example of a media query that returns the content when the device's width is less than or equal to 100px:",
+        "<code>@media (max-width: 100px) { /* CSS Rules */ }</code>",
+        "Remember, the CSS inside the media query is applied only if the media type matches that of the device being used.",
+        "<hr>",
+        "Add a media query, so that the <code>p</code> tag has a <code>font-size</code> of 10px when the device's height is less than or equal to 800px."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  p {",
+        "    font-size: 20px;",
+        "  }",
+        "  ",
+        "  /* Add media query below */",
+        "  ",
+        "</style>",
+        "  ",
+        "<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vivamus quis tempus massa. Aenean erat nisl, gravida vel vestibulum cursus, interdum sit amet lectus. Sed sit amet quam nibh. Suspendisse quis tincidunt nulla. In hac habitasse platea dictumst. Ut sit amet pretium nisl. Vivamus vel mi sem. Aenean sit amet consectetur sem. Suspendisse pretium, purus et gravida consequat, nunc ligula ultricies diam, at aliquet velit libero a dui.</p>"
+      ],
+      "tests": [
+        "assert(code.match(/p\\s*\\{\\s*font-size:\\s*10px;\\s*\\}/g), 'message: Your <code>p</code> element should have the <code>font-size</code> of 10px when the device <code>height</code> is less than or equal to 800px.');",
+        "assert(code.match(/@media \\(max-height:\\s*?800px\\)/g), 'message: Declare a <code>@media</code> query for devices with a <code>height</code> less than or equal to 800px.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solution": [],
+      "hints": [],
+      "challengeType": 0,
+      "translations": {
+        "pt-br": {
+          "title": "Criando uma Media Query",
+          "description": [
+            "Media Queries são uma nova técnica introduzida no CSS3 que mudam a apresentação do conteúdo de acordo com os diferentes tamanhos de janela de exibição. A janela de exibição é a área visível de uma página da web, e é diferente dependendo do dispositivo utilizado para acessar o site.",
+            "Media Queries consistem em um tipo de mídia, e se o tipo de mídia corresponder com o dispositivo no qual o documento está sendo exibido, os estilos são aplicados. Você pode colocar quantos seletores e estilos quanto desejar dentro de suas media queries.",
+            "Segue um exemplo de media query que retorna seu conteúdo quando a largura do dispositivo é menor que 100px:",
+            "<code>@media (max-width: 100px) { /* Regras do CSS  */ }</code>",
+            "Lembre-se, o CSS dentro da media query só é aplicado se o tipo de mídia corresponder ao dispositivo em uso.",
+            "<hr>",
+            "Adicione uma media query para que o tag <code>p</code> tenha um <code>font-size</code> de 10px quando a altura do dispositivo for menor ou igual a 800px."
+          ]
+        }
+      }
+    },
+    {
+      "id": "587d78b1367417b2b2512b09",
+      "title": "Make an Image Responsive",
+      "description": [
+        "Making images responsive with CSS is actually very simple. Instead of applying an absolute width to an element:",
+        "<code>img { width: 720px; }</code>",
+        "You can use:",
+        "<blockquote>img {<br>  max-width: 100%;<br>  display: block;<br>  height: auto;<br>}</blockquote>",
+        "The <code>max-width</code> property of 100% scales the image to fit the width of its container, but the image won't stretch wider than its original width. Setting the <code>display</code> property to block changes the image from an inline element (its default), to a block element on its own line. The <code>height</code> property of auto keeps the original aspect ratio of the image.",
+        "<hr>",
+        "Add style rules for the <code>img</code> tag to make it responsive to the size of its container. It should display as a block-level element, it should fit the full width of its container without stretching, and it should keep its original aspect ratio."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "</style>",
+        "",
+        "<img src=\"https://s3.amazonaws.com/freecodecamp/FCCStickerPack.jpg\" alt=\"freeCodeCamp stickers set\">"
+      ],
+      "tests": [
+        "assert(code.match(/max-width:\\s*?100%;/g), 'message: Your <code>img</code> tag should have a <code>max-width</code> set to 100%.');",
+        "assert($('img').css('display') == 'block', 'message: Your <code>img</code> tag should have a <code>display</code> set to block.');",
+        "assert(code.match(/height:\\s*?auto;/g), 'message: Your <code>img</code> tag should have a <code>height</code> set to auto.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "solutions": [],
+      "hints": [],
+      "translations": {
+        "pt-br": {
+          "title": "Torne uma Imagem Responsiva",
+          "description": [
+            "Fazer com que imagens sejam responsivas é muito simples com CSS. Ao invés de aplicar uma largura absoluta a um elemento:",
+            "<code>img { width: 720px; }</code>",
+            "Você pode usar:",
+            "<blockquote>img {<br>  max-width: 100%;<br>  display: block;<br>  height: auto;<br>}</blockquote>",
+            "A propriedade <code>max-width</code> em 100% ajusta o tamanho da imagem para preencher a largura de seu container, mas a imagem não irá esticar mais que sua largura original. Ajustando a propriedade <code>display</code> como block muda imagem de elemento inline (o padrão) para um elemento block com uma linha própria. A propriedade <code>height</code> na configuração auto mantem a proporção original da imagem.",
+            "<hr>",
+            "Adicione regras de estilo para a tag <code>img</code> para torná-la responsiva com relação ao tamanho do seu container. Ela deve ser exibida como um elemento de nível block, e deve preencher toda a largura de seu container sem esticar, mantendo as proporções originais."
+          ]
+        }
+      }
+    },
+    {
+      "id": "587d78b1367417b2b2512b0a",
+      "title": "Use a Retina Image for Higher Resolution Displays",
+      "description": [
+        "The simplest way to make your images appear \"retina\" (and optimize them for retina displays) is to define their <code>width</code> and <code>height</code> values as only half of what the original file is.",
+        "Here is an example of an image that is only using half of the original height and width:",
+        "<blockquote>&lt;style&gt;<br>  img { height: 250px; width: 250px; }<br>&lt;/style&gt;<br>&lt;img src=&quot;coolPic500x500&quot; alt=&quot;A most excellent picture&quot;&gt;</blockquote>",
+        "<hr>",
+        "Set the <code>width</code> and <code>height</code> of the <code>img</code> tag to half of their original values. In this case, both the original <code>height</code> and the original <code>width</code> are 200px."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "</style>",
+        "",
+        "<img src=\"https://s3.amazonaws.com/freecodecamp/FCCStickers-CamperBot200x200.jpg\" alt=\"freeCodeCamp sticker that says 'Because CamperBot Cares'\">"
+      ],
+      "tests": [
+        "assert($('img').css('width') == '100px', 'message: Your <code>img</code> tag should have a <code>width</code> of 100 pixels.');",
+        "assert($('img').css('height') == '100px', 'message: Your <code>img</code> tag should have a <code>height</code> of 100 pixels.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "solutions": [],
+      "hints": [],
+      "translations": {
+        "pt-br": {
+          "title": "Use uma Imagem Retina para Telas de Alta Resolução",
+          "description": [
+            "A maneira mais simples de fazer com que suas imagens tenham uma aparência \"retina\" (e otimizadas para telas retina) é definindo seus valores de <code>width</code> e <code>height</code> como somente metade do tamanho original dos arquivos.",
+            "Segue um exemplo de imagem que possui somente metade dos valores originais de altura e largura:",
+            "<blockquote>&lt;style&gt;<br>  img { height: 250px; width: 250px; }<br>&lt;/style&gt;<br>&lt;img src=&quot;coolPic500x500&quot; alt=&quot;A most excellent picture&quot;&gt;</blockquote>",
+            "<hr>",
+            "Configure os valores de <code>width</code> e <code>height</code> da tag <code>img</code> como metade do seu tamanho original. Nesse caso, o valor original de <code>height</code> e o valor original de <code>width</code> são de 200px."
+          ]
+        }
+      }
+    },
+    {
+      "id": "587d78b1367417b2b2512b0c",
+      "title": "Make Typography Responsive",
+      "description": [
+        "Instead of using <code>em</code> or <code>px</code> to size text, you can use viewport units for responsive typography. Viewport units, like percentages, are relative units, but they are based off different items. Viewport units are relative to the viewport dimensions (width or height) of a device, and percentages are relative to the size of the parent container element.",
+        "The four different viewport units are:",
+        "<ul><li><code>vw: 10vw</code> would be 10% of the viewport's width.</li><li><code>vh: 3vh</code> would be 3% of the viewport's height.</li><li><code>vmin: 70vmin</code> would be 70% of the viewport's smaller dimension (height vs. width).</li><li><code>vmax: 100vmax</code> would be 100% of the viewport's bigger dimension (height vs. width).</li></ul>",
+        "<hr>",
+        "Set the <code>width</code> of the <code>h2</code> tag to 80% of the viewport's width and the <code>width</code> of the paragraph as 75% of the viewport's smaller dimension."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "</style>",
+        "",
+        "<h2>Importantus Ipsum</h2>",
+        "<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vivamus quis tempus massa. Aenean erat nisl, gravida vel vestibulum cursus, interdum sit amet lectus. Sed sit amet quam nibh. Suspendisse quis tincidunt nulla. In hac habitasse platea dictumst. Ut sit amet pretium nisl. Vivamus vel mi sem. Aenean sit amet consectetur sem. Suspendisse pretium, purus et gravida consequat, nunc ligula ultricies diam, at aliquet velit libero a dui.</p>"
+      ],
+      "tests": [
+        "assert(code.match(/h2\\s*?{\\s*?width:\\s*?80vw;\\s*?}/g), 'message: Your <code>h2</code> tag should have a <code>width</code> of 80vw.');",
+        "assert(code.match(/p\\s*?{\\s*?width:\\s*?75vmin;\\s*?}/g), 'message: Your <code>p</code> tag should have a <code>width</code> of 75vmin.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "hints": [],
+      "challengeType": 0,
+      "translations": {
+        "pt-br": {
+          "title": "Torne a Tipografia Responsiva",
+          "description": [
+            "Ao invés de utilizar <code>em</code> ou <code>px</code> para alterar o tamanho do texto, você pode usar unidades da janela de exibição para obter tipografia responsiva. Unidades da janela de exibição, assim como porcentagens, são unidades relativas, mas que são baseadas em ítens diferentes. Unidades da janela de exibição são relativas às dimensões da janela de exibição (largura ou altura) de um dispositivo, enquanto que porcentagens são relativas ao tamanho do container do elemento pai.",
+            "As quatro unidades da janela de exibição são",
+            "<ul><li><code>vw: 10vw</code> seria 10% da largura da janela de exibição.</li><li><code>vh: 3vh</code> seria 3% da altura da janela de exibição.</li><li><code>vmin: 70vmin</code> seria 70% da menor dimensão da janela de exibição (largura ou altura).</li><li><code>vmax: 100vmax</code> seria 100% da maior dimensão da janela de exibição (largura ou altura).</li></ul>",
+            "<hr>",
+            "Ajuste o <code>width</code> da tag <code>h2</code> para 80% da largura da janela de exibição e a <code>width</code> do parágrafo para 75% da menor dimensão da janela de exibição."
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting.json
new file mode 100644
index 0000000000..493914142d
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-algorithm-scripting.json
@@ -0,0 +1,971 @@
+{
+  "name": "Basic Algorithm Scripting",
+  "order": 5,
+  "time": "50 hours",
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "id": "bd7158d2c442eddfbeb5bd1f",
+      "title": "Get Set for our Algorithm Challenges",
+      "description": [
+        [
+          "//i.imgur.com/sJkp30a.png",
+          "An image of a algorithm challenge showing directions, tests, and the code editor.",
+          "Our algorithm challenges will teach you how to think like a programmer.",
+          ""
+        ],
+        [
+          "//i.imgur.com/d8LuRNh.png",
+          "A mother bird kicks a baby bird out of her nest.",
+          "Our previous challenges introduced you to programming concepts. But for these algorithm challenges, you'll now need to apply what you learned to solve open-ended problems.",
+          ""
+        ],
+        [
+          "//i.imgur.com/WBetuBa.jpg",
+          "A programmer punching through his laptop screen in frustration.",
+          "Our algorithm challenges are hard. Some of them may take you several hours to solve. You will get frustrated. But don't quit.",
+          ""
+        ],
+        [
+          "//i.imgur.com/p2TpOQd.jpg",
+          "A cute dog jumping over a hurdle and winking and pointing his paw at you.",
+          "When you get stuck, just use the Read-Search-Ask methodology.<br>Don't worry - you've got this.",
+          ""
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {
+        "es": {
+          "title": "Prepárate para nuestros Desafíos sobre Algoritmos",
+          "description": [
+            [
+              "//i.imgur.com/sJkp30a.png",
+              "Una imagen de un desafio sobre algoritmos que presenta instrucciones, pruebas y el editor de código.",
+              "Nuestros desafios sobre algoritmos te enseñarán como pensar como un programador.",
+              ""
+            ],
+            [
+              "//i.imgur.com/d8LuRNh.png",
+              "Una mamá pájaro saca un bebé pájaro fuer de su nido.",
+              "Nuestros desafios anteriores te introdujeron a los conceptos de programación. Pero para estos desafios sobre algoritmos, ahora necesitarás aplicar lo que has aprendido y resolver problemas de respuesta abierta",
+              ""
+            ],
+            [
+              "//i.imgur.com/WBetuBa.jpg",
+              "Un programador frustado golpeando la pantalla de su computador.",
+              "Nuestros desafíos sobre algortimos son difíciles.  Algunos pueden requerir muchas horas para resolverse.  Podrás frustarte, pero no te rindas.",
+              ""
+            ],
+            [
+              "//i.imgur.com/p2TpOQd.jpg",
+              "Un tierno perro que salta sobre un obstáculo, pica el ojo y te apunta con su pata.",
+              "Cuando te atasques, usa la metodología Leer-Buscar-Preguntar.<br>No te preocupes -  ya lo has entendido.",
+              ""
+            ]
+          ]
+        },
+        "pt-br": {
+          "title": "Prepare-se para nossos desafios de algoritmos",
+          "description": [
+            [
+              "//i.imgur.com/sJkp30a.png",
+              "Uma imagem de um desafio de algoritmo mostrando instruções, testes e o editor de código.",
+              "Nossos desafios de algoritmos vão te ensinar a pensar como um programador.",
+              ""
+            ],
+            [
+              "//i.imgur.com/d8LuRNh.png",
+              "Uma mãe pássaro expulsa seu filhote do ninho.",
+              "Os desafios anteriores te apresentaram os conceitos de programação. Mas para esses desafios de algoritmos, você terá que aplicar o que aprendeu para resolver problemas abertos.",
+              ""
+            ],
+            [
+              "//i.imgur.com/WBetuBa.jpg",
+              "Um programador frustrado atravessando a tela de seu laptop com um soco.",
+              "Os desafios de algoritmos são difíceis. Você pode levar várias horas para resolver alguns deles. Você vai ficar frustado. Mas não desista.",
+              ""
+            ],
+            [
+              "//i.imgur.com/p2TpOQd.jpg",
+              "Um cachorro fofo pulando sobre um obstáculo, piscando e apontando a pata na sua direção.",
+              "Quando ficar travado, use a metodologia Ler-Pesquisar-Perguntar.<br>Não se preocupe - você consegue.",
+              ""
+            ]
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b3",
+      "title": "Convert Celsius to Fahrenheit",
+      "description": [
+        "The algorithm to convert from Celsius to Fahrenheit is the temperature in Celsius times <code>9/5</code>, plus <code>32</code>.",
+        "You are given a variable <code>celsius</code> representing a temperature in Celsius. Use the variable <code>fahrenheit</code> already defined and assign it the Fahrenheit temperature equivalent to the given Celsius temperature. Use the algorithm mentioned above to help convert the Celsius temperature to Fahrenheit.",
+        "Don't worry too much about the function and return statements as they will be covered in future challenges. For now, only use operators that you have already learned."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function convertToF(celsius) {",
+        "  var fahrenheit;",
+        "  return fahrenheit;",
+        "}",
+        "",
+        "convertToF(30);"
+      ],
+      "solutions": [
+        "function convertToF(celsius) {\n  var fahrenheit = celsius * 9/5 + 32;\n  if ( typeof fahrenheit !== 'undefined' ) {\n  return fahrenheit;\n  } else {\n    return 'fahrenheit not defined';\n  }\n}"
+      ],
+      "tests": [
+        "assert(typeof convertToF(0) === 'number', 'message: <code>convertToF(0)</code> should return a number');",
+        "assert(convertToF(-30) === -22, 'message: <code>convertToF(-30)</code> should return a value of <code>-22</code>');",
+        "assert(convertToF(-10) === 14, 'message: <code>convertToF(-10)</code> should return a value of <code>14</code>');",
+        "assert(convertToF(0) === 32, 'message: <code>convertToF(0)</code> should return a value of <code>32</code>');",
+        "assert(convertToF(20) === 68, 'message: <code>convertToF(20)</code> should return a value of <code>68</code>');",
+        "assert(convertToF(30) === 86, 'message: <code>convertToF(30)</code> should return a value of <code>86</code>');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "isRequired": true,
+      "translations": {
+        "es": {
+          "title": "Convierte celsius a fahrenheit",
+          "description": [
+            "Para probar tu aprendizaje, crearás una solucion \"desde cero\". Coloca tu código entre las líneas indicadas y este será probado contra multiples casos de prueba.",
+            "El algoritmo para convertir de Celsius a Fahrenheit consiste en multiplicar la temperatura en grados Celsius por 9/5 y al resultado agregarle 32.",
+            "Se te da una variable <code>celsius</code> representando una temperatura en Celsius. Crea una variable <code>fahrenheit</code> y aplica el algoritmo para asignar la correspondiente temperatura en Fahrenheit."
+          ]
+        },
+        "pt-br": {
+          "title": "Converta Celsius para Fahrenheit",
+          "description": [
+            "O algoritmo para converter de Celsius para Fahrenheit é a temperatura em Celsius vezes <code>9/5</code> mais <code>32</code>.",
+            "Você recebe uma variável <code>celsius</code> representando uma temperatura em Celsius. Use a variável <code>fahrenheit</code> já definida e aplique o algoritmo para atribuir a ela a temperatura correspondente em Fahrenheit."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a202eed8fc186c8434cb6d61",
+      "title": "Reverse a String",
+      "description": [
+        "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 <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function reverseString(str) {",
+        "  return str;",
+        "}",
+        "",
+        "reverseString(\"hello\");"
+      ],
+      "tests": [
+        "assert(typeof reverseString(\"hello\") === \"string\", 'message: <code>reverseString(\"hello\")</code> should return a string.');",
+        "assert(reverseString(\"hello\") === \"olleh\", 'message: <code>reverseString(\"hello\")</code> should become <code>\"olleh\"</code>.');",
+        "assert(reverseString(\"Howdy\") === \"ydwoH\", 'message: <code>reverseString(\"Howdy\")</code> should become <code>\"ydwoH\"</code>.');",
+        "assert(reverseString(\"Greetings from Earth\") === \"htraE morf sgniteerG\", 'message: <code>reverseString(\"Greetings from Earth\")</code> should return <code>\"htraE morf sgniteerG\"</code>.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function reverseString(str) {\n  return str.split('').reverse().join(\"\");\n}\n\nreverseString('hello');\n"
+      ],
+      "MDNlinks": [
+        "Global String Object",
+        "String.prototype.split()",
+        "Array.prototype.reverse()",
+        "Array.prototype.join()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Invierte el texto",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Inverta uma string",
+          "description": [
+            "Inverta a string fornecida.",
+            "Talvez você tenha que transformar a string num array antes de invertê-la.",
+            "Seu resultado deve ser uma string.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a302f7aae1aa3152a5b413bc",
+      "title": "Factorialize a Number",
+      "description": [
+        "Return the factorial of the provided integer.",
+        "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 <code>n!</code>",
+        "For example: <code>5! = 1 * 2 * 3 * 4 * 5 = 120</code>",
+        "Only integers greater than or equal to zero will be supplied to the function.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function factorialize(num) {",
+        "  return num;",
+        "}",
+        "",
+        "factorialize(5);"
+      ],
+      "tests": [
+        "assert(typeof factorialize(5) === 'number', 'message: <code>factorialize(5)</code> should return a number.');",
+        "assert(factorialize(5) === 120, 'message: <code>factorialize(5)</code> should return 120.');",
+        "assert(factorialize(10) === 3628800, 'message: <code>factorialize(10)</code> should return 3628800.');",
+        "assert(factorialize(20) === 2432902008176640000, 'message: <code>factorialize(20)</code> should return 2432902008176640000.');",
+        "assert(factorialize(0) === 1, 'message: <code>factorialize(0)</code> should return 1.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function factorialize(num) {\n  return num < 1 ? 1 : num * factorialize(num-1);\n}\n\nfactorialize(5);\n"
+      ],
+      "MDNlinks": [
+        "Arithmetic Operators"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Factoriza un número",
+          "description": [
+            "Crea una función que devuelva el factorial del número entero que se te provee",
+            "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 <code>n!</code>",
+            "Por ejemplo: <code>5! = 1 * 2 * 3 * 4 * 5 = 120</code>",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Determine o fatorial de um número",
+          "description": [
+            "Retorne o fatorial do inteiro fornecido.",
+            "Se o inteiro é representado pela letra n, o seu fatorial é o produto de todos os inteiros positivos menores ou iguais a n.",
+            "Por exemplo: <code>5! = 1 * 2 * 3 * 4 * 5 = 120</code>",
+            "Apenas inteiros maiores ou iguais a zero serão fornecidos à função.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a26cbbe9ad8655a977e1ceb5",
+      "title": "Find the Longest Word in a String",
+      "description": [
+        "Return the length of the longest word in the provided sentence.",
+        "Your response should be a number.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function findLongestWordLength(str) {",
+        "  return str.length;",
+        "}",
+        "",
+        "findLongestWordLength(\"The quick brown fox jumped over the lazy dog\");"
+      ],
+      "tests": [
+        "assert(typeof findLongestWordLength(\"The quick brown fox jumped over the lazy dog\") === \"number\", 'message: <code>findLongestWordLength(\"The quick brown fox jumped over the lazy dog\")</code> should return a number.');",
+        "assert(findLongestWordLength(\"The quick brown fox jumped over the lazy dog\") === 6, 'message: <code>findLongestWordLength(\"The quick brown fox jumped over the lazy dog\")</code> should return 6.');",
+        "assert(findLongestWordLength(\"May the force be with you\") === 5, 'message: <code>findLongestWordLength(\"May the force be with you\")</code> should return 5.');",
+        "assert(findLongestWordLength(\"Google do a barrel roll\") === 6, 'message: <code>findLongestWordLength(\"Google do a barrel roll\")</code> should return 6.');",
+        "assert(findLongestWordLength(\"What is the average airspeed velocity of an unladen swallow\") === 8, 'message: <code>findLongestWordLength(\"What is the average airspeed velocity of an unladen swallow\")</code> should return 8.');",
+        "assert(findLongestWordLength(\"What if we try a super-long word such as otorhinolaryngology\") === 19, 'message: <code>findLongestWordLength(\"What if we try a super-long word such as otorhinolaryngology\")</code> should return 19.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function findLongestWordLength(str) {\n  return str.split(' ').sort(function(a, b) { return b.length - a.length;})[0].length;\n}\n\nfindLongestWordLength('The quick brown fox jumped over the lazy dog');\n"
+      ],
+      "MDNlinks": [
+        "String.prototype.split()",
+        "String.length"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Encuentra la palabra más larga",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Encontre a palavra mais longa de uma string",
+          "description": [
+            "Retorne o tamanho da palavra mais longa da frase fornecida.",
+            "Sua resposta deve ser um número.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a789b3483989747d63b0e427",
+      "title": "Return Largest Numbers in Arrays",
+      "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 <code>arr[i]</code>.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function largestOfFour(arr) {",
+        "  // You can do this!",
+        "  return arr;",
+        "}",
+        "",
+        "largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);"
+      ],
+      "tests": [
+        "assert(largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]).constructor === Array, 'message: <code>largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]])</code> should return an array.');",
+        "assert.deepEqual(largestOfFour([[13, 27, 18, 26], [4, 5, 1, 3], [32, 35, 37, 39], [1000, 1001, 857, 1]]), [27, 5, 39, 1001], 'message: <code>largestOfFour([[13, 27, 18, 26], [4, 5, 1, 3], [32, 35, 37, 39], [1000, 1001, 857, 1]])</code> should return <code>[27, 5, 39, 1001]</code>.');",
+        "assert.deepEqual(largestOfFour([[4, 9, 1, 3], [13, 35, 18, 26], [32, 35, 97, 39], [1000000, 1001, 857, 1]]), [9, 35, 97, 1000000], 'message: <code>largestOfFour([[4, 9, 1, 3], [13, 35, 18, 26], [32, 35, 97, 39], [1000000, 1001, 857, 1]])</code> should return <code>[9, 35, 97, 1000000]</code>.');",
+      	 "assert.deepEqual(largestOfFour([[17, 23, 25, 12], [25, 7, 34, 48], [4, -10, 18, 21], [-72, -3, -17, -10]]), [25, 48, 21, -3], 'message: <code>largestOfFour([[17, 23, 25, 12], [25, 7, 34, 48], [4, -10, 18, 21], [-72, -3, -17, -10]])</code> should return <code>[25, 48, 21, -3]</code>.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function largestOfFour(arr) {\n  return arr.map(function(subArr) {\n    return Math.max.apply(null, subArr);\n  });\n}\n\nlargestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);\n"
+      ],
+      "MDNlinks": [
+        "Comparison Operators"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Devuelve el mayor entero de cada arreglo",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Retorne os maiores números de arrays",
+          "description": [
+            "Retorne um array contendo o maior número de cada sub-array fornecido. Para simplificar, o array fornecido conterá exatamente 4 sub-arrays.",
+            "Lembre-se, você pode iterar por um array com um simples <code>for</code> e acessar cada membro do array com a sintaxe <code>arr[i]</code>.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "acda2fb1324d9b0fa741e6b5",
+      "title": "Confirm the Ending",
+      "description": [
+        "Check if a string (first argument, <code>str</code>) ends with the given target string (second argument, <code>target</code>).",
+        "This challenge <em>can</em> be solved with the <code>.endsWith()</code> 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 <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function confirmEnding(str, target) {",
+        "  // \"Never give up and good luck will find you.\"",
+        "  // -- Falcor",
+        "  return str;",
+        "}",
+        "",
+        "confirmEnding(\"Bastian\", \"n\");"
+      ],
+      "tests": [
+        "assert(confirmEnding(\"Bastian\", \"n\") === true, 'message: <code>confirmEnding(\"Bastian\", \"n\")</code> should return true.');",
+        "assert(confirmEnding(\"Congratulation\", \"on\") === true, 'message: <code>confirmEnding(\"Congratulation\", \"on\")</code> should return true.');",
+        "assert(confirmEnding(\"Connor\", \"n\") === false, 'message: <code>confirmEnding(\"Connor\", \"n\")</code> should return false.');",
+        "assert(confirmEnding(\"Walking on water and developing software from a specification are easy if both are frozen\", \"specification\") === false, 'message: <code>confirmEnding(\"Walking on water and developing software from a specification are easy if both are frozen\"&#44; \"specification\"&#41;</code> should return false.');",
+        "assert(confirmEnding(\"He has to give me a new name\", \"name\") === true, 'message: <code>confirmEnding(\"He has to give me a new name\", \"name\")</code> should return true.');",
+        "assert(confirmEnding(\"Open sesame\", \"same\") === true, 'message: <code>confirmEnding(\"Open sesame\", \"same\")</code> should return true.');",
+        "assert(confirmEnding(\"Open sesame\", \"pen\") === false, 'message: <code>confirmEnding(\"Open sesame\", \"pen\")</code> should return false.');",
+        "assert(confirmEnding(\"Open sesame\", \"game\") === false, 'message: <code>confirmEnding(\"Open sesame\", \"game\")</code> should return false.');",
+        "assert(confirmEnding(\"If you want to save our world, you must hurry. We dont know how much longer we can withstand the nothing\", \"mountain\") === false, 'message: <code>confirmEnding(\"If you want to save our world, you must hurry. We dont know how much longer we can withstand the nothing\", \"mountain\")</code> should return false.');",
+        "assert(confirmEnding(\"Abstraction\", \"action\") === true, 'message: <code>confirmEnding(\"Abstraction\", \"action\")</code> should return true.');",
+        "assert(!/\\.endsWith\\(.*?\\)\\s*?;?/.test(code), 'message: Do not use the built-in method <code>.endsWith()</code> to solve the challenge.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function confirmEnding(str, target) {\n  return str.substring(str.length-target.length) === target;\n};\n"
+      ],
+      "MDNlinks": [
+        "String.prototype.substr()",
+        "String.prototype.substring()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Confirma la terminación",
+          "description": [
+            "Verifica si una cadena de texto (primer argumento) termina con otra cadena de texto (segundo argumento).",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Confirme o final",
+          "description": [
+            "Verifique se uma string (primeiro argumento, <code>str</code>) termina com a string alvo fornecida (segundo argumento, <code>target</code>).",
+            "Esse desafio <em>pode</em> ser resolvido com o método <code>.endsWith()</code>, que foi introduzido na ES2015. Mas para o propósito desse desafio, nós gostaríamos que, ao invés dele, você usasse algum dos métodos de substring do JavaScript.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "afcc8d540bea9ea2669306b6",
+      "title": "Repeat a String Repeat a String",
+      "description": [
+        "Repeat a given string <code>str</code> (first argument) for <code>num</code> times (second argument). Return an empty string if <code>num</code> is not a positive number.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function repeatStringNumTimes(str, num) {",
+        "  // repeat after me",
+        "  return str;",
+        "}",
+        "",
+        "repeatStringNumTimes(\"abc\", 3);"
+      ],
+      "tests": [
+        "assert(repeatStringNumTimes(\"*\", 3) === \"***\", 'message: <code>repeatStringNumTimes(\"*\", 3)</code> should return <code>\"***\"</code>.');",
+        "assert(repeatStringNumTimes(\"abc\", 3) === \"abcabcabc\", 'message: <code>repeatStringNumTimes(\"abc\", 3)</code> should return <code>\"abcabcabc\"</code>.');",
+        "assert(repeatStringNumTimes(\"abc\", 4) === \"abcabcabcabc\", 'message: <code>repeatStringNumTimes(\"abc\", 4)</code> should return <code>\"abcabcabcabc\"</code>.');",
+        "assert(repeatStringNumTimes(\"abc\", 1) === \"abc\", 'message: <code>repeatStringNumTimes(\"abc\", 1)</code> should return <code>\"abc\"</code>.');",
+        "assert(repeatStringNumTimes(\"*\", 8) === \"********\", 'message: <code>repeatStringNumTimes(\"*\", 8)</code> should return <code>\"********\"</code>.');",
+        "assert(repeatStringNumTimes(\"abc\", -2) === \"\", 'message: <code>repeatStringNumTimes(\"abc\", -2)</code> should return <code>\"\"</code>.');",
+        "assert(!/\\.repeat/g.test(code), 'message: The built-in <code>repeat()</code>-method should not be used');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function repeatStringNumTimes(str, num) {\n  if (num < 0) return '';\n  return num === 1 ? str : str + repeatStringNumTimes(str, num-1);\n}\n\nrepeatStringNumTimes('abc', 3);\n"
+      ],
+      "MDNlinks": [
+        "Global String Object"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Repite el Texto Repite el Texto",
+          "description": [
+            "Repite una cadena de texto dada (primer argumento) <code>num</code> veces (segundo argumento). Retorna una cadena de texto vacía si <code>num</code> es un número negativo.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Repita uma string Repita uma string",
+          "description": [
+            "Repita uma string <code>str</code> dada (primeiro argumento) <code>num</code> vezes (segundo argumento). Retorne uma string vazia se <code>num</code> não for um número positivo.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "ac6993d51946422351508a41",
+      "title": "Truncate a String",
+      "description": [
+        "Truncate a string (first argument) if it is longer than the given maximum string length (second argument). Return the truncated string with a <code>...</code> ending.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function truncateString(str, num) {",
+        "  // Clear out that junk in your trunk",
+        "  return str;",
+        "}",
+        "",
+        "truncateString(\"A-tisket a-tasket A green and yellow basket\", 8);"
+      ],
+      "tests": [
+        "assert(truncateString(\"A-tisket a-tasket A green and yellow basket\", 8) === \"A-tisket...\", 'message: <code>truncateString(\"A-tisket a-tasket A green and yellow basket\", 8)</code> should return \"A-tisket...\".');",
+        "assert(truncateString(\"Peter Piper picked a peck of pickled peppers\", 11) === \"Peter Piper...\", 'message: <code>truncateString(\"Peter Piper picked a peck of pickled peppers\", 11)</code> should return \"Peter Piper...\".');",
+        "assert(truncateString(\"A-tisket a-tasket A green and yellow basket\", \"A-tisket a-tasket A green and yellow basket\".length) === \"A-tisket a-tasket A green and yellow basket\", 'message: <code>truncateString(\"A-tisket a-tasket A green and yellow basket\", \"A-tisket a-tasket A green and yellow basket\".length)</code> should return \"A-tisket a-tasket A green and yellow basket\".');",
+        "assert(truncateString('A-tisket a-tasket A green and yellow basket', 'A-tisket a-tasket A green and yellow basket'.length + 2) === 'A-tisket a-tasket A green and yellow basket', 'message: <code>truncateString(\"A-tisket a-tasket A green and yellow basket\", \"A-tisket a-tasket A green and yellow basket\".length + 2)</code> should return \"A-tisket a-tasket A green and yellow basket\".');",
+        "assert(truncateString(\"A-\", 1) === \"A...\", 'message: <code>truncateString(\"A-\", 1)</code> should return \"A...\".');",
+        "assert(truncateString(\"Absolutely Longer\", 2) === \"Ab...\", 'message: <code>truncateString(\"Absolutely Longer\", 2)</code> should return \"Ab...\".');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function truncateString(str, num) {\n  if (num >= str.length) {\n    return str;\n  }\n  return str.slice(0, num) + '...';\n}"
+      ],
+      "MDNlinks": [
+        "String.prototype.slice()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Trunca una Cadena de Texto",
+          "description": [
+            "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 \"...\".",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Trunque uma string",
+          "description": [
+            "Trunque uma string (primeiro argumento) se ela for mais longa do que o comprimento máximo dado (segundo argumento). Retorne a string truncada com um <code>...</code> no final.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a6e40f1041b06c996f7b2406",
+      "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). If no element passes the test, return undefined.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function findElement(arr, func) {",
+        "  var num = 0;",
+        "  return num;",
+        "}",
+        "",
+        "findElement([1, 2, 3, 4], function(num){ return num % 2 === 0; });"
+      ],
+      "solutions": [
+        "function findElement(arr, func) {\n  var num;\n  arr.some(function(e) {\n    if (func(e)) {\n      num = e;\n      return true;\n    }\n  });\n  return num;\n}"
+      ],
+      "tests": [
+        "assert.strictEqual(findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; }), 8, 'message: <code>findElement([1, 3, 5, 8, 9, 10], function(num) { return num % 2 === 0; })</code> should return 8.');",
+        "assert.strictEqual(findElement([1, 3, 5, 9], function(num) { return num % 2 === 0; }), undefined, 'message: <code>findElement([1, 3, 5, 9], function(num) { return num % 2 === 0; })</code> should return undefined.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.prototype.filter()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Buscando la verdad",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Achado não é roubado",
+          "description": [
+            "Crie uma função que itera sobre um array (primeiro argumento) e retorna o primeiro elemento do array que retornar <code>true</code> para uma função de teste (segundo argumento). Se nenhum elemento passar no teste, retorne <code>undefined</code>.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        },
+        "fr": {
+          "title": "Détecteur de mensonges",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a77dbc43c33f39daa4429b4f",
+      "title": "Boo who",
+      "description": [
+        "Check if a value is classified as a boolean primitive. Return true or false.",
+        "Boolean primitives are true and false.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function booWho(bool) {",
+        "  // What is the new fad diet for ghost developers? The Boolean.",
+        "  return bool;",
+        "}",
+        "",
+        "booWho(null);"
+      ],
+      "solutions": [
+        "function booWho(bool) {\n  // What is the new fad diet for ghost developers? The Boolean.\n  return typeof bool === \"boolean\";\n}\n\nbooWho(null);"
+      ],
+      "tests": [
+        "assert.strictEqual(booWho(true), true, 'message: <code>booWho(true)</code> should return true.');",
+        "assert.strictEqual(booWho(false), true, 'message: <code>booWho(false)</code> should return true.');",
+        "assert.strictEqual(booWho([1, 2, 3]), false, 'message: <code>booWho([1, 2, 3])</code> should return false.');",
+        "assert.strictEqual(booWho([].slice), false, 'message: <code>booWho([].slice)</code> should return false.');",
+        "assert.strictEqual(booWho({ \"a\": 1 }), false, 'message: <code>booWho({ \"a\": 1 })</code> should return false.');",
+        "assert.strictEqual(booWho(1), false, 'message: <code>booWho(1)</code> should return false.');",
+        "assert.strictEqual(booWho(NaN), false, 'message: <code>booWho(NaN)</code> should return false.');",
+        "assert.strictEqual(booWho(\"a\"), false, 'message: <code>booWho(\"a\")</code> should return false.');",
+        "assert.strictEqual(booWho(\"true\"), false, 'message: <code>booWho(\"true\")</code> should return false.');",
+        "assert.strictEqual(booWho(\"false\"), false, 'message: <code>booWho(\"false\")</code> should return false.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Boolean Objects"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "¡Bu!",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Bu!",
+          "description": [
+            "Verifique se um valor é classificado como um primitivo booleano. Retorne <code>true</code> ou <code>false</code>.",
+            "Primitivos booleanos são <code>true</code> e <code>false</code>.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Tente programar em par. Escreva seu próprio código."
+          ]
+        },
+        "fr": {
+          "title": "Boo !",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "ab6137d4e35944e21037b769",
+      "title": "Title Case a Sentence",
+      "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 <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function titleCase(str) {",
+        "  return str;",
+        "}",
+        "",
+        "titleCase(\"I'm a little tea pot\");"
+      ],
+      "tests": [
+        "assert(typeof titleCase(\"I'm a little tea pot\") === \"string\", 'message: <code>titleCase(\"I&#39;m a little tea pot\")</code> should return a string.');",
+        "assert(titleCase(\"I'm a little tea pot\") === \"I'm A Little Tea Pot\", 'message: <code>titleCase(\"I&#39;m a little tea pot\")</code> should return <code>I&#39;m A Little Tea Pot</code>.');",
+        "assert(titleCase(\"sHoRt AnD sToUt\") === \"Short And Stout\", 'message: <code>titleCase(\"sHoRt AnD sToUt\")</code> should return <code>Short And Stout</code>.');",
+        "assert(titleCase(\"HERE IS MY HANDLE HERE IS MY SPOUT\") === \"Here Is My Handle Here Is My Spout\", 'message: <code>titleCase(\"HERE IS MY HANDLE HERE IS MY SPOUT\")</code> should return <code>Here Is My Handle Here Is My Spout</code>.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function titleCase(str) {\n  return str.split(' ').map(function(word) {\n    return word.charAt(0).toUpperCase() + word.substring(1).toLowerCase();\n  }).join(' ');\n}\n\ntitleCase(\"I'm a little tea pot\");\n"
+      ],
+      "MDNlinks": [
+        "String.prototype.split()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Aplica formato de título",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Transforme Uma String Num Título",
+          "description": [
+            "Retorne a string fornecida com a primeira letra de cada palavra em maiúsculo. Certifique-se de que o resto da palavra esteja minúsculo.",
+            "Para o propósito desse exercício, você também deve deixar maiúscula a primeira letra das palavras de ligação como \"the\" e \"of\".",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "579e2a2c335b9d72dd32e05c",
+      "title": "Slice and Splice",
+      "description": [
+        "You are given two arrays and an index.",
+        "Use the array methods <code>slice</code> and <code>splice</code> to copy each element of the first array into the second array, in order.",
+        "Begin inserting elements at index <code>n</code> of the second array.",
+        "Return the resulting array. The input arrays should remain the same after the function runs.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function frankenSplice(arr1, arr2, n) {",
+        "  // It's alive. It's alive!",
+        "  return arr2;",
+        "}",
+        "",
+        "frankenSplice([1, 2, 3], [4, 5, 6], 1);"
+      ],
+      "tail": [
+        "var testArr1 = [1, 2];",
+        "var testArr2 = ['a', 'b'];"
+      ],
+      "tests": [
+        "assert.deepEqual(frankenSplice([1, 2, 3], [4, 5], 1), [4, 1, 2, 3, 5], 'message: <code>frankenSplice([1, 2, 3], [4, 5], 1)</code> should return <code>[4, 1, 2, 3, 5]</code>.');",
+        "assert.deepEqual(frankenSplice(testArr1, testArr2, 1), ['a', 1, 2, 'b'], 'message: <code>frankenSplice([1, 2], [\"a\", \"b\"], 1)</code> should return <code>[\"a\", 1, 2, \"b\"]</code>.');",
+        "assert.deepEqual(frankenSplice(['claw', 'tentacle'], ['head', 'shoulders', 'knees', 'toes'], 2), ['head', 'shoulders', 'claw', 'tentacle', 'knees', 'toes'], 'message: <code>frankenSplice([\"claw\", \"tentacle\"], [\"head\", \"shoulders\", \"knees\", \"toes\"], 2)</code> should return <code>[\"head\", \"shoulders\", \"claw\", \"tentacle\", \"knees\", \"toes\"]</code>.');",
+        "assert.deepEqual(frankenSplice([1, 2, 3, 4], [], 0), [1, 2, 3, 4], 'message: All elements from the first array should be added to the second array in their original order.');",
+        "assert(testArr1[0] === 1 && testArr1[1] === 2, 'message: The first array should remain the same after the function runs.');",
+        "assert(testArr2[0] === 'a' && testArr2[1] === 'b', 'message: The second array should remain the same after the function runs.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "isBeta": true,
+      "solutions": [
+        "function frankenSplice(arr1, arr2, n) {\n  // It's alive. It's alive!\n  var result = arr2.slice();\n  for(var i = 0; i < arr1.length; i++) {\n    result.splice(n+i, 0, arr1[i]);\n  }\n  return result;\n}\n\nfrankenSplice([1, 2, 3], [4, 5], 1);\n"
+      ],
+      "MDNlinks": [
+        "Array.prototype.slice()",
+        "Array.prototype.splice()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "pt-br": {
+          "title": "Slice e splice",
+          "description": [
+            "Você recebe dois arrays e um índice.",
+            "Use os métodos de array <code>slice</code> e <code>splice</code> para copiar cada elemento do primeiro array para o segundo array, em ordem.",
+            "Comece a inserir elementos no índice <code>n</code> do segundo array.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "adf08ec01beb4f99fc7a68f2",
+      "title": "Falsy Bouncer",
+      "description": [
+        "Remove all falsy values from an array.",
+        "Falsy values in JavaScript are <code>false</code>, <code>null</code>, <code>0</code>, <code>\"\"</code>, <code>undefined</code>, and <code>NaN</code>.",
+        "Hint: Try converting each value to a Boolean.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function bouncer(arr) {",
+        "  // Don't show a false ID to this bouncer.",
+        "  return arr;",
+        "}",
+        "",
+        "bouncer([7, \"ate\", \"\", false, 9]);"
+      ],
+      "tests": [
+        "assert.deepEqual(bouncer([7, \"ate\", \"\", false, 9]), [7, \"ate\", 9], 'message: <code>bouncer([7, \"ate\", \"\", false, 9])</code> should return <code>[7, \"ate\", 9]</code>.');",
+        "assert.deepEqual(bouncer([\"a\", \"b\", \"c\"]), [\"a\", \"b\", \"c\"], 'message: <code>bouncer([\"a\", \"b\", \"c\"])</code> should return <code>[\"a\", \"b\", \"c\"]</code>.');",
+        "assert.deepEqual(bouncer([false, null, 0, NaN, undefined, \"\"]), [], 'message: <code>bouncer([false, null, 0, NaN, undefined, \"\"])</code> should return <code>[]</code>.');",
+        "assert.deepEqual(bouncer([1, null, NaN, 2, undefined]), [1, 2], 'message: <code>bouncer([1, null, NaN, 2, undefined])</code> should return <code>[1, 2]</code>.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function bouncer(arr) {\n  // Don't show a false ID to this bouncer.\n  return arr.filter(function(e) {return e;});\n}\n\nbouncer([7, 'ate', '', false, 9]);\n"
+      ],
+      "MDNlinks": [
+        "Boolean Objects",
+        "Array.prototype.filter()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Detector de Mentiras",
+          "description": [
+            "Remueve todos los valores falsy de un arreglo dado",
+            "En javascript, los valores falsy son los siguientes: <code>false</code>, <code>null</code>, <code>0</code>, <code>\"\"</code>, <code>undefined</code>, y <code>NaN</code>.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Detector de mentiras",
+          "description": [
+            "Remova todos os valores falsos de um array.",
+            "Valores falsos em JavaScript são <code>false</code>, <code>null</code>, <code>0</code>, <code>\"\"</code>, <code>undefined</code> e <code>NaN</code>.",
+            "Dica: Tente converter cada valor para um booleano.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a24c1a4622e3c05097f71d67",
+      "title": "Where do I Belong",
+      "description": [
+        "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, <code>getIndexToIns([1,2,3,4], 1.5)</code> should return <code>1</code> because it is greater than <code>1</code> (index 0), but less than <code>2</code> (index 1).",
+        "Likewise, <code>getIndexToIns([20,3,5], 19)</code> should return <code>2</code> because once the array has been sorted it will look like <code>[3,5,20]</code> and <code>19</code> is less than <code>20</code> (index 2) and greater than <code>5</code> (index 1).",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function getIndexToIns(arr, num) {",
+        "  // Find my place in this sorted array.",
+        "  return num;",
+        "}",
+        "",
+        "getIndexToIns([40, 60], 50);"
+      ],
+      "tests": [
+        "assert(getIndexToIns([10, 20, 30, 40, 50], 35) === 3, 'message: <code>getIndexToIns([10, 20, 30, 40, 50], 35)</code> should return <code>3</code>.');",
+        "assert(typeof(getIndexToIns([10, 20, 30, 40, 50], 35)) === \"number\", 'message: <code>getIndexToIns([10, 20, 30, 40, 50], 35)</code> should return a number.');",
+        "assert(getIndexToIns([10, 20, 30, 40, 50], 30) === 2, 'message: <code>getIndexToIns([10, 20, 30, 40, 50], 30)</code> should return <code>2</code>.');",
+        "assert(typeof(getIndexToIns([10, 20, 30, 40, 50], 30)) === \"number\", 'message: <code>getIndexToIns([10, 20, 30, 40, 50], 30)</code> should return a number.');",
+        "assert(getIndexToIns([40, 60], 50) === 1, 'message: <code>getIndexToIns([40, 60], 50)</code> should return <code>1</code>.');",
+        "assert(typeof(getIndexToIns([40, 60], 50)) === \"number\", 'message: <code>getIndexToIns([40, 60], 50)</code> should return a number.');",
+        "assert(getIndexToIns([3, 10, 5], 3) === 0, 'message: <code>getIndexToIns([3, 10, 5], 3)</code> should return <code>0</code>.');",
+        "assert(typeof(getIndexToIns([3, 10, 5], 3)) === \"number\", 'message: <code>getIndexToIns([3, 10, 5], 3)</code> should return a number.');",
+        "assert(getIndexToIns([5, 3, 20, 3], 5) === 2, 'message: <code>getIndexToIns([5, 3, 20, 3], 5)</code> should return <code>2</code>.');",
+        "assert(typeof(getIndexToIns([5, 3, 20, 3], 5)) === \"number\", 'message: <code>getIndexToIns([5, 3, 20, 3], 5)</code> should return a number.');",
+        "assert(getIndexToIns([2, 20, 10], 19) === 2, 'message: <code>getIndexToIns([2, 20, 10], 19)</code> should return <code>2</code>.');",
+        "assert(typeof(getIndexToIns([2, 20, 10], 19)) === \"number\", 'message: <code>getIndexToIns([2, 20, 10], 19)</code> should return a number.');",
+        "assert(getIndexToIns([2, 5, 10], 15) === 3, 'message: <code>getIndexToIns([2, 5, 10], 15)</code> should return <code>3</code>.');",
+        "assert(typeof(getIndexToIns([2, 5, 10], 15)) === \"number\", 'message: <code>getIndexToIns([2, 5, 10], 15)</code> should return a number.');",
+        "assert(getIndexToIns([], 1) === 0, 'message: <code>getIndexToIns([], 1)</code> should return <code>0</code>.');",
+        "assert(typeof(getIndexToIns([], 1)) === \"number\", 'message: <code>getIndexToIns([], 1)</code> should return a number.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function getIndexToIns(arr, num) {\n  arr = arr.sort(function(a, b){return a-b;});\n  for (var i = 0; i < arr.length; i++) {\n    if (arr[i] >= num)\n      {\n        return i;\n      }\n  }\n  return arr.length;\n}"
+      ],
+      "MDNlinks": [
+        "Array.prototype.sort()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "¿Cuál es mi Asiento?",
+          "description": [
+            "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 <code>where([20,3,5], 19)</code> debe devolver <code>2</code> porque una vez ordenado el arreglo se verá com <code>[3,5,20]</code> y <code>19</code> es menor que <code>20</code> (índice 2) y mayor que <code>5</code> (índice 1).",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Onde é meu lugar?",
+          "description": [
+            "Retorne o menor índice no qual um valor (segundo argumento) deve ser inserido num array (primeiro argumento) depois que ele foi ordenado. O valor retornado deve ser um número.",
+            "Por exemplo, <code>getIndexToIns([1,2,3,4], 1.5)</code> deve retornar <code>1</code> porque <code>1.5</code> é maior que <code>1</code> (índice 0), mas menor que <code>2</code> (índice 1).",
+            "Da mesma forma, <code>getIndexToIns([20,3,5], 19)</code> deve retornar <code>2</code> porque, depois de ordenado, o array será <code>[3,5,20]</code> e <code>19</code> é menor que <code>20</code> (índice 2) e maior que <code>5</code> (index 1).",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "af2170cad53daa0770fabdea",
+      "title": "Mutations",
+      "description": [
+        "Return true if the string in the first element of the array contains all of the letters of the string in the second element of the array.",
+        "For example, <code>[\"hello\", \"Hello\"]</code>, should return true because all of the letters in the second string are present in the first, ignoring case.",
+        "The arguments <code>[\"hello\", \"hey\"]</code> should return false because the string \"hello\" does not contain a \"y\".",
+        "Lastly, <code>[\"Alien\", \"line\"]</code>, should return true because all of the letters in \"line\" are present in \"Alien\".",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function mutation(arr) {",
+        "  return arr;",
+        "}",
+        "",
+        "mutation([\"hello\", \"hey\"]);"
+      ],
+      "tests": [
+        "assert(mutation([\"hello\", \"hey\"]) === false, 'message: <code>mutation([\"hello\", \"hey\"])</code> should return false.');",
+        "assert(mutation([\"hello\", \"Hello\"]) === true, 'message: <code>mutation([\"hello\", \"Hello\"])</code> should return true.');",
+        "assert(mutation([\"zyxwvutsrqponmlkjihgfedcba\", \"qrstu\"]) === true, 'message: <code>mutation([\"zyxwvutsrqponmlkjihgfedcba\", \"qrstu\"])</code> should return true.');",
+        "assert(mutation([\"Mary\", \"Army\"]) === true, 'message: <code>mutation([\"Mary\", \"Army\"])</code> should return true.');",
+        "assert(mutation([\"Mary\", \"Aarmy\"]) === true, 'message: <code>mutation([\"Mary\", \"Aarmy\"])</code> should return true.');",
+        "assert(mutation([\"Alien\", \"line\"]) === true, 'message: <code>mutation([\"Alien\", \"line\"])</code> should return true.');",
+        "assert(mutation([\"floor\", \"for\"]) === true, 'message: <code>mutation([\"floor\", \"for\"])</code> should return true.');",
+        "assert(mutation([\"hello\", \"neo\"]) === false, 'message: <code>mutation([\"hello\", \"neo\"])</code> should return false.');",
+        "assert(mutation([\"voodoo\", \"no\"]) === false, 'message: <code>mutation([\"voodoo\", \"no\"])</code> should return false.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function mutation(arr) {\n  var hash = Object.create(null);\n  arr[0].toLowerCase().split('').forEach(function(c) {\n    hash[c] = true;\n  });\n  return !arr[1].toLowerCase().split('').filter(function(c) {\n    return !hash[c];\n  }).length;\n}\n\nmutation(['hello', 'hey']);\n"
+      ],
+      "MDNlinks": [
+        "String.prototype.indexOf()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Mutaciones",
+          "description": [
+            "Crea una función que devuelva <code>true</code> si la cadena de texto del primer elemento de un arreglo contiene todas las letras de la cadena de texto del segundo elemento del arreglo.",
+            "Por ejemplo, <code>[\"hello\", \"Hello\"]</code>, debe devolver <code>true</code> 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 <code>[\"hello\", \"hey\"]</code> la función debe devolver false porque la cadena de texto \"hello\" no contiene una \"y\".",
+            "Finalmente, <code>[\"Alien\", \"line\"]</code>, la función debe devolver <code>true</code> porque todas las letras en \"line\" están presentes en \"Alien\".",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Mutações",
+          "description": [
+            "Retorne <code>true</code> se a string no primeiro elemento do array contiver todas as letras da string no segundo elemento do array.",
+            "Por exemplo, para os argumentos <code>[\"hello\", \"Hello\"]</code>, sua função deve retornar <code>true</code>, porque todas as letras da segunda string estão presentes na primeira, ignorando maiúsculas e minúsculas.",
+            "Para os argumentos <code>[\"hello\", \"hey\"]</code>, sua função deve retornar <code>false</code> porque a string \"hello\" não contém um \"y\".",
+            "Finalmente, para <code>[\"Alien\", \"line\"]</code>, sua função deve retornar <code>true</code> porque todas as letras em \"line\" estão presentes em \"Alien\".",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a9bd25c716030ec90084d8a1",
+      "title": "Chunky Monkey",
+      "description": [
+        "Write a function that splits an array (first argument) into groups the length of <code>size</code> (second argument) and returns them as a two-dimensional array.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function chunkArrayInGroups(arr, size) {",
+        "  // Break it up.",
+        "  return arr;",
+        "}",
+        "",
+        "chunkArrayInGroups([\"a\", \"b\", \"c\", \"d\"], 2);"
+      ],
+      "tests": [
+        "assert.deepEqual(chunkArrayInGroups([\"a\", \"b\", \"c\", \"d\"], 2), [[\"a\", \"b\"], [\"c\", \"d\"]], 'message: <code>chunkArrayInGroups([\"a\", \"b\", \"c\", \"d\"], 2)</code> should return <code>[[\"a\", \"b\"], [\"c\", \"d\"]]</code>.');",
+        "assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3), [[0, 1, 2], [3, 4, 5]], 'message: <code>chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3)</code> should return <code>[[0, 1, 2], [3, 4, 5]]</code>.');",
+        "assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2), [[0, 1], [2, 3], [4, 5]], 'message: <code>chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2)</code> should return <code>[[0, 1], [2, 3], [4, 5]]</code>.');",
+        "assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4), [[0, 1, 2, 3], [4, 5]], 'message: <code>chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4)</code> should return <code>[[0, 1, 2, 3], [4, 5]]</code>.');",
+        "assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3), [[0, 1, 2], [3, 4, 5], [6]], 'message: <code>chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3)</code> should return <code>[[0, 1, 2], [3, 4, 5], [6]]</code>.');",
+        "assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4), [[0, 1, 2, 3], [4, 5, 6, 7], [8]], 'message: <code>chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4)</code> should return <code>[[0, 1, 2, 3], [4, 5, 6, 7], [8]]</code>.');",
+        "assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2), [[0, 1], [2, 3], [4, 5], [6, 7], [8]], 'message: <code>chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2)</code> should return <code>[[0, 1], [2, 3], [4, 5], [6, 7], [8]]</code>.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function chunkArrayInGroups(arr, size) {\n  var out = [];\n  for (var i = 0; i < arr.length; i+=size) {\n    out.push(arr.slice(i,i+size));\n  }\n  return out;\n}\n\nchunkArrayInGroups(['a', 'b', 'c', 'd'], 2);\n"
+      ],
+      "MDNlinks": [
+        "Array.prototype.push()",
+        "Array.prototype.slice()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "En mil Pedazos",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Em pedaços",
+          "description": [
+            "Escreva uma função que divide um array (primeiro argumento) em grupos de comprimento <code>size</code> (segundo argumento) e retorna esses grupos num array bidimensional.",
+            "Lembre-se de <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-data-structures.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-data-structures.json
new file mode 100644
index 0000000000..c81b5785fd
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-data-structures.json
@@ -0,0 +1,825 @@
+{
+  "name": "Basic Data Structures",
+  "order": 4,
+  "time": "1 hour",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7dac367417b2b2516zx5",
+      "title": "Introduction to Arrays",
+      "description": [
+        [
+          "",
+          "",
+          "<dfn>Arrays</dfn> are one of JavaScript's most fundamental built-in data structures, and probably the data structure that you will work with most often throughout the course of the freeCodeCamp curriculum. The array is by no means unique to JavaScript, however &mdash; in fact, it’s probably safe to say that arrays are utilized by almost every complex program... ever.<br><br>In computer science, an array is a linear collection of elements characterized by the fact that each element has a unique <dfn>index</dfn>, or address, that can be computed and used to look up an element's position at run-time.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "In Javascript, arrays are written as comma-separated lists and are enclosed in brackets <code>[element1, element2, element3]</code>. They can be any length, and store any type of data supported by JavaScript.<br><br>Arrays can sometimes be simple and serve very basic functionalities, but they can also be complex and very powerful - all of which depends on how the programmer chooses to utilize them<br><br>From this point forward, whenever we refer to the term <dfn>array</dfn>, it will be strictly within the context of JavaScript.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "JavaScript offers many array <dfn>methods</dfn>, which are a sort of built in function, that allow us to access, traverse, and mutate arrays as needed, depending on our purpose.<br><br>In the coming challenges, we will discuss several of the most common and useful methods, and a few other key techniques, that will help you to better understand and utilize arrays as data structures in JavaScript.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7e367417b2b2512b20",
+      "title": "Use an Array to Store a Collection of Data",
+      "description": [
+        "The below is an example of the simplest implementation of an array data structure. This is known as a <dfn>one-dimensional array</dfn>, meaning it only has one level, or that it does not have any other arrays nested within it. Notice it contains <dfn>booleans</dfn>, <dfn>strings</dfn>, and <dfn>numbers</dfn>, among other valid JavaScript data types:",
+        "<blockquote>let simpleArray = ['one', 2, 'three’, true, false, undefined, null];<br>console.log(simpleArray.length);<br>// logs 7</blockquote>",
+        "All array's have a length property, which as shown above, can be very easily accessed with the syntax <code>Array.length</code>.",
+        "A more complex implementation of an array can be seen below. This is known as a <dfn>multi-dimensional array</dfn>, or an array that contains other arrays. Notice that this array also contains JavaScript <dfn>objects</dfn>, which we will examine very closely in our next section, but for now, all you need to know is that arrays are also capable of storing complex objects.",
+        "<blockquote>let complexArray = [<br>  [<br>    {<br>      one: 1,<br>      two: 2<br>    },<br>    {<br>      three: 3,<br>      four: 4<br>    }<br>  ],<br>  [<br>    {<br>      a: \"a\",<br>      b: \"b\"<br>    },<br>    {<br>      c: \"c\",<br>      d: “d”<br>    }<br>  ]<br>];</blockquote>",
+        "<hr>",
+        "We have defined a variable called <code>yourArray</code>. Complete the statement by assigning an array of at least 5 elements in length to the <code>yourArray</code> variable. Your array should contain at least one <dfn>string</dfn>, one <dfn>number</dfn>, and one <dfn>boolean</dfn>."
+      ],
+      "challengeSeed": [
+        "let yourArray; // change this line"
+      ],
+      "tests": [
+        "assert.strictEqual(Array.isArray(yourArray), true, 'message: yourArray is an array');",
+        "assert.isAtLeast(yourArray.length, 5, 'message: <code>yourArray</code> is at least 5 elements long');",
+        "assert(yourArray.filter( el => typeof el === 'boolean').length >= 1, 'message: <code>yourArray</code> contains at least one <code>boolean</code>');",
+        "assert(yourArray.filter( el => typeof el === 'number').length >= 1, 'message: <code>yourArray</code> contains at least one <code>number</code>');",
+        "assert(yourArray.filter( el => typeof el === 'string').length >= 1, 'message: <code>yourArray</code> contains at least one <code>string</code>');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d78b2366415b2v2512be3",
+      "title": "Access an Array's Contents Using Bracket Notation",
+      "description": [
+        "The fundamental feature of any data structure is, of course, the ability to not only store data, but to be able to retrieve that data on command. So, now that we've learned how to create an array, let's begin to think about how we can access that array's information.",
+        "When we define a simple array as seen below, there are 3 items in it:",
+        "<blockquote>let ourArray = [\"a\", \"b\", \"c\"];</blockquote>",
+        "In an array, each array item has an <dfn>index</dfn>.  This index doubles as the position of that item in the array, and how you reference it. However, it is important to note, that JavaScript arrays are <dfn>zero-indexed</dfn>, meaning that the first element of an array is actually at the <em><strong>zeroth</strong></em> position, not the first.",
+        "In order to retrieve an element from an array we can enclose an index in brackets and append it to the end of an array, or more commonly, to a variable which references an array object. This is known as <dfn>bracket notation</dfn>.",
+        "For example, if we want to retrieve the <code>\"a\"</code> from <code>ourArray</code> and assign it to a variable, we can do so with the following code:",
+        "<blockquote>let ourVariable = ourArray[0];<br>// ourVariable equals \"a\"</blockquote>",
+        "In addition to accessing the value associated with an index, you can also <em>set</em> an index to a value using the same notation:",
+        "<blockquote>ourArray[1] = \"not b anymore\";<br>// ourArray now equals [\"a\", \"not b anymore\", \"c\"];</blockquote>",
+        "Using bracket notation, we have now reset the item at index 1 from <code>\"b\"</code>, to <code>\"not b anymore\"</code>.",
+        "<hr>",
+        "In order to complete this challenge, set the 2nd position (index <code>1</code>) of <code>myArray</code> to anything you want, besides <code>\"b\"</code>."
+      ],
+      "challengeSeed": [
+        "let myArray = [\"a\", \"b\", \"c\", \"d\"];",
+        "// change code below this line",
+        "",
+        "//change code above this line",
+        "console.log(myArray);"
+      ],
+      "tests": [
+        "assert.strictEqual(myArray[0], \"a\", 'message: <code>myArray[0]</code> is equal to <code>\"a\"</code>');",
+        "assert.notStrictEqual(myArray[1], \"b\", 'message: <code>myArray[1]</code> is no longer set to <code>\"b\"</code>');",
+        "assert.strictEqual(myArray[2], \"c\", 'message: <code>myArray[2]</code> is equal to <code>\"c\"</code>');",
+        "assert.strictEqual(myArray[3], \"d\", 'message: <code>myArray[3]</code> is equal to <code>\"d\"</code>');"
+      ],
+      "type": "waypoint",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d78b2367417b2b2512b0e",
+      "title": "Add Items to an Array with push() and unshift()",
+      "description": [
+        "An array's length, like the data types it can contain, is not fixed. Arrays can be defined with a length of any number of elements, and elements can be added or removed over time; in other words, arrays are <dfn>mutable</dfn>. In this challenge, we will look at two methods with which we can programmatically modify an array: <code>Array.push()</code> and <code>Array.unshift()</code>. ",
+        "Both methods take one or more elements as parameters and add those elements to the array the method is being called on; the <code>push()</code> method adds elements to the end of an array, and <code>unshift()</code> adds elements to the beginning. Consider the following:",
+        "<blockquote>let twentyThree = 'XXIII';<br>let romanNumerals = ['XXI', 'XXII'];<br><br>romanNumerals.unshift('XIX', 'XX');<br>// now equals ['XIX', 'XX', 'XXI', 'XXII']<br><br>romanNumerals.push(twentyThree);<br>// now equals ['XIX', 'XX', 'XXI', 'XXII', 'XXIII']",
+        "Notice that we can also pass variables, which allows us even greater flexibility in dynamically modifying our array's data.",
+        "<hr>",
+        "We have defined a function, <code>mixedNumbers</code>, which we are passing an array as an argument. Modify the function by using <code>push()</code> and <code>unshift()</code> to add <code>'I', 2, 'three'</code> to the beginning of the array and <code>7, 'VIII', 9</code> to the end so that the returned array contains representations of the numbers 1-9 in order."
+      ],
+      "challengeSeed": [
+        "function mixedNumbers(arr) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return arr;",
+        "}",
+        "",
+        "// do not change code below this line",
+        "console.log(mixedNumbers(['IV', 5, 'six']));"
+      ],
+      "tests": [
+        "assert.deepEqual(mixedNumbers(['IV', 5, 'six']), ['I', 2, 'three', 'IV', 5, 'six', 7, 'VIII', 9], 'message: <code>mixedNumbers([\"IV\", 5, \"six\"])</code> should now return <code>[\"I\", 2, \"three\", \"IV\", 5, \"six\", 7, \"VIII\", 9]</code>');",
+        "assert.notStrictEqual(mixedNumbers.toString().search(/\\.push\\(/), -1, 'message: The <code>mixedNumbers</code> function should utilize the <code>push()</code> method');",
+        "assert.notStrictEqual(mixedNumbers.toString().search(/\\.unshift\\(/), -1, 'message: The <code>mixedNumbers</code> function should utilize the <code>unshift()</code> method');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d78b2367417b2b2512b0f",
+      "title": "Remove Items from an Array with pop() and shift()",
+      "description": [
+        "Both <code>push()</code> and <code>unshift()</code> have corresponding methods that are nearly functional opposites: <code>pop()</code> and <code>shift()</code>. As you may have guessed by now, instead of adding, <code>pop()</code> <em>removes</em> an element from the end of an array, while <code>shift()</code> removes an element from the beginning. The key difference between <code>pop()</code> and <code>shift()</code> and their cousins <code>push()</code> and <code>unshift()</code>, is that neither method takes parameters, and each only allows an array to be modified by a single element at a time.",
+        "Let's take a look:",
+        "<blockquote>let greetings = ['whats up?', 'hello', 'see ya!'];<br><br>greetings.pop();<br>// now equals ['whats up?', 'hello']<br><br>greetings.shift();<br>// now equals ['hello']</blockquote>",
+        "We can also return the value of the removed element with either method like this:",
+        "<blockquote>let popped = greetings.pop();<br>// returns 'hello'<br>// greetings now equals []</blockquote>",
+        "<hr>",
+        "We have defined a function, <code>popShift</code>, which takes an array as an argument and returns a new array. Modify the function, using <code>pop()</code> and <code>shift()</code>, to remove the first and last elements of the argument array, and assign the removed elements to their corresponding variables, so that the returned array contains their values."
+      ],
+      "challengeSeed": [
+        "function popShift(arr) {",
+        "  let popped; // change this line",
+        "  let shifted; // change this line",
+        "  return [shifted, popped];",
+        "}",
+        "",
+        "// do not change code below this line",
+        "console.log(popShift(['challenge', 'is', 'not', 'complete']));"
+      ],
+      "tests": [
+        "assert.deepEqual(popShift(['challenge', 'is', 'not', 'complete']), [\"challenge\", \"complete\"], 'message: <code>popShift([\"challenge\", \"is\", \"not\", \"complete\"])</code> should return <code>[\"challenge\", \"complete\"]</code>');",
+        "assert.notStrictEqual(popShift.toString().search(/\\.pop\\(/), -1, 'message: The <code>popShift</code> function should utilize the <code>pop()</code> method');",
+        "assert.notStrictEqual(popShift.toString().search(/\\.shift\\(/), -1, 'message: The <code>popShift</code> function should utilize the <code>shift()</code> method');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d78b2367417b2b2512b10",
+      "title": "Remove Items Using splice()",
+      "description": [
+        "Ok, so we've learned how to remove elements from the beginning and end of arrays using <code>shift()</code> and <code>pop()</code>, but what if we want to remove an element from somewhere in the middle? Or remove more than one element at once? Well, that's where <code>splice()</code> comes in. <code>splice()</code> allows us to do just that: <strong>remove any number of consecutive elements</strong> from anywhere in an array.",
+        "<code>splice()</code> can take up to 3 parameters, but for now, we'll focus on just the first 2. The first two parameters of <code>splice()</code> are integers which represent indexes, or positions, of the array that <code>splice()</code> is being called upon. And remember, arrays are <em>zero-indexed</em>, so to indicate the first element of an array, we would use <code>0</code>. <code>splice()</code>'s first parameter represents the index on the array from which to begin removing elements, while the second parameter indicates the number of elements to delete. For example:",
+        "<blockquote>let array = ['today', 'was', 'not', 'so', 'great'];<br><br>array.splice(2, 2);<br>// remove 2 elements beginning with the 3rd element<br>// array now equals ['today', 'was', 'great']</blockquote>",
+        "<code>splice()</code> not only modifies the array it's being called on, but it also returns a new array containing the value of the removed elements:",
+        "<blockquote>let array = ['I', 'am', 'feeling', 'really', 'happy'];<br><br>let newArray = array.splice(3, 2);<br>// newArray equals ['really', 'happy']</blockquote>",
+        "<hr>",
+        "We've defined a function, <code>sumOfTen</code>, which takes an array as an argument and returns the sum of that array's elements. Modify the function, using <code>splice()</code>, so that it returns a value of <code>10</code>."
+      ],
+      "challengeSeed": [
+        "function sumOfTen(arr) {",
+        "  // change code below this line",
+        "  ",
+        "  // change code above this line",
+        "  return arr.reduce((a, b) => a + b);",
+        "}",
+        "",
+        "// do not change code below this line",
+        "console.log(sumOfTen([2, 5, 1, 5, 2, 1]));"
+      ],
+      "tests": [
+        "assert.strictEqual(sumOfTen([2, 5, 1, 5, 2, 1]), 10, 'message: <code>sumOfTen</code> should return 10');",
+        "assert.notStrictEqual(sumOfTen.toString().search(/\\.splice\\(/), -1, 'message: The <code>sumOfTen</code> function should utilize the <code>splice()</code> method');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d78b3367417b2b2512b11",
+      "title": "Add Items Using splice()",
+      "description": [
+        "Remember in the last challenge we mentioned that <code>splice()</code> can take up to three parameters? Well, we can go one step further with <code>splice()</code> &mdash; in addition to removing elements, we can use that third parameter, which represents one or more elements, to <em>add</em> them as well. This can be incredibly useful for quickly switching out an element, or a set of elements, for another. For instance, let's say you're storing a color scheme for a set of DOM elements in an array, and want to dynamically change a color based on some action:",
+        "<blockquote>function colorChange(arr, index, newColor) {<br>&nbsp;&nbsp;arr.splice(index, 1, newColor);<br>&nbsp;&nbsp;return arr;<br>}<br><br>let colorScheme = ['#878787', '#a08794', '#bb7e8c', '#c9b6be', '#d1becf'];<br><br>colorScheme = colorChange(colorScheme, 2, '#332327');<br>// we have removed '#bb7e8c' and added '#332327' in its place<br>// colorScheme now equals ['#878787', '#a08794', '#332327', '#c9b6be', '#d1becf']</blockquote>",
+        "This function takes an array of hex values, an index at which to remove an element, and the new color to replace the removed element with. The return value is an array containing a newly modified color scheme! While this example is a bit oversimplified, we can see the value that utilizing <code>splice()</code> to its maximum potential can have.",
+        "<hr>",
+        "We have defined a function, <code>htmlColorNames</code>, which takes an array of HTML colors as an argument. Modify the function using <code>splice()</code> to remove the first two elements of the array and add <code>'DarkSalmon'</code> and <code>'BlanchedAlmond'</code> in their respective places."
+      ],
+      "challengeSeed": [
+        "function htmlColorNames(arr) {",
+        "  // change code below this line",
+        "  ",
+        "  // change code above this line",
+        "  return arr;",
+        "} ",
+        " ",
+        "// do not change code below this line",
+        "console.log(htmlColorNames(['DarkGoldenRod', 'WhiteSmoke', 'LavenderBlush', 'PaleTurqoise', 'FireBrick']));"
+      ],
+      "tests": [
+        "assert.deepEqual(htmlColorNames(['DarkGoldenRod', 'WhiteSmoke', 'LavenderBlush', 'PaleTurqoise', 'FireBrick']), ['DarkSalmon', 'BlanchedAlmond', 'LavenderBlush', 'PaleTurqoise', 'FireBrick'], 'message: <code>htmlColorNames</code> should return <code>[\"DarkSalmon\", \"BlanchedAlmond\", \"LavenderBlush\", \"PaleTurqoise\", \"FireBrick\"]</code>');",
+        "assert(/.splice/.test(code), 'message: The <code>htmlColorNames</code> function should utilize the <code>splice()</code> method');",
+        "assert(!/shift|unshift/.test(code), 'message: You should not use <code>shift()</code> or <code>unshift()</code>.');",
+        "assert(!/\\[\\d\\]\\s*=/.test(code), 'message: You should not use array bracket notation.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7a367417b2b2512b12",
+      "title": "Copy Array Items Using slice()",
+      "description": [
+        "The next method we will cover is <code>slice()</code>. <code>slice()</code>, rather than modifying an array, copies, or <em>extracts</em>, a given number of elements to a new array, leaving the array it is called upon untouched. <code>slice()</code> takes only 2 parameters &mdash; the first is the index at which to begin extraction, and the second is the index at which to stop extraction (extraction will occur up to, but not including the element at this index). Consider this:",
+        "<blockquote>let weatherConditions = ['rain', 'snow', 'sleet', 'hail', 'clear'];<br><br>let todaysWeather = weatherConditions.slice(1, 3);<br>// todaysWeather equals ['snow', 'sleet'];<br>// weatherConditions still equals ['rain', 'snow', 'sleet', 'hail', 'clear']<br></blockquote>",
+        "In effect, we have created a new array by extracting elements from an existing array.",
+        "<hr>",
+        "We have defined a function, <code>forecast</code>, that takes an array as an argument. Modify the function using <code>slice()</code> to extract information from the argument array and return a new array that contains the elements <code>'warm'</code> and <code>'sunny'</code>."
+      ],
+      "challengeSeed": [
+        "function forecast(arr) {",
+        "  // change code below this line",
+        "  ",
+        "  return arr;",
+        "}",
+        "",
+        "// do not change code below this line",
+        "console.log(forecast(['cold', 'rainy', 'warm', 'sunny', 'cool', 'thunderstorms']));"
+      ],
+      "tests": [
+        "assert.deepEqual(forecast(['cold', 'rainy', 'warm', 'sunny', 'cool', 'thunderstorms']), ['warm', 'sunny'], 'message: <code>forecast</code> should return <code>[\"warm\", \"sunny\"]');",
+        "assert(/\\.slice\\(/.test(code), 'message: The <code>forecast</code> function should utilize the <code>slice()</code> method');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7b367417b2b2512b13",
+      "title": "Copy an Array with the Spread Operator",
+      "description": [
+        "While <code>slice()</code> allows us to be selective about what elements of an array to copy, among several other useful tasks, ES6's new <dfn>spread operator</dfn> allows us to easily copy <em>all</em> of an array's elements, in order, with a simple and highly readable syntax. The spread syntax simply looks like this: <code>...</code>",
+        "In practice, we can use the spread operator to copy an array like so:",
+        "<blockquote>let thisArray = [true, true, undefined, false, null];<br>let thatArray = [...thisArray];<br>// thatArray equals [true, true, undefined, false, null]<br>// thisArray remains unchanged, and is identical to thatArray</blockquote>",
+        "<hr>",
+        "We have defined a function, <code>copyMachine</code> which takes <code>arr</code> (an array) and <code>num</code> (a number) as arguments. The function is supposed to return a new array made up of <code>num</code> copies of <code>arr</code>. We have done most of the work for you, but it doesn't work quite right yet. Modify the function using spread syntax so that it works correctly (hint: another method we have already covered might come in handy here!)."
+      ],
+      "challengeSeed": [
+        "function copyMachine(arr, num) {",
+        "  let newArr = [];",
+        "  while (num >= 1) {",
+        "    // change code below this line",
+        "",
+        "    // change code above this line",
+        "    num--;",
+        "  }",
+        "  return newArr;",
+        "}",
+        "",
+        "// change code here to test different cases:",
+        "console.log(copyMachine([true, false, true], 2));"
+      ],
+      "tests": [
+        "assert.deepEqual(copyMachine([true, false, true], 2), [[true, false, true], [true, false, true]], 'message: <code>copyMachine([true, false, true], 2)</code> should return <code>[[true, false, true], [true, false, true]]</code>');",
+        "assert.deepEqual(copyMachine([1, 2, 3], 5), [[1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3]], 'message: <code>copyMachine([1, 2, 3], 5)</code> should return <code>[[1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3], [1, 2, 3]]</code>');",
+        "assert.deepEqual(copyMachine([true, true, null], 1), [[true, true, null]], 'message: <code>copyMachine([true, true, null], 1)</code> should return <code>[[true, true, null]]</code>');",
+        "assert.deepEqual(copyMachine(['it works'], 3), [['it works'], ['it works'], ['it works']], 'message: <code>copyMachine([\"it works\"], 3)</code> should return <code>[[\"it works\"], [\"it works\"], [\"it works\"]]</code>');",
+        "assert.notStrictEqual(copyMachine.toString().indexOf('.concat(_toConsumableArray(arr))'), -1, 'message: The <code>copyMachine</code> function should utilize the <code>spread operator</code> with array <code>arr</code>');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7b367417b2b2512b17",
+      "title": "Combine Arrays with the Spread Operator",
+      "description": [
+        "Another huge advantage of the <dfn>spread</dfn> operator, is the ability to combine arrays, or to insert all the elements of one array into another, at any index. With more traditional syntaxes, we can concatenate arrays, but this only allows us to combine arrays at the end of one, and at the start of another. Spread syntax makes the following operation extremely simple:",
+        "<blockquote>let thisArray = ['sage', 'rosemary', 'parsley', 'thyme'];<br><br>let thatArray = ['basil', 'cilantro', ...thisArray, 'coriander'];<br>// thatArray now equals ['basil', 'cilantro', 'sage', 'rosemary', 'parsley', 'thyme', 'coriander']</blockquote>",
+        "Using spread syntax, we have just achieved an operation that would have been more more complex and more verbose had we used traditional methods.",
+        "<hr>",
+        "We have defined a function <code>spreadOut</code> that returns the variable <code>sentence</code>, modify the function using the <dfn>spread</dfn> operator so that it returns the array <code>['learning', 'to', 'code', 'is', 'fun']</code>."
+      ],
+      "challengeSeed": [
+        "function spreadOut() {",
+        "  let fragment = ['to', 'code'];",
+        "  let sentence; // change this line",
+        "  return sentence;",
+        "}",
+        "",
+        "// do not change code below this line",
+        "console.log(spreadOut());"
+      ],
+      "tests": [
+        "assert.deepEqual(spreadOut(), ['learning', 'to', 'code', 'is', 'fun'], 'message: <code>spreadOut</code> should return <code>[\"learning\", \"to\", \"code\", \"is\", \"fun\"]</code>');",
+        "assert.notStrictEqual(spreadOut.toString().search(/[...]/), -1, 'message: The <code>spreadOut</code> function should utilize spread syntax');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7b367417b2b2512b14",
+      "title": "Check For The Presence of an Element With indexOf()",
+      "description": [
+        "Since arrays can be changed, or <em>mutated</em>, at any time, there's no guarantee about where a particular piece of data will be on a given array, or if that element even still exists. Luckily, JavaScript provides us with another built-in method, <code>indexOf()</code>, that allows us to quickly and easily check for the presence of an element on an array. <code>indexOf()</code> takes an element as a parameter, and when called, it returns the position, or index, of that element, or <code>-1</code> if the element does not exist on the array.",
+        "For example:",
+        "<blockquote>let fruits = ['apples', 'pears', 'oranges', 'peaches', 'pears'];<br><br>fruits.indexOf('dates') // returns -1<br>fruits.indexOf('oranges') // returns 2<br>fruits.indexOf('pears') // returns 1, the first index at which the element exists</blockquote>",
+        "<hr>",
+        "<code>indexOf()</code> can be incredibly useful for quickly checking for the presence of an element on an array. We have defined a function, <code>quickCheck</code>, that takes an array and an element as arguments. Modify the function using <code>indexOf()</code> so that it returns <code>true</code> if the passed element exists on the array, and <code>false</code> if it does not."
+      ],
+      "challengeSeed": [
+        "function quickCheck(arr, elem) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "}",
+        "",
+        "// change code here to test different cases:",
+        "console.log(quickCheck(['squash', 'onions', 'shallots'], 'mushrooms'));"
+      ],
+      "tests": [
+        "assert.strictEqual(quickCheck(['squash', 'onions', 'shallots'], 'mushrooms'), false, 'message: <code>quickCheck([\"squash\", \"onions\", \"shallots\"], \"mushrooms\")</code> should return <code>false</code>');",
+        "assert.strictEqual(quickCheck(['squash', 'onions', 'shallots'], 'onions'), true, 'message: <code>quickCheck([\"squash\", \"onions\", \"shallots\"], \"onions\")</code> should return <code>true</code>');",
+        "assert.strictEqual(quickCheck([3, 5, 9, 125, 45, 2], 125), true, 'message: <code>quickCheck([3, 5, 9, 125, 45, 2], 125)</code> should return <code>true</code>');",
+        "assert.strictEqual(quickCheck([true, false, false], undefined), false, 'message: <code>quickCheck([true, false, false], undefined)</code> should return <code>false</code>');",
+        "assert.notStrictEqual(quickCheck.toString().search(/\\.indexOf\\(/), -1, 'message: The <code>quickCheck</code> function should utilize the <code>indexOf()</code> method');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7b367417b2b2512b15",
+      "title": "Iterate Through All an Array's Items Using For Loops",
+      "description": [
+        "Sometimes when working with arrays, it is very handy to be able to iterate through each item to find one or more elements that we might need, or to manipulate an array based on which data items meet a certain set of criteria. JavaScript offers several built in methods that each iterate over arrays in slightly different ways to achieve different results (such as <code>every()</code>, <code>forEach()</code>, <code>map()</code>, etc.), however the technique which is most flexible and offers us the greatest amount of control is a simple <code>for</code> loop.",
+        "Consider the following:",
+        "<blockquote>function greaterThanTen(arr) {<br>&nbsp;&nbsp;let newArr = [];<br>&nbsp;&nbsp;for (let i = 0; i < arr.length; i++) {<br>&nbsp;&nbsp;&nbsp;&nbsp;if (arr[i] > 10) {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;newArr.push(arr[i]);<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>&nbsp;&nbsp;}<br>&nbsp;&nbsp;return newArr;<br>}<br><br>greaterThanTen([2, 12, 8, 14, 80, 0, 1]);<br>// returns [12, 14, 80]</blockquote>",
+        "Using a <code>for</code> loop, this function iterates through and accesses each element of the array, and subjects it to a simple test that we have created. In this way, we have easily and programmatically determined which data items are greater than <code>10</code>, and returned a new array containing those items.",
+        "<hr>",
+        "We have defined a function, <code>filteredArray</code>, which takes <code>arr</code>, a nested array, and <code>elem</code> as arguments, and returns a new array. <code>elem</code> represents an element that may or may not be present on one or more of the arrays nested within <code>arr</code>. Modify the function, using a <code>for</code> loop, to return a filtered version of the passed array such that any array nested within <code>arr</code> containing <code>elem</code> has been removed."
+      ],
+      "challengeSeed": [
+        "function filteredArray(arr, elem) {",
+        "  let newArr = [];",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return newArr;",
+        "}",
+        "",
+        "// change code here to test different cases:",
+        "console.log(filteredArray([[3, 2, 3], [1, 6, 3], [3, 13, 26], [19, 3, 9]], 3));"
+      ],
+      "tests": [
+        "assert.deepEqual(filteredArray([ [10, 8, 3], [14, 6, 23], [3, 18, 6] ], 18), [[10, 8, 3], [14, 6, 23]], 'message: <code>filteredArray([[10, 8, 3], [14, 6, 23], [3, 18, 6]], 18)</code> should return <code>[ [10, 8, 3], [14, 6, 23] ]</code>');",
+        "assert.deepEqual(filteredArray([ ['trumpets', 2], ['flutes', 4], ['saxophones', 2] ], 2), [['flutes', 4]], 'message: <code>filteredArray([ [\"trumpets\", 2], [\"flutes\", 4], [\"saxophones\", 2] ], 2)</code> should return <code>[ [\"flutes\", 4] ]</code>');",
+        "assert.deepEqual(filteredArray([['amy', 'beth', 'sam'], ['dave', 'sean', 'peter']], 'peter'), [['amy', 'beth', 'sam']], 'message: <code>filteredArray([ [\"amy\", \"beth\", \"sam\"], [\"dave\", \"sean\", \"peter\"] ], \"peter\")</code> should return <code>[ [\"amy\", \"beth\", \"sam\"] ]</code>');",
+        "assert.deepEqual(filteredArray([[3, 2, 3], [1, 6, 3], [3, 13, 26], [19, 3, 9]], 3), [], 'message: <code>filteredArray([[3, 2, 3], [1, 6, 3], [3, 13, 26], [19, 3, 9]], 3)</code> should return <code>[ ]</code>');",
+        "assert.notStrictEqual(filteredArray.toString().search(/for/), -1, 'message: The <code>filteredArray</code> function should utilize a <code>for</code> loop');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7b367417b2b2512b16",
+      "title": "Create complex multi-dimensional arrays",
+      "description": [
+        "Awesome! You have just learned a ton about arrays! This has been a fairly high level overview, and there is plenty more to learn about working with arrays, much of which you will see in later sections. But before moving on to looking at <dfn>Objects</dfn>, lets take one more look, and see how arrays can become a bit more complex than what we have seen in previous challenges.",
+        "One of the most powerful features when thinking of arrays as data structures, is that arrays can contain, or even be completely made up of other arrays. We have seen arrays that contain arrays in previous challenges, but fairly simple ones. However, arrays can contain an infinite depth of arrays that can contain other arrays, each with their own arbitrary levels of depth, and so on. In this way, an array can very quickly become very complex data structure, known as a <dfn>multi-dimensional</dfn>, or nested array. Consider the following example:",
+        "<blockquote>let nestedArray = [ // top, or first level - the outer most array<br>&nbsp;&nbsp;['deep'], // an array within an array, 2 levels of depth<br>&nbsp;&nbsp;[<br>&nbsp;&nbsp;&nbsp;&nbsp;['deeper'], ['deeper'] // 2 arrays nested 3 levels deep<br>&nbsp;&nbsp;],<br>&nbsp;&nbsp;[<br>&nbsp;&nbsp;&nbsp;&nbsp;[<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;['deepest'], ['deepest'] // 2 arrays nested 4 levels deep<br>&nbsp;&nbsp;&nbsp;&nbsp;],<br>&nbsp;&nbsp;&nbsp;&nbsp;[<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;['deepest-est?'] // an array nested 5 levels deep<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;]<br>&nbsp;&nbsp;&nbsp;&nbsp;]<br>&nbsp;&nbsp;]<br>];</blockquote>",
+        "While this example may seem convoluted, this level of complexity is not unheard of, or even unusual, when dealing with large amounts of data.",
+        "However, we can still very easily access the deepest levels of an array this complex with bracket notation:",
+        "<blockquote>console.log(nestedArray[2][1][0][0][0]);<br>// logs: deepest-est?</blockquote>",
+        "And now that we know where that piece of data is, we can reset it if we need to:",
+        "<blockquote>nestedArray[2][1][0][0][0] = 'deeper still';<br><br>console.log(nestedArray[2][1][0][0][0]);<br>// now logs: deeper still</blockquote>",
+        "<hr>",
+        "We have defined a variable, <code>myNestedArray</code>, set equal to an array. Modify <code>myNestedArray</code>, using any combination of <dfn>strings</dfn>, <dfn>numbers</dfn>, and <dfn>booleans</dfn> for data elements, so that it has exactly five levels of depth (remember, the outer-most array is level 1). Somewhere on the third level, include the string <code>'deep'</code>, on the fourth level, include the string <code>'deeper'</code>, and on the fifth level, include the string <code>'deepest'</code>."
+      ],
+      "challengeSeed": [
+        "let myNestedArray = [",
+        "  // change code below this line",
+        "  ['unshift', false, 1, 2, 3, 'complex', 'nested'],",
+        "  ['loop', 'shift', 6, 7, 1000, 'method'],",
+        "  ['concat', false, true, 'spread', 'array'],",
+        "  ['mutate', 1327.98, 'splice', 'slice', 'push'],",
+        "  ['iterate', 1.3849, 7, '8.4876', 'arbitrary', 'depth']",
+        "  // change code above this line",
+        "];"
+      ],
+      "tests": [
+        "assert.strictEqual((function(arr) { let flattened = (function flatten(arr) { const flat = [].concat(...arr); return flat.some (Array.isArray) ? flatten(flat) : flat; })(arr); for (let i = 0; i < flattened.length; i++) { if ( typeof flattened[i] !== 'number' && typeof flattened[i] !== 'string' && typeof flattened[i] !== 'boolean') { return false } } return true })(myNestedArray), true, 'message: <code>myNestedArray</code> should contain only numbers, booleans, and strings as data elements');",
+        "assert.strictEqual((function(arr) {let depth = 0;function arrayDepth(array, i, d) { if (Array.isArray(array[i])) {  arrayDepth(array[i], 0, d + 1);} else {  depth = (d > depth) ? d : depth;}if (i < array.length) {  arrayDepth(array, i + 1, d);}  }arrayDepth(arr, 0, 0);return depth;})(myNestedArray), 4, 'message: <code>myNestedArray</code> should have exactly 5 levels of depth');",
+        "assert((function howDeep(array, target, depth = 0) {return array.reduce((combined, current) => {if (Array.isArray(current)) {  return combined.concat(howDeep(current, target, depth + 1));} else if (current === target) {  return combined.concat(depth);} else {  return combined;}}, []);})(myNestedArray, 'deep').length === 1 && (function howDeep(array, target, depth = 0) {return array.reduce((combined, current) => {if (Array.isArray(current)) {  return combined.concat(howDeep(current, target, depth + 1));} else if (current === target) {  return combined.concat(depth);} else {  return combined;}}, []);})(myNestedArray, 'deep')[0] === 2, 'message: <code>myNestedArray</code> should contain exactly one occurrence of the string <code>\"deep\"</code> on an array nested 3 levels deep');",
+        "assert((function howDeep(array, target, depth = 0) {return array.reduce((combined, current) => {if (Array.isArray(current)) {  return combined.concat(howDeep(current, target, depth + 1));} else if (current === target) {  return combined.concat(depth);} else {  return combined;}}, []);})(myNestedArray, 'deeper').length === 1 && (function howDeep(array, target, depth = 0) {return array.reduce((combined, current) => {if (Array.isArray(current)) {  return combined.concat(howDeep(current, target, depth + 1));} else if (current === target) {  return combined.concat(depth);} else {  return combined;}}, []);})(myNestedArray, 'deeper')[0] === 3, 'message: <code>myNestedArray</code> should contain exactly one occurrence of the string <code>\"deeper\"</code> on an array nested 4 levels deep');",
+        "assert((function howDeep(array, target, depth = 0) {return array.reduce((combined, current) => {if (Array.isArray(current)) {  return combined.concat(howDeep(current, target, depth + 1));} else if (current === target) {  return combined.concat(depth);} else {  return combined;}}, []);})(myNestedArray, 'deepest').length === 1 && (function howDeep(array, target, depth = 0) {return array.reduce((combined, current) => {if (Array.isArray(current)) {  return combined.concat(howDeep(current, target, depth + 1));} else if (current === target) {  return combined.concat(depth);} else {  return combined;}}, []);})(myNestedArray, 'deepest')[0] === 4, 'message: <code>myNestedArray</code> should contain exactly one occurrence of the string <code>\"deepest\"</code> on an array nested 5 levels deep');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dac367417b2b25184d3",
+      "title": "Introduction to Objects",
+      "description": [
+        [
+          "",
+          "",
+          "The next data structure we will discuss is the JavaScript <dfn>object</dfn>. Like arrays, objects are a fundamental part of JavaScript. However, it is probably safe to say that objects surpass arrays in flexibility, usefulness and in their overall importance to the language &mdash; in fact, you may have heard this line before: 'In JavaScript, everything is an object.'<br><br>While an understanding of objects is important to understand the inner workings of JavaScript functions or JavaScript's object-oriented capabilities, JavaScript objects at a basic level are actually just <dfn>key-value pair</dfn> stores, a commonly used data structure across almost all programming languages. Here, we will confine our discussion to JavaScript objects in this capacity.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Key-value pair data structures go by different names depending on the language and the specific details of the data structure. The terms <dfn>dictionary</dfn>, <dfn>map</dfn>, and <dfn>hash table</dfn> all refer to the notion of a data structure in which specific keys, or properties, are mapped to specific values.<br><br>Objects, and other similar key-value pair data structures, offer some very useful benefits. One clear benefit is that they allow us to structure our data in an intuitive way; properties can be nested to an arbitrary depth, and values can be anything, including arrays and even other objects.<br><br>Largely due to this flexibility, objects are also the foundation for <dfn>JavaScript Object Notation</dfn>, or <dfn>JSON</dfn>, which is a widely used method of sending data across the web.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Another powerful advantage of key-value pair data structures is <dfn>constant lookup time</dfn>. What this means, is that when you request the value of a specific property, you will get the value back in the same amount of time (theoretically) regardless of the number of entries in the object. If you had an object with 5 entries or one that held a collection of 1,000,000, you could still retrieve property values or check if a key exists in the same amount of time.<br><br>The reason for this fast lookup time, is that internally, the object is storing properties using a hashing mechanism which allows it to know exactly where it has stored different property values. If you want to learn more about this please take a look at the optional Advanced Data Structures challenges. All you should remember for now is that <strong>performant access to flexibly structured data make key-value stores very attractive data structures useful in a wide variety of settings</strong>.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "<br><br>In JavaScript, objects are written as comma-separated lists of key-value pairs, wrapped in curly brackets, with each key and its assigned value separated by a colon:<br> <code>{ key1: 'val-1', key2: 'val-2' }</code><br><br>In the next few challenges, we will examine JavaScript objects more closely, and take a look at <dfn>methods</dfn> and techniques that allow us to access, store, and manipulate an object's data.<br><br>Note that throughout the scope of this discussion, and in general when considering JavaScript objects, the terms <dfn>key</dfn> and <dfn>property</dfn> will be used interchangeably.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7c367417b2b2512b18",
+      "title": "Add Key-Value Pairs to JavaScript Objects",
+      "description": [
+        "At their most basic, objects are just collections of <dfn>key-value pairs</dfn>, or in other words, pieces of data mapped to unique identifiers that we call <dfn>properties</dfn> or <dfn>keys</dfn>. Let's take a look at a very simple example:",
+        "<blockquote>let FCC_User = {<br>  username: 'awesome_coder',<br>  followers: 572,<br>  points: 1741,<br>  completedProjects: 15<br>};</blockquote>",
+        "The above code defines an object called <code>FCC_User</code> that has four <dfn>properties</dfn>, each of which map to a specific value. If we wanted to know the number of <code>followers</code> <code>FCC_User</code> has, we can access that property by writing:",
+        "<blockquote>let userData = FCC_User.followers;<br>// userData equals 572</blockquote>",
+        "This is called <dfn>dot notation</dfn>. Alternatively, we can also access the property with brackets, like so:",
+        "<blockquote>let userData = FCC_User['followers']<br>// userData equals 572</blockquote>",
+        "Notice that with <dfn>bracket notation</dfn>, we enclosed <code>followers</code> in quotes. This is because the brackets actually allow us to pass a variable in to be evaluated as a property name (hint: keep this in mind for later!). Had we passed <code>followers</code> in without the quotes, the JavaScript engine would have attempted to evaluate it as a variable, and a <code>ReferenceError: followers is not defined</code> would have been thrown.",
+        "<hr>",
+        "Using the same syntax, we can also <em><strong>add new</strong></em> key-value pairs to objects. We've created a <code>foods</code> object with three entries. Add three more entries: <code>bananas</code> with a value of <code>13</code>, <code>grapes</code> with a value of <code>35</code>, and <code>strawberries</code> with a value of <code>27</code>."
+      ],
+      "challengeSeed": [
+        "let foods = {",
+        "  apples: 25,",
+        "  oranges: 32,",
+        "  plums: 28",
+        "};",
+        "",
+        "// change code below this line",
+        "",
+        "// change code above this line",
+        "",
+        "console.log(foods);"
+      ],
+      "tests": [
+        "assert(typeof foods === 'object', 'message: <code>foods</code> is an object');",
+        "assert(foods.bananas === 13, 'message: The <code>foods</code> object has a key <code>\"bananas\"</code> with a value of <code>13</code>');",
+        "assert(foods.grapes === 35, 'message: The <code>foods</code> object has a key <code>\"grapes\"</code> with a value of <code>35</code>');",
+        "assert(foods.strawberries === 27, 'message: The <code>foods</code> object has a key <code>\"strawberries\"</code> with a value of <code>27</code>');",
+        "assert(code.search(/bananas:/) === -1 && code.search(/grapes:/) === -1 && code.search(/strawberries:/) === -1, 'message: The key-value pairs should be set using dot or bracket notation');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7c367417b2b2512b19",
+      "title": "Modify an Object Nested Within an Object",
+      "description": [
+        "Now let's take a look at a slightly more complex object. Object properties can be nested to an arbitrary depth, and their values can be any type of data supported by JavaScript, including arrays and even other objects. Consider the following:",
+        "<blockquote>let nestedObject = {<br>  id: 28802695164,<br>  date: 'December 31, 2016',<br>  data: {<br>    totalUsers: 99,<br>    online: 80,<br>    onlineStatus: {<br>      active: 67,<br>      away: 13<br>    }<br>  }<br>};</blockquote>",
+        "<code>nestedObject</code> has three unique keys: <code>id</code>, whose value is a number, <code>date</code> whose value is a string, and <code>data</code>, whose value is an object which has yet another object nested within it. While structures can quickly become complex, we can still use the same notations to access the information we need.",
+        "<hr>",
+        "Here we've defined an object, <code>userActivity</code>, which includes another object nested within it. You can modify properties on this nested object in the same way you modified properties in the last challenge. Set the value of the <code>online</code> key to <code>45</code>."
+      ],
+      "challengeSeed": [
+        "let userActivity = {",
+        "  id: 23894201352,",
+        "  date: 'January 1, 2017',",
+        "  data: {",
+        "    totalUsers: 51,",
+        "    online: 42",
+        "  }",
+        "};",
+        "",
+        "// change code below this line",
+        "",
+        "// change code above this line",
+        "",
+        "console.log(userActivity);"
+      ],
+      "tests": [
+        "assert('id' in userActivity && 'date' in userActivity && 'data' in userActivity, 'message: <code>userActivity</code> has <code>id</code>, <code>date</code> and <code>data</code> properties');",
+        "assert('totalUsers' in userActivity.data && 'online' in userActivity.data, 'message: <code>userActivity</code> has a <code>data</code> key set to an object with keys <code>totalUsers</code> and <code>online</code>');",
+        "assert(userActivity.data.online === 45, 'message: The <code>online</code> property nested in the <code>data</code> key of <code>userActivity</code> should be set to <code>45</code>');",
+        "assert.strictEqual(code.search(/online: 45/), -1, 'message: The <code>online</code> property is set using dot or bracket notation');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7c367417b2b2512b1a",
+      "title": "Access Property Names with Bracket Notation",
+      "description": [
+        "In the first object challenge we mentioned the use of bracket notation as a way to access property values using the evaluation of a variable. For instance, imagine that our <code>foods</code> object is being used in a program for a supermarket cash register. We have some function that sets the <code>selectedFood</code> and we want to check our <code>foods</code> object for the presence of that food. This might look like:",
+        "<blockquote>let selectedFood = getCurrentFood(scannedItem);<br>let inventory = foods[selectedFood];</blockquote>",
+        "This code will evaluate the value stored in the <code>selectedFood</code> variable and return the value of that key in the <code>foods</code> object, or <code>undefined</code> if it is not present. Bracket notation is very useful because sometimes object properties are not known before runtime or we need to access them in a more dynamic way.",
+        "<hr>",
+        "We've defined a function, <code>checkInventory</code>, which receives a scanned item as an argument. Return the current value of the <code>scannedItem</code> key in the <code>foods</code> object. You can assume that only valid keys will be provided as an argument to <code>checkInventory</code>."
+      ],
+      "challengeSeed": [
+        "let foods = {",
+        "  apples: 25,",
+        "  oranges: 32,",
+        "  plums: 28,",
+        "  bananas: 13,",
+        "  grapes: 35,",
+        "  strawberries: 27",
+        "};",
+        "// do not change code above this line",
+        "",
+        "function checkInventory(scannedItem) {",
+        "  // change code below this line",
+        "",
+        "}",
+        "",
+        "// change code below this line to test different cases:",
+        "console.log(checkInventory(\"apples\"));"
+      ],
+      "tests": [
+        "assert.strictEqual(typeof checkInventory, 'function', 'message: <code>checkInventory</code> is a function');",
+        "assert.deepEqual(foods, {apples: 25, oranges: 32, plums: 28, bananas: 13, grapes: 35, strawberries: 27}, 'message: The <code>foods</code> object should have only the following key-value pairs: <code>apples: 25</code>, <code>oranges: 32</code>, <code>plums: 28</code>, <code>bananas: 13</code>, <code>grapes: 35</code>, <code>strawberries: 27</code>');",
+        "assert.strictEqual(checkInventory('apples'), 25, 'message: <code>checkInventory(\"apples\")</code> should return <code>25</code>');",
+        "assert.strictEqual(checkInventory('bananas'), 13, 'message: <code>checkInventory(\"bananas\")</code> should return <code>13</code>');",
+        "assert.strictEqual(checkInventory('strawberries'), 27, 'message: <code>checkInventory(\"strawberries\")</code> should return <code>27</code>');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7c367417b2b2512b1b",
+      "title": "Use the delete Keyword to Remove Object Properties",
+      "description": [
+        "Now you know what objects are and their basic features and advantages. In short, they are key-value stores which provide a flexible, intuitive way to structure data, <strong><em>and</em></strong>, they provide very fast lookup time. Throughout the rest of these challenges, we will describe several common operations you can perform on objects so you can become comfortable applying these useful data structures in your programs.",
+        "In earlier challenges, we have both added to and modified an object's key-value pairs. Here we will see how we can <em>remove</em> a key-value pair from an object.",
+        "Let's revisit our <code>foods</code> object example one last time. If we wanted to remove the <code>apples</code> key, we can remove it by using the <code>delete</code> keyword like this:",
+        "<blockquote>delete foods.apples;</blockquote>",
+        "<hr>",
+        "Use the delete keyword to remove the <code>oranges</code>, <code>plums</code>, and <code>strawberries</code> keys from the <code>foods</code> object."
+      ],
+      "challengeSeed": [
+        "let foods = {",
+        "  apples: 25,",
+        "  oranges: 32,",
+        "  plums: 28,",
+        "  bananas: 13,",
+        "  grapes: 35,",
+        "  strawberries: 27",
+        "};",
+        "",
+        "// change code below this line",
+        "",
+        "// change code above this line",
+        "",
+        "console.log(foods);"
+      ],
+      "tests": [
+        "assert(!foods.hasOwnProperty('oranges') && !foods.hasOwnProperty('plums') && !foods.hasOwnProperty('strawberries') && Object.keys(foods).length === 3, 'message: The <code>foods</code> object only has three keys: <code>apples</code>, <code>grapes</code>, and <code>bananas</code>');",
+        "assert(code.search(/oranges:/) !== -1 && code.search(/plums:/) !== -1 && code.search(/strawberries:/) !== -1, 'message: The <code>oranges</code>, <code>plums</code>, and <code>strawberries</code> keys are removed using <code>delete</code>');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7d367417b2b2512b1c",
+      "title": "Check if an Object has a Property",
+      "description": [
+        "Now we can add, modify, and remove keys from objects. But what if we just wanted to know if an object has a specific property? JavaScript provides us with two different ways to do this. One uses the <code>hasOwnProperty()</code> method and the other uses the <code>in</code> keyword. If we have an object <code>users</code> with a property of <code>Alan</code>, we could check for its presence in either of the following ways:",
+        "<blockquote>users.hasOwnProperty('Alan');<br>'Alan' in users;<br>// both return true</blockquote>",
+        "<hr>",
+        "We've created an object, <code>users</code>, with some users in it and a function <code>isEveryoneHere</code>, which we pass the <code>users</code> object to as an argument. Finish writing this function so that it returns <code>true</code> only if the <code>users</code> object contains all four names, <code>Alan</code>, <code>Jeff</code>, <code>Sarah</code>, and <code>Ryan</code>, as keys, and <code>false</code> otherwise."
+      ],
+      "challengeSeed": [
+        "let users = {",
+        "  Alan: {",
+        "    age: 27,",
+        "    online: true",
+        "  },",
+        "  Jeff: {",
+        "    age: 32,",
+        "    online: true",
+        "  },",
+        "  Sarah: {",
+        "    age: 48,",
+        "    online: true",
+        "  },",
+        "  Ryan: {",
+        "    age: 19,",
+        "    online: true",
+        "  }",
+        "};",
+        "",
+        "function isEveryoneHere(obj) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "}",
+        "",
+        "console.log(isEveryoneHere(users));"
+      ],
+      "tests": [
+        "assert('Alan' in users && 'Jeff' in users && 'Sarah' in users && 'Ryan' in users && Object.keys(users).length === 4, 'message: The <code>users</code> object only contains the keys <code>Alan</code>, <code>Jeff</code>, <code>Sarah</code>, and <code>Ryan</code>');",
+        "assert(isEveryoneHere(users) === true, 'message: The function <code>isEveryoneHere</code> returns <code>true</code> if <code>Alan</code>, <code>Jeff</code>, <code>Sarah</code>, and <code>Ryan</code> are properties on the <code>users</code> object');",
+        "assert((function() { delete users.Alan; delete users.Jeff; delete users.Sarah; delete users.Ryan; return isEveryoneHere(users) })() === false, 'message: The function <code>isEveryoneHere</code> returns <code>false</code> if <code>Alan</code>, <code>Jeff</code>, <code>Sarah</code>, and <code>Ryan</code> are not properties on the <code>users</code> object');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7d367417b2b2512b1d",
+      "title": " Iterate Through the Keys of an Object with a for...in Statement",
+      "description": [
+        "Sometimes you may need to iterate through all the keys within an object. This requires a specific syntax in JavaScript called a <dfn>for...in</dfn> statement. For our <code>users</code> object, this could look like:",
+        "<blockquote>for (let user in users) {<br>  console.log(user);<br>};<br><br>// logs:<br>Alan<br>Jeff<br>Sarah<br>Ryan</blockquote>",
+        "In this statement, we defined a variable <code>user</code>, and as you can see, this variable was reset during each iteration to each of the object's keys as the statement looped through the object, resulting in each user's name being printed to the console.",
+        "<strong>NOTE:</strong><br>Objects do not maintain an ordering to stored keys like arrays do; thus a keys position on an object, or the relative order in which it appears, is irrelevant when referencing or accessing that key.",
+        "<hr>",
+        "We've defined a function, <code>countOnline</code>; use a <dfn>for...in</dfn> statement within this function to loop through the users in the <code>users</code> object and return the number of users whose <code>online</code> property is set to <code>true</code>."
+      ],
+      "challengeSeed": [
+        "let users = {",
+        "  Alan: {",
+        "    age: 27,",
+        "    online: false",
+        "  },",
+        "  Jeff: {",
+        "    age: 32,",
+        "    online: true",
+        "  },",
+        "  Sarah: {",
+        "    age: 48,",
+        "    online: false",
+        "  },",
+        "  Ryan: {",
+        "    age: 19,",
+        "    online: true",
+        "  }",
+        "};",
+        "",
+        "function countOnline(obj) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "}",
+        "",
+        "console.log(countOnline(users));"
+      ],
+      "tests": [
+        "assert(users.Alan.online === false && users.Jeff.online === true &&  users.Sarah.online === false &&  users.Ryan.online === true, 'message: The <code>users</code> object contains users <code>Jeff</code> and <code>Ryan</code> with <code>online</code> set to <code>true</code> and users <code>Alan</code> and <code>Sarah</code> with <code>online</code> set to <code>false</code>');",
+        "assert((function() { users.Harry = {online: true}; users.Sam = {online: true}; users.Carl = {online: true}; return countOnline(users) })() === 5, 'message: The function <code>countOnline</code> returns the number of users with the <code>online</code> property set to <code>true</code>');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7d367417b2b2512b1e",
+      "title": "Generate an Array of All Object Keys with Object.keys()",
+      "description": [
+        "We can also generate an array which contains all the keys stored in an object using the <code>Object.keys()</code> method and passing in an object as the argument. This will return an array with strings representing each property in the object. Again, there will be no specific order to the entries in the array.",
+        "<hr>",
+        "Finish writing the <code>getArrayOfUsers</code> function so that it returns an array containing all the properties in the object it receives as an argument."
+      ],
+      "challengeSeed": [
+        "let users = {",
+        "  Alan: {",
+        "    age: 27,",
+        "    online: false",
+        "  },",
+        "  Jeff: {",
+        "    age: 32,",
+        "    online: true",
+        "  },",
+        "  Sarah: {",
+        "    age: 48,",
+        "    online: false",
+        "  },",
+        "  Ryan: {",
+        "    age: 19,",
+        "    online: true",
+        "  }",
+        "};",
+        "",
+        "function getArrayOfUsers(obj) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "}",
+        "",
+        "console.log(getArrayOfUsers(users));"
+      ],
+      "tests": [
+        "assert('Alan' in users && 'Jeff' in users && 'Sarah' in users && 'Ryan' in users && Object.keys(users).length === 4, 'message: The <code>users</code> object only contains the keys <code>Alan</code>, <code>Jeff</code>, <code>Sarah</code>, and <code>Ryan</code>');",
+        "assert((function() { users.Sam = {}; users.Lewis = {}; let R = getArrayOfUsers(users); return (R.indexOf('Alan') !== -1 && R.indexOf('Jeff') !== -1 && R.indexOf('Sarah') !== -1 && R.indexOf('Ryan') !== -1 && R.indexOf('Sam') !== -1 && R.indexOf('Lewis') !== -1); })() === true, 'message: The <code>getArrayOfUsers</code> function returns an array which contains all the keys in the <code>users</code> object');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b7d367417b2b2512b1f",
+      "title": "Modify an Array Stored in an Object",
+      "description": [
+        "Now you've seen all the basic operations for JavaScript objects. You can add, modify, and remove key-value pairs, check if keys exist, and iterate over all the keys in an object. As you continue learning JavaScript you will see even more versatile applications of objects. Additionally, the optional Advanced Data Structures lessons later in the curriculum also cover the ES6 <dfn>Map</dfn> and <dfn>Set</dfn> objects, both of which are similar to ordinary objects but provide some additional features. Now that you've learned the basics of arrays and objects, you're fully prepared to begin tackling more complex problems using JavaScript!",
+        "<hr>",
+        "Take a look at the object we've provided in the code editor. The <code>user</code> object contains three keys. The <code>data</code> key contains four keys, one of which contains an array of <code>friends</code>. From this, you can see how flexible objects are as data structures. We've started writing a function <code>addFriend</code>. Finish writing it so that it takes a <code>user</code> object and adds the name of the <code>friend</code> argument to the array stored in <code>user.data.friends</code> and returns that array."
+      ],
+      "challengeSeed": [
+        "let user = {",
+        "  name: 'Kenneth',",
+        "  age: 28,",
+        "  data: {",
+        "    username: 'kennethCodesAllDay',",
+        "    joinDate: 'March 26, 2016',",
+        "    organization: 'freeCodeCamp',",
+        "    friends: [",
+        "      'Sam',",
+        "      'Kira',",
+        "      'Tomo'",
+        "    ],",
+        "    location: {",
+        "      city: 'San Francisco',",
+        "      state: 'CA',",
+        "      country: 'USA'",
+        "    }",
+        "  }",
+        "};",
+        "",
+        "function addFriend(userObj, friend) {",
+        "  // change code below this line  ",
+        "",
+        "  // change code above this line",
+        "}",
+        "",
+        "console.log(addFriend(user, 'Pete'));"
+      ],
+      "tests": [
+        "assert('name' in user && 'age' in user && 'data' in user, 'message: The <code>user</code> object has <code>name</code>, <code>age</code>, and <code>data</code> keys');",
+        "assert((function() { let L1 = user.data.friends.length; addFriend(user, 'Sean'); let L2 = user.data.friends.length; return (L2 === L1 + 1); })(), 'message: The <code>addFriend</code> function accepts a <code>user</code> object and a <code>friend</code> string as arguments and adds the friend to the array of <code>friends</code> in the <code>user</code> object');",
+        "assert.deepEqual((function() { delete user.data.friends; user.data.friends = ['Sam', 'Kira', 'Tomo']; return addFriend(user, 'Pete') })(), ['Sam', 'Kira', 'Tomo', 'Pete'], 'message: <code>addFriend(user, \"Pete\")</code> should return <code>[\"Sam\", \"Kira\", \"Tomo\", \"Pete\"]</code>');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-javascript.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-javascript.json
new file mode 100644
index 0000000000..569667685b
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/basic-javascript.json
@@ -0,0 +1,5690 @@
+{
+  "name": "Basic JavaScript",
+  "time": "10 hours",
+  "order": 1,
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "id": "bd6123c9c441eddfaeb4bdef",
+      "title": "Introduction to JavaScript",
+      "description": [
+        [
+          "https://upload.wikimedia.org/wikipedia/commons/thumb/6/6a/JavaScript-logo.png/480px-JavaScript-logo.png",
+          "A yellow square with the letters, JS, in the bottom right to represent the JS logo",
+          "JavaScript (JS) is a high-level programming language that all modern web browsers support. It is also one of the core technologies of the web, along with HTML and CSS that you may have learned previously. This section will cover basic programming concepts in JavaScript, which range from variables and arithemtic to objects and loops."
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "bd7123c9c441eddfaeb4bdef",
+      "title": "Comment Your JavaScript Code",
+      "description": [
+        "Comments are lines of code that JavaScript will intentionally ignore. Comments are a great way to leave notes to yourself and to other people who will later need to figure out what that code does.",
+        "There are two ways to write comments in JavaScript:",
+        "Using <code>//</code> will tell JavaScript to ignore the remainder of the text on the current line:",
+        "<blockquote>// This is an in-line comment.</blockquote>",
+        "You can make a multi-line comment beginning with <code>/*</code> and ending with <code>*/</code>:",
+        "<blockquote>/* This is a <br>   multi-line comment */</blockquote>",
+        "<strong>Best Practice</strong><br>As you write code, you should regularly add comments to clarify the function of parts of your code. Good commenting can help communicate the intent of your code&mdash;both for others <em>and</em> for your future self.",
+        "<hr>",
+        "Try creating one of each type of comment."
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "solutions": [
+        "// Fake Comment\n/* Another Comment */"
+      ],
+      "tests": [
+        "assert(code.match(/(\\/\\/)...../g), 'message: Create a <code>//</code> style comment that contains at least five letters.');",
+        "assert(code.match(/(\\/\\*)([^\\*\\/]{5,})(?=\\*\\/)/gm), 'message: Create a <code>/* */</code> style comment that contains at least five letters.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Agrega comentarios a tu código JavaScript",
+          "description": [
+            "Los comentarios son líneas de código que el computador ignorará intencionalmente. Los comentarios son una gran forma de dejarte notas a ti mismo y a otras personas que luego tendrán que averiguar lo que hace que el código. ",
+            "Vamos a echar un vistazo a las dos maneras en las que puedes agregar tus comentarios en JavaScript.",
+            "El comentario de doble barra comentará el resto del texto en la línea donde se ubica:",
+            "<code>// Este es un comentario.</code>",
+            "El comentario de barra-estrella-estrella-barra, comentará todo lo que haya entre los caracteres <code>/*</code> y <code>*/</code>:",
+            "<code>/* Este es también un comentario */</code>",
+            "Trata de crear uno de cada uno."
+          ]
+        },
+        "fr": {
+          "title": "Commentez votre code JavaScript",
+          "description": [
+            "Les commentaires sont des lignes de code que Javascript va intentionnellement ignorer. Les commentaires sont un bon moyen de laisser des notes à votre intention ou pour d'autres personnes qui devront comprendre ce que fait votre code.",
+            "Il y a deux façons d'écrire des commentaires en JavaScript.",
+            "Utiliser <code>//</code> indiquera à JavaScript d'ignorer le reste du texte sur cette même ligne:",
+            "<code>// Voici un commentaire sur une ligne.</code>",
+            "Vous pouvez commenter plusieurs lignes en commençant par <code>/*</code> et en finissant par <code>*/</code>:",
+            "<code>/*Voici un commentaire <br>   sur plusieurs lignes */</code>",
+            "<strong>Conseils</strong>",
+            "Lorsque vous écrivez votre code, vous devriez ajouter régulièrement des commentaires pour clarifier l'objectif de certaines parties de votre code. De bons commentaires peuvent aider les autres <em>et</em> vous-même à mieux comprendre votre code.",
+            "<hr>",
+            "Essayez de créer un commentaire de chaque type."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c443eddfaeb5bdef",
+      "title": "Declare JavaScript Variables",
+      "description": [
+        "In computer science, <dfn>data</dfn> is anything that is meaningful to the computer. JavaScript provides seven different <dfn>data types</dfn> which are <code>undefined</code>, <code>null</code>, <code>boolean</code>, <code>string</code>, <code>symbol</code>, <code>number</code>, and <code>object</code>.",
+        "For example, computers distinguish between numbers, such as the number <code>12</code>, and <code>strings</code>, such as <code>\"12\"</code>, <code>\"dog\"</code>, or <code>\"123 cats\"</code>, which are collections of characters. Computers can perform mathematical operations on a number, but not on a string.",
+        "<dfn>Variables</dfn> allow computers to store and manipulate data in a dynamic fashion. They do this by using a \"label\" to point to the data rather than using the data itself. Any of the seven data types may be stored in a variable.",
+        "<code>Variables</code> are similar to the x and y variables you use in mathematics, which means they're a simple name to represent the data we want to refer to. Computer <code>variables</code> differ from mathematical variables in that they can store different values at different times.",
+        "We tell JavaScript to create or <dfn>declare</dfn> a variable by putting the keyword <code>var</code> in front of it, like so:",
+        "<blockquote>var ourName;</blockquote>",
+        "creates a <code>variable</code> called <code>ourName</code>. In JavaScript we end statements with semicolons.",
+        "<code>Variable</code> names can be made up of numbers, letters, and <code>$</code> or <code>_</code>, but may not contain spaces or start with a number.",
+        "<hr>",
+        "Use the <code>var</code> keyword to create a variable called <code>myName</code>.",
+        "<strong>Hint</strong><br>Look at the <code>ourName</code> example if you get stuck."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourName;",
+        "",
+        "// Declare myName below this line",
+        ""
+      ],
+      "tail": [
+        "if(typeof myName !== \"undefined\"){(function(v){return v;})(myName);}"
+      ],
+      "solutions": [
+        "var myName;"
+      ],
+      "tests": [
+        "assert(/var\\s+myName\\s*;/.test(code), 'message: You should declare <code>myName</code> with the <code>var</code> keyword, ending with a semicolon');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Declara variables en JavaScript",
+          "description": [
+            "Cuando almacenamos datos en una <code>estructura de datos</code>, la llamamos una <code>variable</code>. Estas variables no son diferentes de las variables x e y que utilizas en matemáticas. ",
+            "Vamos a crear nuestra primera variable y a llamarla \"myName\".",
+            "Te darás cuenta que en <code>myName</code>, no usamos un espacio, y que la \" N\"se escribe con mayúscula. Las variables en JavaScript se escriben con <code>capitalización camello (camel case)</code>. Un ejemplo de capitalización camello: capitalizacionCamello.",
+            "Ahora, utiliza la palabra clave <code>var</code> para crear una variable llamada <code>myName</code>. Establecele como valor tu nombre, entre comillas dobles. ",
+            "Mira el ejemplo con <code>ourName</code> si te quedas atascado."
+          ]
+        },
+        "fr": {
+          "title": "Déclarer des variables en JavaScript",
+          "description": [
+            "En informatique, une <dfn>donnée</dfn> comporte tout ce qui peut avoir du sens pour l'ordinateur. Javascript dispose de sept <code>types de données</code> différents qui sont <code>undefined</code>, <code>null</code>, <code>boolean</code>, <code>string</code>, <code>symbol</code>, <code>number</code> et <code>object</code>.",
+            "Par exemple, les ordinateurs font la différence entre les nombres tel que <code>12</code> et les <code>strings</code>, tels que <code>\"12\"</code>, <code>\"dog\"</code>, ou <code>\"123 cats\"</code>, qui sont des collections de caractères. Les ordinateurs peuvent faire des opérations mathématiques sur un nombre, mais pas sur une chaîne de caractères.",
+            "Les <dfn>variables</dfn> permettent aux ordinateurs de stocker et manipuler les données de façon dynamique. Ils font cela en utilisant un <blockquote>label</blockquote> qui réfère à la donnée plutôt que d'utiliser la donnée elle-même. Les sept types de données peuvent être stockés dans une variable.",
+            "Les <code>variables</code> sont similaires aux x et y que vous utilisez en mathématiques, ce qui veut dire que ce sont des noms simples qui représentent les données que l'on veut utiliser. Les <code>variables</code> de l'ordinateur diffèrent de celles des mathématiques car elles peuvent stocker différentes valeurs à différents moments.",
+            "On peut dire à JavaScript de créer ou <code>déclarer</code> une variable en la précédant du mot-clé <code>var</code>, comme ceci:",
+            "<code>var notreNom</code>;",
+            "crée une <code>variable</code> appelée <code>notreNom</code>.On termine nos expressions avec un point virgule en JavaScript.",
+            "Le nom d'une <code>variable</code> peut être composé de nombres, lettres et <code>$</code> ou <code>_</code>, mais ne peut contenir d'espaces ou commencer par un nombre.",
+            "<hr>",
+            "Utilisez le mot-clé <code>var</code> pour créer une variable appelée <code>monNom</code>",
+            "<strong>Conseil</strong><br>Regardez à l'exemple de <code>notreNom</code> si vous vous êtes bloqué."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244a8",
+      "title": "Storing Values with the Assignment Operator",
+      "description": [
+        "In JavaScript, you can store a value in a variable with the <dfn>assignment</dfn> operator.",
+        "<code>myVariable = 5;</code>",
+        "This assigns the <code>Number</code> value <code>5</code> to <code>myVariable</code>.",
+        "Assignment always goes from right to left. Everything to the right of the <code>=</code> operator is resolved before the value is assigned to the variable to the left of the operator.",
+        "<blockquote>myVar = 5;<br>myNum = myVar;</blockquote>",
+        "This assigns <code>5</code> to <code>myVar</code> and then resolves <code>myVar</code> to <code>5</code>  again and assigns it to <code>myNum</code>.",
+        "<hr>",
+        "Assign the value <code>7</code> to variable <code>a</code>.",
+        "Assign the contents of <code>a</code> to variable <code>b</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "head": [
+        "if (typeof a != 'undefined') {",
+        "  a = undefined;",
+        "}",
+        "if (typeof b != 'undefined') {",
+        "  b = undefined;",
+        "}"
+      ],
+      "challengeSeed": [
+        "// Setup",
+        "var a;",
+        "var b = 2;",
+        "",
+        "// Only change code below this line",
+        ""
+      ],
+      "tail": [
+        "(function(a,b){return \"a = \" + a + \", b = \" + b;})(a,b);"
+      ],
+      "solutions": [
+        "var a;\nvar b = 2;\na = 7;\nb = a;"
+      ],
+      "tests": [
+        "assert(/var a;/.test(code) && /var b = 2;/.test(code), 'message: Do not change code above the line');",
+        "assert(typeof a === 'number' && a === 7, 'message: <code>a</code> should have a value of 7');",
+        "assert(typeof b === 'number' && b === 7, 'message: <code>b</code> should have a value of 7');",
+        "assert(/b\\s*=\\s*a\\s*;/g.test(code), 'message: <code>a</code> should be assigned to <code>b</code> with <code>=</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Almacenar valores con el operador igual",
+          "description": [
+            "En JavaScript, puedes almacenar un valor en una variable con la <dfn>asignación</dfn> o con el operador <code>igual</code> (<code>=</code>).",
+            "<code>miVariable = 5;</code>",
+            "Asigna el valor <code>númerico</code> de <code>5</code> a <code>miVariable</code>.",
+            "La asignación siempre va de derecha a izquierda. Todo a la derecha del operador <code>=</code> es resuelto antes que el valor es asignado a la variable a la izquierda del operador.",
+            "<blockquote>miVar = 5;<br>miNum = miVar;</blockquote>",
+            "Asigna <code>5</code> a <code>miVar</code> y entonces resuelve <code>miVar</code> a <code>5</code> otra vez y asigna esta a <code>miNum</code>.",
+            "<h4>Instrucciones</h4>",
+            "Asigna el valor <code>7</code> a la variable <code>a</code>.",
+            "Asigna el contenido de <code>a</code> a la variable <code>b</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244a9",
+      "title": "Initializing Variables with the Assignment Operator",
+      "description": [
+        "It is common to <dfn>initialize</dfn> a variable to an initial value in the same line as it is declared.",
+        "<code>var myVar = 0;</code>",
+        "Creates a new variable called <code>myVar</code> and assigns it an initial value of <code>0</code>.",
+        "<hr>",
+        "Define a variable <code>a</code> with <code>var</code> and initialize it to a value of <code>9</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var ourVar = 19;",
+        "",
+        "// Only change code below this line",
+        ""
+      ],
+      "tail": [
+        "if(typeof a !== 'undefined') {(function(a){return \"a = \" + a;})(a);} else { (function() {return 'a is undefined';})(); }"
+      ],
+      "solutions": [
+        "var a = 9;"
+      ],
+      "tests": [
+        "assert(/var\\s+a\\s*=\\s*9\\s*/.test(code), 'message: Initialize <code>a</code> to a value of <code>9</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Inicializar variables con el operador igual",
+          "description": [
+            "Es común <dfn>inicializar</dfn> una variable a un valor inicial en la misma línea que es declarada.",
+            "<code>var miVar = 0;</code>",
+            "Crea una nueva variable llamada <code>miVar</code> y le asigna un valor inicial de <code>0</code>.",
+            "<h4>Instrucciones</h4>",
+            "Define una variable <code>a</code> con <code>var</code> e inicializala a un valor de <code>9</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244aa",
+      "title": "Understanding Uninitialized Variables",
+      "description": [
+        "When JavaScript variables are declared, they have an initial value of <code>undefined</code>. If you do a mathematical operation on an <code>undefined</code> variable your result will be <code>NaN</code> which means <dfn>\"Not a Number\"</dfn>. If you concatenate a string with an <code>undefined</code> variable, you will get a literal <dfn>string</dfn> of <code>\"undefined\"</code>.",
+        "<hr>",
+        "Initialize the three variables <code>a</code>, <code>b</code>, and <code>c</code> with <code>5</code>, <code>10</code>, and <code>\"I am a\"</code> respectively so that they will not be <code>undefined</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Initialize these three variables",
+        "var a;",
+        "var b;",
+        "var c;",
+        "",
+        "// Do not change code below this line",
+        "",
+        "a = a + 1;",
+        "b = b + 5;",
+        "c = c + \" String!\";",
+        ""
+      ],
+      "tail": [
+        "(function(a,b,c){ return \"a = \" + a + \", b = \" + b + \", c = '\" + c + \"'\"; })(a,b,c);"
+      ],
+      "solutions": [
+        "var a = 5;\nvar b = 10;\nvar c = \"I am a\";\na = a + 1;\nb = b + 5;\nc = c + \" String!\";"
+      ],
+      "tests": [
+        "assert(typeof a === 'number' && a === 6, 'message: <code>a</code> should be defined and evaluated to have the value of <code>6</code>');",
+        "assert(typeof b === 'number' && b === 15, 'message: <code>b</code> should be defined and evaluated to have the value of <code>15</code>');",
+        "assert(!/undefined/.test(c) && c === \"I am a String!\", 'message: <code>c</code> should not contain <code>undefined</code> and should have a value of \"I am a String!\"');",
+        "assert(/a = a \\+ 1;/.test(code) && /b = b \\+ 5;/.test(code) && /c = c \\+ \" String!\";/.test(code), 'message: Do not change code below the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Entendiendo variables sin inicializar",
+          "description": [
+            "Cuando las variables de JavaScript son declaradas, ellas tienen un valor inicial de <code>undefined</code>. Si tu haces una operación matematica sobre una variable <code>undefined</code> tu resultado sera <code>NaN</code> el cual significa <dfn>\"Not a Number\"</dfn> es decir \"No es un número\". Si tu concatenas una cadena con una variable <code>undefined</code>, vas a obtener una <dfn>cadena</dfn> literal de <code>\"undefined\"</code>.",
+            "<h4>Instrucciones</h4>",
+            "Inicializa las tres variables <code>a</code>, <code>b</code>, y <code>c</code> con <code>5</code>, <code>10</code>, y <code>\"I am a\"</code> respectivamente de manera que no sean <code>undefined</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ab",
+      "title": "Understanding Case Sensitivity in Variables",
+      "description": [
+        "In JavaScript all variables and function names are case sensitive. This means that capitalization matters.",
+        "<code>MYVAR</code> is not the same as <code>MyVar</code> nor <code>myvar</code>. It is possible to have multiple distinct variables with the same name but different casing. It is strongly recommended that for the sake of clarity, you <em>do not</em> use this language feature.",
+        "<h4>Best Practice</h4>",
+        "Write variable names in Javascript in <dfn>camelCase</dfn>. In <dfn>camelCase</dfn>, multi-word variable names have the first word in lowercase and the first letter of each subsequent word is capitalized.",
+        "<strong>Examples:</strong>",
+        "<blockquote>var someVariable;<br>var anotherVariableName;<br>var thisVariableNameIsTooLong;</blockquote>",
+        "<hr>",
+        "Modify the existing declarations and assignments so their names use <dfn>camelCase</dfn>.<br>Do not create any new variables."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Declarations",
+        "var StUdLyCapVaR;",
+        "var properCamelCase;",
+        "var TitleCaseOver;",
+        "",
+        "// Assignments",
+        "STUDLYCAPVAR = 10;",
+        "PRoperCAmelCAse = \"A String\";",
+        "tITLEcASEoVER = 9000;"
+      ],
+      "solutions": [
+        "var studlyCapVar;\nvar properCamelCase;\nvar titleCaseOver;\n\nstudlyCapVar = 10;\nproperCamelCase = \"A String\";\ntitleCaseOver = 9000;"
+      ],
+      "tests": [
+        "assert(typeof studlyCapVar !== 'undefined' && studlyCapVar === 10, 'message: <code>studlyCapVar</code> is defined and has a value of <code>10</code>');",
+        "assert(typeof properCamelCase !== 'undefined' && properCamelCase === \"A String\", 'message: <code>properCamelCase</code> is defined and has a value of <code>\"A String\"</code>');",
+        "assert(typeof titleCaseOver !== 'undefined' && titleCaseOver === 9000, 'message: <code>titleCaseOver</code> is defined and has a value of <code>9000</code>');",
+        "assert(code.match(/studlyCapVar/g).length === 2, 'message: <code>studlyCapVar</code> should use camelCase in both declaration and assignment sections.');",
+        "assert(code.match(/properCamelCase/g).length === 2, 'message: <code>properCamelCase</code> should use camelCase in both declaration and assignment sections.');",
+        "assert(code.match(/titleCaseOver/g).length === 2, 'message: <code>titleCaseOver</code> should use camelCase in both declaration and assignment sections.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Entendiendo la distinción en variables",
+          "description": [
+            "En JavaScript todas las variables y nombres de funciones distinguen entre mayúsculas y minúsculas. Esto significa que la capitalización importa.",
+            "<code>MIVAR</code> no es lo mismo que <code>MiVar</code> o <code>mivar</code>. Esto hace posible tener múltiples variables distintas con el mismo nombre pero de diferente manera. Es fuertemente recomendado por el bien de la claridad, que tu <em>no</em> uses esta característica del lenguaje.",
+            "<h4>Mejor Práctica</h4>",
+            "Escribe nombres de variables en Javascript en <dfn>capitalizaciónCamello (camelCase)</dfn>. En <dfn>capitalizaciónCamello</dfn>, los nombres de variables con múltiples palabras tienen la primera palabra en minúsculas y la primera letra de cada palabra subsecuente es capitalizada.",
+            "<strong>Ejemplos:</strong>",
+            "<blockquote>var algunaVariable;<br>var otraVariable;<br>var esteNombreDeVariableEsMuyLargo;</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Repara las declaraciones y asignaciones de variables de manera que sus nombres usen <dfn>capitalizaciónCamello</dfn>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb3bdef",
+      "title": "Add Two Numbers with JavaScript",
+      "description": [
+        "<code>Number</code> is a data type in JavaScript which represents numeric data.",
+        "Now let's try to add two numbers using JavaScript.",
+        "JavaScript uses the <code>+</code> symbol as addition operation when placed between two numbers.",
+        "<strong>Example</strong>",
+        "<blockquote>myVar = 5 + 10; // assigned 15</blockquote>",
+        "<hr>",
+        "Change the <code>0</code> so that sum will equal <code>20</code>."
+      ],
+      "challengeSeed": [
+        "var sum = 10 + 0;",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'sum = '+z;})(sum);"
+      ],
+      "solutions": [
+        "var sum = 10 + 10;"
+      ],
+      "tests": [
+        "assert(sum === 20, 'message: <code>sum</code> should equal <code>20</code>');",
+        "assert(/\\+/.test(code), 'message: Use the <code>+</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Suma dos números con JavaScript",
+          "description": [
+            "Intentemos sumar dos números con JavaScript.",
+            "JavaScript utiliza el símbolo <code>+</code> para la adición.",
+            "Cambie el <code>0</code> para que la suma seá igual a <code>20</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb4bdef",
+      "title": "Subtract One Number from Another with JavaScript",
+      "description": [
+        "We can also subtract one number from another.",
+        "JavaScript uses the <code>-</code> symbol for subtraction.",
+        "",
+        "<strong>Example</strong>",
+        "<blockquote>myVar = 12 - 6; // assigned 6</blockquote>",
+        "",
+        "<hr>",
+        "Change the <code>0</code> so the difference is <code>12</code>."
+      ],
+      "challengeSeed": [
+        "var difference = 45 - 0;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'difference = '+z;})(difference);"
+      ],
+      "solutions": [
+        "var difference = 45 - 33;"
+      ],
+      "tests": [
+        "assert(difference === 12, 'message: Make the variable <code>difference</code> equal 12.');",
+        "assert(/var\\s*difference\\s*=\\s*45\\s*-\\s*33;?/.test(code),'message: Only subtract one number from 45.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Resta un número de otro con JavaScript",
+          "description": [
+            "También podemos restar un número de otro.",
+            "JavaScript utiliza el símbolo <code>-</code> de sustracción",
+            "Cambia el <code>0</code> para que la diferencia sea <code>12</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1231c1c11feddfaeb5bdef",
+      "title": "Multiply Two Numbers with JavaScript",
+      "description": [
+        "We can also multiply one number by another.",
+        "JavaScript uses the <code>*</code> symbol for multiplication of two numbers.",
+        "",
+        "<strong>Example</strong>",
+        "<blockquote>myVar = 13 * 13; // assigned 169</blockquote>",
+        "",
+        "<hr>",
+        "Change the <code>0</code> so that product will equal <code>80</code>."
+      ],
+      "challengeSeed": [
+        "var product = 8 * 0;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'product = '+z;})(product);"
+      ],
+      "solutions": [
+        "var product = 8 * 10;"
+      ],
+      "tests": [
+        "assert(product === 80,'message: Make the variable <code>product</code> equal 80');",
+        "assert(/\\*/.test(code), 'message: Use the <code>*</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Multiplica dos números con JavaScript",
+          "description": [
+            "También podemos multiplicar un número por otro.",
+            "JavaScript utiliza el símbolo <code>*</code> de la multiplicación.",
+            "Cambie el <code>0</code> para que el producto sea igual a <code>80</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb6bdef",
+      "title": "Divide One Number by Another with JavaScript",
+      "description": [
+        "We can also divide one number by another.",
+        "JavaScript uses the <code>/</code> symbol for division.",
+        "",
+        "<strong>Example</strong>",
+        "<blockquote>myVar = 16 / 2; // assigned 8</blockquote>",
+        "",
+        "<hr>",
+        "Change the <code>0</code> so that the <code>quotient</code> is equal to <code>2</code>."
+      ],
+      "challengeSeed": [
+        "var quotient = 66 / 0;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'quotient = '+z;})(quotient);"
+      ],
+      "solutions": [
+        "var quotient = 66 / 33;"
+      ],
+      "tests": [
+        "assert(quotient === 2, 'message: Make the variable <code>quotient</code> equal to 2.');",
+        "assert(/\\d+\\s*\\/\\s*\\d+/.test(code), 'message: Use the <code>/</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Divide un número por otro con JavaScript",
+          "description": [
+            "También podemos dividir un número por otro.",
+            "JavaScript utiliza el símbolo <code>/</code> para dividir.",
+            "Cambia el <code>0</code> para que el cociente sea igual a <code>2</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ac",
+      "title": "Increment a Number with JavaScript",
+      "description": [
+        "You can easily <dfn>increment</dfn> or add one to a variable with the <code>++</code> operator.",
+        "<code>i++;</code>",
+        "is the equivalent of",
+        "<code>i = i + 1;</code>",
+        "<strong>Note</strong><br>The entire line becomes <code>i++;</code>, eliminating the need for the equal sign.",
+        "<hr>",
+        "Change the code to use the <code>++</code> operator on <code>myVar</code>.",
+        "<strong>Hint</strong><br>Learn more about <a href=\"https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Operators/Arithmetic_Operators#Increment_()\" target=\"_blank\">Arithmetic operators - Increment (++)</a>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myVar = 87;",
+        "",
+        "// Only change code below this line",
+        "myVar = myVar + 1;",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'myVar = ' + z;})(myVar);"
+      ],
+      "solutions": [
+        "var myVar = 87;\nmyVar++;"
+      ],
+      "tests": [
+        "assert(myVar === 88, 'message: <code>myVar</code> should equal <code>88</code>');",
+        "assert(/myVar\\s*\\=.*myVar\\s*\\+\\s*1/.test(code) === false, 'message: <code>myVar = myVar + 1;</code> should be changed');",
+        "assert(/[+]{2}\\s*myVar|myVar\\s*[+]{2}/.test(code), 'message: Use the <code>++</code> operator');",
+        "assert(/var myVar = 87;/.test(code), 'message: Do not change code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Incrementa un número con JavaScript",
+          "description": [
+            "Tu puedes fácilmente <dfn>incrementar</dfn> o agregar uno a una variable con el operador <code>++</code>.",
+            "<code>i++</code>",
+            "es el equivalente de",
+            "<code>i = i + 1;</code>",
+            "<strong>Nota</strong><br>Toda la línea equivale a <code>i++</code>, sin necesidad del signo igual.",
+            "<h4>Instrucciones</h4>",
+            "Cambia el código para usar el operador <code>++</code> sobre <code>myVar</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ad",
+      "title": "Decrement a Number with JavaScript",
+      "description": [
+        "You can easily <dfn>decrement</dfn> or decrease a variable by one with the <code>--</code> operator.",
+        "<code>i--;</code>",
+        "is the equivalent of",
+        "<code>i = i - 1;</code>",
+        "<strong>Note</strong><br>The entire line becomes <code>i--;</code>, eliminating the need for the equal sign.",
+        "<hr>",
+        "Change the code to use the <code>--</code> operator on <code>myVar</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myVar = 11;",
+        "",
+        "// Only change code below this line",
+        "myVar = myVar - 1;",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'myVar = ' + z;})(myVar);"
+      ],
+      "solutions": [
+        "var myVar = 11;\nmyVar--;"
+      ],
+      "tests": [
+        "assert(myVar === 10, 'message: <code>myVar</code> should equal <code>10</code>');",
+        "assert(/[-]{2}\\s*myVar|myVar\\s*[-]{2}/.test(code), 'message: Use the <code>--</code> operator on <code>myVar</code>');",
+        "assert(/var myVar = 11;/.test(code), 'message: Do not change code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Decrementar un número con JavaScript",
+          "description": [
+            "Fácilmente puedes <dfn>decrementar</dfn> o disminuir una variable por uno con el operador <code>--</code>.",
+            "<code>i--;</code>",
+            "es el equivalente a",
+            "<code>i = i - 1;</code>",
+            "<strong>Nota</strong><br>Toda la línea equivale a <code>i--;</code>, sin necesidad del signo igual.",
+            "<h4>Instrucciones</h4>",
+            "Cambia el código para usar el operador <code>--</code> en <code>myVar</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1391c1c11feddfaeb4bdef",
+      "title": "Create Decimal Numbers with JavaScript",
+      "description": [
+        "We can store decimal numbers in variables too. Decimal numbers are sometimes referred to as <dfn>floating point</dfn> numbers or <dfn>floats</dfn>.",
+        "<strong>Note</strong><br>Not all real numbers can accurately be represented in <dfn>floating point</dfn>. This can lead to rounding errors. <a href=\"https://en.wikipedia.org/wiki/Floating_point#Accuracy_problems\" target=\"_blank\">Details Here</a>.",
+        "<hr>",
+        "Create a variable <code>myDecimal</code> and give it a decimal value with a fractional part (e.g. <code>5.7</code>)."
+      ],
+      "challengeSeed": [
+        "var ourDecimal = 5.7;",
+        "",
+        "// Only change code below this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){if(typeof myDecimal !== \"undefined\"){return myDecimal;}})();"
+      ],
+      "solutions": [
+        "var myDecimal = 9.9;"
+      ],
+      "tests": [
+        "assert(typeof myDecimal === \"number\", 'message: <code>myDecimal</code> should be a number.');",
+        "assert(myDecimal % 1 != 0, 'message: <code>myDecimal</code> should have a decimal point'); "
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Crea números decimales con JavaScript",
+          "description": [
+            "Podemos almacenar números decimales en variables también. Los números decimales a veces son referidos como números de <dfn>punto flotante</dfn> o <dfn>flotantes</dfn>.",
+            "<strong>Nota</strong><br>No todos los números reales pueden ser exactamente representados en <dfn>punto flotante</dfn>. Esto puede conducir a errores de redondeo. <a href=\"https://en.wikipedia.org/wiki/Floating_point#Accuracy_problems\" target=\"_blank\">Detalles aquí</a>.",
+            "<h4>Instrucciones</h4>",
+            "Crea una variable <code>myDecimal</code> y dale un valor decimal con una parte fraccional (p.e. <code>5.7</code>)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7993c9c69feddfaeb7bdef",
+      "title": "Multiply Two Decimals with JavaScript",
+      "description": [
+        "In JavaScript, you can also perform calculations with decimal numbers, just like whole numbers.",
+        "Let's multiply two decimals together to get their product.",
+        "<hr>",
+        "Change the <code>0.0</code> so that product will equal <code>5.0</code>."
+      ],
+      "challengeSeed": [
+        "var product = 2.0 * 0.0;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(y){return 'product = '+y;})(product);"
+      ],
+      "solutions": [
+        "var product = 2.0 * 2.5;"
+      ],
+      "tests": [
+        "assert(product === 5.0, 'message: The variable <code>product</code> should equal <code>5.0</code>.');",
+        "assert(/\\*/.test(code), 'message: You should use the <code>*</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Multiplicar dos decimales con JavaScript",
+          "description": [
+            "En JavaScript, también puedes realizar cálculos con números decimales, al igual que con números enteros.",
+            "Vamos a multiplicar dos números decimales para obtener su producto.",
+            "<h4>Instrucciones</h4>",
+            "Cambia el <code>0.0</code> para que el producto sea igual a <code>5.0</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7993c9ca9feddfaeb7bdef",
+      "title": "Divide one Decimal by Another with JavaScript",
+      "description": [
+        "Now let's divide one decimal by another.",
+        "<hr>",
+        "Change the <code>0.0</code> so that <code>quotient</code> will equal to <code>2.2</code>."
+      ],
+      "challengeSeed": [
+        "var quotient = 0.0 / 2.0; // Fix this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(y){return 'quotient = '+y;})(quotient);"
+      ],
+      "solutions": [],
+      "tests": [
+        "assert(quotient === 2.2, 'message: The variable <code>quotient</code> should equal <code>2.2</code>');",
+        "assert(/4\\.40*\\s*\\/\\s*2\\.*0*/.test(code), 'message: You should use the <code>/</code> operator to divide 4.4 by 2');",
+        "assert(code.match(/quotient/g).length === 3, 'message: The quotient variable should only be assigned once');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Divide un número decimal por otro con JavaScript",
+          "description": [
+            "Ahora vamos a dividir un decimal por otro.",
+            "<h4>Instrucciones</h4>",
+            "Cambia el <code>0.0</code> para que tu cociente sea igual a <code>2.2</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ae",
+      "title": "Finding a Remainder in JavaScript",
+      "description": [
+        "The <dfn>remainder</dfn> operator <code>%</code> gives the remainder of the division of two numbers.",
+        "<strong>Example</strong>",
+        "<blockquote>5 % 2 = 1 because<br>Math.floor(5 / 2) = 2 (Quotient)<br>2 * 2 = 4<br>5 - 4 = 1 (Remainder)</blockquote>",
+        "<strong>Usage</strong><br>In mathematics, a number can be checked to be even or odd by checking the remainder of the division of the number by <code>2</code>.",
+        "<blockquote>17 % 2 = 1 (17 is Odd)<br>48 % 2 = 0 (48 is Even)</blockquote>",
+        "<strong>Note</strong><br>The <dfn>remainder</dfn> operator is sometimes incorrectly referred to as  the \"modulus\" operator. It is very similar to modulus, but does not work properly with negative numbers.",
+        "<hr>",
+        "Set <code>remainder</code> equal to the remainder of <code>11</code> divided by <code>3</code> using the <dfn>remainder</dfn> (<code>%</code>) operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Only change code below this line",
+        "",
+        "var remainder;",
+        ""
+      ],
+      "tail": [
+        "(function(y){return 'remainder = '+y;})(remainder);"
+      ],
+      "solutions": [
+        "var remainder =  11 % 3;"
+      ],
+      "tests": [
+        "assert(/var\\s+?remainder/.test(code), 'message: The variable <code>remainder</code> should be initialized');",
+        "assert(remainder === 2, 'message: The value of <code>remainder</code> should be <code>2</code>');",
+        "assert(/\\s+?remainder\\s*?=\\s*?.*%.*;/.test(code), 'message: You should use the <code>%</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Encontrar un cociente en JavaScript",
+          "description": [
+            "El operador <dfn>residuo</dfn> <code>%</code> da el residuo de la división de dos números.",
+            "<strong>Ejemplo</strong>",
+            "<blockquote>5 % 2 = 1 por que<br>Math.floor(5 / 2) = 2 (Cociente)<br>2 * 2 = 4<br>5 - 4 = 1 (Residuo)</blockquote>",
+            "<strong>Uso</strong><br>En matemáticas, se puede comprobar si un número es par o impar revisando en residuo de la división del número por <code>2</code>.",
+            "<blockquote>17 % 2 = 1 (17 es Impar)<br>48 % 2 = 0 (48 es Par)</blockquote>",
+            "<strong>Nota</strong><br>El operador <dfn>residuo</dfn> es a veces incorrectamente referenciado como el operador \"módulo\". Este es muy parecido a módulo, pero no trabaja apropiadamente con números negativos.",
+            "<h4>Instrucciones</h4>",
+            "Asigna <code>remainder</code> igual al residuo de <code>11</code> dividido por <code>3</code> usando el operador <dfn>residuo</dfn> (<code>%</code>)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244af",
+      "title": "Compound Assignment With Augmented Addition",
+      "description": [
+        "In programming, it is common to use assignments to modify the contents of a variable. Remember that everything to the right of the equals sign is evaluated first, so we can say:",
+        "<code>myVar = myVar + 5;</code>",
+        "to add <code>5</code> to <code>myVar</code>. Since this is such a common pattern, there are operators which do both a mathematical operation and assignment in one step.",
+        "One such operator is the <code>+=</code> operator.",
+        "<blockquote>var myVar = 1;<br>myVar += 5;<br>console.log(myVar); // Returns 6</blockquote>",
+        "<hr>",
+        "Convert the assignments for <code>a</code>, <code>b</code>, and <code>c</code> to use the <code>+=</code> operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var a = 3;",
+        "var b = 17;",
+        "var c = 12;",
+        "",
+        "// Only modify code below this line",
+        "",
+        "a = a + 12;",
+        "b = 9 + b;",
+        "c = c + 7;",
+        ""
+      ],
+      "tail": [
+        "(function(a,b,c){ return \"a = \" + a + \", b = \" + b + \", c = \" + c; })(a,b,c);"
+      ],
+      "solutions": [
+        "var a = 3;\nvar b = 17;\nvar c = 12;\n\na += 12;\nb += 9;\nc += 7;"
+      ],
+      "tests": [
+        "assert(a === 15, 'message: <code>a</code> should equal <code>15</code>');",
+        "assert(b === 26, 'message: <code>b</code> should equal <code>26</code>');",
+        "assert(c === 19, 'message: <code>c</code> should equal <code>19</code>');",
+        "assert(code.match(/\\+=/g).length === 3, 'message: You should use the <code>+=</code> operator for each variable');",
+        "assert(/var a = 3;/.test(code) && /var b = 17;/.test(code) && /var c = 12;/.test(code), 'message: Do not modify the code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Asignación con más",
+          "description": [
+            "En programación, es común usar asignaciones para modificar el contenido de una variable. Recuerda que todo lo de la derecha del signo igual es evaluado primero, así podemos decir que:",
+            "<code>miVar = miVar + 5;</code>",
+            "para agregar <code>5</code> a <code>miVar</code>. Dado que este es un patrón común, hay operadores que realizan tanto una operación matemática como una asignación en un paso.",
+            "Uno de tales operadores es el operador <code>+=</code>.",
+            "<code>miVar += 5;</code> añadirá <code>5</code> a <code>miVar</code>.",
+            "<h4>Instrucciones</h4>",
+            "Convierte las asignaciones para <code>a</code>, <code>b</code> y <code>c</code> usando el operador <code>+=</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b0",
+      "title": "Compound Assignment With Augmented Subtraction",
+      "description": [
+        "Like the <code>+=</code> operator, <code>-=</code> subtracts a number from a variable.",
+        "<code>myVar = myVar - 5;</code>",
+        "will subtract <code>5</code> from <code>myVar</code>. This can be rewritten as: ",
+        "<code>myVar -= 5;</code>",
+        "<hr>",
+        "Convert the assignments for <code>a</code>, <code>b</code>, and <code>c</code> to use the <code>-=</code> operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var a = 11;",
+        "var b = 9;",
+        "var c = 3;",
+        "",
+        "// Only modify code below this line",
+        "",
+        "a = a - 6;",
+        "b = b - 15;",
+        "c = c - 1;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(a,b,c){ return \"a = \" + a + \", b = \" + b + \", c = \" + c; })(a,b,c);"
+      ],
+      "solutions": [
+        "var a = 11;\nvar b = 9;\nvar c = 3;\n\na -= 6;\nb -= 15;\nc -= 1;\n\n"
+      ],
+      "tests": [
+        "assert(a === 5, 'message: <code>a</code> should equal <code>5</code>');",
+        "assert(b === -6, 'message: <code>b</code> should equal <code>-6</code>');",
+        "assert(c === 2, 'message: <code>c</code> should equal <code>2</code>');",
+        "assert(code.match(/-=/g).length === 3, 'message: You should use the <code>-=</code> operator for each variable');",
+        "assert(/var a = 11;/.test(code) && /var b = 9;/.test(code) && /var c = 3;/.test(code), 'message: Do not modify the code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Asignación con menos",
+          "description": [
+            "Al igual que el operador <code>+=</code>, <code>-=</code> substrae un número de una variable.",
+            "<code>miVar = miVar - 5;</code>",
+            "substraerá <code>5</code> de <code>miVar</code>. Esto puede ser reescrito como: ",
+            "<code>miVar -= 5;</code>",
+            "<h4>Instrucciones</h4>",
+            "Convierte las asignaciones para <code>a</code>, <code>b</code>, y <code>c</code> para usar el operador <code>-=</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b1",
+      "title": "Compound Assignment With Augmented Multiplication",
+      "description": [
+        "The <code>*=</code> operator multiplies a variable by a number.",
+        "<code>myVar = myVar * 5;</code>",
+        "will multiply <code>myVar</code> by <code>5</code>. This can be rewritten as: ",
+        "<code>myVar *= 5;</code>",
+        "<hr>",
+        "Convert the assignments for <code>a</code>, <code>b</code>, and <code>c</code> to use the <code>*=</code> operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var a = 5;",
+        "var b = 12;",
+        "var c = 4.6;",
+        "",
+        "// Only modify code below this line",
+        "",
+        "a = a * 5;",
+        "b = 3 * b;",
+        "c = c * 10;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(a,b,c){ return \"a = \" + a + \", b = \" + b + \", c = \" + c; })(a,b,c);"
+      ],
+      "solutions": [
+        "var a = 5;\nvar b = 12;\nvar c = 4.6;\n\na *= 5;\nb *= 3;\nc *= 10;"
+      ],
+      "tests": [
+        "assert(a === 25, 'message: <code>a</code> should equal <code>25</code>');",
+        "assert(b === 36, 'message: <code>b</code> should equal <code>36</code>');",
+        "assert(c === 46, 'message: <code>c</code> should equal <code>46</code>');",
+        "assert(code.match(/\\*=/g).length === 3, 'message: You should use the <code>*=</code> operator for each variable');",
+        "assert(/var a = 5;/.test(code) && /var b = 12;/.test(code) && /var c = 4\\.6;/.test(code), 'message: Do not modify the code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Asignación con veces igual",
+          "description": [
+            "El operador <code>*=</code> multiplica una variable por un número.",
+            "<code>miVar = miVar * 5;</code>",
+            "multiplicará <code>miVar</code> por <code>5</code>. Esto puede ser reescrito como: ",
+            "<code>miVar *= 5;</code>",
+            "<h4>Instrucciones</h4>",
+            "Convierte las asignaciones para <code>a</code>, <code>b</code> y <code>c</code> usando el operador <code>*=</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b2",
+      "title": "Compound Assignment With Augmented Division",
+      "description": [
+        "The <code>/=</code> operator divides a variable by another number.",
+        "<code>myVar = myVar / 5;</code>",
+        "Will divide <code>myVar</code> by <code>5</code>. This can be rewritten as: ",
+        "<code>myVar /= 5;</code>",
+        "<hr>",
+        "Convert the assignments for <code>a</code>, <code>b</code>, and <code>c</code> to use the <code>/=</code> operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var a = 48;",
+        "var b = 108;",
+        "var c = 33;",
+        "",
+        "// Only modify code below this line",
+        "",
+        "a = a / 12;",
+        "b = b / 4;",
+        "c = c / 11;",
+        ""
+      ],
+      "tail": [
+        "(function(a,b,c){ return \"a = \" + a + \", b = \" + b + \", c = \" + c; })(a,b,c);"
+      ],
+      "solutions": [
+        "var a = 48;\nvar b = 108;\nvar c = 33;\n\na /= 12;\nb /= 4;\nc /= 11;"
+      ],
+      "tests": [
+        "assert(a === 4, 'message: <code>a</code> should equal <code>4</code>');",
+        "assert(b === 27, 'message: <code>b</code> should equal <code>27</code>');",
+        "assert(c === 3, 'message: <code>c</code> should equal <code>3</code>');",
+        "assert(code.match(/\\/=/g).length === 3, 'message: You should use the <code>/=</code> operator for each variable');",
+        "assert(/var a = 48;/.test(code) && /var b = 108;/.test(code) && /var c = 33;/.test(code), 'message: Do not modify the code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Asignación con división",
+          "description": [
+            "El operador <code>/=</code> divide una variable por otro número.",
+            "<code>miVar = miVar / 5;</code>",
+            "Dividirá <code>miVar</code> por <code>5</code>. Esto puede ser reescrito como: ",
+            "<code>miVar /= 5;</code>",
+            "<h4>Instrucciones</h4>",
+            "Convierte las asignaciones para <code>a</code>, <code>b</code> y <code>c</code> para usar el operador <code>/=</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c444eddfaeb5bdef",
+      "title": "Declare String Variables",
+      "description": [
+        "Previously we have used the code",
+        "<code>var myName = \"your name\";</code>",
+        "<code>\"your name\"</code> is called a <dfn>string</dfn> <dfn>literal</dfn>. It is a string because it is a series of zero or more characters enclosed in single or double quotes.",
+        "<hr>",
+        "Create two new <code>string</code> variables: <code>myFirstName</code> and <code>myLastName</code> and assign them the values of your first and last name, respectively."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var firstName = \"Alan\";",
+        "var lastName = \"Turing\";",
+        "",
+        "// Only change code below this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "if(typeof myFirstName !== \"undefined\" && typeof myLastName !== \"undefined\"){(function(){return myFirstName + ', ' + myLastName;})();}"
+      ],
+      "solutions": [
+        "var myFirstName = \"Alan\";\nvar myLastName = \"Turing\";"
+      ],
+      "tests": [
+        "assert((function(){if(typeof myFirstName !== \"undefined\" && typeof myFirstName === \"string\" && myFirstName.length > 0){return true;}else{return false;}})(), 'message: <code>myFirstName</code> should be a string with at least one character in it.');",
+        "assert((function(){if(typeof myLastName !== \"undefined\" && typeof myLastName === \"string\" && myLastName.length > 0){return true;}else{return false;}})(), 'message: <code>myLastName</code> should be a string with at least one character in it.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Declara variables tipo cadena",
+          "description": [
+            "En el reto anterior, se utilizó el código <code>myName var = \"su nombre\"</code>. Esto es lo que llamamos una variable tipo <code>cadena</code>. No es nada más que una \"cadena\" de caracteres. Las cadenas en JavaScript siempre se encierran entre comillas. ",
+            "Ahora vamos a crear dos nuevas variables tipo cadena: <code>myFirstName</code> y <code>myLastName</code> y asignarles los valores de tu nombre y tu apellido, respectivamente."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b5",
+      "title": "Escaping Literal Quotes in Strings",
+      "description": [
+        "When you are defining a string you must start and end with a single or double quote. What happens when you need a literal quote: <code>\"</code> or <code>'</code> inside of your string?",
+        "In JavaScript, you can <dfn>escape</dfn> a quote from considering it as an end of string quote by placing a <dfn>backslash</dfn> (<code>\\</code>) in front of the quote.",
+        "<code>var sampleStr = \"Alan said, \\\"Peter is learning JavaScript\\\".\";</code>",
+        "This signals to JavaScript that the following quote is not the end of the string, but should instead appear inside the string. So if you were to print this to the console, you would get:",
+        "<code>Alan said, \"Peter is learning JavaScript\".</code>",
+        "<hr>",
+        "Use <dfn>backslashes</dfn> to assign a string to the <code>myStr</code> variable so that if you were to print it to the console, you would see:",
+        "<code>I am a \"double quoted\" string inside \"double quotes\".</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myStr = \"\"; // Change this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){",
+        "  if(typeof myStr === 'string') {",
+        "    console.log(\"myStr = \\\"\" + myStr + \"\\\"\");",
+        "  } else {",
+        "    console.log(\"myStr is undefined\");",
+        "  }",
+        "})();"
+      ],
+      "solutions": [],
+      "tests": [
+        "assert(code.match(/\\\\\"/g).length === 6 && code.match(/[^\\\\]\"/g).length === 10, 'message: You should use two double quotes (<code>&quot;</code>) and four escaped double quotes (<code>&#92;&quot;</code>).');",
+        "assert(myStr === \"I am a \\\"double quoted\\\" string inside \\\"double quotes\\\".\", 'message: Variable myStr should contain the string: <code>I am a \"double quoted\" string inside \"double quotes\".</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Escapar comillas en cadenas de texto",
+          "description": [
+            "Cuando estás definiendo una cadena debes iniciar y terminar con apóstrofes o comillas. ¿Qué pasa cuando necesitas una comilla: <code>\"</code> o <code>'</code> dentro de tu cadena?",
+            "En JavaScript, tu puedes <dfn>escapar</dfn> unas comillas para diferenciarlas de las comillas del final de la cadena colocando una <dfn>barra invertida</dfn> (<code>\\</code>) antes de la cita.",
+            "<code>var cadenaEjem = \"Alan dijo, \\\"Pedro está aprendiendo JavaScript\\\".\";</code>",
+            "Esto le indica a JavaScript que la comilla siguiente no es el fin de la cadena, sino que debe aparecer dentro de la cadena. Así que si fueras a imprimir esto en la consola, tu obtendrías:",
+            "<code>Alan dijo, \"Pedro está aprendiendo JavaScript\".<code>",
+            "<h4>Instructiones</h4>",
+            "Usa <dfn>barras invertidas</dfn>para asigar una cadena a la variable <code>myStr</code> de modo que <em>si</em> tu fueras a imprimirla en la consola, tu verías:",
+            "<code>I am a \"double quoted\" string inside \"double quotes\".</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b4",
+      "title": "Quoting Strings with Single Quotes",
+      "description": [
+        "<dfn>String</dfn> values in JavaScript may be written with single or double quotes, so long as you start and end with the same type of quote. Unlike some languages, single and double quotes are functionally identical in JavaScript.",
+        "<blockquote>\"This string has \\\"double quotes\\\" in it\"</blockquote>",
+        "The value in using one or the other has to do with the need to <dfn>escape</dfn> quotes of the same type. Unless they are escaped, you cannot have more than one pair of whichever quote type begins a string.",
+        "If you have a string with many double quotes, this can be difficult to read and write. Instead, use single quotes:",
+        "<blockquote>'This string has \"double quotes\" in it. And \"probably\" lots of them.'</blockquote>",
+        "<hr>",
+        "Change the provided string from double to single quotes and remove the escaping. Do not change anything else."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myStr = \"<a href=\\\"http://www.example.com\\\" target=\\\"_blank\\\">Link</a>\";",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function() { return \"myStr = \" + myStr; })();"
+      ],
+      "solutions": [
+        "/* head */ 'use strict'; /* solution */ var myStr = '<a href=\"http://www.example.com\" target=\"_blank\">Link</a>'; /* tail */ (function() { return \"myStr = \" + myStr; })();"
+      ],
+      "tests": [
+        "assert(!/\\\\/g.test(code) && myStr.match('\\\\s*<a href\\\\s*=\\\\s*\"http://www.example.com\"\\\\s*target\\\\s*=\\\\s*\"_blank\">\\\\s*Link\\\\s*</a>\\\\s*'), 'message: Remove all the <code>backslashes</code> (<code>\\</code>)');",
+        "assert(code.match(/\"/g).length === 6 && code.match(/'/g).length === 4, 'message: You should have two single quotes <code>&#39;</code> and four double quotes <code>&quot;</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Citando cadenas con comillas simples",
+          "description": [
+            "Los valores de <dfn>Cadenas</dfn> en JavaScript pueden ser escritos con comillas o apóstrofes, siempre y cuando inicien y terminen con el mismo tipo de cita. A diferencia de algunos lenguajes, apóstrofes y comillas son funcionalmente identicas en JavaScript.",
+            "<code>\"Esta cadena tiene \\\"comillas\\\" en esta\"</code>",
+            "La ventaja de usar una o la otra tiene que ver con la necesidad de <code>escapar</code> comillas. Si tu tienes una cadena con algunas comillas, esta puede ser difícil de leer y escribir. En su lugar, usa apóstrofes:",
+            "<code>'Esta cadena tiene \"comillas\" en esta. Y \"probablemente\" muchas de ellas.'</code>",
+            "<h4>Instrucciones</h4>",
+            "Cambia la cadena dada de comillas a apóstrofes y quita el escape."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b6",
+      "title": "Escape Sequences in Strings",
+      "description": [
+        "Quotes are not the only characters that can be <dfn>escaped</dfn> inside a string. There are two reasons to use escaping characters: First is to allow you to use characters you might not otherwise be able to type out, such as a backspace. Second is to allow you to represent multiple quotes in a string without JavaScript misinterpreting what you mean. We learned this in the previous challenge.",
+        "<table class=\"table table-striped\"><thead><tr><th>Code</th><th>Output</th></tr></thead><tbody><tr><td><code>\\'</code></td><td>single quote</td></tr><tr><td><code>\\\"</code></td><td>double quote</td></tr><tr><td><code>\\\\</code></td><td>backslash</td></tr><tr><td><code>\\n</code></td><td>newline</td></tr><tr><td><code>\\r</code></td><td>carriage return</td></tr><tr><td><code>\\t</code></td><td>tab</td></tr><tr><td><code>\\b</code></td><td>backspace</td></tr><tr><td><code>\\f</code></td><td>form feed</td></tr></tbody></table>",
+        "<em>Note that the backslash itself must be escaped in order to display as a backslash.</em>",
+        "<hr>",
+        "Assign the following three lines of text into the single variable <code>myStr</code> using escape sequences.",
+        "<blockquote>FirstLine<br/>&nbsp;&nbsp;&nbsp;&nbsp;\\SecondLine<br/>ThirdLine</blockquote>",
+        "You will need to use escape sequences to insert special characters correctly. You will also need to follow the spacing as it looks above, with no spaces between escape sequences or words.",
+        "Here is the text with the escape sequences written out.",
+        "<q>FirstLine<code>newline</code><code>tab</code><code>backslash</code>SecondLine<code>newline</code>ThirdLine</q>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myStr; // Change this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){",
+        "if (myStr !== undefined){",
+        "console.log('myStr:\\n' + myStr);}})();"
+      ],
+      "solutions": [
+        "var myStr = \"FirstLine\\n\\t\\\\SecondLine\\nThirdLine\";"
+      ],
+      "tests": [
+        "assert(!/ /.test(myStr), 'message: <code>myStr</code> should not contain any spaces');",
+        "assert(/FirstLine/.test(myStr) && /SecondLine/.test(myStr) && /ThirdLine/.test(myStr), 'message: <code>myStr</code> should contain the strings <code>FirstLine</code>, <code>SecondLine</code> and <code>ThirdLine</code> (remember case sensitivity)');",
+        "assert(/FirstLine\\n/.test(myStr), 'message: <code>FirstLine</code> should be followed by the newline character <code>\\n</code>');",
+        "assert(/\\n\\t/.test(myStr), 'message: <code>myStr</code> should contain a tab character <code>\\t</code> which follows a newline character');",
+        "assert(/\\SecondLine/.test(myStr), 'message: <code>SecondLine</code> should be preceded by the backslash character <code>\\\\</code>');",
+        "assert(/SecondLine\\nThirdLine/.test(myStr), 'message: There should be a newline character between <code>SecondLine</code> and <code>ThirdLine</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Secuencias de escape en cadenas",
+          "description": [
+            "Las comillas no son el único caracter que puede ser <dfn>escapado</dfn> dentro de una cadena. Aquí ahí una tabla de secuencias de escape comunes:",
+            "<table class=\"table table-striped\"><thead><tr><th>Código</th><th>Salida</th></tr></thead><tbody><tr><td>\\'</td><td>apostrofe</td></tr><tr><td>\\\"</td><td>comilla</td></tr><tr><td>\\\\</td><td>barra invertida</td></tr><tr><td>\\n</td><td>nueva línea</td></tr><tr><td>\\r</td><td>retorno de carro</td></tr><tr><td>\\t</td><td>tabulación</td></tr><tr><td>\\b</td><td>retroceso</td></tr><tr><td>\\f</td><td>salto de página</td></tr></tbody></table>",
+            "<em>Nota que la barra invertida por si misma tiene que ser escapada con el fin de mostrarse como una barra invertida.</em>",
+            "<h4>Instrucciones</h4>",
+            "Codifica la siguiente secuencia, separada por espacios:<br><q>FirstLine<code>nueva línea</code><code>tabulación</code><code>barra invertida</code>SecondLine<code>nueva línea</code>ThirdLine</q>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b7",
+      "title": "Concatenating Strings with Plus Operator",
+      "description": [
+        "In JavaScript, when the <code>+</code> operator is used with a <code>String</code> value, it is called the <dfn>concatenation</dfn> operator. You can build a new string out of other strings by <dfn>concatenating</dfn> them together.",
+        "<strong>Example</strong>",
+        "<blockquote>'My name is Alan,' + ' I concatenate.'</blockquote>",
+        "<strong>Note</strong><br>Watch out for spaces. Concatenation does not add spaces between concatenated strings, so you'll need to add them yourself.",
+        "<hr>",
+        "Build <code>myStr</code> from the strings <code>\"This is the start. \"</code> and <code>\"This is the end.\"</code> using the <code>+</code> operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var ourStr = \"I come first. \" + \"I come second.\";",
+        "",
+        "// Only change code below this line",
+        "",
+        "var myStr;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){",
+        "  if(typeof myStr === 'string') {",
+        "    return 'myStr = \"' + myStr + '\"';",
+        "  } else {",
+        "    return 'myStr is not a string';",
+        "  }",
+        "})();"
+      ],
+      "solutions": [
+        "var ourStr = \"I come first. \" + \"I come second.\";\nvar myStr = \"This is the start. \" + \"This is the end.\";"
+      ],
+      "tests": [
+        "assert(myStr === \"This is the start. This is the end.\", 'message: <code>myStr</code> should have a value of <code>This is the start. This is the end.</code>');",
+        "assert(code.match(/([\"']).*([\"'])\\s*\\+\\s*([\"']).*([\"'])/g).length > 1, 'message: Use the <code>+</code> operator to build <code>myStr</code>');",
+        "assert(/var\\s+myStr/.test(code), 'message: <code>myStr</code> should be created using the <code>var</code> keyword.');",
+        "assert(/myStr\\s*=/.test(code), 'message: Make sure to assign the result to the <code>myStr</code> variable.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Concatenar cadenas con el operador más",
+          "description": [
+            "En JavaScript, cuando el operador <code>+</code> es usado con un valor de <code>Cadena</code>, este es llamado el operador <dfn>concatenación</dfn>. Tu puedes construir una nueva cadena de otras cadenas <dfn>concatenandolas</dfn> juntas.",
+            "<strong>Ejemplo</strong>",
+            "<blockquote>'Mi nombre es Alan,' + ' Yo concateno.'<blockquote>",
+            "<strong>Nota</strong><br>Cuidado con los espacios. La concatenación no agrega espacios entre cadenas concatenadas, así que necesitarás agregarlos tu mismo.",
+            "<h4>Instrucciones</h4>",
+            "Construye <code>myStr</code> con las cadenas <code>\"This is the start. \"</code> y <code>\"This is the end.\"</code> usando el operador<code>+</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b8",
+      "title": "Concatenating Strings with the Plus Equals Operator",
+      "description": [
+        "We can also use the <code>+=</code> operator to <dfn>concatenate</dfn> a string onto the end of an existing string variable. This can be very helpful to break a long string over several lines.",
+        "<strong>Note</strong><br>Watch out for spaces. Concatenation does not add spaces between concatenated strings, so you'll need to add them yourself.",
+        "<hr>",
+        "Build <code>myStr</code> over several lines by concatenating these two strings: <code>\"This is the first sentence. \"</code> and <code>\"This is the second sentence.\"</code> using the <code>+=</code> operator. Use the <code>+=</code> operator similar to how it is shown in the editor. Start by assigning the first string to <code>myStr</code>, then add on the second string."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var ourStr = \"I come first. \";",
+        "ourStr += \"I come second.\";",
+        "",
+        "// Only change code below this line",
+        "",
+        "var myStr;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){",
+        "  if(typeof myStr === 'string') {",
+        "    return 'myStr = \"' + myStr + '\"';",
+        "  } else {",
+        "    return 'myStr is not a string';",
+        "  }",
+        "})();"
+      ],
+      "solutions": [
+        "var ourStr = \"I come first. \";\nourStr += \"I come second.\";\n\nvar myStr = \"This is the first sentence. \";\nmyStr += \"This is the second sentence.\";"
+      ],
+      "tests": [
+        "assert(myStr === \"This is the first sentence. This is the second sentence.\", 'message: <code>myStr</code> should have a value of <code>This is the first sentence. This is the second sentence.</code>');",
+        "assert(code.match(/\\w\\s*\\+=\\s*[\"']/g).length > 1 && code.match(/\\w\\s*\\=\\s*[\"']/g).length > 1, 'message: Use the <code>+=</code> operator to build <code>myStr</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Concatenar cadenas con el operador mas igual",
+          "description": [
+            "Nosotros también podemos usar el operador <code>+=</code> para <dfn>concatenar</dfn> una cadena al final de una variable de cadena existente. Esto puede ser muy útil para romper una cadena larga sobre varias líneas.",
+            "<strong>Nota</strong><br>Cuidado con los espacios. La concatenación no agrega espacios entre cadenas concatenadas, así que necesitarás añadirlos tu mismo.",
+            "<h4>Instrucciones</h4>",
+            "Construye <code>myStr</code> sobre varias líneas concatenando estas dos cadenas:<br><code>\"This is the first sentence. \"</code> y <code>\"This is the second sentence.\"</code> usando el operador <code>+=</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244b9",
+      "title": "Constructing Strings with Variables",
+      "description": [
+        "Sometimes you will need to build a string, <a href=\"https://en.wikipedia.org/wiki/Mad_Libs\" target=\"_blank\">Mad Libs</a> style. By using the concatenation operator (<code>+</code>), you can insert one or more variables into a string you're building.",
+        "<hr>",
+        "Set <code>myName</code> to a string equal to your name and build <code>myStr</code> with <code>myName</code> between the strings <code>\"My name is \"</code> and <code>\" and I am well!\"</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var ourName = \"freeCodeCamp\";",
+        "var ourStr = \"Hello, our name is \" + ourName + \", how are you?\";",
+        "",
+        "// Only change code below this line",
+        "var myName;",
+        "var myStr;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){",
+        "  var output = [];",
+        "  if(typeof myName === 'string') {",
+        "    output.push('myName = \"' + myName + '\"');",
+        "  } else {",
+        "    output.push('myName is not a string');",
+        "  }",
+        "  if(typeof myStr === 'string') {",
+        "    output.push('myStr = \"' + myStr + '\"');",
+        "  } else {",
+        "    output.push('myStr is not a string');",
+        "  }",
+        "  return output.join('\\n');",
+        "})();"
+      ],
+      "solutions": [
+        "var myName = \"Bob\";\nvar myStr = \"My name is \" + myName + \" and I am well!\";"
+      ],
+      "tests": [
+        "assert(typeof myName !== 'undefined' && myName.length > 2, 'message: <code>myName</code> should be set to a string at least 3 characters long');",
+        "assert(code.match(/[\"']\\s*\\+\\s*myName\\s*\\+\\s*[\"']/g).length > 0, 'message: Use two <code>+</code> operators to build <code>myStr</code> with <code>myName</code> inside it');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Construir cadenas con variables",
+          "description": [
+            "A veces necesitarás construir una cadena, al estilo <a href=\"https://en.wikipedia.org/wiki/Mad_Libs\" target=\"_blank\">Mad Libs</a>. Mediante el uso del operador concatenación (<code>+</code>), puedes insertar una o más variables dentro de una cadena que estés construyendo.",
+            "<h4>Instrucciones</h4>",
+            "Asigna <code>myName</code> a una cadena igual a tu nombre y construye <code>myStr</code> con <code>myName</code> entre las cadenas <code>\"My name is \"</code> and <code>\" and I am well!\"</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ed",
+      "title": "Appending Variables to Strings",
+      "description": [
+        "Just as we can build a string over multiple lines out of string <dfn>literals</dfn>, we can also append variables to a string using the plus equals (<code>+=</code>) operator.",
+        "<hr>",
+        "Set <code>someAdjective</code> and append it to <code>myStr</code> using the <code>+=</code> operator."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var anAdjective = \"awesome!\";",
+        "var ourStr = \"freeCodeCamp is \";",
+        "ourStr += anAdjective;",
+        "",
+        "// Only change code below this line",
+        "",
+        "var someAdjective;",
+        "var myStr = \"Learning to code is \";",
+        ""
+      ],
+      "tail": [
+        "(function(){",
+        "  var output = [];",
+        "  if(typeof someAdjective === 'string') {",
+        "    output.push('someAdjective = \"' + someAdjective + '\"');",
+        "  } else {",
+        "    output.push('someAdjective is not a string');",
+        "  }",
+        "  if(typeof myStr === 'string') {",
+        "    output.push('myStr = \"' + myStr + '\"');",
+        "  } else {",
+        "    output.push('myStr is not a string');",
+        "  }",
+        "  return output.join('\\n');",
+        "})();"
+      ],
+      "solutions": [
+        "var anAdjective = \"awesome!\";\nvar ourStr = \"freeCodeCamp is \";\nourStr += anAdjective;\n\nvar someAdjective = \"neat\";\nvar myStr = \"Learning to code is \";\nmyStr += someAdjective;"
+      ],
+      "tests": [
+        "assert(typeof someAdjective !== 'undefined' && someAdjective.length > 2, 'message: <code>someAdjective</code> should be set to a string at least 3 characters long');",
+        "assert(code.match(/myStr\\s*\\+=\\s*someAdjective\\s*/).length > 0, 'message: Append <code>someAdjective</code> to <code>myStr</code> using the <code>+=</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Anexando variables a cadenas",
+          "description": [
+            "Al igual que podemos construir una cadena en múltiples líneas a partir de cadenas <dfn>literales</dfn>, nosotros podemos ademas anexar variables a una cadena usando el operador más igual (<code>+=</code>).",
+            "<h4>Instructiones</h4>",
+            "Asigna <code>someAdjective</code> y anexalo a <code>myStr</code> usando el operador <code>+=</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c448eddfaeb5bdef",
+      "title": "Find the Length of a String",
+      "description": [
+        "You can find the length of a <code>String</code> value by writing <code>.length</code> after the string variable or string literal.",
+        "<code>\"Alan Peter\".length; // 10</code>",
+        "For example, if we created a variable <code>var firstName = \"Charles\"</code>, we could find out how long the string <code>\"Charles\"</code> is by using the <code>firstName.length</code> property.",
+        "<hr>",
+        "Use the <code>.length</code> property to count the number of characters in the <code>lastName</code> variable and assign it to <code>lastNameLength</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var firstNameLength = 0;",
+        "var firstName = \"Ada\";",
+        "",
+        "firstNameLength = firstName.length;",
+        "",
+        "// Setup",
+        "var lastNameLength = 0;",
+        "var lastName = \"Lovelace\";",
+        "",
+        "// Only change code below this line.",
+        "",
+        "lastNameLength = lastName;",
+        "",
+        ""
+      ],
+      "tail": [
+        "if(typeof lastNameLength !== \"undefined\"){(function(){return lastNameLength;})();}"
+      ],
+      "solutions": [
+        "var firstNameLength = 0;\nvar firstName = \"Ada\";\nfirstNameLength = firstName.length;\n\nvar lastNameLength = 0;\nvar lastName = \"Lovelace\";\nlastNameLength = lastName.length;"
+      ],
+      "tests": [
+        "assert((function(){if(typeof lastNameLength !== \"undefined\" && typeof lastNameLength === \"number\" && lastNameLength === 8){return true;}else{return false;}})(), 'message: <code>lastNameLength</code> should be equal to eight.');",
+        "assert((function(){if(code.match(/\\.length/gi) && code.match(/\\.length/gi).length >= 2 && code.match(/var lastNameLength \\= 0;/gi) && code.match(/var lastNameLength \\= 0;/gi).length >= 1){return true;}else{return false;}})(), 'message: You should be getting the length of <code>lastName</code> by using <code>.length</code> like this: <code>lastName.length</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Comprueba la propiedad longitud (length) de una variable tipo cadena",
+          "description": [
+            "Las <code>estructuras de datos</code> tienen <code>propiedades</code>. Por ejemplo, las <code>cadenas</code> tienen una propiedad llamada <code>.length </code> que te dirá cuántos caracteres hay en la cadena.",
+            "Por ejemplo, si creamos una variable <code>var firstName=\"Charles\"</code>, podemos averiguar la longitud de la cadena \"Charles\" usando la propiedad <code>firstName.length</code>. ",
+            "Usa la propiedad <code>.length</code> para contar el número de caracteres en el variable <code>lastName</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c549eddfaeb5bdef",
+      "title": "Use Bracket Notation to Find the First Character in a String",
+      "description": [
+        "<code>Bracket notation</code> is a way to get a character at a specific <code>index</code> within a string.",
+        "Most modern programming languages, like JavaScript, don't start counting at 1 like humans do. They start at 0. This is referred to as <dfn>Zero-based</dfn> indexing.",
+        "For example, the character at index 0 in the word \"Charles\" is \"C\". So if <code>var firstName = \"Charles\"</code>, you can get the value of the first letter of the string by using <code>firstName[0]</code>.",
+        "<hr>",
+        "Use <dfn>bracket notation</dfn> to find the first character in the <code>lastName</code> variable and assign it to <code>firstLetterOfLastName</code>.",
+        "<strong>Hint</strong><br>Try looking at the <code>firstLetterOfFirstName</code> variable declaration if you get stuck."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var firstLetterOfFirstName = \"\";",
+        "var firstName = \"Ada\";",
+        "",
+        "firstLetterOfFirstName = firstName[0];",
+        "",
+        "// Setup",
+        "var firstLetterOfLastName = \"\";",
+        "var lastName = \"Lovelace\";",
+        "",
+        "// Only change code below this line",
+        "firstLetterOfLastName = lastName;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(v){return v;})(firstLetterOfLastName);"
+      ],
+      "solutions": [
+        "var firstLetterOfLastName = \"\";\nvar lastName = \"Lovelace\";\n\n// Only change code below this line\nfirstLetterOfLastName = lastName[0];"
+      ],
+      "tests": [
+        "assert(firstLetterOfLastName === 'L', 'message: The <code>firstLetterOfLastName</code> variable should have the value of <code>L</code>.');",
+        "assert(code.match(/firstLetterOfLastName\\s*?=\\s*?lastName\\[.*?\\]/), 'message: You should use bracket notation.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Usa la notación de corchetes para encontrar el primer carácter de una cadena",
+          "description": [
+            "La <code>notación de corchetes</code> es una forma de obtener el caracter en un <code>índice</code> específico de una cadena.",
+            "Los computadoras no empiezan a contar desde 1 como hacen los humanos. Comienzan en 0 ",
+            "Por ejemplo, el caracter en el índice 0 en la palabra \"Charles \" es \"C\". Entonces si <code>var firstName = \"Charles\"</code>, puedes obtener la primera letra de la cadena usando <code>firstName[0]</code> .",
+            "Usa la <code>notación de corchetes</code> para encontrar el primer caracter en la variable <code>lastName</code> y asignarlo a <code>firstLetterOfLastName</code>.",
+            "Si te atascas intenta mirar la declaración de la variable <code>firstLetterOfFirstName</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ba",
+      "title": "Understand String Immutability",
+      "description": [
+        "In JavaScript, <code>String</code> values are <dfn>immutable</dfn>, which means that they cannot be altered once created.",
+        "For example, the following code:",
+        "<blockquote>var myStr = \"Bob\";<br>myStr[0] = \"J\";</blockquote>",
+        "cannot change the value of <code>myStr</code> to \"Job\", because the contents of <code>myStr</code> cannot be altered. Note that this does <em>not</em> mean that <code>myStr</code> cannot be changed, just that the individual characters of a <dfn>string literal</dfn> cannot be changed. The only way to change <code>myStr</code> would be to assign it with a new string, like this:",
+        "<blockquote>var myStr = \"Bob\";<br>myStr = \"Job\";</blockquote>",
+        "<hr>",
+        "Correct the assignment to <code>myStr</code> so it contains the string value of <code>Hello World</code> using the approach shown in the example above."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var myStr = \"Jello World\";",
+        "",
+        "// Only change code below this line",
+        "",
+        "myStr[0] = \"H\"; // Fix Me",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(v){return \"myStr = \" + v;})(myStr);"
+      ],
+      "solutions": [
+        "var myStr = \"Jello World\";\nmyStr = \"Hello World\";"
+      ],
+      "tests": [
+        "assert(myStr === \"Hello World\", 'message: <code>myStr</code> should have a value of <code>Hello World</code>');",
+        "assert(/myStr = \"Jello World\"/.test(code), 'message: Do not change the code above the line');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Comprender la inmutabilidad de cadenas",
+          "description": [
+            "En JavaScript, los valores de las <code>Cadenas</code> son <dfn>inmutables</dfn>, lo cual significa que ellos no pueden ser alterados una vez creados.",
+            "Por ejemplo, el siguiente código:",
+            "<blockquote>var miCad = \"Bob\";<br>myCad[0] = \"J\";</blockquote>",
+            "no puede cambiar el valor de <code>miCad</code> a \"Job\" porque el contenido de <code>miCad</code> no puede ser alterado. Nota que esto <em>no</em> significa que <code>miCad</code> no puede ser cambiado, solo que los valores individuales de una <dfn>cadena literal</dfn> no pueden ser cambiados. La única manera de cambiar <code>miCad</code> sería asignandola a una nueva cadena, como esta:",
+            "<blockquote>var miCad = \"Bob\";<br>miCad = \"Job\";</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Corrige la asignación de <code>myStr</code> para lograr el efecto deseado."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c450eddfaeb5bdef",
+      "title": "Use Bracket Notation to Find the Nth Character in a String",
+      "description": [
+        "You can also use <dfn>bracket notation</dfn> to get the character at other positions within a string.",
+        "Remember that computers start counting at <code>0</code>, so the first character is actually the zeroth character.",
+        "<hr>",
+        "Let's try to set <code>thirdLetterOfLastName</code> to equal the third letter of the <code>lastName</code> variable using bracket notation.",
+        "<strong>Hint</strong><br>Try looking at the <code>secondLetterOfFirstName</code> variable declaration if you get stuck."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var firstName = \"Ada\";",
+        "var secondLetterOfFirstName = firstName[1];",
+        "",
+        "// Setup",
+        "var lastName = \"Lovelace\";",
+        "",
+        "// Only change code below this line.",
+        "var thirdLetterOfLastName = lastName;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(v){return v;})(thirdLetterOfLastName);"
+      ],
+      "solutions": [
+        "var lastName = \"Lovelace\";\nvar thirdLetterOfLastName = lastName[2];"
+      ],
+      "tests": [
+        "assert(thirdLetterOfLastName === 'v', 'message: The <code>thirdLetterOfLastName</code> variable should have the value of <code>v</code>.');",
+        "assert(code.match(/thirdLetterOfLastName\\s*?=\\s*?lastName\\[.*?\\]/), 'message: You should use bracket notation.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Usar la notación de corchetes para encontrar el n-ésimo caracter en una cadena",
+          "description": [
+            "También puede usar <code>notación de corchetes</code> para obtener el caracter en otras posiciones dentro de una cadena.",
+            "Recuerda que los computadores empiezan a contar a 0, por lo que el primer caracter es en realidad el caracter cero.",
+            "<h4>Instrucciones</h4>",
+            "Vamos a tratar de asignar a <code>thirdLetterOfLastName</code> la <code>tercera letra</code> de la variable <code>lastName</code>.",
+            "<strong>Pista</strong><br>Si te atascas intenta mirar la declaración de la variable <code>secondLetterOfFirstName</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c451eddfaeb5bdef",
+      "title": "Use Bracket Notation to Find the Last Character in a String",
+      "description": [
+        "In order to get the last letter of a string, you can subtract one from the string's length.",
+        "For example, if <code>var firstName = \"Charles\"</code>, you can get the value of the last letter of the string by using <code>firstName[firstName.length - 1]</code>.",
+        "<hr>",
+        "Use <dfn>bracket notation</dfn> to find the last character in the <code>lastName</code> variable.",
+        "<strong>Hint</strong><br>Try looking at the <code>lastLetterOfFirstName</code> variable declaration if you get stuck."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var firstName = \"Ada\";",
+        "var lastLetterOfFirstName = firstName[firstName.length - 1];",
+        "",
+        "// Setup",
+        "var lastName = \"Lovelace\";",
+        "",
+        "// Only change code below this line.",
+        "var lastLetterOfLastName = lastName;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(v){return v;})(lastLetterOfLastName);"
+      ],
+      "solutions": [
+        "var firstName = \"Ada\";\nvar lastLetterOfFirstName = firstName[firstName.length - 1];\n\nvar lastName = \"Lovelace\";\nvar lastLetterOfLastName = lastName[lastName.length - 1];"
+      ],
+      "tests": [
+        "assert(lastLetterOfLastName === \"e\", 'message: <code>lastLetterOfLastName</code> should be \"e\".');",
+        "assert(code.match(/\\.length/g).length === 2, 'message: You have to use <code>.length</code> to get the last letter.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Usa notación de corchetes para encontrar el último caracter de una cadena",
+          "description": [
+            "Con el fin de conseguir la última letra de una cadena, puedes restar uno a la longitud de la cadena.",
+            "Por ejemplo, si <code>var firstName = \"Charles\"</code>, se puede obtener la última letra usando <code>firstName[firstName.length - 1]</code>. ",
+            "<h4>Instrucciones</h4>",
+            "Utiliza <code>notación de corchetes</code> para encontrar el último caracter de la variabel <code>lastName</code>.",
+            "Si te atascas intenta mirando la declaración de la variable <code>lastLetterOfFirstName</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c452eddfaeb5bdef",
+      "title": "Use Bracket Notation to Find the Nth-to-Last Character in a String",
+      "description": [
+        "You can use the same principle we just used to retrieve the last character in a string to retrieve the Nth-to-last character.",
+        "For example, you can get the value of the third-to-last letter of the <code>var firstName = \"Charles\"</code> string by using <code>firstName[firstName.length - 3]</code>",
+        "<hr>",
+        "Use <dfn>bracket notation</dfn> to find the second-to-last character in the <code>lastName</code> string.",
+        "<strong>Hint</strong><br>Try looking at the <code>thirdToLastLetterOfFirstName</code> variable declaration if you get stuck."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var firstName = \"Ada\";",
+        "var thirdToLastLetterOfFirstName = firstName[firstName.length - 3];",
+        "",
+        "// Setup",
+        "var lastName = \"Lovelace\";",
+        "",
+        "// Only change code below this line",
+        "var secondToLastLetterOfLastName = lastName;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(v){return v;})(secondToLastLetterOfLastName);"
+      ],
+      "solutions": [
+        "var firstName = \"Ada\";\nvar thirdToLastLetterOfFirstName = firstName[firstName.length - 3];\n\nvar lastName = \"Lovelace\";\nvar secondToLastLetterOfLastName = lastName[lastName.length - 2];"
+      ],
+      "tests": [
+        "assert(secondToLastLetterOfLastName === 'c', 'message: <code>secondToLastLetterOfLastName</code> should be \"c\".');",
+        "assert(code.match(/\\.length/g).length === 2, 'message: You have to use <code>.length</code> to get the second last letter.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Usa notación de corchetes para encontrar el n-ésimo último caracter de una cadena",
+          "description": [
+            "Puede utilizar el mismo principio utilizamos para recuperar el último caracter de una cadena para recuperar el n-ésimo último caracter.",
+            "Por ejemplo, se puede obtener el valor de la tercera última letra de la cadena <code>var firstName = \"Charles\"</code> utilizando <code>firstName[firstName.length - 3]</code> ",
+            "<h4>Instrucciones</h4>",
+            "Usa <code>notación de corchete</code> para encontrar el segundo último caracter de la cadena en <code>lastName</code>.",
+            "<strong>Pista</strong><br>Si te atascas intenta mirando la declaración de la variable <code>thirdToLastLetterOfFirstName</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244bb",
+      "title": "Word Blanks",
+      "description": [
+        "We will now use our knowledge of strings to build a \"<a href='https://en.wikipedia.org/wiki/Mad_Libs' target='_blank'>Mad Libs</a>\" style word game we're calling \"Word Blanks\". You will create an (optionally humorous) \"Fill in the Blanks\" style sentence. Here's an example of an incomplete sentence.",
+        "<code>\"The ______ ______ looked around ______ then ______ into the house\"</code>",
+        "These four blanks would be filled in this order: (adjective) (noun) (adverb) (verb)",
+        "You will need to use string concatenation to build a new string, <code>result</code>, using the variables <code>myNoun</code>, <code>myAdjective</code>, <code>myVerb</code>, and <code>myAdverb</code>. These variables are passed to the function as parameters. Don't change these parameter names in the function.",
+        "Include additional strings and spaces (which will not change) in between the provided variables to make a complete sentence."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function wordBlanks(myNoun, myAdjective, myVerb, myAdverb) {",
+        "  // Your code below this line",
+        "  var result = \"\";",
+        "",
+        "  // Your code above this line",
+        "  return result;",
+        "}",
+        "",
+        "// Change the words here to test your function",
+        "wordBlanks(\"dog\", \"big\", \"ran\", \"quickly\");"
+      ],
+      "tail": [
+        "var test1 = wordBlanks(\"dog\", \"big\", \"ran\", \"quickly\");",
+        "var test2 = wordBlanks(\"cat\", \"little\", \"hit\", \"slowly\");"
+      ],
+      "solutions": [
+        "function wordBlanks(myNoun, myAdjective, myVerb, myAdverb) {\n  var result = \"\";\n\n  result = \"Once there was a \" + myNoun + \" which was very \" + myAdjective + \". \";\n  result += \"It \" + myVerb + \" \" + myAdverb + \" around the yard.\";\n\n  return result;\n}"
+      ],
+      "tests": [
+        "assert(typeof wordBlanks(\"\",\"\",\"\",\"\") === 'string', 'message: <code>wordBlanks(\"\",\"\",\"\",\"\")</code> should return a string.');",
+        "assert(/\\bdog\\b/.test(test1) && /\\bbig\\b/.test(test1) && /\\bran\\b/.test(test1) && /\\bquickly\\b/.test(test1),'message: <code>wordBlanks(\"dog\", \"big\", \"ran\", \"quickly\")</code> should contain all of the passed in words separated by non-word characters (and any additional words in your madlib).');",
+        "assert(/\\bcat\\b/.test(test2) && /\\blittle\\b/.test(test2) && /\\bhit\\b/.test(test2) && /\\bslowly\\b/.test(test2),'message: <code>wordBlanks(\"cat\", \"little\", \"hit\", \"slowly\")</code> should contain all of the passed in words separated by non-word characters (and any additional words in your madlib).');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Espacios en blanco de palabras",
+          "description": [
+            "Ahora usaremos nuestro conocimiento de cadenas para construir un juego de palabras estilo \"<a href='https://en.wikipedia.org/wiki/Mad_Libs' target='_blank'>Mad Libs</a>\" que llamaremos \"Espacios en Blanco de Palabras\". Vas a crear unas oraciones estilo (opcionalmente graciosa) \"Llena los espacios en blanco\".",
+            "Necesitarás usar operadores de cadenas para construir una nueva cadena <code>result</code>, usando las variables previstas: <code>myNoun</code>, <code>myAdjective</code>, <code>myVerb</code> y <code>myAdverb</code>.",
+            "Además, necesitarás proporcionar cadenas adicionales, las cuales no cambiarán entre las palabras proporcionadas.",
+            "Nosotros hemos proporcionado un marco de referencia para probar tus resultados con diferentes palabras. La prueba correrá tu función con varias palabras diferentes para asegurarse  que todas las palabras proporcionadas aparezcan en la salida, así como en tus cadenas adicionales."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7993c9c69feddfaeb8bdef",
+      "title": "Store Multiple Values in one Variable using JavaScript Arrays",
+      "description": [
+        "With JavaScript <code>array</code> variables, we can store several pieces of data in one place.",
+        "You start an array declaration with an opening square bracket, end it with a closing square bracket, and put a comma between each entry, like this: ",
+        "<code>var sandwich = [\"peanut butter\", \"jelly\", \"bread\"]</code>.",
+        "<hr>",
+        "Modify the new array <code>myArray</code> so that it contains both a <code>string</code> and a <code>number</code> (in that order).",
+        "<strong>Hint</strong><br>Refer to the example code in the text editor if you get stuck."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [\"John\", 23];",
+        "",
+        "// Only change code below this line.",
+        "var myArray = [];",
+        ""
+      ],
+      "tail": [
+        "(function(z){return z;})(myArray);"
+      ],
+      "solutions": [
+        "var myArray = [\"The Answer\", 42];"
+      ],
+      "tests": [
+        "assert(typeof myArray == 'object', 'message: <code>myArray</code> should be an <code>array</code>.');",
+        "assert(typeof myArray[0] !== 'undefined' && typeof myArray[0] == 'string', 'message: The first item in <code>myArray</code> should be a <code>string</code>.');",
+        "assert(typeof myArray[1] !== 'undefined' && typeof myArray[1] == 'number', 'message: The second item in <code>myArray</code> should be a <code>number</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Almacena múltiples valores en una variable utilizando vectores en JavaScript",
+          "description": [
+            "Con las variables tipo <code>vector</code> (o en inglés <code>array</code>) podemos almacenar diversos datos en un solo lugar.",
+            "Empiezas la declaración de un vector con un corchete de apertura, y terminas con un corchete de cierre, y pones una coma entre cada entrada, así: <code>var sandwich = [\"mantequilla de maní\", \"jalea\" , \"pan\"]</code>. ",
+            "<h4>Instrucciones</h4>",
+            "Ahora vamos a crear un nuevo vector llamado <code>myArray</code> que contenga una <code>cadena</code> y un <code>número</code> (en ese orden).",
+            "Consulta el código comentado en el editor de texto si te atascas."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb7bdef",
+      "title": "Nest one Array within Another Array",
+      "description": [
+        "You can also nest arrays within other arrays, like this: <code>[[\"Bulls\", 23], [\"White Sox\", 45]]</code>. This is also called a <dfn>Multi-dimensional Array<dfn>.",
+        "<hr>",
+        "Create a nested array called <code>myArray</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [[\"the universe\", 42], [\"everything\", 101010]];",
+        "",
+        "// Only change code below this line.",
+        "var myArray = [];",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\"){(function(){return myArray;})();}"
+      ],
+      "solutions": [
+        "var myArray = [[1,2,3]];"
+      ],
+      "tests": [
+        "assert(Array.isArray(myArray) && myArray.some(Array.isArray), 'message: <code>myArray</code> should have at least one array nested within another array.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Anida un vector dentro de otro vector",
+          "description": [
+            "También puedes anidar vectores dentro de otros vectores, como este: <code>[[\"Bulls\", 23], [\"White Sox\", 45]]</code>.",
+            "<h4>Instrucciones</h4>",
+            "Ahora vamos a crear un vector anidado llamado <code>myArray</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392ca",
+      "title": "Access Array Data with Indexes",
+      "description": [
+        "We can access the data inside arrays using <code>indexes</code>.",
+        "Array indexes are written in the same bracket notation that strings use, except that instead of specifying a character, they are specifying an entry in the array. Like strings, arrays use <dfn>zero-based</dfn> indexing, so the first element in an array is element <code>0</code>.",
+        "<strong>Example</strong>",
+        "<blockquote>var array = [50,60,70];<br>array[0]; // equals 50<br>var data = array[1];  // equals 60</blockquote>",
+        "<strong>Note</strong><br>There shouldn't be any spaces between the array name and the square brackets, like <code>array [0]</code>. Although JavaScript is able to process this correctly, this may confuse other programmers reading your code.",
+        "<hr>",
+        "Create a variable called <code>myData</code> and set it to equal the first value of <code>myArray</code> using bracket notation."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [50,60,70];",
+        "var ourData = ourArray[0]; // equals 50",
+        "",
+        "// Setup",
+        "var myArray = [50,60,70];",
+        "",
+        "// Only change code below this line.",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\" && typeof myData !== \"undefined\"){(function(y,z){return 'myArray = ' + JSON.stringify(y) + ', myData = ' + JSON.stringify(z);})(myArray, myData);}"
+      ],
+      "solutions": [
+        "var myArray = [50,60,70];\nvar myData = myArray[0];"
+      ],
+      "tests": [
+        "assert((function(){if(typeof myArray !== 'undefined' && typeof myData !== 'undefined' && myArray[0] === myData){return true;}else{return false;}})(), 'message: The variable <code>myData</code> should equal the first value of <code>myArray</code>.');",
+        "assert((function(){if(code.match(/\\s*=\\s*myArray\\[0\\]/g)){return true;}else{return false;}})(), 'message: The data in variable <code>myArray</code> should be accessed using bracket notation.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Accede a los datos de un vector mediante índices",
+          "description": [
+            "Podemos acceder a los datos dentro de los vectores usando <code>índices</code>.",
+            "Los índices del vector se escriben en la misma notación con corchetes usado con cadenas, excepto que en lugar de especificar un caracter, especifican un elemento del vector.",
+            "Por ejemplo:",
+            "<code>var array = [1,2,3];</code>",
+            "<code>array[0]; //es igual a 1</code>",
+            "<code>var data = array[1];</code>",
+            "<h4>Instrucciones</h4>",
+            "Crea una variable llamada <code>myData</ ​​code> y asignale el primer valor del vector <code>myArray</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb8bdef",
+      "title": "Modify Array Data With Indexes",
+      "description": [
+        "Unlike strings, the entries of arrays are <dfn>mutable</dfn> and can be changed freely.",
+        "<strong>Example</strong>",
+        "<blockquote>var ourArray = [50,40,30];<br>ourArray[0] = 15; // equals [15,40,30]</blockquote>",
+        "<strong>Note</strong><br>There shouldn't be any spaces between the array name and the square brackets, like <code>array [0]</code>. Although JavaScript is able to process this correctly, this may confuse other programmers reading your code.",
+        "<hr>",
+        "Modify the data stored at index <code>0</code> of <code>myArray</code> to a value of <code>45</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [18,64,99];",
+        "ourArray[1] = 45; // ourArray now equals [18,45,99].",
+        "",
+        "// Setup",
+        "var myArray = [18,64,99];",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\"){(function(){return myArray;})();}"
+      ],
+      "solutions": [
+        "var myArray = [18,64,99];\nmyArray[0] = 45;"
+      ],
+      "tests": [
+        "assert((function(){if(typeof myArray != 'undefined' && myArray[0] == 45 && myArray[1] == 64 && myArray[2] == 99){return true;}else{return false;}})(), 'message: <code>myArray</code> should now be [45,64,99].');",
+        "assert((function(){if(code.match(/myArray\\[0\\]\\s*=\\s*/g)){return true;}else{return false;}})(), 'message: You should be using correct index to modify the value in <code>myArray</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Modifica datos de un vector usando índices",
+          "description": [
+            "También podemos modificar los datos almacenados en vectores usando índices.",
+            "Por ejemplo:",
+            "<code>var ourArray = [3,2,1];</code>",
+            "<code>ourArray[0] = 1; // equals [1,2,1]</code>",
+            "<h4>Instrucciones</h4>",
+            "Ahora establece el dato almacenado en el índice 0 de <code>myArray</code> para que sea el valor 3."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56592a60ddddeae28f7aa8e1",
+      "title": "Access Multi-Dimensional Arrays With Indexes",
+      "description": [
+        "One way to think of a <dfn>multi-dimensional</dfn> array, is as an <em>array of arrays</em>. When you use brackets to access your array, the first set of brackets refers to the entries in the outer-most (the first level) array, and each additional pair of brackets refers to the next level of entries inside.",
+        "<strong>Example</strong>",
+        "<blockquote>var arr = [<br>    [1,2,3],<br>    [4,5,6],<br>    [7,8,9],<br>    [[10,11,12], 13, 14]<br>];<br>arr[3]; // equals [[10,11,12], 13, 14]<br>arr[3][0]; // equals [10,11,12]<br>arr[3][0][1]; // equals 11</blockquote>",
+        "<strong>Note</strong><br>There shouldn't be any spaces between the array name and the square brackets, like <code>array [0][0]</code> and even this <code>array [0] [0]</code> is not allowed. Although JavaScript is able to process this correctly, this may confuse other programmers reading your code.",
+        "<hr>",
+        "Using bracket notation select an element from <code>myArray</code> such that <code>myData</code> is equal to <code>8</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var myArray = [[1,2,3], [4,5,6], [7,8,9], [[10,11,12], 13, 14]];",
+        "",
+        "// Only change code below this line.",
+        "var myData = myArray[0][0];",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\"){(function(){return \"myData: \" + myData + \" myArray: \" + JSON.stringify(myArray);})();}"
+      ],
+      "solutions": [
+        "var myArray = [[1,2,3],[4,5,6], [7,8,9], [[10,11,12], 13, 14]];\nvar myData = myArray[2][1];"
+      ],
+      "tests": [
+        "assert(myData === 8, 'message: <code>myData</code> should be equal to <code>8</code>.');",
+        "assert(/myArray\\[2\\]\\[1\\]/g.test(code) && !/myData\\s*=\\s*(?:.*[-+*/%]|\\d)/g.test(code), 'message: You should be using bracket notation to read the correct value from <code>myArray</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Acceder a vectores multi-dimensionales con índices",
+          "description": [
+            "Una manera de pensar un vector <dfn>multi-dimensional</dfn>, es como un <em>vector de vectores</em>. Cuando usas corchetes para acceder a tu vector, el primer conjunto de brackets se refiere a las entradas en el vector más externo y cada nivel subsecuente de brackets se refiere al siguiente nivel de vectores internos.",
+            "<strong>Ejemplo</strong>",
+            "<blockquote>var vec = [<br>    [1,2,3],<br>    [4,5,6],<br>    [7,8,9],<br>    [[10,11,12], 13, 14]<br>];<br>vec[0]; // es igual [1,2,3]<br>vec[1][2]; // es igual 6<br>vec[3][0][1]; // es igual 11</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Lee de <code>myArray</code> usando la notación corchete de modo que myData sea igual a <code>8</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392cb",
+      "title": "Manipulate Arrays With push()",
+      "description": [
+        "An easy way to append data to the end of an array is via the <code>push()</code> function.",
+        "<code>.push()</code> takes one or more <dfn>parameters</dfn> and \"pushes\" them onto the end of the array.",
+        "<blockquote>var arr = [1,2,3];<br>arr.push(4);<br>// arr is now [1,2,3,4]</blockquote>",
+        "<hr>",
+        "Push <code>[\"dog\", 3]</code> onto the end of the <code>myArray</code> variable."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [\"Stimpson\", \"J\", \"cat\"];",
+        "ourArray.push([\"happy\", \"joy\"]); ",
+        "// ourArray now equals [\"Stimpson\", \"J\", \"cat\", [\"happy\", \"joy\"]]",
+        "",
+        "// Setup",
+        "var myArray = [[\"John\", 23], [\"cat\", 2]];",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(z){return 'myArray = ' + JSON.stringify(z);})(myArray);"
+      ],
+      "solutions": [
+        "var myArray = [[\"John\", 23], [\"cat\", 2]];\nmyArray.push([\"dog\",3]);"
+      ],
+      "tests": [
+        "assert((function(d){if(d[2] != undefined && d[0][0] == 'John' && d[0][1] === 23 && d[2][0] == 'dog' && d[2][1] === 3 && d[2].length == 2){return true;}else{return false;}})(myArray), 'message: <code>myArray</code> should now equal <code>[[\"John\", 23], [\"cat\", 2], [\"dog\", 3]]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Manipula vectores con push()",
+          "description": [
+            "No sólo se pueden sacar datos del final de un vector con <code>pop()</code>, también puedes empujar (<code>push()</code>) datos al final del vector.",
+            "<h4>Instrucciones</h4>",
+            "Empuja <code>[\"dog\", 3]</code> al final de la variable <code>myArray</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392cc",
+      "title": "Manipulate Arrays With pop()",
+      "description": [
+        "Another way to change the data in an array is with the <code>.pop()</code> function.",
+        "<code>.pop()</code> is used to \"pop\" a value off of the end of an array. We can store this \"popped off\" value by assigning it to a variable. In other words, <code>.pop()</code> removes the last element from an array and returns that element.",
+        "Any type of entry can be \"popped\" off of an array - numbers, strings, even nested arrays.",
+        "<blockquote><code>var threeArr = [1, 4, 6];<br> var oneDown = threeArr.pop();<br> console.log(oneDown); // Returns 6<br> console.log(threeArr); // Returns [1, 4]</code></blockquote>",
+        "<hr>",
+        "Use the <code>.pop()</code> function to remove the last item from <code>myArray</code>, assigning the \"popped off\" value to <code>removedFromMyArray</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [1,2,3];",
+        "var removedFromOurArray = ourArray.pop(); ",
+        "// removedFromOurArray now equals 3, and ourArray now equals [1,2]",
+        "",
+        "// Setup",
+        "var myArray = [[\"John\", 23], [\"cat\", 2]];",
+        "",
+        "// Only change code below this line.",
+        "var removedFromMyArray;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(y, z){return 'myArray = ' + JSON.stringify(y) + ' & removedFromMyArray = ' + JSON.stringify(z);})(myArray, removedFromMyArray);"
+      ],
+      "solutions": [
+        "var myArray = [[\"John\", 23], [\"cat\", 2]];\nvar removedFromMyArray = myArray.pop();"
+      ],
+      "tests": [
+        "assert((function(d){if(d[0][0] == 'John' && d[0][1] === 23 && d[1] == undefined){return true;}else{return false;}})(myArray), 'message: <code>myArray</code> should only contain <code>[[\"John\", 23]]</code>.');",
+        "assert(/removedFromMyArray\\s*=\\s*myArray\\s*.\\s*pop\\s*(\\s*)/.test(code), 'message: Use <code>pop()</code> on <code>myArray</code>');",
+        "assert((function(d){if(d[0] == 'cat' && d[1] === 2 && d[2] == undefined){return true;}else{return false;}})(removedFromMyArray), 'message: <code>removedFromMyArray</code> should only contain <code>[\"cat\", 2]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Manipula vectores con pop()",
+          "description": [
+            "Otra forma de cambiar los datos en un vector es con la función <code>.pop()</code>.",
+            "<code>.pop()</code> se utiliza para \"sacar\" el valor final de un vector. Podemos almacenar el valor \"sacado\" asignando <code>pop</code> a una variable por ejemplo durante su declaración.",
+            "Todo tipo de datos puede ser \"sacado\" de un vector --números, cadenas, incluso los vectores anidadas.",
+            "<h4>Instrucciones</h4>",
+            "Usa la función <code>.pop()</code> para sacar el último elemento de <code>myArray</code> y asigna ese valor \"sacado\" a <code>removedFromMyArray </code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392cd",
+      "title": "Manipulate Arrays With shift()",
+      "description": [
+        "<code>pop()</code> always removes the last element of an array. What if you want to remove the first?",
+        "That's where <code>.shift()</code> comes in. It works just like <code>.pop()</code>, except it removes the first element instead of the last.",
+        "<hr>",
+        "Use the <code>.shift()</code> function to remove the first item from <code>myArray</code>, assigning the \"shifted off\" value to <code>removedFromMyArray</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [\"Stimpson\", \"J\", [\"cat\"]];",
+        "removedFromOurArray = ourArray.shift();",
+        "// removedFromOurArray now equals \"Stimpson\" and ourArray now equals [\"J\", [\"cat\"]].",
+        "",
+        "// Setup",
+        "var myArray = [[\"John\", 23], [\"dog\", 3]];",
+        "",
+        "// Only change code below this line.",
+        "var removedFromMyArray;",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(y, z){return 'myArray = ' + JSON.stringify(y) + ' & removedFromMyArray = ' + JSON.stringify(z);})(myArray, removedFromMyArray);"
+      ],
+      "solutions": [
+        "var myArray = [[\"John\", 23], [\"dog\", 3]];\n\n// Only change code below this line.\nvar removedFromMyArray = myArray.shift();"
+      ],
+      "tests": [
+        "assert((function(d){if(d[0][0] == 'dog' && d[0][1] === 3 && d[1] == undefined){return true;}else{return false;}})(myArray), 'message: <code>myArray</code> should now equal <code>[[\"dog\", 3]]</code>.');",
+        "assert((function(d){if(d[0] == 'John' && d[1] === 23 && typeof removedFromMyArray === 'object'){return true;}else{return false;}})(removedFromMyArray), 'message: <code>removedFromMyArray</code> should contain <code>[\"John\", 23]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Manipula vectores con shift()",
+          "description": [
+            "<code>pop()</code> siempre elimina el último elemento de un vector. ¿Qué pasa si quieres quitar el primero?",
+            "Ahí es donde entra <code>.shift()</code>. Funciona igual que <code>.pop ()</code>, excepto que elimina el primer elemento en lugar del pasado. ",
+            "<h4>Instrucciones</h4>",
+            "Usa la función <code>.shift()</code> para eliminar el primer elemento de <code>myArray</code>, y el elemento que saques asignalo a <code>removedFromMyArra</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392ce",
+      "title": "Manipulate Arrays With unshift()",
+      "description": [
+        "Not only can you <code>shift</code> elements off of the beginning of an array, you can also <code>unshift</code> elements to the beginning of an array i.e. add elements in front of the array.",
+        "<code>.unshift()</code> works exactly like <code>.push()</code>, but instead of adding the element at the end of the array, <code>unshift()</code> adds the element at the beginning of the array.",
+        "<hr>",
+        "Add <code>[\"Paul\",35]</code> to the beginning of the <code>myArray</code> variable using <code>unshift()</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [\"Stimpson\", \"J\", \"cat\"];",
+        "ourArray.shift(); // ourArray now equals [\"J\", \"cat\"]",
+        "ourArray.unshift(\"Happy\"); ",
+        "// ourArray now equals [\"Happy\", \"J\", \"cat\"]",
+        "",
+        "// Setup",
+        "var myArray = [[\"John\", 23], [\"dog\", 3]];",
+        "myArray.shift();",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(y, z){return 'myArray = ' + JSON.stringify(y);})(myArray);"
+      ],
+      "solutions": [
+        "var myArray = [[\"John\", 23], [\"dog\", 3]];\nmyArray.shift();\nmyArray.unshift([\"Paul\", 35]);"
+      ],
+      "tests": [
+        "assert((function(d){if(typeof d[0] === \"object\" && d[0][0] == 'Paul' && d[0][1] === 35 && d[1][0] != undefined && d[1][0] == 'dog' && d[1][1] != undefined && d[1][1] == 3){return true;}else{return false;}})(myArray), 'message: <code>myArray</code> should now have [[\"Paul\", 35], [\"dog\", 3]].');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Manipula vectores con unshift()",
+          "description": [
+            "No sólo se puedes <code>correr</code> (shift) elementos del comienzo de un vector, también puedes <code>descorrerlos</code> (unshift) al comienzo.",
+            "<code>unshift()</code> funciona exactamente igual que <code>push()</code>, pero en lugar de añadir el elemento al final del vector, <code>unshift()</code> añade el elemento al comienzo del vector. ",
+            "<h4>Instrucciones</h4>",
+            "Añade <code>\"Paul\"</code> al comienzo de la variable <code>myArray</code> usando <code>unshift()</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244bc",
+      "title": "Shopping List",
+      "description": [
+        "Create a shopping list in the variable <code>myList</code>. The list should be a multi-dimensional array containing several sub-arrays.",
+        "The first element in each sub-array should contain a string with the name of the item. The second element should be a number representing the quantity i.e.",
+        "<code>[\"Chocolate Bar\", 15]</code>",
+        "There should be at least 5 sub-arrays in the list."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myList = [];",
+        "",
+        ""
+      ],
+      "tail": [
+        "var count = 0;",
+        "var isArray = false;",
+        "var hasString = false;",
+        "var hasNumber = false;",
+        "(function(list){",
+        "  if(Array.isArray(myList)) {",
+        "    isArray = true;",
+        "    if(myList.length > 0) {",
+        "      hasString = true;",
+        "      hasNumber = true;",
+        "      myList.forEach(function(elem) {",
+        "        if(typeof elem[0] !== 'string') {",
+        "          hasString = false;",
+        "        }",
+        "        if(typeof elem[1] !== 'number') {",
+        "          hasNumber = false;",
+        "        }",
+        "      });",
+        "    }",
+        "    count = myList.length;",
+        "    return JSON.stringify(myList);",
+        "  } else {",
+        "    return \"myList is not an array\";",
+        "  }",
+        "",
+        "})(myList);"
+      ],
+      "solutions": [
+        "var myList = [\n  [\"Candy\", 10],\n  [\"Potatoes\", 12],\n  [\"Eggs\", 12],\n  [\"Catfood\", 1],\n  [\"Toads\", 9]\n];"
+      ],
+      "tests": [
+        "assert(isArray, 'message: <code>myList</code> should be an array');",
+        "assert(hasString, 'message: The first elements in each of your sub-arrays must all be strings');",
+        "assert(hasNumber, 'message: The second elements in each of your sub-arrays must all be numbers');",
+        "assert(count > 4, 'message: You must have at least 5 items in your list');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Lista de compras",
+          "description": [
+            "Crea una lista de compras en la variable <code>myList</code>. La lista tiene que ser un vector multidimensional conteniendo varios sub-vectores.",
+            "El primer elemento en cada sub-vector debe contener una cadena con el nombre del elemento. El segundo elemento debe ser un número representando la cantidad i. e.",
+            "<code>[\"Barra de Chocolate\", 15]</code>",
+            "Tiene que haber por lo menos 5 sub-vectores en la lista."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392cf",
+      "title": "Write Reusable JavaScript with Functions",
+      "description": [
+        "In JavaScript, we can divide up our code into reusable parts called <dfn>functions</dfn>.",
+        "Here's an example of a function:",
+        "<blockquote>function functionName() {<br>  console.log(\"Hello World\");<br>}</blockquote>",
+        "You can call or <dfn>invoke</dfn> this function by using its name followed by parentheses, like this:",
+        "<code>functionName();</code>",
+        "Each time the function is called it will print out the message <code>\"Hello World\"</code> on the dev console. All of the code between the curly braces will be executed every time the function is called.",
+        "<hr>",
+        "<ol><li>Create a function called <code>reusableFunction</code> which prints <code>\"Hi World\"</code> to the dev console.</li><li>Call the function.</li></ol>"
+      ],
+      "head": [
+        "var logOutput = \"\";",
+        "var originalConsole = console",
+        "function capture() {",
+        "    var nativeLog = console.log;",
+        "    console.log = function (message) {",
+        "        if(message && message.trim) logOutput = message.trim();",
+        "        if(nativeLog.apply) {",
+        "          nativeLog.apply(originalConsole, arguments);",
+        "        } else {",
+        "          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');",
+        "          nativeLog(nativeMsg);",
+        "        }",
+        "    };",
+        "}",
+        "",
+        "function uncapture() {",
+        "  console.log = originalConsole.log;",
+        "}",
+        "",
+        "capture();"
+      ],
+      "challengeSeed": [
+        "// Example",
+        "function ourReusableFunction() {",
+        "  console.log(\"Heyya, World\");",
+        "}",
+        "",
+        "ourReusableFunction();",
+        "",
+        "// Only change code below this line",
+        ""
+      ],
+      "tail": [
+        "uncapture();",
+        "",
+        "if (typeof reusableFunction !== \"function\") { ",
+        "  (function() { return \"reusableFunction is not defined\"; })();",
+        "} else {",
+        "  (function() { return logOutput || \"console.log never called\"; })();",
+        "}"
+      ],
+      "solutions": [
+        "function reusableFunction() {\n  console.log(\"Hi World\");\n}\nreusableFunction();"
+      ],
+      "tests": [
+        "assert(typeof reusableFunction === 'function', 'message: <code>reusableFunction</code> should be a function');",
+        "assert(\"Hi World\" === logOutput, 'message: <code>reusableFunction</code> should output \"Hi World\" to the dev console');",
+        "assert(/^\\s*reusableFunction\\(\\)\\s*;/m.test(code), 'message: Call <code>reusableFunction</code> after you define it');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Escribe código JavaScript reutilizable con funciones",
+          "description": [
+            "En JavaScript, podemos dividir nuestro código en partes reutilizables llamadas funciones.",
+            "He aquí un ejemplo de una función:",
+            "<code>function nombreDeFuncion(a, b) {</code>",
+            "<code>& nbsp; & nbsp; return a + b;</code>",
+            "<code>}</code>",
+            "Después de escribir las líneas anteriores en nuestro código, podemos pasar valores a nuestra función y el resultado que sigue a la instrucción <code>return</code> será retornado.",
+            "Por ejemplo, podemos pasar los números <code>4</code> y <code>2</code> al \"llamar\" la función más adelante en nuestro código, así: <code>nombreDeFuncion(4, 2)</ code >. ",
+            "En este ejemplo, la función devolverá el número <code>6</code>, ya que es el resultado de <code>4 + 2</code>.",
+            "Crea y llama una función de nombre <code>myFunction</code> que devuelva la suma de <code>a</code> y <code>b</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244bd",
+      "title": "Passing Values to Functions with Arguments",
+      "description": [
+        "<dfn>Parameters</dfn> are variables that act as placeholders for the values that are to be input to a function when it is called. When a function is defined, it is typically defined along with one or more parameters. The actual values that are input (or <dfn>\"passed\"</dfn>) into a function when it is called are known as <dfn>arguments</dfn>.",
+        "Here is a function with two parameters, <code>param1</code> and <code>param2</code>:",
+        "<blockquote>function testFun(param1, param2) {<br>  console.log(param1, param2);<br>}</blockquote>",
+        "Then we can call <code>testFun</code>:",
+        "<code>testFun(\"Hello\", \"World\");</code>",
+        "We have passed two arguments, <code>\"Hello\"</code> and <code>\"World\"</code>. Inside the function, <code>param1</code> will equal \"Hello\" and <code>param2</code> will equal \"World\". Note that you could call <code>testFun</code> again with different arguments and the parameters would take on the value of the new arguments.",
+        "<hr>",
+        "<ol><li>Create a function called <code>functionWithArgs</code> that accepts two arguments and outputs their sum to the dev console.</li><li>Call the function with two numbers as arguments.</li></ol>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "head": [
+        "var logOutput = \"\";",
+        "var originalConsole = console",
+        "function capture() {",
+        "    var nativeLog = console.log;",
+        "    console.log = function (message) {",
+        "        if(message) logOutput = JSON.stringify(message).trim();",
+        "        if(nativeLog.apply) {",
+        "          nativeLog.apply(originalConsole, arguments);",
+        "        } else {",
+        "          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');",
+        "          nativeLog(nativeMsg);",
+        "        }",
+        "    };",
+        "}",
+        "",
+        "function uncapture() {",
+        "  console.log = originalConsole.log;",
+        "}",
+        "",
+        "capture();"
+      ],
+      "challengeSeed": [
+        "// Example",
+        "function ourFunctionWithArgs(a, b) {",
+        "  console.log(a - b);",
+        "}",
+        "ourFunctionWithArgs(10, 5); // Outputs 5",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "uncapture();",
+        "",
+        "if (typeof functionWithArgs !== \"function\") { ",
+        "  (function() { return \"functionWithArgs is not defined\"; })();",
+        "} else {",
+        "  (function() { return logOutput || \"console.log never called\"; })();",
+        "}"
+      ],
+      "solutions": [
+        "function functionWithArgs(a, b) {\n  console.log(a + b);\n}\nfunctionWithArgs(10, 5);"
+      ],
+      "tests": [
+        "assert(typeof functionWithArgs === 'function', 'message: <code>functionWithArgs</code> should be a function');",
+        "if(typeof functionWithArgs === \"function\") { capture(); functionWithArgs(1,2); uncapture(); } assert(logOutput == 3, 'message: <code>functionWithArgs(1,2)</code> should output <code>3</code>');",
+        "if(typeof functionWithArgs === \"function\") { capture(); functionWithArgs(7,9); uncapture(); } assert(logOutput == 16, 'message: <code>functionWithArgs(7,9)</code> should output <code>16</code>');",
+        "assert(/^\\s*functionWithArgs\\s*\\(\\s*\\d+\\s*,\\s*\\d+\\s*\\)\\s*;/m.test(code), 'message: Call <code>functionWithArgs</code> with two numbers after you define it.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Pasando valores a funciones con argumentos",
+          "description": [
+            "Los <dfn>parámetros</dfn> son variables que actúan como marcadores de lugar para los valores que han de ser entrada para una función cuando esta es llamada. Cuando una función es definida, es típicamente definida con uno o más parámetros. Los valores actuales que son entrada (or <dfn>\"pasados\"</dfn>) dentro de una función cuando esta es llamada son concidos como <dfn>argumentos</dfn>.",
+            "Aquí hay una función con dos parámetros, <code>param1</code> y <code>param2</code>:",
+            "<blockquote>function testFun(param1, param2) {<br>  console.log(param1, param2);<br>}</blockquote>",
+            "Entonces nosotros podemos llamar <code>testFun</code>:",
+            "<code>testFun(\"Hello\", \"World\");</code>",
+            "Nosotros hemos pasado dos argumentos, <code>\"Hello\"</code> y <code>\"World\"</code>. Dentro de la función, <code>param1</code> será igual a \"Hello\" y <code>param2</code> será igual a \"World\". Nota que puedes llamar <code>testFun</code> otra vez con argumentos diferentes y los parámetros asumirían el valor de los nuevos argumentos.",
+            "<h4>Instrucciones</h4>",
+            "<ol><li>Crea una función llamada <code>functionWithArgs</code> que acepte dos argumentos y da salida a su suma en la consola.</li><li>Llama la función.</li></ol>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244be",
+      "title": "Global Scope and Functions",
+      "description": [
+        "In JavaScript, <dfn>scope</dfn> refers to the visibility of variables. Variables which are defined outside of a function block have <dfn>Global</dfn> scope. This means, they can be seen everywhere in your JavaScript code.",
+        "Variables which are used without the <code>var</code> keyword are automatically created in the <code>global</code> scope. This can create unintended consequences elsewhere in your code or when running a function again. You should always declare your variables with <code>var</code>.",
+        "<hr>",
+        "Using <code>var</code>, declare a <code>global</code> variable <code>myGlobal</code> outside of any function. Initialize it with a value of <code>10</code>.",
+        "Inside function <code>fun1</code>, assign <code>5</code> to <code>oopsGlobal</code> <strong><em>without</em></strong> using the <code>var</code> keyword."
+      ],
+      "releasedOn": "January 1, 2016",
+      "head": [
+        "var logOutput = \"\";",
+        "var originalConsole = console",
+        "function capture() {",
+        "    var nativeLog = console.log;",
+        "    console.log = function (message) {",
+        "        logOutput = message;",
+        "        if(nativeLog.apply) {",
+        "          nativeLog.apply(originalConsole, arguments);",
+        "        } else {",
+        "          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');",
+        "          nativeLog(nativeMsg);",
+        "        }",
+        "    };",
+        "}",
+        "",
+        "function uncapture() {",
+        "  console.log = originalConsole.log;",
+        "}",
+        "var oopsGlobal;",
+        "capture();"
+      ],
+      "challengeSeed": [
+        "// Declare your variable here",
+        "",
+        "",
+        "function fun1() {",
+        "  // Assign 5 to oopsGlobal Here",
+        "  ",
+        "}",
+        "",
+        "// Only change code above this line",
+        "function fun2() {",
+        "  var output = \"\";",
+        "  if (typeof myGlobal != \"undefined\") {",
+        "    output += \"myGlobal: \" + myGlobal;",
+        "  }",
+        "  if (typeof oopsGlobal != \"undefined\") {",
+        "    output += \" oopsGlobal: \" + oopsGlobal;",
+        "  }",
+        "  console.log(output);",
+        "}"
+      ],
+      "tail": [
+        "fun1();",
+        "fun2();",
+        "uncapture();",
+        "(function() { return logOutput || \"console.log never called\"; })();"
+      ],
+      "solutions": [
+        "// Declare your variable here\nvar myGlobal = 10;\n\nfunction fun1() {\n  // Assign 5 to oopsGlobal Here\n  oopsGlobal = 5;\n}\n\n// Only change code above this line\nfunction fun2() {\n  var output = \"\";\n  if(typeof myGlobal != \"undefined\") {\n    output += \"myGlobal: \" + myGlobal;\n  }\n  if(typeof oopsGlobal != \"undefined\") {\n    output += \" oopsGlobal: \" + oopsGlobal;\n  }\n  console.log(output);\n}"
+      ],
+      "tests": [
+        "assert(typeof myGlobal != \"undefined\", 'message: <code>myGlobal</code> should be defined');",
+        "assert(myGlobal === 10, 'message: <code>myGlobal</code> should have a value of <code>10</code>');",
+        "assert(/var\\s+myGlobal/.test(code), 'message: <code>myGlobal</code> should be declared using the <code>var</code> keyword');",
+        "assert(typeof oopsGlobal != \"undefined\" && oopsGlobal === 5, 'message: <code>oopsGlobal</code> should be a global variable and have a value of <code>5</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Alcance global y funciones",
+          "description": [
+            "En JavaScript, <dfn>alcance</dfn> se referiere a la visibilidad de variables. Las variables que definas fuera de un bloque de una función tienen alcance <dfn>Global</dfn>. Esto significa que ellas pueden ser vistas en todas partes en tu código JavaScript.",
+            "Las variables que pueden ser usadas sin la palabra clave <code>var</code> son automáticamente creadas en el alcance <code>global</code>. Esto puede tener consecuencias no deseadas en otras partes de tu código o cuando se ejecuta una función de nuevo. Tu siempre deberías declarar tus variables con <code>var</code>.",
+            "<h4>Instrucciones</h4>",
+            "Declara a variable <code>global</code> <code>myGlobal</code> fuera de cualquier función. Inicializala para tener un valor de <code>10</code> ",
+            "Dentro de la función <code>fun1</code>, asigna <code>5</code> a <code>oopsGlobal</code> <strong><em>sin</em></strong> usar la palabra clave <code>var</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244bf",
+      "title": "Local Scope and Functions",
+      "description": [
+        "Variables which are declared within a function, as well as the function parameters have <dfn>local</dfn> scope. That means, they are only visible within that function.",
+        "Here is a function <code>myTest</code> with a local variable called <code>loc</code>.",
+        "<blockquote>function myTest() {<br>  var loc = \"foo\";<br>  console.log(loc);<br>}<br>myTest(); // logs \"foo\"<br>console.log(loc); // loc is not defined</blockquote>",
+        "<code>loc</code> is not defined outside of the function.",
+        "<hr>",
+        "Declare a local variable <code>myVar</code> inside <code>myLocalScope</code>. Run the tests and then follow the instructions commented out in the editor.",
+        "<strong>Hint</strong><br>Refreshing the page may help if you get stuck."
+      ],
+      "releasedOn": "January 1, 2016",
+      "head": [
+        "var logOutput = \"\";",
+        "var originalConsole = console",
+        "function capture() {",
+        "  var nativeLog = console.log;",
+        "  console.log = function (message) {",
+        "    logOutput = message;",
+        "    if(nativeLog.apply) {",
+        "      nativeLog.apply(originalConsole, arguments);",
+        "    } else {",
+        "      var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');",
+        "      nativeLog(nativeMsg);",
+        "    }",
+        "  };",
+        "}",
+        "",
+        "function uncapture() {",
+        "  console.log = originalConsole.log;",
+        "}",
+        ""
+      ],
+      "challengeSeed": [
+        "function myLocalScope() {",
+        "  'use strict'; // you shouldn't need to edit this line",
+        "  ",
+        "  console.log(myVar);",
+        "}",
+        "myLocalScope();",
+        "",
+        "// Run and check the console",
+        "// myVar is not defined outside of myLocalScope",
+        "console.log(myVar);",
+        "",
+        "// Now remove the console log line to pass the test",
+        ""
+      ],
+      "tail": [
+        "typeof myLocalScope === 'function' && (capture(), myLocalScope(), uncapture());",
+        "(function() { return logOutput || \"console.log never called\"; })();"
+      ],
+      "solutions": [
+        "function myLocalScope() {\n  'use strict';\n  \n  var myVar;\n  console.log(myVar);\n}\nmyLocalScope();"
+      ],
+      "tests": [
+        "assert(typeof myVar === 'undefined', 'message: No global <code>myVar</code> variable');",
+        "assert(/var\\s+myVar/.test(code), 'message: Add a local <code>myVar</code> variable');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Alcance local y funciones",
+          "description": [
+            "Las variables que son declaradas dentro de una función, así como los parámetros de la función tienen alcance <dfn>local</dfn>. Eso significa que solo son visibles dentro de esa función.",
+            "Aquí está una función <code>myTest</code> con una variable local llamada <code>loc</code>.",
+            "<blockquote>function myTest() {<br>  var loc = \"foo\";<br>  console.log(loc);<br>}<br>myTest(); // \"foo\"<br>console.log(loc); // \"undefined\"</blockquote>",
+            "<code>loc</code> no está definida fuera de la función.",
+            "<h4>Instrucciones</h4>",
+            "Declara una variable local <code>myVar</code> dentro de <code>myLocalScope</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c0",
+      "title": "Global vs. Local Scope in Functions",
+      "description": [
+        "It is possible to have both <dfn>local</dfn> and <dfn>global</dfn> variables with the same name. When you do this, the <code>local</code> variable takes precedence over the <code>global</code> variable.",
+        "In this example:",
+        "<blockquote>var someVar = \"Hat\";<br>function myFun() {<br>  var someVar = \"Head\";<br>  return someVar;<br>}</blockquote>",
+        "The function <code>myFun</code> will return <code>\"Head\"</code> because the <code>local</code> version of the variable is present.",
+        "<hr>",
+        "Add a local variable to <code>myOutfit</code> to override the value of <code>outerWear</code> with <code>\"sweater\"</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var outerWear = \"T-Shirt\";",
+        "",
+        "function myOutfit() {",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  ",
+        "  // Only change code above this line",
+        "  return outerWear;",
+        "}",
+        "",
+        "myOutfit();"
+      ],
+      "solutions": [
+        "var outerWear = \"T-Shirt\";\nfunction myOutfit() {\n  var outerWear = \"sweater\";\n  return outerWear;\n}"
+      ],
+      "tests": [
+        "assert(outerWear === \"T-Shirt\", 'message: Do not change the value of the global <code>outerWear</code>');",
+        "assert(myOutfit() === \"sweater\", 'message: <code>myOutfit</code> should return <code>\"sweater\"</code>');",
+        "assert(/return outerWear/.test(code), 'message: Do not change the return statement');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Alcance global vs. local en funciones",
+          "description": [
+            "Es posible tener variables <dfn>locales</dfn> y <dfn>globales</dfn> con el mismo nombre. Cuando tu haces esto, la variable <code>local</code> toma precedencia sobre la variable <code>global</code>.",
+            "En este ejemplo:",
+            "<blockquote>var algunaVar = \"Sombrero\";<br>function miFun() {<br>  var algunaVar = \"Cabeza\";<br>  return algunaVar;<br>}</blockquote>",
+            "La función <code>miFun</code> regresará <code>\"Cabeza\"</code> porque la versión <code>local</code> de la variable tiene precedencia.",
+            "<h4>Instrucciones</h4>",
+            "Agrega una variable local a <code>myOutfit</code> para sobreescribir el valor de <code>outerWear</code> con <code>\"sweater\"</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c2",
+      "title": "Return a Value from a Function with Return",
+      "description": [
+        "We can pass values into a function with <dfn>arguments</dfn>. You can use a <code>return</code> statement to send a value back out of a function.",
+        "<strong>Example</strong>",
+        "<blockquote>function plusThree(num) {<br>  return num + 3;<br>}<br>var answer = plusThree(5); // 8</blockquote>",
+        "<code>plusThree</code> takes an <dfn>argument</dfn> for <code>num</code> and returns a value equal to <code>num + 3</code>.",
+        "<hr>",
+        "Create a function <code>timesFive</code> that accepts one argument, multiplies it by <code>5</code>, and returns the new value. See the last line in the editor for an example of how you can test your <code>timesFive</code> function."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "function minusSeven(num) {",
+        "  return num - 7;",
+        "}",
+        "",
+        "// Only change code below this line",
+        "",
+        "",
+        "",
+        "console.log(minusSeven(10));"
+      ],
+      "tail": [],
+      "solutions": [
+        "function timesFive(num) {\n  return num * 5;\n}\ntimesFive(10);"
+      ],
+      "tests": [
+        "assert(typeof timesFive === 'function', 'message: <code>timesFive</code> should be a function');",
+        "assert(code.match(/timesFive\\(\\s*\\d+\\s*\\)/g), 'message: function <code>timesFive</code> should be called with a number');",
+        "assert(timesFive(5) === 25, 'message: <code>timesFive(5)</code> should return <code>25</code>');",
+        "assert(timesFive(2) === 10, 'message: <code>timesFive(2)</code> should return <code>10</code>');",
+        "assert(timesFive(0) === 0, 'message: <code>timesFive(0)</code> should return <code>0</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Retorna un valor desde una función con return",
+          "description": [
+            "Podemos pasar valores a una función mediante los <dfn>argumentos</dfn>. Puedes usar una sentencia <code>return</code> para enviar un valor de vuelta de una función.",
+            "<strong>Ejemplo</strong>",
+            "<blockquote>function masTres(num) {<br>  return num + 3;<br>}<br>var respuesta = masTres(5); // 8</blockquote>",
+            "<code>masTres</code> toma un <dfn>argumento</dfn> que es <code>num</code> y retorna un valor igual a <code>num + 3</code>.",
+            "<h4>Instrucciones</h4>",
+            "Crea una función <code>timesFive</code> que acepte un argumento, lo multiplique por <code>5</code> y retorne el nuevo valor."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c3",
+      "title": "Assignment with a Returned Value",
+      "description": [
+        "If you'll recall from our discussion of <a href=\"storing-values-with-the-assignment-operator\" target=\"_blank\">Storing Values with the Assignment Operator</a>, everything to the right of the equal sign is resolved before the value is assigned. This means we can take the return value of a function and assign it to a variable.",
+        "Assume we have pre-defined a function <code>sum</code> which adds two numbers together, then: ",
+        "<code>ourSum = sum(5, 12);</code>",
+        "will call <code>sum</code> function, which returns a value of <code>17</code> and assigns it to <code>ourSum</code> variable.",
+        "<hr>",
+        "Call the <code>processArg</code> function with an argument of <code>7</code> and assign its return value to the variable <code>processed</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var changed = 0;",
+        "",
+        "function change(num) {",
+        "  return (num + 5) / 3;",
+        "}",
+        "",
+        "changed = change(10);",
+        "",
+        "// Setup",
+        "var processed = 0;",
+        "",
+        "function processArg(num) {",
+        "  return (num + 3) / 5;",
+        "}",
+        "",
+        "// Only change code below this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){return \"processed = \" + processed})();"
+      ],
+      "solutions": [
+        "var processed = 0;\n\nfunction processArg(num) {\n  return (num + 3) / 5;\n}\n\nprocessed = processArg(7);"
+      ],
+      "tests": [
+        "assert(processed === 2, 'message: <code>processed</code> should have a value of <code>2</code>');",
+        "assert(/processed\\s*=\\s*processArg\\(\\s*7\\s*\\)\\s*;/.test(code), 'message: You should assign <code>processArg</code> to <code>processed</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Asignación con un valor retornado",
+          "description": [
+            "Si recuerdas de nuestra discusión de <a href=\"waypoint-storing-values-with-the-equal-operator\" target=\"_blank\">Almacenar Valores con el Operador Igual</a>, todo a la derecha del signo igual es resuelto antes que el valor sea asignado. Esto significa que nosotros podemos tomar el valor de retorno de una función y asignarlo a una variable.",
+            "Supongamos que tenemos una función pre-definida <code>suma</code> la cual suma dos números, entonces: ",
+            "<code>nuestraSuma = suma(5, 12);</code>",
+            "llamará la función <code>suma</code>, la cual retornará un valor de <code>17</code> y lo asignará a la variable <code>nuestraSuma</code>.",
+            "<h4>Instrucciones</h4>",
+            "Llama la función <code>processArg</code> con un argumento <code>7</code> y asigna su valor de retorno a la variable <code>processed</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c6",
+      "title": "Stand in Line",
+      "description": [
+        "In Computer Science a <dfn>queue</dfn> is an abstract <dfn>Data Structure</dfn> where items are kept in order. New items can be added at the back of the <code>queue</code> and old items are taken off from the front of the <code>queue</code>.",
+        "Write a function <code>nextInLine</code> which takes an array (<code>arr</code>) and a number (<code>item</code>) as arguments.",
+        "Add the number to the end of the array, then remove the first element of the array.",
+        "The <code>nextInLine</code> function should then return the element that was removed."
+      ],
+      "releasedOn": "January 1, 2016",
+      "head": [
+        "var logOutput = [];",
+        "var originalConsole = console",
+        "function capture() {",
+        "    var nativeLog = console.log;",
+        "    console.log = function (message) {",
+        "        logOutput.push(message);",
+        "        if(nativeLog.apply) {",
+        "          nativeLog.apply(originalConsole, arguments);",
+        "        } else {",
+        "          var nativeMsg = Array.prototype.slice.apply(arguments).join(' ');",
+        "          nativeLog(nativeMsg);",
+        "        }",
+        "    };",
+        "}",
+        "",
+        "function uncapture() {",
+        "  console.log = originalConsole.log;",
+        "}",
+        "",
+        "capture();"
+      ],
+      "challengeSeed": [
+        "function nextInLine(arr, item) {",
+        "  // Your code here",
+        "  ",
+        "  return item;  // Change this line",
+        "}",
+        "",
+        "// Test Setup",
+        "var testArr = [1,2,3,4,5];",
+        "",
+        "// Display Code",
+        "console.log(\"Before: \" + JSON.stringify(testArr));",
+        "console.log(nextInLine(testArr, 6)); // Modify this line to test",
+        "console.log(\"After: \" + JSON.stringify(testArr));"
+      ],
+      "tail": [
+        "uncapture();",
+        "testArr = [1,2,3,4,5];",
+        "(function() { return logOutput.join(\"\\n\");})();"
+      ],
+      "solutions": [
+        "var testArr = [ 1,2,3,4,5];\n\nfunction nextInLine(arr, item) {\n    arr.push(item);\n    return arr.shift();\n}"
+      ],
+      "tests": [
+        "assert.isNumber(nextInLine([],5), 'message: <code>nextInLine([], 5)</code> should return a number.');",
+        "assert(nextInLine([],1) === 1, 'message: <code>nextInLine([], 1)</code> should return <code>1</code>');",
+        "assert(nextInLine([2],1) === 2, 'message: <code>nextInLine([2], 1)</code> should return <code>2</code>');",
+        "assert(nextInLine([5,6,7,8,9],1) === 5, 'message: <code>nextInLine([5,6,7,8,9], 1)</code> should return <code>5</code>');",
+        "nextInLine(testArr, 10); assert(testArr[4] === 10, 'message: After <code>nextInLine(testArr, 10)</code>, <code>testArr[4]</code> should be <code>10</code>');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Hacer cola",
+          "description": [
+            "En Ciencias de la Computación una <dfn>cola</dfn> es una <dfn>Estructura de Datos</dfn> abstracta donde los elementos son mantenidos en orden. Nuevos elementos pueden ser agregados en la parte trasera de la <code>cola</code> y los elementos viejos son quitados desde el frente de la <code>cola</code>.",
+            "Escribe una función <code>nextInLine</code> la cual toma un vector (<code>arr</code>) y un número (<code>item</code>) como argumentos. Agrega el número al final del vector, entonces retira el primer elemento del vector. La función nextInLine debe entonces devolver el elemento que se ha eliminado."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7123c9c441eddfaeb5bdef",
+      "title": "Understanding Boolean Values",
+      "description": [
+        "Another data type is the <dfn>Boolean</dfn>. <code>Booleans</code> may only be one of two values: <code>true</code> or <code>false</code>. They are basically little on-off switches, where <code>true</code> is \"on\" and <code>false</code> is \"off.\"  These two states are mutually exclusive.",
+        "<strong>Note</strong><br><code>Boolean</code> values are never written with quotes. The <code>strings</code> <code>\"true\"</code> and <code>\"false\"</code> are not <code>Boolean</code> and have no special meaning in JavaScript.",
+        "<hr>",
+        "Modify the <code>welcomeToBooleans</code> function so that it returns <code>true</code> instead of <code>false</code> when the run button is clicked."
+      ],
+      "challengeSeed": [
+        "function welcomeToBooleans() {",
+        "",
+        "// Only change code below this line.",
+        "",
+        "return false; // Change this line",
+        "",
+        "// Only change code above this line.",
+        "}"
+      ],
+      "tail": [
+        "welcomeToBooleans();"
+      ],
+      "solutions": [
+        "function welcomeToBooleans() {\n  return true; // Change this line\n}"
+      ],
+      "tests": [
+        "assert(typeof welcomeToBooleans() === 'boolean', 'message: The <code>welcomeToBooleans()</code> function should return a boolean &#40;true/false&#41; value.');",
+        "assert(welcomeToBooleans() === true, 'message: <code>welcomeToBooleans()</code> should return true.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Entiende los valores booleanos",
+          "description": [
+            "En informática las <code>estructuras de datos</code> son cosas que contienen datos. JavaScript tiene siete de estas. Por ejemplo, la estructura de datos <code>Número</code> contiene números. ",
+            "Vamos a aprender acerca de la estructura de datos más básica de todas: el <code>Boolean</code>. Los booleanos sólo puede contener el valor verdadero o el valor falso. Son básicamente pequeños interruptores de encendido y apagado. ",
+            "<h4>Instrucciones</h4>",
+            "Vamos a modificar nuestra función <code>welcomeToBooleans</code> para que devuelva <code>true</code> en lugar de <code>false</code> cuando se pulse el botón de ejecución."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c12feddfaeb3bdef",
+      "title": "Use Conditional Logic with If Statements",
+      "description": [
+        "<code>If</code> statements are used to make decisions in code. The keyword <code>if</code> tells JavaScript to execute the code in the curly braces under certain conditions, defined in the parentheses. These conditions are known as <code>Boolean</code> conditions and they may only be <code>true</code> or <code>false</code>.",
+        "When the condition evaluates to <code>true</code>, the program executes the statement inside the curly braces. When the Boolean condition evaluates to <code>false</code>, the statement inside the curly braces will not execute.",
+        "<strong>Pseudocode</strong>",
+        "<blockquote>if (<i>condition is true</i>) {<br>  <i>statement is executed</i><br>}</blockquote>",
+        "<strong>Example</strong>",
+        "<blockquote>function test (myCondition) {<br>  if (myCondition) {<br>     return \"It was true\";<br>  }<br>  return \"It was false\";<br>}<br>test(true);  // returns \"It was true\"<br>test(false); // returns \"It was false\"</blockquote>",
+        "When <code>test</code> is called with a value of <code>true</code>, the <code>if</code> statement evaluates <code>myCondition</code> to see if it is <code>true</code> or not. Since it is <code>true</code>, the function returns <code>\"It was true\"</code>. When we call <code>test</code> with a value of <code>false</code>, <code>myCondition</code> is <em>not</em> <code>true</code> and the statement in the curly braces is not executed and the function returns <code>\"It was false\"</code>.",
+        "<hr>",
+        "Create an <code>if</code> statement inside the function to return <code>\"Yes, that was true\"</code> if the parameter <code>wasThatTrue</code> is <code>true</code> and return <code>\"No, that was false\"</code> otherwise."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "function ourTrueOrFalse(isItTrue) {",
+        "  if (isItTrue) { ",
+        "    return \"Yes, it's true\";",
+        "  }",
+        "  return \"No, it's false\";",
+        "}",
+        "",
+        "// Setup",
+        "function trueOrFalse(wasThatTrue) {",
+        "",
+        "  // Only change code below this line.",
+        "  ",
+        "  ",
+        "  ",
+        "  // Only change code above this line.",
+        "",
+        "}",
+        "",
+        "// Change this value to test",
+        "trueOrFalse(true);"
+      ],
+      "solutions": [
+        "function trueOrFalse(wasThatTrue) {\n  if (wasThatTrue) {\n    return \"Yes, that was true\";\n  }\n  return \"No, that was false\";\n}"
+      ],
+      "tests": [
+        "assert(typeof trueOrFalse === \"function\", 'message: <code>trueOrFalse</code> should be a function');",
+        "assert(typeof trueOrFalse(true) === \"string\", 'message: <code>trueOrFalse(true)</code> should return a string');",
+        "assert(typeof trueOrFalse(false) === \"string\", 'message: <code>trueOrFalse(false)</code> should return a string');",
+        "assert(trueOrFalse(true) === \"Yes, that was true\", 'message: <code>trueOrFalse(true)</code> should return \"Yes, that was true\"');",
+        "assert(trueOrFalse(false) === \"No, that was false\", 'message: <code>trueOrFalse(false)</code> should return \"No, that was false\"');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Usa lógica condicional con instrucciones if y else",
+          "description": [
+            "Podemos usar instrucciones <code>if</code> (\"if\" es \"si\" en español) en JavaScript para ejecutar código sólo cuando cierta condición se cumpla.",
+            "Las instrucciones <code>if</code> requieren evaluar algún tipo de condición booleana.",
+            "Por ejemplo:",
+            "<code>if (1 === 2) {</code>",
+            "<code>&nbsp;&nbsp;return true;</code>",
+            "<code>} else {</code>",
+            "<code>&nbsp;&nbsp;return false;</code>",
+            "<code>}</code>",
+            "Vamos a usar la instrucción <code>if</code> con <code>else</code> (\"else\" puede traducirse como \"de lo contrario\") para hacer un juego de cara o sello.",
+            "<h4>Instrucciones</h4>",
+            "Crea una instrucción <code>if</code> con <code>else</code> que retorne la cadena <code>\"heads\"</code> si la variable <code>flip</code> es cero, o bien que retorne <code >\"tails\"</code> si la variable <code>flip</code> no es cero. "
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d0",
+      "title": "Comparison with the Equality Operator",
+      "description": [
+        "There are many <dfn>Comparison Operators</dfn> in JavaScript. All of these operators return a boolean <code>true</code> or <code>false</code> value.",
+        "The most basic operator is the equality operator <code>==</code>. The equality operator compares two values and returns <code>true</code> if they're equivalent or <code>false</code> if they are not. Note that equality is different from assignment (<code>=</code>), which assigns the value at the right of the operator to a variable in the left.",
+        "<blockquote>function equalityTest(myVal) {<br>  if (myVal == 10) {<br>     return \"Equal\";<br>  }<br>  return \"Not Equal\";<br>}</blockquote>",
+        "If <code>myVal</code> is equal to <code>10</code>, the equality operator returns <code>true</code>, so the code in the curly braces will execute, and the function will return <code>\"Equal\"</code>. Otherwise, the function will return <code>\"Not Equal\"</code>.",
+        "In order for JavaScript to compare two different <code>data types</code> (for example, <code>numbers</code> and <code>strings</code>), it must convert one type to another. Once it does, however, it can compare terms as follows:",
+        "<blockquote>   1   ==  1    // true<br>   1   ==  2    // false<br>   1   == '1'   // true<br>  \"3\"  ==  3    // true</blockquote>",
+        "<hr>",
+        "Add the <code>equality operator</code> to the indicated line so that the function will return \"Equal\" when <code>val</code> is equivalent to <code>12</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "function testEqual(val) {",
+        "  if (val) { // Change this line",
+        "    return \"Equal\";",
+        "  }",
+        "  return \"Not Equal\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testEqual(10);"
+      ],
+      "solutions": [
+        "function testEqual(val) {\n  if (val == 12) {\n    return \"Equal\";\n  }\n  return \"Not Equal\";\n}"
+      ],
+      "tests": [
+        "assert(testEqual(10) === \"Not Equal\", 'message: <code>testEqual(10)</code> should return \"Not Equal\"');",
+        "assert(testEqual(12) === \"Equal\", 'message: <code>testEqual(12)</code> should return \"Equal\"');",
+        "assert(testEqual(\"12\") === \"Equal\", 'message: <code>testEqual(\"12\")</code> should return \"Equal\"');",
+        "assert(code.match(/==/g) && !code.match(/===/g), 'message: You should use the <code>==</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador de igualdad",
+          "description": [
+            "Hay muchos <dfn>Operadores de Comparación</dfn> en JavaScript. Todos estos operadores retornan un valor booleano <code>true</code>(verdadero) o <code>false</code>(falso).",
+            "El operador más básico es el operador de igualdad <code>==</code>. El operador de igualdad compara dos valores y retorna <code>true</code> si son equivalentes o <code>false</code> si no lo son. Nota que la igualdad es diferente de la asignación (<code>=</code>), la cual asigna el valor a la derecha del operador a la variable en la izquierda.",
+            "<blockquote>function pruebaIgualdad(miVal) {<br>  if (miVal == 10) {<br>     return \"Igual\";<br>  }<br>  return \"No Es Igual\";<br>}</blockquote>",
+            "Si <code>miVal</code> es igual a <code>10</code>, el operador de igualdad retornará <code>true</code>(verdadero), así el código entre llaves será ejecutado y la función retornará <code>\"Equal\"</code>. De otra manera, la función retornará <code>\"Not Equal\"</code>.",
+            "Para que JavaScript pueda comparar dos <code>tipos de datos</code> diferentes (por ejemplo, <code>números</code> y <code>cadenas de texto</code>), debe convertir un tipo a otro. Una vez que lo hace, sin embargo, puede comparar términos de la siguiente manera:",
+            "<blockquote>   1   ==  1    // true<br>   1   ==  2    // false<br>   1   == '1'   // true<br>  \"3\"  ==  3    // true</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agrega el <code>operador de igualdad</code> a la línea indicada de manera que la función retornará \"Equal\" cuando <code>val</code> sea equivalente a <code>12</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d1",
+      "title": "Comparison with the Strict Equality Operator",
+      "description": [
+        "Strict equality (<code>===</code>) is the counterpart to the equality operator (<code>==</code>). Unlike the equality operator, strict equality tests both the <code>data type</code> and value of the compared elements.",
+        "<strong>Examples</strong>",
+        "<blockquote>3 === 3   // true<br>3 === '3' // false</blockquote>",
+        "In the second example, <code>3</code> is a <code>Number</code> type and <code>'3'</code> is a <code>String</code> type.",
+        "<hr>",
+        "Use the strict equality operator in the <code>if</code> statement so the function will return \"Equal\" when <code>val</code> is strictly equal to <code>7</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "function testStrict(val) {",
+        "  if (val) { // Change this line",
+        "    return \"Equal\";",
+        "  }",
+        "  return \"Not Equal\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testStrict(10);"
+      ],
+      "solutions": [
+        "function testStrict(val) {\n  if (val === 7) {\n    return \"Equal\";\n  }\n  return \"Not Equal\";\n}"
+      ],
+      "tests": [
+        "assert(testStrict(10) === \"Not Equal\", 'message: <code>testStrict(10)</code> should return \"Not Equal\"');",
+        "assert(testStrict(7) === \"Equal\", 'message: <code>testStrict(7)</code> should return \"Equal\"');",
+        "assert(testStrict(\"7\") === \"Not Equal\", 'message: <code>testStrict(\"7\")</code> should return \"Not Equal\"');",
+        "assert(code.match(/(val\\s*===\\s*\\d+)|(\\d+\\s*===\\s*val)/g).length > 0, 'message: You should use the <code>===</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador de estricta igualdad",
+          "description": [
+            "Igualdad estricta (<code>===</code>) es la contraparte del operador de igualdad (<code>==</code>). Diferente al operador de igualdad, igualdad estricta prueba los <code>tipos de datos</code> y el valor de los elementos comparados.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote>3 === 3   // true<br>3 === '3' // falso</blockquote>",
+            "En el segundo ejemplo, <code>3</code> es de tipo <code>Número</code> y <code>'3'</code> es de tipo <code>Cadena</code>.",
+            "<h4>Instrucciones</h4>",
+            "Usa el operador de igualdad estricta en la sentencia <code>if</code> de manera que la función retorne \"Equal\" cuando <code>val</code> es estrictamente igual a <code>7</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d2",
+      "title": "Comparison with the Inequality Operator",
+      "description": [
+        "The inequality operator (<code>!=</code>) is the opposite of the equality operator. It means \"Not Equal\" and returns <code>false</code> where equality would return <code>true</code> and <em>vice versa</em>. Like the equality operator, the inequality operator will convert data types of values while comparing.",
+        "<strong>Examples</strong>",
+        "<blockquote>1 != 2      // true<br>1 != \"1\"    // false<br>1 != '1'    // false<br>1 != true   // false<br>0 != false  // false</blockquote>",
+        "<hr>",
+        "Add the inequality operator <code>!=</code> in the <code>if</code> statement so that the function will return \"Not Equal\" when <code>val</code> is not equivalent to <code>99</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "function testNotEqual(val) {",
+        "  if (val) { // Change this line",
+        "    return \"Not Equal\";",
+        "  }",
+        "  return \"Equal\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testNotEqual(10);"
+      ],
+      "solutions": [
+        "function testNotEqual(val) {\n  if (val != 99) {\n    return \"Not Equal\";\n  }\n  return \"Equal\";\n}"
+      ],
+      "tests": [
+        "assert(testNotEqual(99) === \"Equal\", 'message: <code>testNotEqual(99)</code> should return \"Equal\"');",
+        "assert(testNotEqual(\"99\") === \"Equal\", 'message: <code>testNotEqual(\"99\")</code> should return \"Equal\"');",
+        "assert(testNotEqual(12) === \"Not Equal\", 'message: <code>testNotEqual(12)</code> should return \"Not Equal\"');",
+        "assert(testNotEqual(\"12\") === \"Not Equal\", 'message: <code>testNotEqual(\"12\")</code> should return \"Not Equal\"');",
+        "assert(testNotEqual(\"bob\") === \"Not Equal\", 'message: <code>testNotEqual(\"bob\")</code> should return \"Not Equal\"');",
+        "assert(code.match(/(?!!==)!=/), 'message: You should use the <code>!=</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador de desigualdad",
+          "description": [
+            "El operador de desigualdad (<code>!=</code>) es el opuesto al operador de igualdad. Esto significa \"No Igual a\" y retorna <code>false</code> cuando igualdad retornaría <code>true</code> y <em>viceversa</em>. Como el operador de igualdad, el operador de desigualdad convertirá tipos de datos mientras compara.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote>1 != 2      // true<br>1 != \"1\"    // false<br>1 != '1'    // false<br>1 != true   // false<br>0 != false  // false</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agrega el operador de desigualdad <code>!=</code> en la sentencia <code>if</code> de manera que la función retorne \"Not Equal\" (No igual a) cuando <code>val</code> no es equivalente a <code>99</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d3",
+      "title": "Comparison with the Strict Inequality Operator",
+      "description": [
+        "The strict inequality operator (<code>!==</code>) is the logical opposite of the strict equality operator. It means \"Strictly Not Equal\" and returns <code>false</code> where strict equality would return <code>true</code> and <em>vice versa</em>. Strict inequality will not convert data types.",
+        "<strong>Examples</strong>",
+        "<blockquote>3 !== 3   // false<br>3 !== '3' // true<br>4 !== 3   // true</blockquote>",
+        "<hr>",
+        "Add the <code>strict inequality operator</code> to the <code>if</code> statement so the function will return \"Not Equal\" when <code>val</code> is not strictly equal to <code>17</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "function testStrictNotEqual(val) {",
+        "  // Only Change Code Below this Line",
+        "  ",
+        "  if (val) {",
+        "",
+        "  // Only Change Code Above this Line",
+        "",
+        "    return \"Not Equal\";",
+        "  }",
+        "  return \"Equal\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testStrictNotEqual(10);"
+      ],
+      "solutions": [
+        "function testStrictNotEqual(val) {\n  if (val !== 17) {\n    return \"Not Equal\";\n  }\n  return \"Equal\";\n}"
+      ],
+      "MDNlinks": [
+        "Strict Inequality Operator"
+      ],
+      "tests": [
+        "assert(testStrictNotEqual(17) === \"Equal\", 'message: <code>testStrictNotEqual(17)</code> should return \"Equal\"');",
+        "assert(testStrictNotEqual(\"17\") === \"Not Equal\", 'message: <code>testStrictNotEqual(\"17\")</code> should return \"Not Equal\"');",
+        "assert(testStrictNotEqual(12) === \"Not Equal\", 'message: <code>testStrictNotEqual(12)</code> should return \"Not Equal\"');",
+        "assert(testStrictNotEqual(\"bob\") === \"Not Equal\", 'message: <code>testStrictNotEqual(\"bob\")</code> should return \"Not Equal\"');",
+        "assert(code.match(/(val\\s*!==\\s*\\d+)|(\\d+\\s*!==\\s*val)/g).length > 0, 'message: You should use the <code>!==</code> operator');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador de estricta desigualdad",
+          "description": [
+            "El operador de estricta desigualdad (<code>!==</code>) es el opuesto al operador de estricta igualdad. Esto significa \"Estrictamente no Igual\" y retorna <code>false</code>(falso) donde igualdad estricta retornaría <code>true</code>(verdadero) y <em>viceversa</em>. Estricta desigualdad no convertirá tipos de datos.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote>3 !== 3   // false<br>3 !== '3' // true<br>4 !== 3   // true</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agrega el <code>operador de estricta desigualdad</code> a la sentencia <code>if</code> de manera que la función retorne \"Not Equal\" cuando <code>val</code> no es estrictamente igual a <code>17</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d4",
+      "title": "Comparison with the Greater Than Operator",
+      "description": [
+        "The greater than operator (<code>&gt;</code>) compares the values of two numbers. If the number to the left is greater than the number to the right, it returns <code>true</code>. Otherwise, it returns <code>false</code>.",
+        "Like the equality operator, greater than operator will convert data types of values while comparing.",
+        "<strong>Examples</strong>",
+        "<blockquote> 5 > 3   // true<br> 7 > '3' // true<br> 2 > 3   // false<br>'1' > 9  // false</blockquote>",
+        "<hr>",
+        "Add the <code>greater than</code> operator to the indicated lines so that the return statements make sense."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testGreaterThan(val) {",
+        "  if (val) {  // Change this line",
+        "    return \"Over 100\";",
+        "  }",
+        "  ",
+        "  if (val) {  // Change this line",
+        "    return \"Over 10\";",
+        "  }",
+        "",
+        "  return \"10 or Under\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testGreaterThan(10);"
+      ],
+      "solutions": [
+        "function testGreaterThan(val) {\n  if (val > 100) {  // Change this line\n    return \"Over 100\";\n  }\n  if (val > 10) {  // Change this line\n    return \"Over 10\";\n  }\n  return \"10 or Under\";\n}"
+      ],
+      "tests": [
+        "assert(testGreaterThan(0) === \"10 or Under\", 'message: <code>testGreaterThan(0)</code> should return \"10 or Under\"');",
+        "assert(testGreaterThan(10) === \"10 or Under\", 'message: <code>testGreaterThan(10)</code> should return \"10 or Under\"');",
+        "assert(testGreaterThan(11) === \"Over 10\", 'message: <code>testGreaterThan(11)</code> should return \"Over 10\"');",
+        "assert(testGreaterThan(99) === \"Over 10\", 'message: <code>testGreaterThan(99)</code> should return \"Over 10\"');",
+        "assert(testGreaterThan(100) === \"Over 10\", 'message: <code>testGreaterThan(100)</code> should return \"Over 10\"');",
+        "assert(testGreaterThan(101) === \"Over 100\", 'message: <code>testGreaterThan(101)</code> should return \"Over 100\"');",
+        "assert(testGreaterThan(150) === \"Over 100\", 'message: <code>testGreaterThan(150)</code> should return \"Over 100\"');",
+        "assert(code.match(/val\\s*>\\s*('|\")*\\d+('|\")*/g).length > 1, 'message: You should use the <code>&gt;</code> operator at least twice');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador mayor que",
+          "description": [
+            "El operador mayor que (<code>&gt;</code>) compara los valores de dos números. Si el número a la izquierda es mayor que el número a la derecha, este returna <code>true</code>(verdadero). De otra manera, este retorna <code>false</code>(falso).",
+            "Al igual que el operador de igualdad, el operador mayor que convertirá tipos de datos de valores mientras los compara.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote> 5 > 3   // true<br> 7 > '3' // true<br> 2 > 3   // false<br>'1' > 9  // false</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agrega el operador <code>mayor que</code> para las líneas indicadas de manera que las sentencias retornadas tengan sentido."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d5",
+      "title": "Comparison with the Greater Than Or Equal To Operator",
+      "description": [
+        "The <code>greater than or equal to</code> operator (<code>&gt;=</code>) compares the values of two numbers. If the number to the left is greater than or equal to the number to the right, it returns <code>true</code>. Otherwise, it returns <code>false</code>.",
+        "Like the equality operator, <code>greater than or equal to</code> operator will convert data types while comparing.",
+        "<strong>Examples</strong>",
+        "<blockquote> 6  >=  6  // true<br> 7  >= '3' // true<br> 2  >=  3  // false<br>'7' >=  9  // false</blockquote>",
+        "<hr>",
+        "Add the <code>greater than or equal to</code> operator to the indicated lines so that the return statements make sense."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testGreaterOrEqual(val) {",
+        "  if (val) {  // Change this line",
+        "    return \"20 or Over\";",
+        "  }",
+        "  ",
+        "  if (val) {  // Change this line",
+        "    return \"10 or Over\";",
+        "  }",
+        "",
+        "  return \"Less than 10\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testGreaterOrEqual(10);"
+      ],
+      "solutions": [
+        "function testGreaterOrEqual(val) {\n  if (val >= 20) {  // Change this line\n    return \"20 or Over\";\n  }\n  \n  if (val >= 10) {  // Change this line\n    return \"10 or Over\";\n  }\n\n  return \"Less than 10\";\n}"
+      ],
+      "tests": [
+        "assert(testGreaterOrEqual(0) === \"Less than 10\", 'message: <code>testGreaterOrEqual(0)</code> should return \"Less than 10\"');",
+        "assert(testGreaterOrEqual(9) === \"Less than 10\", 'message: <code>testGreaterOrEqual(9)</code> should return \"Less than 10\"');",
+        "assert(testGreaterOrEqual(10) === \"10 or Over\", 'message: <code>testGreaterOrEqual(10)</code> should return \"10 or Over\"');",
+        "assert(testGreaterOrEqual(11) === \"10 or Over\", 'message: <code>testGreaterOrEqual(11)</code> should return \"10 or Over\"');",
+        "assert(testGreaterOrEqual(19) === \"10 or Over\", 'message: <code>testGreaterOrEqual(19)</code> should return \"10 or Over\"');",
+        "assert(testGreaterOrEqual(100) === \"20 or Over\", 'message: <code>testGreaterOrEqual(100)</code> should return \"20 or Over\"');",
+        "assert(testGreaterOrEqual(21) === \"20 or Over\", 'message: <code>testGreaterOrEqual(21)</code> should return \"20 or Over\"');",
+        "assert(code.match(/val\\s*>=\\s*('|\")*\\d+('|\")*/g).length > 1, 'message: You should use the <code>&gt;=</code> operator at least twice');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador mayor o ogual",
+          "description": [
+            "El operador <code>mayor o igual </code> (<code>&gt;=</code>) compara los valores de dos números. Si el número de la izquierda es mayor o igual a el número de la derecha, este retorna <code>true</code>(verdadero). De otra manera, este retorna <code>false</code>(falso).",
+            "Como el operador de igualdad, el operador <code>mayor o igual</code> convertirá tipos de datos mientras está comparando.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote> 6  >=  6  // true<br> 7  >= '3' // true<br> 2  >=  3  // false<br>'7' >=  9  // false</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agrega el operador <code>mayor o igual</code> a las líneas indicadas de manera que las sentencias de retorno tengan sentido."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d6",
+      "title": "Comparison with the Less Than Operator",
+      "description": [
+        "The <dfn>less than</dfn> operator (<code>&lt;</code>) compares the values of two numbers. If the number to the left is less than the number to the right, it returns <code>true</code>. Otherwise, it returns <code>false</code>. Like the equality operator, <dfn>less than</dfn> operator converts data types while comparing.",
+        "<strong>Examples</strong>",
+        "<blockquote>  2 &lt; 5  // true<br>'3' &lt; 7  // true<br>  5 &lt; 5  // false<br>  3 &lt; 2  // false<br>'8' &lt; 4  // false</blockquote>",
+        "<hr>",
+        "Add the <code>less than</code> operator to the indicated lines so that the return statements make sense."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testLessThan(val) {",
+        "  if (val) {  // Change this line",
+        "    return \"Under 25\";",
+        "  }",
+        "  ",
+        "  if (val) {  // Change this line",
+        "    return \"Under 55\";",
+        "  }",
+        "",
+        "  return \"55 or Over\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testLessThan(10);"
+      ],
+      "solutions": [
+        "function testLessThan(val) {\n  if (val < 25) {  // Change this line\n    return \"Under 25\";\n  }\n  \n  if (val < 55) {  // Change this line\n    return \"Under 55\";\n  }\n\n  return \"55 or Over\";\n}"
+      ],
+      "tests": [
+        "assert(testLessThan(0) === \"Under 25\", 'message: <code>testLessThan(0)</code> should return \"Under 25\"');",
+        "assert(testLessThan(24) === \"Under 25\", 'message: <code>testLessThan(24)</code> should return \"Under 25\"');",
+        "assert(testLessThan(25) === \"Under 55\", 'message: <code>testLessThan(25)</code> should return \"Under 55\"');",
+        "assert(testLessThan(54) === \"Under 55\", 'message: <code>testLessThan(54)</code> should return \"Under 55\"');",
+        "assert(testLessThan(55) === \"55 or Over\", 'message: <code>testLessThan(55)</code> should return \"55 or Over\"');",
+        "assert(testLessThan(99) === \"55 or Over\", 'message: <code>testLessThan(99)</code> should return \"55 or Over\"');",
+        "assert(code.match(/val\\s*<\\s*('|\")*\\d+('|\")*/g).length > 1, 'message: You should use the <code>&lt;</code> operator at least twice');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador menor que",
+          "description": [
+            "El operador <dfn>menor que</dfn> (<code>&lt;</code>) compara los valores de dos números. Si el número a la izquierda es menor que el número de la derecha, este retorna <code>true</code>(verdadero). De otra manera, este retorna <code>false</code>(falso). Como el operador de igualdad, el operador <dfn>menor que</dfn> convierte tipos de datos mientra compara.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote>  2 &lt; 5  // true<br>'3' &lt; 7  // true<br>  5 &lt; 5  // false<br>  3 &lt; 2  // false<br>'8' &lt; 4  // false</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agregar el operador <code>menor que</code> a las líneas indicadas de modo que las sentencias de retorno tengan sentido."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d7",
+      "title": "Comparison with the Less Than Or Equal To Operator",
+      "description": [
+        "The <code>less than or equal to</code> operator (<code>&lt;=</code>) compares the values of two numbers. If the number to the left is less than or equal to the number to the right, it returns <code>true</code>. If the number on the left is greater than the number on the right, it returns <code>false</code>. Like the equality operator, <code>less than or equal to</code> converts data types.",
+        "<strong>Examples</strong>",
+        "<blockquote>  4 &lt;= 5  // true<br>'7' &lt;= 7  // true<br>  5 &lt;= 5  // true<br>  3 &lt;= 2  // false<br>'8' &lt;= 4  // false</blockquote>",
+        "<hr>",
+        "Add the <code>less than or equal to</code> operator to the indicated lines so that the return statements make sense."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testLessOrEqual(val) {",
+        "  if (val) {  // Change this line",
+        "    return \"Smaller Than or Equal to 12\";",
+        "  }",
+        "  ",
+        "  if (val) {  // Change this line",
+        "    return \"Smaller Than or Equal to 24\";",
+        "  }",
+        "",
+        "  return \"More Than 24\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testLessOrEqual(10);",
+        ""
+      ],
+      "solutions": [
+        "function testLessOrEqual(val) {\n  if (val <= 12) {  // Change this line\n    return \"Smaller Than or Equal to 12\";\n  }\n  \n  if (val <= 24) {  // Change this line\n    return \"Smaller Than or Equal to 24\";\n  }\n\n  return \"More Than 24\";\n}"
+      ],
+      "tests": [
+        "assert(testLessOrEqual(0) === \"Smaller Than or Equal to 12\", 'message: <code>testLessOrEqual(0)</code> should return \"Smaller Than or Equal to 12\"');",
+        "assert(testLessOrEqual(11) === \"Smaller Than or Equal to 12\", 'message: <code>testLessOrEqual(11)</code> should return \"Smaller Than or Equal to 12\"');",
+        "assert(testLessOrEqual(12) === \"Smaller Than or Equal to 12\", 'message: <code>testLessOrEqual(12)</code> should return \"Smaller Than or Equal to 12\"');",
+        "assert(testLessOrEqual(23) === \"Smaller Than or Equal to 24\", 'message: <code>testLessOrEqual(23)</code> should return \"Smaller Than or Equal to 24\"');",
+        "assert(testLessOrEqual(24) === \"Smaller Than or Equal to 24\", 'message: <code>testLessOrEqual(24)</code> should return \"Smaller Than or Equal to 24\"');",
+        "assert(testLessOrEqual(25) === \"More Than 24\", 'message: <code>testLessOrEqual(25)</code> should return \"More Than 24\"');",
+        "assert(testLessOrEqual(55) === \"More Than 24\", 'message: <code>testLessOrEqual(55)</code> should return \"More Than 24\"');",
+        "assert(code.match(/val\\s*<=\\s*('|\")*\\d+('|\")*/g).length > 1, 'message: You should use the <code>&lt;=</code> operator at least twice');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador menor o igual",
+          "description": [
+            "El operador <code>menor o igual</code> (<code>&lt;=</code>) compara los valores de dos números. Si el número a la izquierda es menor o igual que el número de la derecha, este retorna <code>true</code>(verdadero). Si el número a la izquierda es mayor que el número de la derecha, este retorna <code>false</code>(falso). Al igual que el operador de igualdad, <code>menor o igual</code> convierte tipos de datos.",
+            "<strong>Ejemplos</strong>",
+            "<blockquote>  4 &lt;= 5  // true<br>'7' &lt;= 7  // true<br>  5 &lt;= 5  // true<br>  3 &lt;= 2  // false<br>'8' &lt;= 4  // false</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Agrega el operador <code>menor o igual</code> a las líneas indicadas de modo que las sentencias de retorno tengan sentido."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d8",
+      "title": "Comparisons with the Logical And Operator",
+      "description": [
+        "Sometimes you will need to test more than one thing at a time. The <dfn>logical and</dfn> operator (<code>&&</code>) returns <code>true</code> if and only if the <dfn>operands</dfn> to the left and right of it are true.",
+        "The same effect could be achieved by nesting an if statement inside another if:",
+        "<blockquote>if (num > 5) {<br>  if (num < 10) {<br>    return \"Yes\";<br>  }<br>}<br>return \"No\";</blockquote>",
+        "will only return \"Yes\" if <code>num</code> is greater than <code>5</code> and less than <code>10</code>. The same logic can be written as:",
+        "<blockquote>if (num > 5 && num < 10) {<br>  return \"Yes\";<br>}<br>return \"No\";</blockquote>",
+        "<hr>",
+        "Combine the two if statements into one statement which will return <code>\"Yes\"</code> if <code>val</code> is less than or equal to <code>50</code> and greater than or equal to <code>25</code>. Otherwise, will return <code>\"No\"</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testLogicalAnd(val) {",
+        "  // Only change code below this line",
+        "",
+        "  if (val) {",
+        "    if (val) {",
+        "      return \"Yes\";",
+        "    }",
+        "  }",
+        "",
+        "  // Only change code above this line",
+        "  return \"No\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testLogicalAnd(10);"
+      ],
+      "solutions": [
+        "function testLogicalAnd(val) {\n  if (val >= 25 && val <= 50) {\n    return \"Yes\";\n  }\n  return \"No\";\n}"
+      ],
+      "tests": [
+        "assert(code.match(/&&/g).length === 1, 'message: You should use the <code>&&</code> operator once');",
+        "assert(code.match(/if/g).length === 1, 'message: You should only have one <code>if</code> statement');",
+        "assert(testLogicalAnd(0) === \"No\", 'message: <code>testLogicalAnd(0)</code> should return \"No\"');",
+        "assert(testLogicalAnd(24) === \"No\", 'message: <code>testLogicalAnd(24)</code> should return \"No\"');",
+        "assert(testLogicalAnd(25) === \"Yes\", 'message: <code>testLogicalAnd(25)</code> should return \"Yes\"');",
+        "assert(testLogicalAnd(30) === \"Yes\", 'message: <code>testLogicalAnd(30)</code> should return \"Yes\"');",
+        "assert(testLogicalAnd(50) === \"Yes\", 'message: <code>testLogicalAnd(50)</code> should return \"Yes\"');",
+        "assert(testLogicalAnd(51) === \"No\", 'message: <code>testLogicalAnd(51)</code> should return \"No\"');",
+        "assert(testLogicalAnd(75) === \"No\", 'message: <code>testLogicalAnd(75)</code> should return \"No\"');",
+        "assert(testLogicalAnd(80) === \"No\", 'message: <code>testLogicalAnd(80)</code> should return \"No\"');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador lógico y",
+          "description": [
+            "A veces necesitarás probar más de una cosa a la vez. El operador <dfn>lógico y</dfn> (<code>&&</code>) retorna <code>true</code>(verdadero) si y solo si los <dfn>operandos</dfn> a la izquierda y derecha de este son verdaderos.",
+            "El mismo efecto podría lograrse anidando una sentencia if dentro de otro if:",
+            "<blockquote>if (num > 5) {<br>  if (num < 10) {<br>    return \"Yes\";<br>  }<br>}<br>return \"No\";</blockquote>",
+            "solo retornará \"Yes\" si <code>num</code> está entre <code>6</code> y <code>9</code> (6 y 9 incluidos). La misma lógica puede ser escrita como:",
+            "<blockquote>if (num > 5 && num < 10) {<br>  return \"Yes\";<br>}<br>return \"No\";</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Combina las dos sentencias if dentro de una sentencia la cual retornará <code>\"Yes\"</code> si <code>val</code> es menor o igual a <code>50</code> y mayor o igual a <code>25</code>. De otra manera, retornará <code>\"No\"</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244d9",
+      "title": "Comparisons with the Logical Or Operator",
+      "description": [
+        "The <dfn>logical or</dfn> operator (<code>||</code>) returns <code>true</code> if either of the <dfn>operands</dfn> is <code>true</code>. Otherwise, it returns <code>false</code>.",
+        "The <dfn>logical or</dfn> operator is composed of two pipe symbols (<code>|</code>). This can typically be found between your Backspace and Enter keys.",
+        "The pattern below should look familiar from prior waypoints:",
+        "<blockquote>if (num > 10) {<br>  return \"No\";<br>}<br>if (num < 5) {<br>  return \"No\";<br>}<br>return \"Yes\";</blockquote>",
+        "will return \"Yes\" only if <code>num</code> is between <code>5</code> and <code>10</code> (5 and 10 included). The same logic can be written as:",
+        "<blockquote>if (num > 10 || num < 5) {<br>  return \"No\";<br>}<br>return \"Yes\";</blockquote>",
+        "<hr>",
+        "Combine the two <code>if</code> statements into one statement which returns <code>\"Outside\"</code> if <code>val</code> is not between <code>10</code> and <code>20</code>, inclusive. Otherwise, return <code>\"Inside\"</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testLogicalOr(val) {",
+        "  // Only change code below this line",
+        "",
+        "  if (val) {",
+        "    return \"Outside\";",
+        "  }",
+        "",
+        "  if (val) {",
+        "    return \"Outside\";",
+        "  }",
+        "",
+        "  // Only change code above this line",
+        "  return \"Inside\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testLogicalOr(15);"
+      ],
+      "solutions": [
+        "function testLogicalOr(val) {\n  if (val < 10 || val > 20) {\n    return \"Outside\";\n  }\n  return \"Inside\";\n}"
+      ],
+      "tests": [
+        "assert(code.match(/\\|\\|/g).length === 1, 'message: You should use the <code>||</code> operator once');",
+        "assert(code.match(/if/g).length === 1, 'message: You should only have one <code>if</code> statement');",
+        "assert(testLogicalOr(0) === \"Outside\", 'message: <code>testLogicalOr(0)</code> should return \"Outside\"');",
+        "assert(testLogicalOr(9) === \"Outside\", 'message: <code>testLogicalOr(9)</code> should return \"Outside\"');",
+        "assert(testLogicalOr(10) === \"Inside\", 'message: <code>testLogicalOr(10)</code> should return \"Inside\"');",
+        "assert(testLogicalOr(15) === \"Inside\", 'message: <code>testLogicalOr(15)</code> should return \"Inside\"');",
+        "assert(testLogicalOr(19) === \"Inside\", 'message: <code>testLogicalOr(19)</code> should return \"Inside\"');",
+        "assert(testLogicalOr(20) === \"Inside\", 'message: <code>testLogicalOr(20)</code> should return \"Inside\"');",
+        "assert(testLogicalOr(21) === \"Outside\", 'message: <code>testLogicalOr(21)</code> should return \"Outside\"');",
+        "assert(testLogicalOr(25) === \"Outside\", 'message: <code>testLogicalOr(25)</code> should return \"Outside\"');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "La comparación con el operador lógico o",
+          "description": [
+            "El operador <dfn>lógico o</dfn> (<code>||</code>) retorna <code>true</code>(verdadero) si cualquiera de los <dfn>operandos</dfn> es <code>true</code>(verdadero). De otra manera, este retorna <code>false</code>(falso).",
+            "El patrón de abajo debería ser familiar de los puntos de referencia anteriores:",
+            "<blockquote>if (num > 10) {<br>  return \"No\";<br>}<br>if (num < 5) {<br>  return \"No\";<br>}<br>return \"Yes\";</blockquote>",
+            "retornará \"Yes\" solo si <code>num</code> está entre <code>5</code> y <code>10</code> (5 y 10 incluidos). La misma lógica puede ser escrita como:",
+            "<blockquote>if (num > 10 || num < 5) {<br>  return \"No\";<br>}<br>return \"Yes\";</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Combina las dos sentencias <code>if</code> dentro de una sentencia la cual retorne <code>\"Outside\"</code> si <code>val</code> no está entre <code>10</code> y <code>20</code>, inclusive. De otra manera, retorna <code>\"Inside\"</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244da",
+      "title": "Introducing Else Statements",
+      "description": [
+        "When a condition for an <code>if</code> statement is true, the block of code following it is executed. What about when that condition is false?  Normally nothing would happen. With an <code>else</code> statement, an alternate block of code can be executed.",
+        "<blockquote>if (num > 10) {<br>  return \"Bigger than 10\";<br>} else {<br>  return \"10 or Less\";<br>}</blockquote>",
+        "<hr>",
+        "Combine the <code>if</code> statements into a single <code>if/else</code> statement."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testElse(val) {",
+        "  var result = \"\";",
+        "  // Only change code below this line",
+        "  ",
+        "  if (val > 5) {",
+        "    result = \"Bigger than 5\";",
+        "  }",
+        "  ",
+        "  if (val <= 5) {",
+        "    result = \"5 or Smaller\";",
+        "  }",
+        "  ",
+        "  // Only change code above this line",
+        "  return result;",
+        "}",
+        "",
+        "// Change this value to test",
+        "testElse(4);",
+        ""
+      ],
+      "solutions": [
+        "function testElse(val) {\n  var result = \"\";\n  if(val > 5) {\n    result = \"Bigger than 5\";\n  } else {\n    result = \"5 or Smaller\";\n  }\n  return result;\n}"
+      ],
+      "tests": [
+        "assert(code.match(/if/g).length === 1, 'message: You should only have one <code>if</code> statement in the editor');",
+        "assert(/else/g.test(code), 'message: You should use an <code>else</code> statement');",
+        "assert(testElse(4) === \"5 or Smaller\", 'message: <code>testElse(4)</code> should return \"5 or Smaller\"');",
+        "assert(testElse(5) === \"5 or Smaller\", 'message: <code>testElse(5)</code> should return \"5 or Smaller\"');",
+        "assert(testElse(6) === \"Bigger than 5\", 'message: <code>testElse(6)</code> should return \"Bigger than 5\"');",
+        "assert(testElse(10) === \"Bigger than 5\", 'message: <code>testElse(10)</code> should return \"Bigger than 5\"');",
+        "assert(/var result = \"\";/.test(code) && /return result;/.test(code), 'message: Do not change the code above or below the lines.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Introducción de las sentencias else",
+          "description": [
+            "Cuando una condición de una sentencia <code>if</code> es verdadera, el siguiente bloque de código es ejecutado. ¿Y cuando esa condición es falsa? Normalmente nada pasaría. Con una sentencia <code>else</code>(además), un bloque alternativo de código puede ser ejecutado.",
+            "<blockquote>if (num > 10) {<br>  return \"Más grande que 10\";<br>} else {<br>  return \"10 o Menos\";<br>}</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Combina las sentencias <code>if</code> dentro de una sola sentencia <code>if/else</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244db",
+      "title": "Introducing Else If Statements",
+      "description": [
+        "If you have multiple conditions that need to be addressed, you can chain <code>if</code> statements together with <code>else if</code> statements.",
+        "<blockquote>if (num > 15) {<br>  return \"Bigger than 15\";<br>} else if (num < 5) {<br>  return \"Smaller than 5\";<br>} else {<br>  return \"Between 5 and 15\";<br>}</blockquote>",
+        "<hr>",
+        "Convert the logic to use <code>else if</code> statements."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testElseIf(val) {",
+        "  if (val > 10) {",
+        "    return \"Greater than 10\";",
+        "  }",
+        "  ",
+        "  if (val < 5) {",
+        "    return \"Smaller than 5\";",
+        "  }",
+        "  ",
+        "  return \"Between 5 and 10\";",
+        "}",
+        "",
+        "// Change this value to test",
+        "testElseIf(7);",
+        ""
+      ],
+      "solutions": [
+        "function testElseIf(val) {\n  if(val > 10) {\n    return \"Greater than 10\";\n  } else if(val < 5) {\n    return \"Smaller than 5\";\n  } else {\n    return \"Between 5 and 10\";\n  }\n}"
+      ],
+      "tests": [
+        "assert(code.match(/else/g).length > 1, 'message: You should have at least two <code>else</code> statements');",
+        "assert(code.match(/if/g).length > 1, 'message: You should have at least two <code>if</code> statements');",
+        "assert(testElseIf(0) === \"Smaller than 5\", 'message: <code>testElseIf(0)</code> should return \"Smaller than 5\"');",
+        "assert(testElseIf(5) === \"Between 5 and 10\", 'message: <code>testElseIf(5)</code> should return \"Between 5 and 10\"');",
+        "assert(testElseIf(7) === \"Between 5 and 10\", 'message: <code>testElseIf(7)</code> should return \"Between 5 and 10\"');",
+        "assert(testElseIf(10) === \"Between 5 and 10\", 'message: <code>testElseIf(10)</code> should return \"Between 5 and 10\"');",
+        "assert(testElseIf(12) === \"Greater than 10\", 'message: <code>testElseIf(12)</code> should return \"Greater than 10\"');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Introducción de las sentencias else if",
+          "description": [
+            "Si tienes múltiples condiciones que deben abordarse, puedes encadenar sentencias <code>if</code> juntas con sentencias <code>else if</code>.",
+            "<blockquote>if (num > 15) {<br>  return \"Más grande que 15\";<br>} else if (num < 5) {<br>  return \"Más pequeño que 5\";<br>} else {<br>  return \"Entre 5 y 15\";<br>}</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Convierte la lógica para usar sentencias <code>else if</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "5690307fddb111c6084545d7",
+      "title": "Logical Order in If Else Statements",
+      "description": [
+        "Order is important in <code>if</code>, <code>else if</code> statements.",
+        "The function is executed from top to bottom so you will want to be careful of what statement comes first.",
+        "Take these two functions as an example.",
+        "Here's the first:",
+        "<blockquote>function foo(x) {<br>  if (x < 1) {<br>    return \"Less than one\";<br>  } else if (x < 2) {<br>    return \"Less than two\";<br>  } else {<br>    return \"Greater than or equal to two\";<br>  }<br>}</blockquote>",
+        "And the second just switches the order of the statements:",
+        "<blockquote>function bar(x) {<br>  if (x < 2) {<br>    return \"Less than two\";<br>  } else if (x < 1) {<br>    return \"Less than one\";<br>  } else {<br>    return \"Greater than or equal to two\";<br>  }<br>}</blockquote>",
+        "While these two functions look nearly identical if we pass a number to both we get different outputs.",
+        "<blockquote>foo(0) // \"Less than one\"<br>bar(0) // \"Less than two\"</blockquote>",
+        "<hr>",
+        "Change the order of logic in the function so that it will return the correct statements in all cases."
+      ],
+      "challengeSeed": [
+        "function orderMyLogic(val) {",
+        "  if (val < 10) {",
+        "    return \"Less than 10\";",
+        "  } else if (val < 5) {",
+        "    return \"Less than 5\";",
+        "  } else {",
+        "    return \"Greater than or equal to 10\";",
+        "  }",
+        "}",
+        "",
+        "// Change this value to test",
+        "orderMyLogic(7);"
+      ],
+      "solutions": [
+        "function orderMyLogic(val) {\n  if(val < 5) {\n    return \"Less than 5\";            \n  } else if (val < 10) {\n    return \"Less than 10\";\n  } else {\n    return \"Greater than or equal to 10\";\n  }\n}"
+      ],
+      "tests": [
+        "assert(orderMyLogic(4) === \"Less than 5\", 'message: <code>orderMyLogic(4)</code> should return \"Less than 5\"');",
+        "assert(orderMyLogic(6) === \"Less than 10\", 'message: <code>orderMyLogic(6)</code> should return \"Less than 10\"');",
+        "assert(orderMyLogic(11) === \"Greater than or equal to 10\", 'message: <code>orderMyLogic(11)</code> should return \"Greater than or equal to 10\"');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Orden lógico en sentencias else if",
+          "description": [
+            "El orden es importante en las sentencia <code>if</code> y <code>else if</code>.",
+            "El ciclo es ejecutado de arriba hacia abajo por lo que tendrás que ser cuidadoso de cual sentencia va primero.",
+            "Toma estas dos funciones como ejemplo.",
+            "Aquí está la primera:",
+            "<blockquote>function foo(x) {<br>  if (x < 1) {<br>    return \"Menor que uno\";<br>  } else if (x < 2) {<br>    return \"Menor que dos\";<br>  } else {<br>    return \"Mayor o igual a dos\";<br>  }<br>}</blockquote>",
+            "Y el segundo solo cambia el orden de las sentencias:",
+            "<blockquote>function bar(x) {<br>  if (x < 2) {<br>    return \"Menor que dos\";<br>  } else if (x < 1) {<br>    return \"Menor que uno\";<br>  } else {<br>    return \"Mayor o igual a dos\";<br>  }<br>}</blockquote>",
+            "Mientras esas dos funciones parecen casi idénticas, si nosotros pasamos un número a ambas obtendremos diferentes salidas.",
+            "<blockquote>foo(0) // \"Menor que uno\"<br>bar(0) // \"Menor que dos\"</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Cambia el orden de la lógica en la función de manera que esta retorne las sentencias correctas en todos los casos."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244dc",
+      "title": "Chaining If Else Statements",
+      "description": [
+        "<code>if/else</code> statements can be chained together for complex logic. Here is <dfn>pseudocode</dfn> of multiple chained <code>if</code> / <code>else if</code> statements:",
+        "<blockquote>if (<em>condition1</em>) {<br>  <em>statement1</em><br>} else if (<em>condition2</em>) {<br>  <em>statement2</em><br>} else if (<em>condition3</em>) {<br>  <em>statement3</em><br>. . .<br>} else {<br>  <em>statementN</em><br>}</blockquote>",
+        "<hr>",
+        "Write chained <code>if</code>/<code>else if</code> statements to fulfill the following conditions:",
+        "<code>num &lt;   5</code> - return \"Tiny\"<br><code>num &lt;  10</code> - return \"Small\"<br><code>num &lt; 15</code> - return \"Medium\"<br><code>num &lt; 20</code> - return \"Large\"<br><code>num >= 20</code>  - return \"Huge\""
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function testSize(num) {",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  return \"Change Me\";",
+        "  // Only change code above this line",
+        "}",
+        "",
+        "// Change this value to test",
+        "testSize(7);"
+      ],
+      "solutions": [
+        "function testSize(num) {\n  if (num < 5) {\n    return \"Tiny\";\n  } else if (num < 10) {\n    return \"Small\";\n  } else if (num < 15) {\n    return \"Medium\";\n  } else if (num < 20) {\n    return \"Large\";\n  } else {\n    return \"Huge\";\n  }\n}"
+      ],
+      "tests": [
+        "assert(code.match(/else/g).length > 3, 'message: You should have at least four <code>else</code> statements');",
+        "assert(code.match(/if/g).length > 3, 'message: You should have at least four <code>if</code> statements');",
+        "assert(code.match(/return/g).length >= 1, 'message: You should have at least one <code>return</code> statement');",
+        "assert(testSize(0) === \"Tiny\", 'message: <code>testSize(0)</code> should return \"Tiny\"');",
+        "assert(testSize(4) === \"Tiny\", 'message: <code>testSize(4)</code> should return \"Tiny\"');",
+        "assert(testSize(5) === \"Small\", 'message: <code>testSize(5)</code> should return \"Small\"');",
+        "assert(testSize(8) === \"Small\", 'message: <code>testSize(8)</code> should return \"Small\"');",
+        "assert(testSize(10) === \"Medium\", 'message: <code>testSize(10)</code> should return \"Medium\"');",
+        "assert(testSize(14) === \"Medium\", 'message: <code>testSize(14)</code> should return \"Medium\"');",
+        "assert(testSize(15) === \"Large\", 'message: <code>testSize(15)</code> should return \"Large\"');",
+        "assert(testSize(17) === \"Large\", 'message: <code>testSize(17)</code> should return \"Large\"');",
+        "assert(testSize(20) === \"Huge\", 'message: <code>testSize(20)</code> should return \"Huge\"');",
+        "assert(testSize(25) === \"Huge\", 'message: <code>testSize(25)</code> should return \"Huge\"');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Encadenamiento de sentencias else if",
+          "description": [
+            "Las sentencias <code>if/else</code>(si/de lo contrario) pueden ser encadenadas juntas por una lógica compleja. Aquí está el <dfn>pseudocódigo</dfn> de múltiples sentencias <code>if</code> / <code>else if</code> encadenadas:",
+            "<blockquote>if (<em>condicion1</em>) {<br>  <em>sentencias1</em><br>} else if (<em>condicion2</em>) {<br>  <em>sentencias2</em><br>} else if (<em>condicion3</em>) {<br>  <em>sentencias3</em><br>. . .<br>} else {<br>  <em>sentenciasN</em><br>}</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Escribe sentencias <code>if</code>/<code>else if</code> encadenadas para cumplir las siguientes condiciones:",
+            "<code>num &lt;   5</code> - retorna \"Tiny\"<br><code>num &lt;  10</code> - retorna \"Small\"<br><code>num &lt; 15</code> - retorna \"Medium\"<br><code>num &lt; 20</code> - retorna \"Large\"<br><code>num >= 20</code>  - retorna \"Huge\""
+          ]
+        }
+      }
+    },
+    {
+      "id": "5664820f61c48e80c9fa476c",
+      "title": "Golf Code",
+      "description": [
+        "In the game of <a href=\"https://en.wikipedia.org/wiki/Golf\" target=\"_blank\">golf</a> each hole has a <code>par</code> meaning the average number of <code>strokes</code> a golfer is expected to make in order to sink the ball in a hole to complete the play. Depending on how far above or below <code>par</code> your <code>strokes</code> are, there is a different nickname.",
+        "Your function will be passed <code>par</code> and <code>strokes</code> arguments. Return the correct string according to this table which lists the strokes in order of priority; top (highest) to bottom (lowest):",
+        "<table class=\"table table-striped\"><thead><tr><th>Strokes</th><th>Return</th></tr></thead><tbody><tr><td>1</td><td>\"Hole-in-one!\"</td></tr><tr><td>&lt;= par - 2</td><td>\"Eagle\"</td></tr><tr><td>par - 1</td><td>\"Birdie\"</td></tr><tr><td>par</td><td>\"Par\"</td></tr><tr><td>par + 1</td><td>\"Bogey\"</td></tr><tr><td>par + 2</td><td>\"Double Bogey\"</td></tr><tr><td>&gt;= par + 3</td><td>\"Go Home!\"</td></tr></tbody></table>",
+        "<code>par</code> and <code>strokes</code> will always be numeric and positive. We have added an array of all the names for your convenience."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var names = [\"Hole-in-one!\", \"Eagle\", \"Birdie\", \"Par\", \"Bogey\", \"Double Bogey\", \"Go Home!\"];",
+        "function golfScore(par, strokes) {",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  return \"Change Me\";",
+        "  // Only change code above this line",
+        "}",
+        "",
+        "// Change these values to test",
+        "golfScore(5, 4);"
+      ],
+      "solutions": [
+        "function golfScore(par, strokes) {\n  if (strokes === 1) {\n    return \"Hole-in-one!\";\n  }\n  \n  if (strokes <= par - 2) {\n    return \"Eagle\";\n  }\n  \n  if (strokes === par - 1) {\n    return \"Birdie\";\n  }\n  \n  if (strokes === par) {\n    return \"Par\";\n  }\n  \n  if (strokes === par + 1) {\n    return \"Bogey\";\n  }\n  \n  if(strokes === par + 2) {\n    return \"Double Bogey\";\n  }\n  \n  return \"Go Home!\";\n}"
+      ],
+      "tests": [
+        "assert(golfScore(4, 1) === \"Hole-in-one!\", 'message: <code>golfScore(4, 1)</code> should return \"Hole-in-one!\"');",
+        "assert(golfScore(4, 2) === \"Eagle\", 'message: <code>golfScore(4, 2)</code> should return \"Eagle\"');",
+        "assert(golfScore(5, 2) === \"Eagle\", 'message: <code>golfScore(5, 2)</code> should return \"Eagle\"');",
+        "assert(golfScore(4, 3) === \"Birdie\", 'message: <code>golfScore(4, 3)</code> should return \"Birdie\"');",
+        "assert(golfScore(4, 4) === \"Par\", 'message: <code>golfScore(4, 4)</code> should return \"Par\"');",
+        "assert(golfScore(1, 1) === \"Hole-in-one!\", 'message: <code>golfScore(1, 1)</code> should return \"Hole-in-one!\"');",
+        "assert(golfScore(5, 5) === \"Par\", 'message: <code>golfScore(5, 5)</code> should return \"Par\"');",
+        "assert(golfScore(4, 5) === \"Bogey\", 'message: <code>golfScore(4, 5)</code> should return \"Bogey\"');",
+        "assert(golfScore(4, 6) === \"Double Bogey\", 'message: <code>golfScore(4, 6)</code> should return \"Double Bogey\"');",
+        "assert(golfScore(4, 7) === \"Go Home!\", 'message: <code>golfScore(4, 7)</code> should return \"Go Home!\"');",
+        "assert(golfScore(5, 9) === \"Go Home!\", 'message: <code>golfScore(5, 9)</code> should return \"Go Home!\"');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Código de golf",
+          "description": [
+            "En el juego de <a href='https://es.wikipedia.org/wiki/Golf' target='_blank'>golf</a> cada hoyo tiene un <dfn>par</dfn> promedio para el número de <dfn>golpes</dfn> necesarios para meter la pelota. Dependiendo de que tan lejos por encima o por debajo del <code>par</code> estén tus <code>golpes</code>, habrá un sobrenombre diferente.",
+            "Tu función pasará un <code>par</code> y el número de <code>golpes</code>, y retornará una cadena de acuerdo a esta tabla (basada en el orden de prioridad - arriba (lo más alto) hacia abajo (lo más bajo)):",
+            "<table class=\"table table-striped\"><thead><tr><th>Golpes</th><th>Retorna</th></tr></thead><tbody><tr><td>1</td><td>\"Hole-in-one!\"</td></tr><tr><td>&lt;= par - 2</td><td>\"Eagle\"</td></tr><tr><td>par - 1</td><td>\"Birdie\"</td></tr><tr><td>par</td><td>\"Par\"</td></tr><tr><td>par + 1</td><td>\"Bogey\"</td></tr><tr><td>par + 2</td><td>\"Double Bogey\"</td></tr><tr><td>&gt;= par + 3</td><td>\"Go Home!\"</td></tr></tbody></table>",
+            "Tanto <code>par</code> como <code>golpes</code> siempre serán numéricos y positivos."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244dd",
+      "title": "Selecting from Many Options with Switch Statements",
+      "description": [
+        "If you have many options to choose from, use a <code>switch</code> statement. A <code>switch</code> statement tests a value and can have many <code>case</code> statements which define various possible values. Statements are executed from the first matched <code>case</code> value until a <code>break</code> is encountered.",
+        "Here is a <dfn>pseudocode</dfn> example:",
+        "<blockquote>switch(num) {<br>  case value1:<br>    statement1;<br>    break;<br>  case value2:<br>    statement2;<br>    break;<br>...<br>  case valueN:<br>    statementN;<br>    break;<br>}</blockquote>",
+        "<code>case</code> values are tested with strict equality (<code>===</code>). The <code>break</code> tells JavaScript to stop executing statements. If the <code>break</code> is omitted, the next statement will be executed.",
+        "<hr>",
+        "Write a switch statement which tests <code>val</code> and sets <code>answer</code> for the following conditions:<br><code>1</code> - \"alpha\"<br><code>2</code> - \"beta\"<br><code>3</code> - \"gamma\"<br><code>4</code> - \"delta\""
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function caseInSwitch(val) {",
+        "  var answer = \"\";",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  ",
+        "  // Only change code above this line  ",
+        "  return answer;  ",
+        "}",
+        "",
+        "// Change this value to test",
+        "caseInSwitch(1);",
+        ""
+      ],
+      "solutions": [
+        "function caseInSwitch(val) {\n  var answer = \"\";\n\n  switch(val) {\n    case 1:\n      answer = \"alpha\";\n      break;\n    case 2:\n      answer = \"beta\";\n      break;\n    case 3:\n      answer = \"gamma\";\n      break;\n    case 4:\n      answer = \"delta\";\n  }\n  return answer;  \n}"
+      ],
+      "tests": [
+        "assert(caseInSwitch(1) === \"alpha\", 'message: <code>caseInSwitch(1)</code> should have a value of \"alpha\"');",
+        "assert(caseInSwitch(2) === \"beta\", 'message: <code>caseInSwitch(2)</code> should have a value of \"beta\"');",
+        "assert(caseInSwitch(3) === \"gamma\", 'message: <code>caseInSwitch(3)</code> should have a value of \"gamma\"');",
+        "assert(caseInSwitch(4) === \"delta\", 'message: <code>caseInSwitch(4)</code> should have a value of \"delta\"');",
+        "assert(!/else/g.test(code) || !/if/g.test(code), 'message: You should not use any <code>if</code> or <code>else</code> statements');",
+        "assert(code.match(/break/g).length > 2, 'message: You should have at least 3 <code>break</code> statements');"
+      ],
+      "type": "waypoint",
+      "MDNlinks": [
+        "Switch Statement"
+      ],
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Seleccionar desde diferentes opciones con la sentencia switch",
+          "description": [
+            "Si tienes varias opciones para elegir, usa una sentencia <code>switch</code>. Una sentencia <code>switch</code> prueba un valor y puede tener varias sentencias <code>case</code> las cuales definen varios posibles valores. Las sentencias son ejecutadas desde el primer valor <code>case</code> igualado hasta que se encuentr un <code>break</code>.",
+            "Aquí hay un <dfn>pseudocódigo</dfn> de ejemplo:",
+            "<blockquote>switch(num) {<br>  case valor1:<br>    sentencia1;<br>    break;<br>  case valor2:<br>    sentencia2;<br>    break;<br>...<br>  case valorN:<br>    sentenciaN;<br>    break;<br>}</blockquote>",
+            "Los valores <code>case</code> son probados con estricta igualdad (<code>===</code>). El <code>break</code> le dice a JavaScript que pare la ejecución del bloque de sentencias en el que está. Si se omite <code>break</code>, se ejecutará la siguiente sentencia.",
+            "<h4>Instrucciones</h4>",
+            "Escribe una sentencia <code>switch</code> que pruebe <code>val</code> y establezca <code>answer</code> para las siguientes condiciones:<br><code>1</code> - \"alpha\"<br><code>2</code> - \"beta\"<br><code>3</code> - \"gamma\"<br><code>4</code> - \"delta\""
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244de",
+      "title": "Adding a Default Option in Switch Statements",
+      "description": [
+        "In a <code>switch</code> statement you may not be able to specify all possible values as <code>case</code> statements. Instead, you can add the <code>default</code> statement which will be executed if no matching <code>case</code> statements are found. Think of it like the final <code>else</code> statement in an <code>if/else</code> chain.",
+        "A <code>default</code> statement should be the last case.",
+        "<blockquote>switch (num) {<br>  case value1:<br>    statement1;<br>    break;<br>  case value2:<br>    statement2;<br>    break;<br>...<br>  default:<br>    defaultStatement;<br>    break;<br>}</blockquote>",
+        "<hr>",
+        "Write a switch statement to set <code>answer</code> for the following conditions:<br><code>\"a\"</code> - \"apple\"<br><code>\"b\"</code> - \"bird\"<br><code>\"c\"</code> - \"cat\"<br><code>default</code> - \"stuff\""
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function switchOfStuff(val) {",
+        "  var answer = \"\";",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  ",
+        "  // Only change code above this line  ",
+        "  return answer;  ",
+        "}",
+        "",
+        "// Change this value to test",
+        "switchOfStuff(1);",
+        ""
+      ],
+      "solutions": [
+        "function switchOfStuff(val) {\n  var answer = \"\";\n\n  switch(val) {\n    case \"a\":\n      answer = \"apple\";\n      break;\n    case \"b\":\n      answer = \"bird\";\n      break;\n    case \"c\":\n      answer = \"cat\";\n      break;\n    default:\n      answer = \"stuff\";\n  }\n  return answer;  \n}"
+      ],
+      "tests": [
+        "assert(switchOfStuff(\"a\") === \"apple\", 'message: <code>switchOfStuff(\"a\")</code> should have a value of \"apple\"');",
+        "assert(switchOfStuff(\"b\") === \"bird\", 'message: <code>switchOfStuff(\"b\")</code> should have a value of \"bird\"');",
+        "assert(switchOfStuff(\"c\") === \"cat\", 'message: <code>switchOfStuff(\"c\")</code> should have a value of \"cat\"');",
+        "assert(switchOfStuff(\"d\") === \"stuff\", 'message: <code>switchOfStuff(\"d\")</code> should have a value of \"stuff\"');",
+        "assert(switchOfStuff(4) === \"stuff\", 'message: <code>switchOfStuff(4)</code> should have a value of \"stuff\"');",
+        "assert(!/else/g.test(code) || !/if/g.test(code), 'message: You should not use any <code>if</code> or <code>else</code> statements');",
+        "assert(switchOfStuff(\"string-to-trigger-default-case\") === \"stuff\", 'message: You should use a <code>default</code> statement');",
+        "assert(code.match(/break/g).length > 2, 'message: You should have at least 3 <code>break</code> statements');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Agregar una opción por omisión (default) en una sentencia switch",
+          "description": [
+            "En una sentencia <code>switch</code> puede que no seas capaz de especificar todos los posibles valores en las sentencias <code>case</code>. En su lugar, puedes agregar la sentencia <code>default</code> la cual será ejecutada si no es encontrada ninguna coincidencia con alguna sentencia <code>case</code>. Piensa en esto como la última sentencia <code>else</code> en una cadena <code>if/else</code>.",
+            "Una sentencia <code>default</code> debería ser el último caso.",
+            "<blockquote>switch(num) {<br>  case valor1:<br>    sentencia1;<br>    break;<br>  case valor2:<br>    sentencia2;<br>    break;<br>...<br>  default:<br>    sentenciaDefault;<br>}</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Escribe una sentencia switch para establecer <code>answer</code> para las siguientes condiciones:<br><code>\"a\"</code> - \"apple\"<br><code>\"b\"</code> - \"bird\"<br><code>\"c\"</code> - \"cat\"<br><code>default</code> - \"stuff\""
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244df",
+      "title": "Multiple Identical Options in Switch Statements",
+      "description": [
+        "If the <code>break</code> statement is omitted from a <code>switch</code> statement's <code>case</code>, the following <code>case</code> statement(s) are executed until a <code>break</code> is encountered. If you have multiple inputs with the same output, you can represent them in a <code>switch</code> statement like this:",
+        "<blockquote>switch(val) {<br>  case 1:<br>  case 2:<br>  case 3:<br>    result = \"1, 2, or 3\";<br>    break;<br>  case 4:<br>    result = \"4 alone\";<br>}</blockquote>",
+        "Cases for 1, 2, and 3 will all produce the same result.",
+        "<hr>",
+        "Write a switch statement to set <code>answer</code> for the following ranges:<br><code>1-3</code> - \"Low\"<br><code>4-6</code> - \"Mid\"<br><code>7-9</code> - \"High\"",
+        "<strong>Note</strong><br>You will need to have a <code>case</code> statement for each number in the range."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function sequentialSizes(val) {",
+        "  var answer = \"\";",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  ",
+        "  // Only change code above this line  ",
+        "  return answer;  ",
+        "}",
+        "",
+        "// Change this value to test",
+        "sequentialSizes(1);",
+        ""
+      ],
+      "solutions": [
+        "function sequentialSizes(val) {\n  var answer = \"\";\n  \n  switch(val) {\n    case 1:\n    case 2:\n    case 3:\n      answer = \"Low\";\n      break;\n    case 4:\n    case 5:\n    case 6:\n      answer = \"Mid\";\n      break;\n    case 7:\n    case 8:\n    case 9:\n      answer = \"High\";\n  }\n  \n  return answer;  \n}"
+      ],
+      "tests": [
+        "assert(sequentialSizes(1) === \"Low\", 'message: <code>sequentialSizes(1)</code> should return \"Low\"');",
+        "assert(sequentialSizes(2) === \"Low\", 'message: <code>sequentialSizes(2)</code> should return \"Low\"');",
+        "assert(sequentialSizes(3) === \"Low\", 'message: <code>sequentialSizes(3)</code> should return \"Low\"');",
+        "assert(sequentialSizes(4) === \"Mid\", 'message: <code>sequentialSizes(4)</code> should return \"Mid\"');",
+        "assert(sequentialSizes(5) === \"Mid\", 'message: <code>sequentialSizes(5)</code> should return \"Mid\"');",
+        "assert(sequentialSizes(6) === \"Mid\", 'message: <code>sequentialSizes(6)</code> should return \"Mid\"');",
+        "assert(sequentialSizes(7) === \"High\", 'message: <code>sequentialSizes(7)</code> should return \"High\"');",
+        "assert(sequentialSizes(8) === \"High\", 'message: <code>sequentialSizes(8)</code> should return \"High\"');",
+        "assert(sequentialSizes(9) === \"High\", 'message: <code>sequentialSizes(9)</code> should return \"High\"');",
+        "assert(!/else/g.test(code) || !/if/g.test(code), 'message: You should not use any <code>if</code> or <code>else</code> statements');",
+        "assert(code.match(/case/g).length === 9, 'message: You should have nine <code>case</code> statements');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Múltiples opciones idénticas en una sentencias switch",
+          "description": [
+            "Si la sentencia <code>break</code> es omitida de una sentencia <code>case</code> de un <code>switch</code>, las siguientes sentencias <code>case</code> son ejecutadas hasta que sea encontrado un <code>break</code>. Si tienes multiples entradas con la misma salida, puede representarlas en una sentencia <code>switch</code> así:",
+            "<blockquote>switch(val) {<br>  case 1:<br>  case 2:<br>  case 3:<br>    result = \"1, 2, or 3\";<br>    break;<br>  case 4:<br>    result = \"4 alone\";<br>}</blockquote>",
+            "Los casos 1, 2, y 3 producirán el mismo resultado.",
+            "<h4>Instrucciones</h4>",
+            "Escribe una sentencia <code>switch</code> para establecer <code>answer</code> para los siguientes rangos:<br><code>1-3</code> - \"Low\"<br><code>4-6</code> - \"Mid\"<br><code>7-9</code> - \"High\"",
+            "<strong>Nota</strong><br>Necesitarás tener una sentencia <code>case</code> por cada número en el rango."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244e0",
+      "title": "Replacing If Else Chains with Switch",
+      "description": [
+        "If you have many options to choose from, a <code>switch</code> statement can be easier to write than many chained <code>if</code>/<code>else if</code> statements. The following:",
+        "<blockquote>if (val === 1) {<br>  answer = \"a\";<br>} else if (val === 2) {<br>  answer = \"b\";<br>} else {<br>  answer = \"c\";<br>}</blockquote>",
+        "can be replaced with:",
+        "<blockquote>switch(val) {<br>  case 1:<br>    answer = \"a\";<br>    break;<br>  case 2:<br>    answer = \"b\";<br>    break;<br>  default:<br>    answer = \"c\";<br>}</blockquote>",
+        "<hr>",
+        "Change the chained <code>if</code>/<code>else if</code> statements into a <code>switch</code> statement."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function chainToSwitch(val) {",
+        "  var answer = \"\";",
+        "  // Only change code below this line",
+        "  ",
+        "  if (val === \"bob\") {",
+        "    answer = \"Marley\";",
+        "  } else if (val === 42) {",
+        "    answer = \"The Answer\";",
+        "  } else if (val === 1) {",
+        "    answer = \"There is no #1\";",
+        "  } else if (val === 99) {",
+        "    answer = \"Missed me by this much!\";",
+        "  } else if (val === 7) {",
+        "    answer = \"Ate Nine\";",
+        "  }",
+        "  ",
+        "  // Only change code above this line  ",
+        "  return answer;  ",
+        "}",
+        "",
+        "// Change this value to test",
+        "chainToSwitch(7);",
+        ""
+      ],
+      "solutions": [
+        "function chainToSwitch(val) {\n  var answer = \"\";\n\n  switch(val) {\n    case \"bob\":\n      answer = \"Marley\";\n      break;\n    case 42:\n      answer = \"The Answer\";\n      break;\n    case 1:\n      answer = \"There is no #1\";\n      break;\n    case 99:\n      answer = \"Missed me by this much!\";\n      break;\n    case 7:\n      answer = \"Ate Nine\";\n  }\n  return answer;  \n}"
+      ],
+      "tests": [
+        "assert(!/else/g.test(code), 'message: You should not use any <code>else</code> statements anywhere in the editor');",
+        "assert(!/if/g.test(code), 'message: You should not use any <code>if</code> statements anywhere in the editor');",
+        "assert(code.match(/break/g).length >= 4, 'message: You should have at least four <code>break</code> statements');",
+        "assert(chainToSwitch(\"bob\") === \"Marley\", 'message: <code>chainToSwitch(\"bob\")</code> should be \"Marley\"');",
+        "assert(chainToSwitch(42) === \"The Answer\", 'message: <code>chainToSwitch(42)</code> should be \"The Answer\"');",
+        "assert(chainToSwitch(1) === \"There is no #1\", 'message: <code>chainToSwitch(1)</code> should be \"There is no #1\"');",
+        "assert(chainToSwitch(99) === \"Missed me by this much!\", 'message: <code>chainToSwitch(99)</code> should be \"Missed me by this much!\"');",
+        "assert(chainToSwitch(7) === \"Ate Nine\", 'message: <code>chainToSwitch(7)</code> should be \"Ate Nine\"');",
+        "assert(chainToSwitch(\"John\") === \"\", 'message: <code>chainToSwitch(\"John\")</code> should be \"\" (empty string)');",
+        "assert(chainToSwitch(156) === \"\", 'message: <code>chainToSwitch(156)</code> should be \"\" (empty string)');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Reemplazar cadenas if else con switch",
+          "description": [
+            "Si tienes varias opciones para elegir, una sentencia <code>switch</code> puede ser más fácil de escribir que varias sentencias <code>if</code>/<code>if else</code> anidadas. Lo siguiente:",
+            "<blockquote>if (val === 1) {<br>  respuesta = \"a\";<br>} else if (val === 2) {<br>  respuesta = \"b\";<br>} else {<br>  respuesta = \"c\";<br>}</blockquote>",
+            "puede ser reemplazado con:",
+            "<blockquote>switch(val) {<br>  case 1:<br>    respuesta = \"a\";<br>    break;<br>  case 2:<br>    respuesta = \"b\";<br>    break;<br>  default:<br>    respuesta = \"c\";<br>}</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Cambia las sentencias <code>if</code>/<code>if else</code> anidadas dentro de una sentencia <code>switch</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "5679ceb97cbaa8c51670a16b",
+      "title": "Returning Boolean Values from Functions",
+      "description": [
+        "You may recall from <a href=\"waypoint-comparison-with-the-equality-operator\" target=\"_blank\">Comparison with the Equality Operator</a> that all comparison operators return a boolean <code>true</code> or <code>false</code> value.",
+        "Sometimes people use an if/else statement to do a comparison, like this:",
+        "<blockquote>function isEqual(a,b) {<br>  if (a === b) {<br>    return true;<br>  } else {<br>    return false;<br>  }<br>}</blockquote>",
+        "But there's a better way to do this. Since <code>===</code> returns <code>true</code> or <code>false</code>, we can return the result of the comparison:",
+        "<blockquote>function isEqual(a,b) {<br>  return a === b;<br>}</blockquote>",
+        "<hr>",
+        "Fix the function <code>isLess</code> to remove the <code>if/else</code> statements."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function isLess(a, b) {",
+        "  // Fix this code",
+        "  if (a < b) {",
+        "    return true;",
+        "  } else {",
+        "    return false;",
+        "  }",
+        "}",
+        "",
+        "// Change these values to test",
+        "isLess(10, 15);"
+      ],
+      "tail": [
+        ""
+      ],
+      "solutions": [
+        "function isLess(a, b) {\n  return a < b;\n}"
+      ],
+      "tests": [
+        "assert(isLess(10,15) === true, 'message: <code>isLess(10,15)</code> should return <code>true</code>');",
+        "assert(isLess(15, 10) === false, 'message: <code>isLess(15,10)</code> should return <code>false</code>');",
+        "assert(!/if|else/g.test(code), 'message: You should not use any <code>if</code> or <code>else</code> statements');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Retornar valores booleanos desde funciones",
+          "description": [
+            "Tal vez recuerdes de <a href=\"waypoint-comparison-with-the-equality-operator\" target=\"_blank\">La comparación con el operador de igualdad</a> que todos los operadores de comparación retornan un valor booleano <code>true</code> (verdadero) o <code>false</code> (falso).",
+            "Un <dfn>anti-patrón</dfn> común es usar una sentencia <code>if/else</code> para hacer una comparación y entonces retornar <code>true</code> o <code>false</code>:",
+            "<blockquote>function sonIguales(a,b) {<br>  if (a === b) {<br>    return true;<br>  } else {<br>    return false;<br>  }<br>}</blockquote>",
+            "Ya que <code>===</code> returna <code>true</code> (verdadero) o <code>false</code> (falso), podemos simplemente retornar el resultado de la comparación:",
+            "<blockquote>function sonIguales(a,b) {<br>  return a === b;<br>}</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Arregla la función <code>isLess</code> para remover las sentencias <code>if/else</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c4",
+      "title": "Return Early Pattern for Functions",
+      "description": [
+        "When a <code>return</code> statement is reached, the execution of the current function stops and control returns to the calling location.",
+        "<strong>Example</strong>",
+        "<blockquote>function myFun() {<br>  console.log(\"Hello\");<br>  return \"World\";<br>  console.log(\"byebye\")<br>}<br>myFun();</blockquote>",
+        "The above outputs \"Hello\" to the console, returns \"World\", but <code>\"byebye\"</code> is never output, because the function exits at the <code>return</code> statement.",
+        "<hr>",
+        "Modify the function <code>abTest</code> so that if <code>a</code> or <code>b</code> are less than <code>0</code> the function will immediately exit with a value of <code>undefined</code>.",
+        "<strong>Hint</strong><br>Remember that <a href='http://www.freeCodeCamp.com/challenges/understanding-uninitialized-variables' target='_blank'><code>undefined</code> is a keyword</a>, not a string."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "function abTest(a, b) {",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  ",
+        "  // Only change code above this line",
+        "",
+        "  return Math.round(Math.pow(Math.sqrt(a) + Math.sqrt(b), 2));",
+        "}",
+        "",
+        "// Change values below to test your code",
+        "abTest(2,2);"
+      ],
+      "tail": [
+        ""
+      ],
+      "solutions": [
+        "function abTest(a, b) {\n  if(a < 0 || b < 0) {\n    return undefined;\n  } \n  return Math.round(Math.pow(Math.sqrt(a) + Math.sqrt(b), 2));\n}"
+      ],
+      "tests": [
+        "assert(typeof abTest(2,2) === 'number' , 'message: <code>abTest(2,2)</code> should return a number');",
+        "assert(abTest(2,2) === 8 , 'message: <code>abTest(2,2)</code> should return <code>8</code>');",
+        "assert(abTest(-2,2) === undefined , 'message: <code>abTest(-2,2)</code> should return <code>undefined</code>');",
+        "assert(abTest(2,-2) === undefined , 'message: <code>abTest(2,-2)</code> should return <code>undefined</code>');",
+        "assert(abTest(2,8) === 18 , 'message: <code>abTest(2,8)</code> should return <code>18</code>');",
+        "assert(abTest(3,3) === 12 , 'message: <code>abTest(3,3)</code> should return <code>12</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Retornar un patrón temprano para funciones",
+          "description": [
+            "Cuando se alcanza una sentencia <code>return</code>, la ejecución de la presente función se detiene y el control la retorna a la ubicación de la llamada.",
+            "<strong>Ejemplo</strong>",
+            "<blockquote>function miFuncion() {<br>  console.log(\"Hola\");<br>  return \"Mundo\";<br>  console.log(\"chaochao\")<br>}<br>miFuncion();</blockquote>",
+            "Esta presenta en consola \"Hola\", retorna \"Mundo\", pero <code>\"chaochao\"</code> nunca se presenta, porque la función sale con la sentencia <code>return</code>.",
+            "<h4>Instrucciones</h4>",
+            "Modifica la función <code>abTest</code> de manera que si <code>a</code> o <code>b</code> son menores que <code>0</code> la función saldrá inmediatamente con un valor <code>undefined</code>.",
+            "<strong>Pista</strong><br>Recuerda que <a href='http://www.freeCodeCamp.com/challenges/understanding-uninitialized-variables' target='_blank'><code>undefined</code> es una palabra clave</a>, no una cadena."
+          ]
+        }
+      }
+    },
+    {
+      "id": "565bbe00e9cc8ac0725390f4",
+      "title": "Counting Cards",
+      "description": [
+        "In the casino game Blackjack, a player can gain an advantage over the house by keeping track of the relative number of high and low cards remaining in the deck. This is called <a href='https://en.wikipedia.org/wiki/Card_counting' target='_blank'>Card Counting</a>.",
+        "Having more high cards remaining in the deck favors the player. Each card is assigned a value according to the table below. When the count is positive, the player should bet high. When the count is zero or negative, the player should bet low.",
+        "<table class=\"table table-striped\"><thead><tr><th>Count Change</th><th>Cards</th></tr></thead><tbody><tr><td>+1</td><td>2, 3, 4, 5, 6</td></tr><tr><td>0</td><td>7, 8, 9</td></tr><tr><td>-1</td><td>10, 'J', 'Q', 'K', 'A'</td></tr></tbody></table>",
+        "You will write a card counting function. It will receive a <code>card</code> parameter, which can be a number or a string, and increment or decrement the global <code>count</code> variable according to the card's value (see table). The function will then return a string with the current count and the string <code>Bet</code> if the count is positive, or <code>Hold</code> if the count is zero or negative. The current count and the player's decision (<code>Bet</code> or <code>Hold</code>) should be separated by a single space.",
+        "<strong>Example Output</strong><br><code>-3 Hold</code><br><code>5 Bet</code>",
+        "<strong>Hint</strong><br>Do NOT reset <code>count</code> to 0 when value is 7, 8, or 9.<br>Do NOT return an array.<br>Do NOT include quotes (single or double) in the output."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var count = 0;",
+        "",
+        "function cc(card) {",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  return \"Change Me\";",
+        "  // Only change code above this line",
+        "}",
+        "",
+        "// Add/remove calls to test your function.",
+        "// Note: Only the last will display",
+        "cc(2); cc(3); cc(7); cc('K'); cc('A');"
+      ],
+      "solutions": [
+        "var count = 0;\nfunction cc(card) {\n  switch(card) {\n    case 2:\n    case 3:\n    case 4:\n    case 5:\n    case 6:\n      count++;\n      break;\n    case 10:\n    case 'J':\n    case 'Q':\n    case 'K':\n    case 'A':\n      count--;\n  }\n  if(count > 0) {\n    return count + \" Bet\";\n  } else {\n    return count + \" Hold\";\n  }\n}"
+      ],
+      "tests": [
+        "assert((function(){ count = 0; cc(2);cc(3);cc(4);cc(5);var out = cc(6); if(out === \"5 Bet\") {return true;} return false; })(), 'message: Cards Sequence 2, 3, 4, 5, 6 should return <code>5 Bet</code>');",
+        "assert((function(){ count = 0; cc(7);cc(8);var out = cc(9); if(out === \"0 Hold\") {return true;} return false; })(), 'message: Cards Sequence 7, 8, 9 should return <code>0 Hold</code>');",
+        "assert((function(){ count = 0; cc(10);cc('J');cc('Q');cc('K');var out = cc('A'); if(out === \"-5 Hold\") {return true;} return false; })(), 'message: Cards Sequence 10, J, Q, K, A should return <code>-5 Hold</code>');",
+        "assert((function(){ count = 0; cc(3);cc(7);cc('Q');cc(8);var out = cc('A'); if(out === \"-1 Hold\") {return true;} return false; })(), 'message: Cards Sequence 3, 7, Q, 8, A should return <code>-1 Hold</code>');",
+        "assert((function(){ count = 0; cc(2);cc('J');cc(9);cc(2);var out = cc(7); if(out === \"1 Bet\") {return true;} return false; })(), 'message: Cards Sequence 2, J, 9, 2, 7 should return <code>1 Bet</code>');",
+        "assert((function(){ count = 0; cc(2);cc(2);var out = cc(10); if(out === \"1 Bet\") {return true;} return false; })(), 'message: Cards Sequence 2, 2, 10 should return <code>1 Bet</code>');",
+        "assert((function(){ count = 0; cc(3);cc(2);cc('A');cc(10);var out = cc('K'); if(out === \"-1 Hold\") {return true;} return false; })(), 'message: Cards Sequence 3, 2, A, 10, K should return <code>-1 Hold</code>');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Contar cartas",
+          "description": [
+            "En el juego de casino Blackjack, un jugador puede conseguir ventaja sobre la casa manteniendo un registro del número relativo de cartas altas y bajas restantes en la baraja. Esto es llamado <a href='https://en.wikipedia.org/wiki/Card_counting' target='_blank'>Conteo de Cartas</a>.",
+            "Tener más cartas altas restantes en la baraja favorece al jugador. A cada carta se le asigna un valor de acuerdo a la tabla de abajo. Cuando el conteo es positivo, el jugador debe apostar alto. Cuando el conteo es cero o negativo, el jugador debe apostar bajo.",
+            "<table class=\"table table-striped\"><thead><tr><th>Valor</th><th>Cartas</th></tr></thead><tbody><tr><td>+1</td><td>2, 3, 4, 5, 6</td></tr><tr><td>0</td><td>7, 8, 9</td></tr><tr><td>-1</td><td>10, 'J', 'Q', 'K','A'</td></tr></tbody></table>",
+            "Vas a escribir una función de conteo de cartas. Esta recibirá un parametro <code>card</code> (carta) e incrementa o decrementa la variable <code>count</code> (conteo) global de acuerdo al valor de la carta (ver tabla). La función retornará entonces una cadena con el presente conteo y la cadena <code>Bet</code> si el conteo es positivo o <code>Hold</code> si el conteo es cero o negativo. El presente conteo y la desición del jugador (<code>Bet</code> o <code>Hold</code>) deben quedar separada por un único espacio.",
+            "<strong>Ejemplo de Salida</strong><br><code>-3 Hold<br>5 Bet</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392d0",
+      "title": "Build JavaScript Objects",
+      "description": [
+        "You may have heard the term <code>object</code> before.",
+        "Objects are similar to <code>arrays</code>, except that instead of using indexes to access and modify their data, you access the data in objects through what are called <code>properties</code>.",
+        "Here's a sample object:",
+        "<blockquote>var cat = {<br>  \"name\": \"Whiskers\",<br>  \"legs\": 4,<br>  \"tails\": 1,<br>  \"enemies\": [\"Water\", \"Dogs\"]<br>};</blockquote>",
+        "Objects are useful for storing data in a structured way, and can represent real world objects, like a cat.",
+        "<hr>",
+        "Make an object that represents a dog called <code>myDog</code> which contains the properties <code>\"name\"</code> (a string), <code>\"legs\"</code>, <code>\"tails\"</code> and <code>\"friends\"</code>.",
+        "You can set these object properties to whatever values you want, as long <code>\"name\"</code> is a string, <code>\"legs\"</code> and <code>\"tails\"</code> are numbers, and <code>\"friends\"</code> is an array."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourDog = {",
+        "  \"name\": \"Camper\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"everything!\"]",
+        "};",
+        "",
+        "// Only change code below this line.",
+        "",
+        "var myDog = {",
+        "  ",
+        "  ",
+        "  ",
+        "  ",
+        "};"
+      ],
+      "tail": [
+        "(function(z){return z;})(myDog);"
+      ],
+      "solutions": [
+        "var myDog = {\n  \"name\": \"Camper\",\n  \"legs\": 4,\n  \"tails\": 1,\n  \"friends\": [\"everything!\"]  \n};"
+      ],
+      "tests": [
+        "assert((function(z){if(z.hasOwnProperty(\"name\") && z.name !== undefined && typeof z.name === \"string\"){return true;}else{return false;}})(myDog), 'message: <code>myDog</code> should contain the property <code>name</code> and it should be a <code>string</code>.');",
+        "assert((function(z){if(z.hasOwnProperty(\"legs\") && z.legs !== undefined && typeof z.legs === \"number\"){return true;}else{return false;}})(myDog), 'message: <code>myDog</code> should contain the property <code>legs</code> and it should be a <code>number</code>.');",
+        "assert((function(z){if(z.hasOwnProperty(\"tails\") && z.tails !== undefined && typeof z.tails === \"number\"){return true;}else{return false;}})(myDog), 'message: <code>myDog</code> should contain the property <code>tails</code> and it should be a <code>number</code>.');",
+        "assert((function(z){if(z.hasOwnProperty(\"friends\") && z.friends !== undefined && Array.isArray(z.friends)){return true;}else{return false;}})(myDog), 'message: <code>myDog</code> should contain the property <code>friends</code> and it should be an <code>array</code>.');",
+        "assert((function(z){return Object.keys(z).length === 4;})(myDog), 'message: <code>myDog</code> should only contain all the given properties.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Construye objetos en JavaScript",
+          "description": [
+            "Es posible que haya oído el término <code>objeto</code> antes.",
+            "Los objetos son similares a los <code>vectores</code>, excepto que en lugar de utilizar los índices para acceder y modificar sus datos, pueden accederse mediante lo que se llama <code>propiedades</code>.",
+            "Esto es un objeto de ejemplo:",
+            "<code>var cat = {</code>",
+            "<code>&nbsp;&nbsp;\"name\": \"Whiskers\",</code>",
+            "<code>&nbsp;&nbsp;\"legs\": 4,</code>",
+            "<code>&nbsp;&nbsp;\"tails\": 1,</code>",
+            "<code>&nbsp;&nbsp;\"enemies\": [\"Water\", \"Dogs\"]</code>",
+            "<code>};</code>",
+            "Los objetos son útiles para almacenar datos de manera estructurada, y pueden representar objetos del mundo real, como un gato.",
+            "Vamos a tratar de hacer un objeto que representa un perro, lo llamaremos <code>mydog</code> y contendrá las propiedades <code>\"name\"</code> (una cadena con el nombre), <code>\"legs\"</code> (piernas), <code>\"tails\"</code> (colas) y <code>\"friends\" (amigos)</code>. ",
+            "Podrás establecer estas propiedades del objeto en los valores que desees, siempre y cuando <code>\"name\"</code> sea una cadena, <code>\"legs\"</code> y <code>\"tails\"</code> sean números, y <code>\"friends\"</code> sea un vector."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c7",
+      "title": "Accessing Object Properties with the Dot Operator",
+      "description": [
+        "There are two ways to access the properties of an object: the dot operator (<code>.</code>) and bracket notation (<code>[]</code>), similar to an array.",
+        "The dot operator is what you use when you know the name of the property you're trying to access ahead of time.",
+        "Here is a sample of using the dot operator (<code>.</code>) to read an object's property:",
+        "<blockquote>var myObj = {<br>  prop1: \"val1\",<br>  prop2: \"val2\"<br>};<br>var prop1val = myObj.prop1; // val1<br>var prop2val = myObj.prop2; // val2</blockquote>",
+        "<hr>",
+        "Read in the property values of <code>testObj</code> using dot notation. Set the variable <code>hatValue</code> equal to the object's property <code>hat</code> and set the variable <code>shirtValue</code> equal to the object's property <code>shirt</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var testObj = {",
+        "  \"hat\": \"ballcap\",",
+        "  \"shirt\": \"jersey\",",
+        "  \"shoes\": \"cleats\"",
+        "};",
+        "",
+        "// Only change code below this line",
+        "",
+        "var hatValue = testObj;      // Change this line",
+        "var shirtValue = testObj;    // Change this line"
+      ],
+      "tail": [
+        "(function(a,b) { return \"hatValue = '\" + a + \"', shirtValue = '\" + b + \"'\"; })(hatValue,shirtValue);"
+      ],
+      "solutions": [
+        "var testObj = {\n  \"hat\": \"ballcap\",\n  \"shirt\": \"jersey\",\n  \"shoes\": \"cleats\"\n};\n\nvar hatValue = testObj.hat;  \nvar shirtValue = testObj.shirt;"
+      ],
+      "tests": [
+        "assert(typeof hatValue === 'string' , 'message: <code>hatValue</code> should be a string');",
+        "assert(hatValue === 'ballcap' , 'message: The value of <code>hatValue</code> should be <code>\"ballcap\"</code>');",
+        "assert(typeof shirtValue === 'string' , 'message: <code>shirtValue</code> should be a string');",
+        "assert(shirtValue === 'jersey' , 'message: The value of <code>shirtValue</code> should be <code>\"jersey\"</code>');",
+        "assert(code.match(/testObj\\.\\w+/g).length > 1, 'message: You should use dot notation twice');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Acceder a propiedades de objetos con el operador punto",
+          "description": [
+            "Hay dos maneras de acceder a las propiedades de un objeto: con el operador punto (<code>.</code>) y con la notación corchete (<code>[]</code>), similar al caso de un vector.",
+            "El operador punto es el que usas cuando de antemano sabes el nombre de la propiedad que estás intentando acceder.",
+            "Aquí está un ejemplo del uso del operador punto (<code>.</code>) para leer una propiedad de un objeto:",
+            "<blockquote>var miObj = {<br>  prop1: \"val1\",<br>  prop2: \"val2\"<br>};<br>var prop1val = miObj.prop1; // val1<br>var prop2val = miObj.prop2; // val2</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Lee los valores de propiedades de <code>testObj</code> usando notación punto. Asigna la variable <code>hatValue</code> igual a la propiedad objeto <code>hat</code> y asigna la variable <code>shirtValue</code> igual a la propiedad objeto <code>shirt</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c8",
+      "title": "Accessing Object Properties with Bracket Notation",
+      "description": [
+        "The second way to access the properties of an object is bracket notation (<code>[]</code>). If the property of the object you are trying to access has a space in its name, you will need to use bracket notation.",
+        "Here is a sample of using bracket notation to read an object's property:",
+        "<blockquote>var myObj = {<br>  \"Space Name\": \"Kirk\",<br>  \"More Space\": \"Spock\"<br>};<br>myObj[\"Space Name\"]; // Kirk<br>myObj['More Space']; // Spock</blockquote>",
+        "Note that property names with spaces in them must be in quotes (single or double).",
+        "<hr>",
+        "Read the values of the properties <code>\"an entree\"</code> and <code>\"the drink\"</code> of <code>testObj</code> using bracket notation and assign them to <code>entreeValue</code> and <code>drinkValue</code> respectively."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var testObj = {",
+        "  \"an entree\": \"hamburger\",",
+        "  \"my side\": \"veggies\",",
+        "  \"the drink\": \"water\"",
+        "};",
+        "",
+        "// Only change code below this line",
+        "",
+        "var entreeValue = testObj;   // Change this line",
+        "var drinkValue = testObj;    // Change this line"
+      ],
+      "tail": [
+        "(function(a,b) { return \"entreeValue = '\" + a + \"', drinkValue = '\" + b + \"'\"; })(entreeValue,drinkValue);"
+      ],
+      "solutions": [
+        "var testObj = {\n  \"an entree\": \"hamburger\",\n  \"my side\": \"veggies\",\n  \"the drink\": \"water\"\n};\nvar entreeValue = testObj[\"an entree\"];\nvar drinkValue = testObj['the drink'];"
+      ],
+      "tests": [
+        "assert(typeof entreeValue === 'string' , 'message: <code>entreeValue</code> should be a string');",
+        "assert(entreeValue === 'hamburger' , 'message: The value of <code>entreeValue</code> should be <code>\"hamburger\"</code>');",
+        "assert(typeof drinkValue === 'string' , 'message: <code>drinkValue</code> should be a string');",
+        "assert(drinkValue === 'water' , 'message: The value of <code>drinkValue</code> should be <code>\"water\"</code>');",
+        "assert(code.match(/testObj\\s*?\\[('|\")[^'\"]+\\1\\]/g).length > 1, 'message: You should use bracket notation twice');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Acceder a las propiedades de objetos con la notación corchete",
+          "description": [
+            "La segunda manera de acceder a las propiedades de un objeto es con la notación corchete (<code>[]</code>). Si el nombre de la propiedad del objeto que estás intentando acceder tiene un espacio, necesitarás usar la notación corchete.",
+            "Aquí está un ejemplo del uso de la notación corchete para leer una propiedad de un objeto:",
+            "<blockquote>var miObj = {<br>  \"Nombre con espacio\": \"Kirk\",<br>  \"Mas espacio\": \"Spock\"<br>};<br>miObj[\"Nombre con espacio\"]; // Kirk<br>miObj['Mas espacio']; // Spock</blockquote>",
+            "Nota que los nombres de propiedades con espacios tienen que estar entre comillas (apóstrofes o comillas).",
+            "<h4>Instrucciones</h4>",
+            "Lee los valores de las propiedades <code>\"an entree\"</code> y <code>\"the drink\"</code> de <code>testObj</code> usando la notación corchete."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244c9",
+      "title": "Accessing Object Properties with Variables",
+      "description": [
+        "Another use of bracket notation on objects is to use a variable to access a property. This can be very useful for iterating through lists of the object properties or for doing the lookup.",
+        "Here is an example of using a variable to access a property:",
+        "<blockquote>var someProp = \"propName\";<br>var myObj = {<br>  propName: \"Some Value\"<br >};<br>myObj[someProp]; // \"Some Value\"</blockquote>",
+        "Here is one more:",
+        "<blockquote>var myDog = \"Hunter\";<br>var dogs = {<br>  Fido: \"Mutt\",\n  Hunter: \"Doberman\",\n  Snoopie: \"Beagle\"<br >};<br>var breed = dogs[myDog];<br>console.log(breed);// \"Doberman\"</blockquote>",
+        "Note that we  do <em>not</em> use quotes around the variable name when using it to access the property because we are using the <em>value</em> of the variable, not the <em>name</em>.",
+        "<hr>",
+        "Use the <code>playerNumber</code> variable to look up player <code>16</code> in <code>testObj</code> using bracket notation. Then assign that name to the <code>player</code> variable."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var testObj = {",
+        "  12: \"Namath\",",
+        "  16: \"Montana\",",
+        "  19: \"Unitas\"",
+        "};",
+        "",
+        "// Only change code below this line;",
+        "",
+        "var playerNumber;       // Change this Line",
+        "var player = testObj;   // Change this Line"
+      ],
+      "tail": [
+        "if(typeof player !== \"undefined\"){(function(v){return v;})(player);}"
+      ],
+      "solutions": [
+        "var testObj = {\n  12: \"Namath\",\n  16: \"Montana\",\n  19: \"Unitas\"\n};\nvar playerNumber = 16;\nvar player = testObj[playerNumber];"
+      ],
+      "tests": [
+        "assert(typeof playerNumber === 'number', 'message: <code>playerNumber</code> should be a number');",
+        "assert(typeof player === 'string', 'message: The variable <code>player</code> should be a string');",
+        "assert(player === 'Montana', 'message: The value of <code>player</code> should be \"Montana\"');",
+        "assert(/testObj\\s*?\\[.*?\\]/.test(code),'message: You should use bracket notation to access <code>testObj</code>');",
+        "assert(!code.match(/player\\s*=\\s*\"|\\'\\s*Montana\\s*\"|\\'\\s*;/gi),'message: You should not assign the value <code>Montana</code> to the variable <code>player</code> directly.');",
+        "assert(/testObj\\s*?\\[\\s*playerNumber\\s*\\]/.test(code),'message: You should be using the variable <code>playerNumber</code> in your bracket notation');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Acceder a propiedades de objetos con variables",
+          "description": [
+            "Otro uso de la notación corchete sobre objetos es usar una variable para acceder a una propiedad. Esto puede ser muy útil en iteraciones sobre la lista de propiedades de un objetos o para hacer operaciones de búsqueda.",
+            "Aquí está un ejemplo del uso de una variable para acceder a una propiedad:",
+            "<blockquote>var algunaProp = \"propNombre\";<br>var miObj = {<br>  propNombre: \"Algún valor\"<br >}<br>miObj[algunaProp]; // \"Algún valor\"</blockquote>",
+            "Aquí hay uno más:",
+            "<blockquote>var miPerro = \"Cazador\";<br>var perros = {<br>  Fido: \"Mutt\",\n  Cazador: \"Doberman\",\n  Snoopie: \"Beagle\"<br >}<br>var raza = perros[miPerro]; // \"Cazador\"<br>console.log(raza)// \"Doberman\"</blockquote>",
+            "Nota que <em>no</em> usamos comillas alrededor del nombre de la variable (<code>miPerro</code>) cuando la usamos para acceder a la propiedad (<code>perros[miPerro]</code> porque estamos usando el <em>valor</em> de la variable y no su <em>nombre</em>",
+            "<h4>Instrucciones</h4>",
+            "Usa la variable <code>playerNumber</code> para buscar y asignar a <code>player</code> el jugador <code>16</code> de <code>testObj</code>, usa la notación corchete."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392d1",
+      "title": "Updating Object Properties",
+      "description": [
+        "After you've created a JavaScript object, you can update its properties at any time just like you would update any other variable. You can use either dot or bracket notation to update.",
+        "For example, let's look at <code>ourDog</code>:",
+        "<blockquote>var ourDog = {<br>  \"name\": \"Camper\",<br>  \"legs\": 4,<br>  \"tails\": 1,<br>  \"friends\": [\"everything!\"]<br>};</blockquote>",
+        "Since he's a particularly happy dog, let's change his name to \"Happy Camper\". Here's how we update his object's name property:",
+        "<code>ourDog.name = \"Happy Camper\";</code> or",
+        "<code>ourDog[\"name\"] = \"Happy Camper\";</code>",
+        "Now when we evaluate <code>ourDog.name</code>, instead of getting \"Camper\", we'll get his new name, \"Happy Camper\".",
+        "<hr>",
+        "Update the <code>myDog</code> object's name property. Let's change her name from \"Coder\" to \"Happy Coder\". You can use either dot or bracket notation."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourDog = {",
+        "  \"name\": \"Camper\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"everything!\"]",
+        "};",
+        "",
+        "ourDog.name = \"Happy Camper\";",
+        "",
+        "// Setup",
+        "var myDog = {",
+        "  \"name\": \"Coder\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"freeCodeCamp Campers\"]",
+        "};",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(z){return z;})(myDog);"
+      ],
+      "solutions": [
+        "var myDog = {\n  \"name\": \"Coder\",\n  \"legs\": 4,\n  \"tails\": 1,\n  \"friends\": [\"freeCodeCamp Campers\"]\n};\nmyDog.name = \"Happy Coder\";"
+      ],
+      "tests": [
+        "assert(/happy coder/gi.test(myDog.name), 'message: Update <code>myDog</code>&apos;s <code>\"name\"</code> property to equal \"Happy Coder\".');",
+        "assert(/\"name\": \"Coder\"/.test(code), 'message: Do not edit the <code>myDog</code> definition');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Actualiza las propiedades de un objeto en JavaScript",
+          "description": [
+            "Después de que hayas creado un objeto de JavaScript, puedes actualizar sus propiedades en cualquier momento, tal y como harías con cualquier otra variable.",
+            "Por ejemplo, echemos un vistazo a <code>ourDog</code>:",
+            "<code>var ourDog = {</code>",
+            "<code>&nbsp;&nbsp;\"name\": \"Camper\",</code>",
+            "<code>&nbsp;&nbsp;\"legs\": 4,</code>",
+            "<code>&nbsp;&nbsp;\"tails\": 1,</code>",
+            "<code>&nbsp;&nbsp;\"friends\": [\"everything!\"]</code>",
+            "<code>};</code>",
+            "Dado que es un perro particularmente feliz, vamos a cambiar su nombre a \"Happy Camper\". Así es como actualizamos la propiedad nombre del objeto: ",
+            "<code>ourDog.name = \"Happy Camper\";</code>",
+            "Ahora, cuando ejecutemos <code>return ourDog.name</code>, en lugar de obtener \"Camper\", vamos a recibir su nuevo nombre, \"Happy Camper\".",
+            "<h4>Instrucciones</h4>",
+            "Vamos a actualizar la propiedad del objeto <code>mydog</code>. Cambiemos su nombre de \"Coder\" a \"Happy Coder\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392d2",
+      "title": "Add New Properties to a JavaScript Object",
+      "description": [
+        "You can add new properties to existing JavaScript objects the same way you would modify them.",
+        "Here's how we would add a <code>\"bark\"</code> property to <code>ourDog</code>:",
+        "<code>ourDog.bark = \"bow-wow\";</code> ",
+        "or",
+        "<code>ourDog[\"bark\"] = \"bow-wow\";</code>",
+        "Now when we evaluate <code>ourDog.bark</code>, we'll get his bark, \"bow-wow\".",
+        "<hr>",
+        "Add a <code>\"bark\"</code> property to <code>myDog</code> and set it to a dog sound, such as \"woof\". You may use either dot or bracket notation."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourDog = {",
+        "  \"name\": \"Camper\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"everything!\"]",
+        "};",
+        "",
+        "ourDog.bark = \"bow-wow\";",
+        "",
+        "// Setup",
+        "var myDog = {",
+        "  \"name\": \"Happy Coder\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"freeCodeCamp Campers\"]",
+        "};",
+        "",
+        "// Only change code below this line.",
+        ""
+      ],
+      "tail": [
+        "(function(z){return z;})(myDog);"
+      ],
+      "solutions": [
+        "var myDog = {\n  \"name\": \"Happy Coder\",\n  \"legs\": 4,\n  \"tails\": 1,\n  \"friends\": [\"freeCodeCamp Campers\"]\n};\nmyDog.bark = \"Woof Woof\";"
+      ],
+      "tests": [
+        "assert(myDog.bark !== undefined, 'message: Add the property <code>\"bark\"</code> to <code>myDog</code>.');",
+        "assert(!/bark[^\\n]:/.test(code), 'message: Do not add <code>\"bark\"</code> to the setup section');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Añade nuevas propiedades a un objeto JavaScript",
+          "description": [
+            "Puedes añadir nuevas propiedades a objetos existente de la misma forma que usarías para modificarlos.",
+            "Así es como añadimos una propiedad <code>\"bark\"</code> (ladra) a nuestro objeto <code>ourDog</code>:",
+            "<code>ourDog.bark = \"bow-wow\";</code>",
+            "Ahora, cuando ejecutemos <code>return ourDog.bark</code>, vamos a recbir su ladrido, \" bow-wow \".",
+            "<h4>Instrucciones</h4>",
+            "Vamos a añadir una propiedad <code>ladra</code> a <code>myDog</code> y a ponerle un sonido de perro, tal como \"woof\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56bbb991ad1ed5201cd392d3",
+      "title": "Delete Properties from a JavaScript Object",
+      "description": [
+        "We can also delete properties from objects like this:",
+        "<code>delete ourDog.bark;</code>",
+        "<hr>",
+        "Delete the <code>\"tails\"</code> property from <code>myDog</code>. You may use either dot or bracket notation."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourDog = {",
+        "  \"name\": \"Camper\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"everything!\"],",
+        "  \"bark\": \"bow-wow\"",
+        "};",
+        "",
+        "delete ourDog.bark;",
+        "",
+        "// Setup",
+        "var myDog = {",
+        "  \"name\": \"Happy Coder\",",
+        "  \"legs\": 4,",
+        "  \"tails\": 1,",
+        "  \"friends\": [\"freeCodeCamp Campers\"],",
+        "  \"bark\": \"woof\"",
+        "};",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(z){return z;})(myDog);"
+      ],
+      "solutions": [
+        "var ourDog = {\n  \"name\": \"Camper\",\n  \"legs\": 4,\n  \"tails\": 1,\n  \"friends\": [\"everything!\"],\n  \"bark\": \"bow-wow\"\n};\nvar myDog = {\n  \"name\": \"Happy Coder\",\n  \"legs\": 4,\n  \"tails\": 1,\n  \"friends\": [\"freeCodeCamp Campers\"],\n  \"bark\": \"woof\"\n};\ndelete myDog.tails;"
+      ],
+      "tests": [
+        "assert(typeof myDog === \"object\" && myDog.tails === undefined, 'message: Delete the property <code>\"tails\"</code> from <code>myDog</code>.');",
+        "assert(code.match(/\"tails\": 1/g).length > 1, 'message: Do not modify the <code>myDog</code> setup');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Elimina propiedades de un objeto JavaScript",
+          "description": [
+            "También podemos eliminar propiedades de los objetos de esta manera:",
+            "<code>delete ourDog.bark;</code>",
+            "<h4>Instrucciones</h4>",
+            "Borremos la propiedad <code>\"tails\"</code> de <code>myDog</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244ca",
+      "title": "Using Objects for Lookups",
+      "description": [
+        "Objects can be thought of as a key/value storage, like a dictionary. If you have tabular data, you can use an object to \"lookup\" values rather than a <code>switch</code> statement or an <code>if/else</code> chain. This is most useful when you know that your input data is limited to a certain range.",
+        "Here is an example of a simple reverse alphabet lookup:",
+        "<blockquote>var alpha = {<br>  1:\"Z\",<br>  2:\"Y\",<br>  3:\"X\",<br>  4:\"W\",<br>  ...<br>  24:\"C\",<br>  25:\"B\",<br>  26:\"A\"<br>};<br>alpha[2]; // \"Y\"<br>alpha[24]; // \"C\"<br><br>var value = 2;<br>alpha[value]; // \"Y\"</blockquote>",
+        "<hr>",
+        "Convert the switch statement into an object called <code>lookup</code>. Use it to look up <code>val</code> and assign the associated string to the <code>result</code> variable."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "function phoneticLookup(val) {",
+        "  var result = \"\";",
+        "",
+        "  // Only change code below this line",
+        "  switch(val) {",
+        "    case \"alpha\": ",
+        "      result = \"Adams\";",
+        "      break;",
+        "    case \"bravo\": ",
+        "      result = \"Boston\";",
+        "      break;",
+        "    case \"charlie\": ",
+        "      result = \"Chicago\";",
+        "      break;",
+        "    case \"delta\": ",
+        "      result = \"Denver\";",
+        "      break;",
+        "    case \"echo\": ",
+        "      result = \"Easy\";",
+        "      break;",
+        "    case \"foxtrot\": ",
+        "      result = \"Frank\";",
+        "  }",
+        "",
+        "  // Only change code above this line",
+        "  return result;",
+        "}",
+        "",
+        "// Change this value to test",
+        "phoneticLookup(\"charlie\");"
+      ],
+      "solutions": [
+        "function phoneticLookup(val) {\n  var result = \"\";\n\n  var lookup = {\n    alpha: \"Adams\",\n    bravo: \"Boston\",\n    charlie: \"Chicago\",\n    delta: \"Denver\",\n    echo: \"Easy\",\n    foxtrot: \"Frank\"\n  };\n\n  result = lookup[val];\n\n  return result;\n}"
+      ],
+      "tests": [
+        "assert(phoneticLookup(\"alpha\") === 'Adams', 'message: <code>phoneticLookup(\"alpha\")</code> should equal <code>\"Adams\"</code>');",
+        "assert(phoneticLookup(\"bravo\") === 'Boston', 'message: <code>phoneticLookup(\"bravo\")</code> should equal <code>\"Boston\"</code>');",
+        "assert(phoneticLookup(\"charlie\") === 'Chicago', 'message: <code>phoneticLookup(\"charlie\")</code> should equal <code>\"Chicago\"</code>');",
+        "assert(phoneticLookup(\"delta\") === 'Denver', 'message: <code>phoneticLookup(\"delta\")</code> should equal <code>\"Denver\"</code>');",
+        "assert(phoneticLookup(\"echo\") === 'Easy', 'message: <code>phoneticLookup(\"echo\")</code> should equal <code>\"Easy\"</code>');",
+        "assert(phoneticLookup(\"foxtrot\") === 'Frank', 'message: <code>phoneticLookup(\"foxtrot\")</code> should equal <code>\"Frank\"</code>');",
+        "assert(typeof phoneticLookup(\"\") === 'undefined', 'message: <code>phoneticLookup(\"\")</code> should equal <code>undefined</code>');",
+        "assert(code.match(/return\\sresult;/), 'message: You should not modify the <code>return</code> statement');",
+        "assert(!/case|switch|if/g.test(code), 'message: You should not use <code>case</code>, <code>switch</code>, or <code>if</code> statements'); "
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Usar objetos para búsquedas",
+          "description": [
+            "Los objetos pueden ser considerados como un almacenamiento llave/valor, como un diccionario. Si tienes datos tabulados, puedes almacenarlos en un objeto para después \"buscar\" valores, en lugar de emplear una sentencia <code>switch</code> o una secuencia de <code>if/else</code>. Esto es más útil cuando sabes que tus datos de entrada son limitados a un cierto rango.",
+            "Aquí está un ejemplo de una simple búsqueda inversa de alfabeto:",
+            "<blockquote>var alfa = {<br>  1:\"Z\",<br>  2:\"Y\",<br>  3:\"X\",<br>  4:\"W\",<br>  ...<br>  24:\"C\",<br>  25:\"B\",<br>  26:\"A\"<br>};<br>alfa[2]; // \"Y\"<br>alfa[24]; // \"C\"<br><br>var valor = 2;<br>alfa[valor]; // \"Y\"</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Convierte la sentencia switch en una tabla de búsqueda llamada <code>lookup</code>. Usala para buscar <code>val</code> y asigna la cadena asociada a la variable <code>result</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "567af2437cbaa8c51670a16c",
+      "title": "Testing Objects for Properties",
+      "description": [
+        "Sometimes it is useful to check if the property of a given object exists or not. We can use the <code>.hasOwnProperty(propname)</code> method of objects to determine if that object has the given property name. <code>.hasOwnProperty()</code> returns <code>true</code> or <code>false</code> if the property is found or not.",
+        "<strong>Example</strong>",
+        "<blockquote>var myObj = {<br>  top: \"hat\",<br>  bottom: \"pants\"<br>};<br>myObj.hasOwnProperty(\"top\");    // true<br>myObj.hasOwnProperty(\"middle\"); // false</blockquote>",
+        "<hr>",
+        "Modify the function <code>checkObj</code> to test <code>myObj</code> for <code>checkProp</code>. If the property is found, return that property's value. If not, return <code>\"Not Found\"</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var myObj = {",
+        "  gift: \"pony\",",
+        "  pet: \"kitten\",",
+        "  bed: \"sleigh\"",
+        "};",
+        "",
+        "function checkObj(checkProp) {",
+        "  // Your Code Here",
+        "  ",
+        "  return \"Change Me!\";",
+        "}",
+        "",
+        "// Test your code by modifying these values",
+        "checkObj(\"gift\");"
+      ],
+      "tail": [
+        ""
+      ],
+      "solutions": [
+        "var myObj = {\n  gift: \"pony\",\n  pet: \"kitten\",\n  bed: \"sleigh\"\n};\nfunction checkObj(checkProp) {\n  if(myObj.hasOwnProperty(checkProp)) {\n    return myObj[checkProp];\n  } else {\n    return \"Not Found\";\n  }\n}"
+      ],
+      "tests": [
+        "assert(checkObj(\"gift\") === \"pony\", 'message: <code>checkObj(\"gift\")</code> should return  <code>\"pony\"</code>.');",
+        "assert(checkObj(\"pet\") === \"kitten\", 'message: <code>checkObj(\"pet\")</code> should return  <code>\"kitten\"</code>.');",
+        "assert(checkObj(\"house\") === \"Not Found\", 'message: <code>checkObj(\"house\")</code> should return  <code>\"Not Found\"</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Probar si un objeto tiene cierta propiedad",
+          "description": [
+            "A veces es útil revisar si cierta propiedad existe o no en un objeto dado. Podemos usar el método de objetos <code>.hasOwnProperty(nomprop)</code> para determinar si un objeto tiene la propiedad <code>nomprop</code>. <code>.hasOwnProperty()</code> retorna <code>true</code> o <code>false</code> si la propiedad es encontrada o no.",
+            "<strong>Ejemplo</strong>",
+            "<blockquote>var miObj = {<br>  arriba: \"sombrero\",<br>  abajo: \"pantalones\"<br>};<br>miObj.hasOwnProperty(\"arriba\");    // true<br>miObj.hasOwnProperty(\"medio\"); // false</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Modifica la función <code>checkObj</code> que prueba si <code>myObj</code> tiene la propiedad <code>checkProp</code>. Si la propiedad es encontrada, retorna el valor de esa propiedad. Si no, retorna <code>\"Not Found\"</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244cb",
+      "title": "Manipulating Complex Objects",
+      "description": [
+        "Sometimes you may want to store data in a flexible <dfn>Data Structure</dfn>. A JavaScript object is one way to handle flexible data. They allow for arbitrary combinations of <dfn>strings</dfn>, <dfn>numbers</dfn>, <dfn>booleans</dfn>, <dfn>arrays</dfn>, <dfn>functions</dfn>, and <dfn>objects</dfn>.",
+        "Here's an example of a complex data structure:",
+        "<blockquote>var ourMusic = [<br>  {<br>    \"artist\": \"Daft Punk\",<br>    \"title\": \"Homework\",<br>    \"release_year\": 1997,<br>    \"formats\": [ <br>      \"CD\", <br>      \"Cassette\", <br>      \"LP\"<br>    ],<br>    \"gold\": true<br>  }<br>];</blockquote>",
+        "This is an array which contains one object inside. The object has various pieces of <dfn>metadata</dfn> about an album. It also has a nested <code>\"formats\"</code> array. If you want to add more album records, you can do this by adding records to the top level array.",
+        "Objects hold data in a property, which has a key-value format. In the example above, <code>\"artist\": \"Daft Punk\"</code> is a property that has a key of <code>\"artist\"</code> and a value of <code>\"Daft Punk\"</code>.",
+        "<a href='http://www.json.org/' target=_blank>JavaScript Object Notation</a> or <code>JSON</code> is a related data interchange format used to store data.",
+        "<blockquote>{<br>  \"artist\": \"Daft Punk\",<br>  \"title\": \"Homework\",<br>  \"release_year\": 1997,<br>  \"formats\": [ <br>    \"CD\",<br>    \"Cassette\",<br>    \"LP\"<br>  ],<br>  \"gold\": true<br>}</blockquote>",
+        "<strong>Note</strong><br>You will need to place a comma after every object in the array, unless it is the last object in the array.",
+        "<hr>",
+        "Add a new album to the <code>myMusic</code> array. Add <code>artist</code> and <code>title</code> strings, <code>release_year</code> number, and a <code>formats</code> array of strings."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "var myMusic = [",
+        "  {",
+        "    \"artist\": \"Billy Joel\",",
+        "    \"title\": \"Piano Man\",",
+        "    \"release_year\": 1973,",
+        "    \"formats\": [ ",
+        "      \"CD\",",
+        "      \"8T\",",
+        "      \"LP\"",
+        "    ],",
+        "    \"gold\": true",
+        "  }",
+        "  // Add record here",
+        "];",
+        ""
+      ],
+      "tail": [
+        "(function(x){ if (Array.isArray(x)) { return JSON.stringify(x); } return \"myMusic is not an array\"})(myMusic);"
+      ],
+      "solutions": [
+        "var myMusic = [\n  {\n    \"artist\": \"Billy Joel\",\n    \"title\": \"Piano Man\",\n    \"release_year\": 1973,\n    \"formats\": [ \n      \"CS\", \n      \"8T\", \n      \"LP\" ],\n    \"gold\": true\n  }, \n  {\n    \"artist\": \"ABBA\",\n    \"title\": \"Ring Ring\",\n    \"release_year\": 1973,\n    \"formats\": [ \n      \"CS\", \n      \"8T\", \n      \"LP\",\n    \"CD\",\n  ]\n  }\n];"
+      ],
+      "tests": [
+        "assert(Array.isArray(myMusic), 'message: <code>myMusic</code> should be an array');",
+        "assert(myMusic.length > 1, 'message: <code>myMusic</code> should have at least two elements');",
+        "assert(typeof myMusic[1] === 'object', 'message: <code>myMusic[1]</code> should be an object');",
+        "assert(Object.keys(myMusic[1]).length > 3, 'message: <code>myMusic[1]</code> should have at least 4 properties');",
+        "assert(myMusic[1].hasOwnProperty('artist') && typeof myMusic[1].artist === 'string', 'message: <code>myMusic[1]</code> should contain an <code>artist</code> property which is a string');",
+        "assert(myMusic[1].hasOwnProperty('title') && typeof myMusic[1].title === 'string', 'message: <code>myMusic[1]</code> should  contain a <code>title</code> property which is a string');",
+        "assert(myMusic[1].hasOwnProperty('release_year') && typeof myMusic[1].release_year === 'number', 'message: <code>myMusic[1]</code> should contain a <code>release_year</code> property which is a number');",
+        "assert(myMusic[1].hasOwnProperty('formats') && Array.isArray(myMusic[1].formats), 'message: <code>myMusic[1]</code> should contain a <code>formats</code> property which is an array');",
+        "assert(myMusic[1].formats.every(function(item) { return (typeof item === \"string\")}) && myMusic[1].formats.length > 1, 'message: <code>formats</code> should be an array of strings with at least two elements');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Manipula objetos complicados",
+          "description": [
+            "Los objetos Javascript son flexibles porque permiten <dfn>Estructuras de Datos</dfn> con combinaciones arbitrarias de <dfn>cadenas</dfn>, <dfn>números</dfn>, <dfn>booleanos</dfn>, <dfn>vectores</dfn>, <dfn>funciones</dfn>, y <dfn>objetos</dfn>.",
+            "Aquí está un ejemplo de un objeto complicado:",
+            "<blockquote>var nuestraMusica = [<br>  {<br>    \"artista\": \"Daft Punk\",<br>    \"titulo\": \"Homework\",<br>    \"año_publicacion\": 1997,<br>    \"formatos\": [ <br>      \"CD\", <br>      \"Cassette\", <br>      \"LP\" ],<br>    \"oro\": true<br>  }<br>];</blockquote>",
+            "Este es un vector de objetos con diversos <dfn>metadatos</dfn> acerca de un álbum musical. Además tiene anidado un vector <code>formatos</code>. En el vector de nivel superior, pueden añadirse otros registros del álbum.",
+            "<strong>Nota</strong><br>En vectores que tengan más de un objeto, necesitarás separar un objeto de otro mediante comas.",
+            "<h4>Instrucciones</h4>",
+            "Agrega un nuevo álbum al objeto <code>myMusic</code>. Agrega las cadenas <code>artist</code> y <code>title</code>, el número <code>release_year</code> y un vector de cadenas <code>formats</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244cc",
+      "title": "Accessing Nested Objects",
+      "description": [
+        "The sub-properties of objects can be accessed by chaining together the dot or bracket notation.",
+        "Here is a nested object:",
+        "<blockquote>var ourStorage = {<br>  \"desk\": {<br>    \"drawer\": \"stapler\"<br>  },<br>  \"cabinet\": {<br>    \"top drawer\": { <br>      \"folder1\": \"a file\",<br>      \"folder2\": \"secrets\"<br>    },<br>    \"bottom drawer\": \"soda\"<br>  }<br>};<br>ourStorage.cabinet[\"top drawer\"].folder2;  // \"secrets\"<br>ourStorage.desk.drawer; // \"stapler\"</blockquote>",
+        "<hr>",
+        "Access the <code>myStorage</code> object and assign the contents of the <code>glove box</code> property to the <code>gloveBoxContents</code> variable. Use bracket notation for properties with a space in their name."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var myStorage = {",
+        "  \"car\": {",
+        "    \"inside\": {",
+        "      \"glove box\": \"maps\",",
+        "      \"passenger seat\": \"crumbs\"",
+        "     },",
+        "    \"outside\": {",
+        "      \"trunk\": \"jack\"",
+        "    }",
+        "  }",
+        "};",
+        "",
+        "var gloveBoxContents = undefined; // Change this line",
+        ""
+      ],
+      "tail": [
+        "(function(x) { ",
+        "  if(typeof x != 'undefined') { ",
+        "    return \"gloveBoxContents = \" + x;",
+        "  }",
+        "  return \"gloveBoxContents is undefined\";",
+        "})(gloveBoxContents);"
+      ],
+      "solutions": [
+        "var myStorage = {  \n  \"car\":{  \n    \"inside\":{  \n      \"glove box\":\"maps\",\n      \"passenger seat\":\"crumbs\"\n    },\n    \"outside\":{  \n      \"trunk\":\"jack\"\n    }\n  }\n};\nvar gloveBoxContents = myStorage.car.inside[\"glove box\"];"
+      ],
+      "tests": [
+        "assert(gloveBoxContents === \"maps\", 'message: <code>gloveBoxContents</code> should equal \"maps\"');",
+        "assert(/=\\s*myStorage\\.car\\.inside\\[\\s*(\"|')glove box\\1\\s*\\]/g.test(code), 'message: Use dot and bracket notation to access <code>myStorage</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Acceder a objetos anidados",
+          "description": [
+            "Las sub-propiedades de los objetos pueden ser accesadas mediante encadenamiento de la notación punto o corchete.",
+            "Aquí está un objeto anidado:",
+            "<blockquote>var nuestroAlmacen = {<br>  \"escritorio\": {<br>    \"cajon\": \"grapadora\"<br>  },<br>  \"armario\": {<br>    \"cajón superior\": { <br>      \"legajador1\": \"un archivo\",<br>      \"legajador2\": \"secretos\"<br>    },<br>    \"cajón inferior\": \"gaseosa\"<br>  }<br>}<br>nuestroAlmacen.armario[\"cajón superior\"].legajador2;  // \"secretos\"<br>nuestroAlmacen.escritorio.cajon; // \"grapadora\"</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Accede al objeto <code>myStorage</code> para recuperar el contenido de <code>glove box</code>. Usa notación corchete para las propiedades con un espacio en su nombre."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244cd",
+      "title": "Accessing Nested Arrays",
+      "description": [
+        "As we have seen in earlier examples, objects can contain both nested objects and nested arrays. Similar to accessing nested objects, Array bracket notation can be chained to access nested arrays.",
+        "Here is an example of how to access a nested array:",
+        "<blockquote>var ourPets = [<br>  {<br>    animalType: \"cat\",<br>    names: [<br>      \"Meowzer\",<br>      \"Fluffy\",<br>      \"Kit-Cat\"<br>    ]<br>  },<br>  {<br>    animalType: \"dog\",<br>    names: [<br>      \"Spot\",<br>      \"Bowser\",<br>      \"Frankie\"<br>    ]<br>  }<br>];<br>ourPets[0].names[1]; // \"Fluffy\"<br>ourPets[1].names[0]; // \"Spot\"</blockquote>",
+        "<hr>",
+        "Retrieve the second tree from the variable <code>myPlants</code> using object dot and array bracket notation."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var myPlants = [",
+        "  { ",
+        "    type: \"flowers\",",
+        "    list: [",
+        "      \"rose\",",
+        "      \"tulip\",",
+        "      \"dandelion\"",
+        "    ]",
+        "  },",
+        "  {",
+        "    type: \"trees\",",
+        "    list: [",
+        "      \"fir\",",
+        "      \"pine\",",
+        "      \"birch\"",
+        "    ]",
+        "  }  ",
+        "];",
+        "",
+        "// Only change code below this line",
+        "",
+        "var secondTree = \"\"; // Change this line",
+        ""
+      ],
+      "tail": [
+        "(function(x) { ",
+        "  if(typeof x != 'undefined') { ",
+        "    return \"secondTree = \" + x;",
+        "  }",
+        "  return \"secondTree is undefined\";",
+        "})(secondTree);"
+      ],
+      "solutions": [
+        "var myPlants = [\n  { \n    type: \"flowers\",\n    list: [\n      \"rose\",\n      \"tulip\",\n      \"dandelion\"\n    ]\n  },\n  {\n    type: \"trees\",\n    list: [\n      \"fir\",\n      \"pine\",\n      \"birch\"\n    ]\n  }  \n];\n\n// Only change code below this line\n\nvar secondTree = myPlants[1].list[1];"
+      ],
+      "tests": [
+        "assert(secondTree === \"pine\", 'message: <code>secondTree</code> should equal \"pine\"');",
+        "assert(/=\\s*myPlants\\[1\\].list\\[1\\]/.test(code), 'message: Use dot and bracket notation to access <code>myPlants</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Acceder a vectores anidados",
+          "description": [
+            "Como hemos visto en ejemplos anteriores, los objetos pueden contener objetos anidados y vectores anidados. De forma similar a acceder a objetos anidados, la notación corchete en vectores puede ser encadenada para acceder a vectores anidados.",
+            "Aquí está un ejemplo de como acceder a un vector anidado:",
+            "<blockquote>var nuestrasMascotas = { <br>  \"gatos\": [<br>    \"Maullador\",<br>    \"Blandito\",<br>    \"Kit-Cat\"<br>  ],<br>  \"perros\": [<br>    \"Mancha\",<br>    \"Bowser\",<br>    \"Frankie\"<br>  ]<br>};<br>nuestrasMascotas.cats[1]; // \"Blandito\"<br>nuestrasMascotas.dogs[0]; // \"Mancha\"</blockquote>",
+            "<h4>Instrucciones</h4>",
+            "Recupera el segundo arbol de la variable <code>myPlants</code> usando notación punto para objetos y notación corchete para vectores."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244cf",
+      "title": "Record Collection",
+      "description": [
+        "You are given a JSON object representing a part of your musical album collection. Each album has several properties and a unique id number as its key. Not all albums have complete information.",
+        "Write a function which takes an album's <code>id</code> (like <code>2548</code>), a property <code>prop</code> (like <code>\"artist\"</code> or <code>\"tracks\"</code>), and a <code>value</code> (like <code>\"Addicted to Love\"</code>) to modify the data in this collection.",
+        "If <code>prop</code> isn't <code>\"tracks\"</code> and <code>value</code> isn't empty (<code>\"\"</code>), update or set the <code>value</code> for that record album's property.",
+        "Your function must always return the entire collection object.",
+        "There are several rules for handling incomplete data:",
+        "If <code>prop</code> is <code>\"tracks\"</code> but the album doesn't have a <code>\"tracks\"</code> property, create an empty array before adding the new value to the album's corresponding property.",
+        "If <code>prop</code> is <code>\"tracks\"</code> and <code>value</code> isn't empty (<code>\"\"</code>), push the <code>value</code> onto the end of the album's existing <code>tracks</code> array.",
+        "If <code>value</code> is empty (<code>\"\"</code>), delete the given <code>prop</code> property from the album.",
+        "<strong>Hints</strong><br>Use <code>bracket notation</code> when <a href=\"accessing-objects-properties-with-variables\" target=\"_blank\">accessing object properties with variables</a>.",
+        "Push is an array method you can read about on <a href=\"https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/push\" target=\"_blank\">Mozilla Developer Network</a>.",
+        "You may refer back to <a href=\"manipulating-complex-objects\" target=\"_blank\">Manipulating Complex Objects</a> Introducing JavaScript Object Notation (JSON) for a refresher."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Setup",
+        "var collection = {",
+        "    \"2548\": {",
+        "      \"album\": \"Slippery When Wet\",",
+        "      \"artist\": \"Bon Jovi\",",
+        "      \"tracks\": [ ",
+        "        \"Let It Rock\", ",
+        "        \"You Give Love a Bad Name\" ",
+        "      ]",
+        "    },",
+        "    \"2468\": {",
+        "      \"album\": \"1999\",",
+        "      \"artist\": \"Prince\",",
+        "      \"tracks\": [ ",
+        "        \"1999\", ",
+        "        \"Little Red Corvette\" ",
+        "      ]",
+        "    },",
+        "    \"1245\": {",
+        "      \"artist\": \"Robert Palmer\",",
+        "      \"tracks\": [ ]",
+        "    },",
+        "    \"5439\": {",
+        "      \"album\": \"ABBA Gold\"",
+        "    }",
+        "};",
+        "// Keep a copy of the collection for tests",
+        "var collectionCopy = JSON.parse(JSON.stringify(collection));",
+        "",
+        "// Only change code below this line",
+        "function updateRecords(id, prop, value) {",
+        "  ",
+        "  ",
+        "  return collection;",
+        "}",
+        "",
+        "// Alter values below to test your code",
+        "updateRecords(5439, \"artist\", \"ABBA\");",
+        ""
+      ],
+      "tail": [
+        ";(function(x) { return \"collection = \\n\" + JSON.stringify(x, '\\n', 2); })(collection);"
+      ],
+      "solutions": [
+        "var collection = {\n    2548: {\n      album: \"Slippery When Wet\",\n      artist: \"Bon Jovi\",\n      tracks: [ \n        \"Let It Rock\", \n        \"You Give Love a Bad Name\" \n      ]\n    },\n    2468: {\n      album: \"1999\",\n      artist: \"Prince\",\n      tracks: [ \n        \"1999\", \n        \"Little Red Corvette\" \n      ]\n    },\n    1245: {\n      artist: \"Robert Palmer\",\n      tracks: [ ]\n    },\n    5439: {\n      album: \"ABBA Gold\"\n    }\n};\n// Keep a copy of the collection for tests\nvar collectionCopy = JSON.parse(JSON.stringify(collection));\n\n// Only change code below this line\nfunction updateRecords(id, prop, value) {\n  if(value === \"\") delete collection[id][prop];\n  else if(prop === \"tracks\") {\n    collection[id][prop] = collection[id][prop] || [];\n    collection[id][prop].push(value);\n  } else {\n    collection[id][prop] = value;\n  }\n  \n  return collection;\n}"
+      ],
+      "tests": [
+        "collection = collectionCopy; assert(updateRecords(5439, \"artist\", \"ABBA\")[5439][\"artist\"] === \"ABBA\", 'message: After <code>updateRecords(5439, \"artist\", \"ABBA\")</code>, <code>artist</code> should be <code>\"ABBA\"</code>');",
+        "assert(updateRecords(5439, \"tracks\", \"Take a Chance on Me\")[5439][\"tracks\"].pop() === \"Take a Chance on Me\", 'message: After <code>updateRecords(5439, \"tracks\", \"Take a Chance on Me\")</code>, <code>tracks</code> should have <code>\"Take a Chance on Me\"</code> as the last element.');",
+        "updateRecords(2548, \"artist\", \"\"); assert(!collection[2548].hasOwnProperty(\"artist\"), 'message: After <code>updateRecords(2548, \"artist\", \"\")</code>, <code>artist</code> should not be set');",
+        "assert(updateRecords(1245, \"tracks\", \"Addicted to Love\")[1245][\"tracks\"].pop() === \"Addicted to Love\", 'message: After <code>updateRecords(1245, \"tracks\", \"Addicted to Love\")</code>, <code>tracks</code> should have <code>\"Addicted to Love\"</code> as the last element.');",
+        "assert(updateRecords(2468, \"tracks\", \"Free\")[2468][\"tracks\"][0] === \"1999\", 'message: After <code>updateRecords(2468, \"tracks\", \"Free\")</code>, <code>tracks</code> should have <code>\"1999\"</code> as the first element.');",
+        "updateRecords(2548, \"tracks\", \"\"); assert(!collection[2548].hasOwnProperty(\"tracks\"), 'message: After <code>updateRecords(2548, \"tracks\", \"\")</code>, <code>tracks</code> should not be set');",
+        "assert(updateRecords(1245, \"album\", \"Riptide\")[1245][\"album\"] === \"Riptide\", 'message: After <code>updateRecords(1245, \"album\", \"Riptide\")</code>, <code>album</code> should be <code>\"Riptide\"</code>');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Colección de registros",
+          "description": [
+            "Se te da un objeto que representa (una pequeña parte de) tu colección de grabaciones. Cada álbum es identificado por un número id único y tiene varias propiedades. No todos los álbumes tienen la información completa.",
+            "Escribe una función que reciba un <code>id</code>, una propiedad (<code>prop</code>) y un valor (<code>value</code>).",
+            "Para el <code>id</code> dado, en la colección <code>collection</code>:",
+            "Si el valor <code>value</code> no está en blanco (<code>value !== \"\"</code>) y <code>prop</code> no es <code>\"tracks\"</code> entonces actualiza o establece el valor de la propiedad <code>prop</code>.",
+            "Si la propiedad <code>prop</code> es <code>\"tracks\"</code> y <code>value</code> no está en blanco, empuja (<em>push</em>) el valor <code>value</code> al final del vector <code>tracks</code>.",
+            "Si el valor <code>value</code> está en blanco, elimina esa <code>prop</code>.",
+            "Siempre retorna el objeto <code>collection</code> entero.",
+            "<strong>Nota</strong><br>No olvides usar <code>notación corchete</code> cuando <a href=\"accessing-objects-properties-with-variables\" target=\"_blank\">accedes a propiedades de objetos con variables</a>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb1bdef",
+      "title": "Iterate with JavaScript While Loops",
+      "description": [
+        "You can run the same code multiple times by using a loop.",
+        "The first type of loop we will learn is called a \"<code>while</code>\" loop because it runs \"while\" a specified condition is true and stops once that condition is no longer true.",
+        "<blockquote>var ourArray = [];<br>var i = 0;<br>while(i &#60; 5) {<br>  ourArray.push(i);<br>  i++;<br>}</blockquote>",
+        "Let's try getting a while loop to work by pushing values to an array.",
+        "<hr>",
+        "Push the numbers 0 through 4 to <code>myArray</code> using a <code>while</code> loop."
+      ],
+      "challengeSeed": [
+        "// Setup",
+        "var myArray = [];",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\"){(function(){return myArray;})();}"
+      ],
+      "solutions": [
+        "var myArray = [];\nvar i = 0;\nwhile(i < 5) {\n  myArray.push(i);\n  i++;\n}"
+      ],
+      "tests": [
+        "assert(code.match(/while/g), 'message: You should be using a <code>while</code> loop for this.');",
+        "assert.deepEqual(myArray, [0,1,2,3,4], 'message: <code>myArray</code> should equal <code>[0,1,2,3,4]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Iterar con JavaScript con ciclos while",
+          "description": [
+            "Puede ejecutar el mismo código varias veces mediante el uso de un ciclo.",
+            "Otro tipo de ciclo de JavaScript se llama un ciclo \"while\", ya que se ejecuta, \"mientras que\" algo sea cierto y se detiene una vez que ya no sea así.",
+            "<code>var ourArray = [];</code>",
+            "<code>var i = 0;</code>",
+            "<code>while(i < 5) {</code>",
+            "<code>&nbsp;&nbsp;ourArray.push(i);</code>",
+            "<code>&nbsp;&nbsp;i++;</code>",
+            "<code>}</code>",
+            "Intentemos que un ciclo <code>while</code> empuje valores en un vector.",
+            "<h4>Instrucciones</h4>",
+            "Empuja los números de 0 a 4 para <code>myArray</code> utilizando un ciclo <code>while</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb5bdef",
+      "title": "Iterate with JavaScript For Loops",
+      "description": [
+        "You can run the same code multiple times by using a loop.",
+        "The most common type of JavaScript loop is called a \"<code>for loop</code>\" because it runs \"for\" a specific number of times.",
+        "For loops are declared with three optional expressions separated by semicolons:",
+        "<code>for ([initialization]; [condition]; [final-expression])</code>",
+        "The <code>initialization</code> statement is executed one time only before the loop starts. It is typically used to define and setup your loop variable.",
+        "The <code>condition</code> statement is evaluated at the beginning of every loop iteration and will continue as long as it evaluates to <code>true</code>. When <code>condition</code> is <code>false</code> at the start of the iteration, the loop will stop executing. This means if <code>condition</code> starts as <code>false</code>, your loop will never execute.",
+        "The <code>final-expression</code> is executed at the end of each loop iteration, prior to the next <code>condition</code> check and is usually used to increment or decrement your loop counter.",
+        "In the following example we initialize with <code>i = 0</code> and iterate while our condition <code>i &#60; 5</code> is true. We'll increment <code>i</code> by <code>1</code> in each loop iteration with <code>i++</code> as our <code>final-expression</code>.",
+        "<blockquote>var ourArray = [];<br>for (var i = 0; i &#60; 5; i++) {<br>  ourArray.push(i);<br>}</blockquote>",
+        "<code>ourArray</code> will now contain <code>[0,1,2,3,4]</code>.",
+        "<hr>",
+        "Use a <code>for</code> loop to work to push the values 1 through 5 onto <code>myArray</code>."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [];",
+        "",
+        "for (var i = 0; i < 5; i++) {",
+        "  ourArray.push(i);",
+        "}",
+        "",
+        "// Setup",
+        "var myArray = [];",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "if (typeof myArray !== \"undefined\"){(function(){return myArray;})();}"
+      ],
+      "solutions": [
+        "var ourArray = [];\nfor (var i = 0; i < 5; i++) {\n  ourArray.push(i);\n}\nvar myArray = [];\nfor (var i = 1; i < 6; i++) {\n  myArray.push(i);\n}"
+      ],
+      "tests": [
+        "assert(code.match(/for\\s*\\(/g).length > 1, 'message: You should be using a <code>for</code> loop for this.');",
+        "assert.deepEqual(myArray, [1,2,3,4,5], 'message: <code>myArray</code> should equal <code>[1,2,3,4,5]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Iterar en JavaScript con ciclos for",
+          "description": [
+            "Puede ejecutar el mismo código varias veces mediante el uso de un ciclo.",
+            "El tipo más común de bucle de JavaScript se llama \"ciclo for\"porque se ejecuta \"por\" (for) un número específico de veces.",
+            "Los ciclos for se declaran con tres expresiones opcionales separadas por punto y coma:",
+            "<code>for ([inicialización]; [condición]; [expresión-final])</code>",
+            "La <code>inicialización</code> se ejecuta sólo una vez antes de que empiece el ciclo. Normalmente se utiliza para definir e inicializar su variable de ciclo. ",
+            "La expresión <code>condición</code> se evalúa al principio de cada iteración del ciclo y continuará en el ciclo siempre y cuando sea verdadera (<code>true</code>). Cuando la <code>condición</code> sea falsa (<code>false</code>) al comienzo de la iteración, se detendrá la ejecución del ciclo.  Esto significa que si la <code>condición</code> inicia en el valor falso <code>false</code>, el ciclo no se ejecutará. ",
+            "La <code>expresión final</code> se ejecuta al final de cada repetición del ciclo, antes del siguiente chequeo de la <code>condición</code> y se utiliza generalmente para aumentar o disminuir el contador del ciclo.",
+            "En el siguiente ejemplo inicializamos con <code>i = 0</code> e iteramos mientras nuestra condición <code>i <5</code> sea verdadera.  Vamos a incrementar <code>i</code> en <code>1</code> en cada iteración del ciclo con <code>i++</code> como nuestra <code>expresión final</code>. ",
+            "<code>var ourArray = [];</code>",
+            "<code>for (var i = 0; i < 5; i++) {</code>",
+            "<code>&nbsp;&nbsp;ourArray.push(i);</code>",
+            "<code>}</code>",
+            "<code>ourArray</code> ahora contendrá <code>[0,1,2,3,4]</code>.",
+            "<h4>Instrucciones</h4>",
+            "Vamos a utilizar un ciclo <code>for</code> para empujar los valores del 1 al 5 en <code>myArray</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56104e9e514f539506016a5c",
+      "title": "Iterate Odd Numbers With a For Loop",
+      "description": [
+        "For loops don't have to iterate one at a time. By changing our <code>final-expression</code>, we can count by even numbers.",
+        "We'll start at <code>i = 0</code> and loop while <code>i &#60; 10</code>. We'll increment <code>i</code> by 2 each loop with <code>i += 2</code>.",
+        "<blockquote>var ourArray = [];<br>for (var i = 0; i &#60; 10; i += 2) {<br>  ourArray.push(i);<br>}</blockquote>",
+        "<code>ourArray</code> will now contain <code>[0,2,4,6,8]</code>.",
+        "Let's change our <code>initialization</code> so we can count by odd numbers.",
+        "<hr>",
+        "Push the odd numbers from 1 through 9 to <code>myArray</code> using a <code>for</code> loop."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [];",
+        "",
+        "for (var i = 0; i < 10; i += 2) {",
+        "  ourArray.push(i);",
+        "}",
+        "",
+        "// Setup",
+        "var myArray = [];",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\"){(function(){return myArray;})();}"
+      ],
+      "solutions": [
+        "var ourArray = [];\nfor (var i = 0; i < 10; i += 2) {\n  ourArray.push(i);\n}\nvar myArray = [];\nfor (var i = 1; i < 10; i += 2) {\n  myArray.push(i);\n}"
+      ],
+      "tests": [
+        "assert(code.match(/for\\s*\\(/g).length > 1, 'message: You should be using a <code>for</code> loop for this.');",
+        "assert.deepEqual(myArray, [1,3,5,7,9], 'message: <code>myArray</code> should equal <code>[1,3,5,7,9]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Itera por los números pares con un ciclo for",
+          "description": [
+            "Los ciclos <code>for</code> no siempre iteran incrementado de a uno. Cambiando nuestra <code>expresión final</code>, podemos contar los números pares.",
+            "Vamos a empezar con <code>i = 0</code> e iterar mientras <code>i <10</code>.  Vamos a incrementar <code>i</code> de a 2 en cada iteración <code>i + = 2</code>. ",
+            "<code>var ourArray = [];</code>",
+            "<code>for (var i = 0; i < 10; i += 2) {</code>",
+            "<code>&nbsp;&nbsp;ourArray.push(i);</code>",
+            "<code>}</code>",
+            "<code>ourArray</code> ahora contendrá <code>[0,2,4,6,8]</code>.",
+            "Vamos a cambiar nuestra <code>inicialización</code> y <code>expresión final</code> para que podamos contar los números impares.",
+            "<h4>Instrucciones</h4>",
+            "Empuja los números impares del 1 al 9 en <code>myArray</code> utilizando un ciclo <code>for</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56105e7b514f539506016a5e",
+      "title": "Count Backwards With a For Loop",
+      "description": [
+        "A for loop can also count backwards, so long as we can define the right conditions.",
+        "In order to count backwards by twos, we'll need to change our <code>initialization</code>, <code>condition</code>, and <code>final-expression</code>.",
+        "We'll start at <code>i = 10</code> and loop while <code>i &#62; 0</code>. We'll decrement <code>i</code> by 2 each loop with <code>i -= 2</code>.",
+        "<blockquote>var ourArray = [];<br>for (var i=10; i &#62; 0; i-=2) {<br>  ourArray.push(i);<br>}</blockquote>",
+        "<code>ourArray</code> will now contain <code>[10,8,6,4,2]</code>.",
+        "Let's change our <code>initialization</code> and <code>final-expression</code> so we can count backward by twos by odd numbers.",
+        "<hr>",
+        "Push the odd numbers from 9 through 1 to <code>myArray</code> using a <code>for</code> loop."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "var ourArray = [];",
+        "",
+        "for (var i = 10; i > 0; i -= 2) {",
+        "  ourArray.push(i);",
+        "}",
+        "",
+        "// Setup",
+        "var myArray = [];",
+        "",
+        "// Only change code below this line.",
+        "",
+        ""
+      ],
+      "tail": [
+        "if(typeof myArray !== \"undefined\"){(function(){return myArray;})();}"
+      ],
+      "solutions": [
+        "var ourArray = [];\nfor (var i = 10; i > 0; i -= 2) {\n  ourArray.push(i);\n}\nvar myArray = [];\nfor (var i = 9; i > 0; i -= 2) {\n  myArray.push(i);\n}"
+      ],
+      "tests": [
+        "assert(code.match(/for\\s*\\(/g).length > 1, 'message: You should be using a <code>for</code> loop for this.');",
+        "assert(code.match(/myArray.push/), 'message: You should be using the array method <code>push</code>.');",
+        "assert.deepEqual(myArray, [9,7,5,3,1], 'message: <code>myArray</code> should equal <code>[9,7,5,3,1]</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Cuenta hacia atrás con un ciclo for",
+          "description": [
+            "Un ciclo también puede contar hacia atrás, siempre y cuando definamos las condiciones adecuadas.",
+            "Para contar hacia atrás de dos en dos, tendremos que cambiar nuestra <code>inicialización</code>, la <code>condición</code> y la <code>última-expresión</code>.",
+            "Vamos a empezar con <code>i = 10</code> e iteraremos mientras <code>i > 0</code>.  Vamos a decrementar <code>i</code> de a 2 por cada iteración con <code>i -= 2</code>. ",
+            "<code>var ourArray = [];</code>",
+            "<code>for (var i = 10; i > 0; i -= 2) {</code>",
+            "<code>&nbsp;&nbsp;ourArray.push(i);</code>",
+            "<code>}</code>",
+            "<code>ourArray</code> ahora contendrá <code>[10,8,6,4,2]</code>.",
+            "Vamos a cambiar nuestra <code>inicialización</code> y la <code>expresión final</code> para que podamos contar hacia atrás de dos en dos pero números impares.",
+            "<h4>Instrucciones</h4>",
+            "Empuja los números impares del 9 a 1 en <code>myArray</code> utilizando un ciclo <code>for</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "5675e877dbd60be8ad28edc6",
+      "title": "Iterate Through an Array with a For Loop",
+      "description": [
+        "A common task in JavaScript is to iterate through the contents of an array. One way to do that is with a <code>for</code> loop. This code will output each element of the array <code>arr</code> to the console:",
+        "<blockquote>var arr = [10,9,8,7,6];<br>for (var i = 0; i < arr.length; i++) {<br>   console.log(arr[i]);<br>}</blockquote>",
+        "Remember that Arrays have zero-based numbering, which means the last index of the array is length - 1. Our <dfn>condition</dfn> for this loop is <code>i < arr.length</code>, which stops when <code>i</code> is at length - 1.",
+        "<hr>",
+        "Declare and initialize a variable <code>total</code> to <code>0</code>. Use a <code>for</code> loop to add the value of each element of the <code>myArr</code> array to <code>total</code>."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "// Example",
+        "var ourArr = [ 9, 10, 11, 12];",
+        "var ourTotal = 0;",
+        "",
+        "for (var i = 0; i < ourArr.length; i++) {",
+        "  ourTotal += ourArr[i];",
+        "}",
+        "",
+        "// Setup",
+        "var myArr = [ 2, 3, 4, 5, 6];",
+        "",
+        "// Only change code below this line",
+        "",
+        ""
+      ],
+      "tail": [
+        "(function(){if(typeof total !== 'undefined') { return \"total = \" + total; } else { return \"total is undefined\";}})()"
+      ],
+      "solutions": [
+        "var ourArr = [ 9, 10, 11, 12];\nvar ourTotal = 0;\n\nfor (var i = 0; i < ourArr.length; i++) {\n  ourTotal += ourArr[i];\n}\n\nvar myArr = [ 2, 3, 4, 5, 6];\nvar total = 0;\n\nfor (var i = 0; i < myArr.length; i++) {\n  total += myArr[i];\n}"
+      ],
+      "tests": [
+        "assert(code.match(/var.*?total\\s*=\\s*0.*?;/), 'message: <code>total</code> should be declared and initialized to 0');",
+        "assert(total === 20, 'message: <code>total</code> should equal 20');",
+        "assert(code.match(/for\\s*\\(/g).length > 1 && code.match(/myArr\\s*\\[/), 'message: You should use a <code>for</code> loop to iterate through <code>myArr</code>');",
+        "assert(!code.match(/total[\\s\\+\\-]*=\\s*(\\d(?!\\s*[;,])|[1-9])/g), 'message: Do not set <code>total</code> to 20 directly');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Iterar a través de un vector con un ciclo for",
+          "description": [
+            "Una tarea común en JavaScript es iterar a traves del contenido de un vector. Una manera de hacerlo es con un ciclo <code>for</code>. Este código imprimirá cada elemento del vector <code>arr</code> en la consola:",
+            "<blockquote>var arr = [10,9,8,7,6];<br>for (var i=0; i < arr.length; i++) {<br>   console.log(arr[i]);<br>}</blockquote>",
+            "Recuerda que los vectores tienen numeración que comienza en cero, la cual significa que el último índice del vector es su longitud - 1. Nuestra <dfn>condición</dfn> para este ciclo es <code>i < arr.length</code>, que lo detendrá cuando <code>i</code> sea la longitud - 1.",
+            "<h4>Instrucciones</h4>",
+            "Declara e inicializa una variable <code>total</code> en <code>0</code>. Usa un ciclo <code>for</code> para añadir el valor de cada elemento del vector <code>myArr</code> a <code>total</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244e1",
+      "title": "Nesting For Loops",
+      "description": [
+        "If you have a multi-dimensional array, you can use the same logic as the prior waypoint to loop through both the array and any sub-arrays. Here is an example:",
+        "<blockquote>var arr = [<br>  [1,2], [3,4], [5,6]<br>];<br>for (var i=0; i &lt; arr.length; i++) {<br>  for (var j=0; j &lt; arr[i].length; j++) {<br>    console.log(arr[i][j]);<br>  }<br>}</blockquote>",
+        "This outputs each sub-element in <code>arr</code> one at a time. Note that for the inner loop, we are checking the <code>.length</code> of <code>arr[i]</code>, since <code>arr[i]</code> is itself an array.",
+        "<hr>",
+        "Modify function <code>multiplyAll</code> so that it multiplies the <code>product</code> variable by each number in the sub-arrays of <code>arr</code>"
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "function multiplyAll(arr) {",
+        "  var product = 1;",
+        "  // Only change code below this line",
+        "  ",
+        "  // Only change code above this line",
+        "  return product;",
+        "}",
+        "",
+        "// Modify values below to test your code",
+        "multiplyAll([[1,2],[3,4],[5,6,7]]);",
+        ""
+      ],
+      "tail": [
+        ""
+      ],
+      "solutions": [
+        "function multiplyAll(arr) {\n  var product = 1;\n  for (var i = 0; i < arr.length; i++) {\n    for (var j = 0; j < arr[i].length; j++) {\n      product *= arr[i][j];\n    }\n  }\n  return product;\n}\n\nmultiplyAll([[1,2],[3,4],[5,6,7]]);"
+      ],
+      "tests": [
+        "assert(multiplyAll([[1],[2],[3]]) === 6, 'message: <code>multiplyAll([[1],[2],[3]])</code> should return <code>6</code>');",
+        "assert(multiplyAll([[1,2],[3,4],[5,6,7]]) === 5040, 'message: <code>multiplyAll([[1,2],[3,4],[5,6,7]])</code> should return <code>5040</code>');",
+        "assert(multiplyAll([[5,1],[0.2, 4, 0.5],[3, 9]]) === 54, 'message: <code>multiplyAll([[5,1],[0.2, 4, 0.5],[3, 9]])</code> should return <code>54</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Anidar ciclos for",
+          "description": [
+            "Si tienes una matriz multi-dimensional, puedes usar la misma lógica del punto anterior para iterar a través de un vector y cualquier sub-vector. Aquí está un ejemplo:",
+            "<blockquote>var arr = [<br>  [1,2], [3,4], [5,6]<br>];<br>for (var i=0; i &lt; arr.length; i++) {<br>  for (var j=0; j &lt; arr[i].length; j++) {<br>    console.log(arr[i][j]);<br>  }<br>}</blockquote>",
+            "Esto imprime cada sub-elemento en <code>arr</code> uno a la vez. Nota que en el ciclo interior, estamos comprobando la longitud <code>.length</code> de <code>arr[i]</code>, ya que <code>arr[i]</code> es por si mismo un vector.",
+            "<h4>Instrucciones</h4>",
+            "Modifica la función <code>multiplyAll</code> de manera que esta multiplique la variable <code>product</code> por cada número en los sub-vectores de <code>arr</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "5688e62ea601b2482ff8422b",
+      "title": "Profile Lookup",
+      "description": [
+        "We have an array of objects representing different people in our contacts lists.",
+        "A <code>lookUpProfile</code> function that takes <code>name</code> and a property (<code>prop</code>) as arguments has been pre-written for you.",
+        "The function should check if <code>name</code> is an actual contact's <code>firstName</code> and the given property (<code>prop</code>) is a property of that contact.",
+        "If both are true, then return the \"value\" of that property.",
+        "If <code>name</code> does not correspond to any contacts then return <code>\"No such contact\"</code>",
+        "If <code>prop</code> does not correspond to any valid properties of a contact found to match <code>name</code> then return <code>\"No such property\"</code>"
+      ],
+      "releasedOn": "January 8, 2016",
+      "challengeSeed": [
+        "//Setup",
+        "var contacts = [",
+        "    {",
+        "        \"firstName\": \"Akira\",",
+        "        \"lastName\": \"Laine\",",
+        "        \"number\": \"0543236543\",",
+        "        \"likes\": [\"Pizza\", \"Coding\", \"Brownie Points\"]",
+        "    },",
+        "    {",
+        "        \"firstName\": \"Harry\",",
+        "        \"lastName\": \"Potter\",",
+        "        \"number\": \"0994372684\",",
+        "        \"likes\": [\"Hogwarts\", \"Magic\", \"Hagrid\"]",
+        "    },",
+        "    {",
+        "        \"firstName\": \"Sherlock\",",
+        "        \"lastName\": \"Holmes\",",
+        "        \"number\": \"0487345643\",",
+        "        \"likes\": [\"Intriguing Cases\", \"Violin\"]",
+        "    },",
+        "    {",
+        "        \"firstName\": \"Kristian\",",
+        "        \"lastName\": \"Vos\",",
+        "        \"number\": \"unknown\",",
+        "        \"likes\": [\"Javascript\", \"Gaming\", \"Foxes\"]",
+        "    }",
+        "];",
+        "",
+        "",
+        "function lookUpProfile(name, prop){",
+        "// Only change code below this line",
+        "",
+        "// Only change code above this line",
+        "}",
+        "",
+        "// Change these values to test your function",
+        "lookUpProfile(\"Akira\", \"likes\");"
+      ],
+      "solutions": [
+        "var contacts = [\n    {\n        \"firstName\": \"Akira\",\n        \"lastName\": \"Laine\",\n        \"number\": \"0543236543\",\n        \"likes\": [\"Pizza\", \"Coding\", \"Brownie Points\"]\n    },\n    {\n        \"firstName\": \"Harry\",\n        \"lastName\": \"Potter\",\n        \"number\": \"0994372684\",\n        \"likes\": [\"Hogwarts\", \"Magic\", \"Hagrid\"]\n    },\n    {\n        \"firstName\": \"Sherlock\",\n        \"lastName\": \"Holmes\",\n        \"number\": \"0487345643\",\n        \"likes\": [\"Intriguing Cases\", \"Violin\"]\n    },\n    {\n        \"firstName\": \"Kristian\",\n        \"lastName\": \"Vos\",\n        \"number\": \"unknown\",\n        \"likes\": [\"Javascript\", \"Gaming\", \"Foxes\"]\n    },\n];\n\n\n//Write your function in between these comments\nfunction lookUpProfile(name, prop){\n    for(var i in contacts){\n      if(contacts[i].firstName === name) {\n        return contacts[i][prop] || \"No such property\";\n      }\n    }\n   return \"No such contact\";\n}\n//Write your function in between these comments\n\nlookUpProfile(\"Akira\", \"likes\");"
+      ],
+      "tests": [
+        "assert(lookUpProfile('Kristian','lastName') === \"Vos\", 'message: <code>\"Kristian\", \"lastName\"</code> should return <code>\"Vos\"</code>');",
+        "assert.deepEqual(lookUpProfile(\"Sherlock\", \"likes\"), [\"Intriguing Cases\", \"Violin\"], 'message: <code>\"Sherlock\", \"likes\"</code> should return <code>[\"Intriguing Cases\", \"Violin\"]</code>');",
+        "assert(typeof lookUpProfile(\"Harry\", \"likes\") === \"object\", 'message: <code>\"Harry\",\"likes\"</code> should return an array');",
+        "assert(lookUpProfile(\"Bob\", \"number\") === \"No such contact\", 'message: <code>\"Bob\", \"number\"</code> should return \"No such contact\"');",
+        "assert(lookUpProfile(\"Bob\", \"potato\") === \"No such contact\", 'message: <code>\"Bob\", \"potato\"</code> should return \"No such contact\"');",
+        "assert(lookUpProfile(\"Akira\", \"address\") === \"No such property\", 'message: <code>\"Akira\", \"address\"</code> should return \"No such property\"');"
+      ],
+      "type": "checkpoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Búsqueda de perfiles",
+          "description": [
+            "Tenemos un vector de objetos que representan diferentes personas en nuestra lista de contactos.",
+            "Una función <code>lookUp</code> que recibe el nombre (<code>firstName</code>) y una propiedad (<code>prop</code>) como argumentos ya ha sido escrita previamente para ti.",
+            "La función debe comprobar si <code>firstName</code> es un nombre (<code>firstName</code>) de algún contacto y si la propiedad dada (<code>prop</code>) es una propiedad de ese contacto.",
+            "Si ambos son verdaderos, entonces retorna el valor (<code>value</code>) de esa propiedad.",
+            "Si <code>firstName</code> no corresponde a ningun contacto entonces retorna <code>\"No such contact\"</code>",
+            "Si <code>prop</code> no corresponde a ninguna propiedad válida entonces retorna <code>\"No such property\"</code>",
+            ""
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c11feddfaeb9bdef",
+      "title": "Generate Random Fractions with JavaScript",
+      "description": [
+        "Random numbers are useful for creating random behavior.",
+        "JavaScript has a <code>Math.random()</code> function that generates a random decimal number between <code>0</code> (inclusive) and not quite up to <code>1</code> (exclusive). Thus <code>Math.random()</code> can return a <code>0</code> but never quite return a <code>1</code>",
+        "<strong>Note</strong><br>Like <a href='storing-values-with-the-assignment-operator' target='_blank'>Storing Values with the Equal Operator</a>, all function calls will be resolved before the <code>return</code> executes, so we can <code>return</code> the value of the <code>Math.random()</code> function.",
+        "<hr>",
+        "Change <code>randomFraction</code> to return a random number instead of returning <code>0</code>."
+      ],
+      "challengeSeed": [
+        "function randomFraction() {",
+        "",
+        "  // Only change code below this line.",
+        "",
+        "  return 0;",
+        "",
+        "  // Only change code above this line.",
+        "}"
+      ],
+      "tail": [
+        "(function(){return randomFraction();})();"
+      ],
+      "solutions": [
+        "function randomFraction() {\n  return Math.random();\n}"
+      ],
+      "tests": [
+        "assert(typeof randomFraction() === \"number\", 'message: <code>randomFraction</code> should return a random number.');",
+        "assert((randomFraction()+''). match(/\\./g), 'message: The number returned by <code>randomFraction</code> should be a decimal.');",
+        "assert(code.match(/Math\\.random/g).length >= 0, 'message: You should be using <code>Math.random</code> to generate the random decimal number.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Generar fracciones al azar con JavaScript",
+          "description": [
+            "Los números aleatorios son útiles para crear un comportamiento aleatorio.",
+            "JavaScript tiene una función <code>Math.random()</code> que genera un número decimal aleatorio.",
+            "<h4>Instrucciones</h4>",
+            "Cambia <code>randomFraction</code> para que devuelva un número al azar en lugar de devolver <code>0</code>.",
+            "Ten en cuenta que puedes retornar lo retornado por una función, igual que harías para devolver una variable o valor."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c12feddfaeb1bdef",
+      "title": "Generate Random Whole Numbers with JavaScript",
+      "description": [
+        "It's great that we can generate random decimal numbers, but it's even more useful if we use it to generate random whole numbers.",
+        "<ol><li>Use <code>Math.random()</code> to generate a random decimal.</li><li>Multiply that random decimal by <code>20</code>.</li><li>Use another function, <code>Math.floor()</code> to round the number down to its nearest whole number.</li></ol>",
+        "Remember that <code>Math.random()</code> can never quite return a <code>1</code> and, because we're rounding down, it's impossible to actually get <code>20</code>. This technique will give us a whole number between <code>0</code> and <code>19</code>.",
+        "Putting everything together, this is what our code looks like:",
+        "<code>Math.floor(Math.random() * 20);</code>",
+        "We are calling <code>Math.random()</code>, multiplying the result by 20, then passing the value to <code>Math.floor()</code> function to round the value down to the nearest whole number.",
+        "<hr>",
+        "Use this technique to generate and return a random whole number between <code>0</code> and <code>9</code>."
+      ],
+      "challengeSeed": [
+        "var randomNumberBetween0and19 = Math.floor(Math.random() * 20);",
+        "",
+        "function randomWholeNum() {",
+        "",
+        "  // Only change code below this line.",
+        "",
+        "  return Math.random();",
+        "}"
+      ],
+      "tail": [
+        "(function(){return randomWholeNum();})();"
+      ],
+      "solutions": [
+        "var randomNumberBetween0and19 = Math.floor(Math.random() * 20);\nfunction randomWholeNum() {\n  return Math.floor(Math.random() * 10);\n}"
+      ],
+      "tests": [
+        "assert(typeof randomWholeNum() === \"number\" && (function(){var r = randomWholeNum();return Math.floor(r) === r;})(), 'message: The result of <code>randomWholeNum</code> should be a whole number.');",
+        "assert(code.match(/Math.random/g).length > 1, 'message: You should be using <code>Math.random</code> to generate a random number.');",
+        "assert(code.match(/\\s*?Math.random\\s*?\\(\\s*?\\)\\s*?\\*\\s*?10[\\D]\\s*?/g) || code.match(/\\s*?10\\s*?\\*\\s*?Math.random\\s*?\\(\\s*?\\)\\s*?/g), 'message: You should have multiplied the result of <code>Math.random</code> by 10 to make it a number that is between zero and nine.');",
+        "assert(code.match(/Math.floor/g).length > 1, 'message: You should use <code>Math.floor</code> to remove the decimal part of the number.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Genera números aleatorios enteros con JavaScript",
+          "description": [
+            "Es muy bueno que podamos generar números decimales al azar, pero es aún más útil si lo utilizamos para generar números enteros aleatorios.",
+            "En primer lugar, vamos a usar <code>Math.random()</code> para generar un decimal aleatorio.",
+            "Entonces vamos a multiplicar este decimal azar por 20.",
+            "Por último, vamos a usar otra función, <code>Math.floor()</code> para redondear el número hasta su número entero más próximo.",
+            "Esta técnica nos da un número entero entre 0 y 19.",
+            "Tenga en cuenta que debido a que estamos redondeando, es imposible obtener 20.",
+            "Poniendo todo junto, así es como se ve nuestro código:",
+            "<code>Math.floor(Math.random() * 20);</code>",
+            "¿Ves como <code>Math.floor</code> toma <code>(Math.random() * 20)</code> como su argumento? Así es - puedes pasar el resultado de un función como argumento de otra función.",
+            "<h4>Instrucciones</h4>",
+            "Usa esta técnica para generar y devolver un número entero aleatorio entre 0 y 9."
+          ]
+        }
+      }
+    },
+    {
+      "id": "cf1111c1c12feddfaeb2bdef",
+      "title": "Generate Random Whole Numbers within a Range",
+      "description": [
+        "Instead of generating a random number between zero and a given number like we did before, we can generate a random number that falls within a range of two specific numbers.",
+        "To do this, we'll define a minimum number <code>min</code> and a maximum number <code>max</code>.",
+        "Here's the formula we'll use. Take a moment to read it and try to understand what this code is doing:",
+        "<code>Math.floor(Math.random() * (max - min + 1)) + min</code>",
+        "<hr>",
+        "Create a function called <code>randomRange</code> that takes a range <code>myMin</code> and <code>myMax</code> and returns a random number that's greater than or equal to <code>myMin</code>, and is less than or equal to <code>myMax</code>, inclusive."
+      ],
+      "challengeSeed": [
+        "// Example",
+        "function ourRandomRange(ourMin, ourMax) {",
+        "",
+        "  return Math.floor(Math.random() * (ourMax - ourMin + 1)) + ourMin;",
+        "}",
+        "",
+        "ourRandomRange(1, 9);",
+        "",
+        "// Only change code below this line.",
+        "",
+        "function randomRange(myMin, myMax) {",
+        "",
+        "  return 0; // Change this line",
+        "",
+        "}",
+        "",
+        "// Change these values to test your function",
+        "var myRandom = randomRange(5, 15);"
+      ],
+      "tail": [
+        "var calcMin = 100;",
+        "var calcMax = -100;",
+        "for(var i = 0; i < 100; i++) {",
+        "  var result = randomRange(5,15);",
+        "  calcMin = Math.min(calcMin, result);",
+        "  calcMax = Math.max(calcMax, result);",
+        "}",
+        "(function(){",
+        "  if(typeof myRandom === 'number') {",
+        "    return \"myRandom = \" + myRandom;",
+        "  } else {",
+        "    return \"myRandom undefined\";",
+        "  }",
+        "})();"
+      ],
+      "solutions": [
+        "function randomRange(myMin, myMax) {\n  return Math.floor(Math.random() * (myMax - myMin + 1)) + myMin;\n}"
+      ],
+      "tests": [
+        "assert(calcMin === 5, 'message: The lowest random number that can be generated by <code>randomRange</code> should be equal to your minimum number, <code>myMin</code>.');",
+        "assert(calcMax === 15, 'message: The highest random number that can be generated by <code>randomRange</code> should be equal to your maximum number, <code>myMax</code>.');",
+        "assert(randomRange(0,1) % 1 === 0 , 'message: The random number generated by <code>randomRange</code> should be an integer, not a decimal.');",
+        "assert((function(){if(code.match(/myMax/g).length > 1 && code.match(/myMin/g).length > 2 && code.match(/Math.floor/g) && code.match(/Math.random/g)){return true;}else{return false;}})(), 'message: <code>randomRange</code> should use both <code>myMax</code> and <code>myMin</code>, and return a random number in your range.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {
+        "es": {
+          "title": "Genera números aleatorios enteros dentro de un rango",
+          "description": [
+            "En lugar de generar un número aleatorio entre cero y un número dado como lo hicimos antes, podemos generar un número aleatorio que caiga dentro de un rango de dos números específicos.",
+            "Para ello, vamos a definir un número mínimo <code>min</code> y un número máximo <code>max</code>.",
+            "He aquí la fórmula que utilizaremos. Tómate un momento para leer y tratar de entender lo que el código está haciendo: ",
+            "<code>Math.floor(Math.random() * (max - min + 1)) + min</code>",
+            "Definir dos variables: <code>myMin</code> y <code>myMax</code>, y asignales valores enteros.",
+            "<h4>Instrucciones</h4>",
+            "A continuación, crea una función llamada <code>myFunction</code> que devuelva un número aleatorio mayor o igual a <code>myMin</code>, y menor o igual a <code>myMax</code>. "
+          ]
+        }
+      }
+    },
+    {
+      "id": "587d7b7e367417b2b2512b23",
+      "title": "Use the parseInt Function",
+      "description": [
+        "The <code>parseInt()</code> function parses a string and returns an integer. Here's an example:",
+        "<code>var a = parseInt(\"007\");</code>",
+        "The above function converts the string \"007\" to an integer 7. If the first character in the string can't be converted into a number, then it returns <code>NaN</code>.",
+        "<hr>",
+        "Use <code>parseInt()</code> in the <code>convertToInteger</code> function so it converts the input string <code>str</code> into an integer, and returns it."
+      ],
+      "challengeSeed": [
+        "function convertToInteger(str) {",
+        "  ",
+        "}",
+        "",
+        "convertToInteger(\"56\");"
+      ],
+      "tail": [],
+      "solutions": [],
+      "tests": [
+        "assert(/parseInt/g.test(code), 'message: <code>convertToInteger</code> should use the <code>parseInt()</code> function');",
+        "assert(typeof(convertToInteger(\"56\")) === \"number\", 'message: <code>convertToInteger(\"56\")</code> should return a number');",
+        "assert(convertToInteger(\"56\") === 56, 'message: <code>convertToInteger(\"56\")</code> should return 56');",
+        "assert(convertToInteger(\"77\") === 77, 'message: <code>convertToInteger(\"77\")</code> should return 77');",
+        "assert.isNaN(convertToInteger(\"JamesBond\"), 'message: <code>convertToInteger(\"JamesBond\")</code> should return NaN');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {},
+      "releasedOn": "February 17, 2017"
+    },
+    {
+      "id": "587d7b7e367417b2b2512b22",
+      "title": "Use the parseInt Function with a Radix",
+      "description": [
+        "The <code>parseInt()</code> function parses a string and returns an integer. It takes a second argument for the radix, which specifies the base of the number in the string. The radix can be an integer between 2 and 36.",
+        "The function call looks like:",
+        "<code>parseInt(string, radix);</code>",
+        "And here's an example:",
+        "<code>var a = parseInt(\"11\", 2);</code>",
+        "The radix variable says that \"11\" is in the binary system, or base 2. This example converts the string \"11\" to an integer 3.",
+        "<hr>",
+        "Use <code>parseInt()</code> in the <code>convertToInteger</code> function so it converts a binary number to an integer and returns it."
+      ],
+      "challengeSeed": [
+        "function convertToInteger(str) {",
+        "  ",
+        "}",
+        "",
+        "convertToInteger(\"10011\");"
+      ],
+      "tail": [],
+      "solutions": [],
+      "tests": [
+        "assert(/parseInt/g.test(code), 'message: <code>convertToInteger</code> should use the <code>parseInt()</code> function');",
+        "assert(typeof(convertToInteger(\"10011\")) === \"number\", 'message: <code>convertToInteger(\"10011\")</code> should return a number');",
+        "assert(convertToInteger(\"10011\") === 19, 'message: <code>convertToInteger(\"10011\")</code> should return 19');",
+        "assert(convertToInteger(\"111001\") === 57, 'message: <code>convertToInteger(\"111001\")</code> should return 57');",
+        "assert.isNaN(convertToInteger(\"JamesBond\"), 'message: <code>convertToInteger(\"JamesBond\")</code> should return NaN');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "releasedOn": "February 17, 2017",
+      "translations": {}
+    },
+    {
+      "id": "587d7b7e367417b2b2512b24",
+      "title": "Use the Conditional (Ternary) Operator",
+      "description": [
+        "The <dfn>conditional operator</dfn>, also called the <dfn>ternary operator</dfn>, can be used as a one line if-else expression.",
+        "The syntax is:",
+        "<code>condition ? statement-if-true : statement-if-false;</code>",
+        "The following function uses an if-else statement to check a condition:",
+        "<blockquote>function findGreater(a, b) {<br>  if(a > b) {<br>    return \"a is greater\";<br>  }<br>  else {<br>    return \"b is greater\";<br>  }<br>}</blockquote>",
+        "This can be re-written using the <code>conditional operator</code>:",
+        "<blockquote>function findGreater(a, b) {<br>  return a > b ? \"a is greater\" : \"b is greater\";<br>}</blockquote>",
+        "<hr>",
+        "Use the <code>conditional operator</code> in the <code>checkEqual</code> function to check if two numbers are equal or not. The function should return either true or false."
+      ],
+      "challengeSeed": [
+        "function checkEqual(a, b) {",
+        "  ",
+        "}",
+        "",
+        "checkEqual(1, 2);"
+      ],
+      "tail": [],
+      "solutions": [],
+      "tests": [
+        "assert(/.+?\\s*?\\?\\s*?.+?\\s*?:\\s*?.+?/gi.test(code), 'message: <code>checkEqual</code> should use the <code>conditional operator</code>');",
+        "assert(checkEqual(1, 2) === false, 'message: <code>checkEqual(1, 2)</code> should return false');",
+        "assert(checkEqual(1, 1) === true, 'message: <code>checkEqual(1, 1)</code> should return true');",
+        "assert(checkEqual(1, -1) === false, 'message: <code>checkEqual(1, -1)</code> should return false');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "releasedOn": "February 17, 2017",
+      "translations": {}
+    },
+    {
+      "id": "587d7b7e367417b2b2512b21",
+      "title": "Use Multiple Conditional (Ternary) Operators",
+      "description": [
+        "In the previous challenge, you used a single <code>conditional operator</code>. You can also chain them together to check for multiple conditions.",
+        "The following function uses if, else if, and else statements to check multiple conditions:",
+        "<blockquote>function findGreaterOrEqual(a, b) {<br>  if(a === b) {<br>    return \"a and b are equal\";<br>  }<br>  else if(a > b) {<br>    return \"a is greater\";<br>  }<br>  else {<br>    return \"b is greater\";<br>  }<br>}</blockquote>",
+        "The above function can be re-written using multiple <code>conditional operators</code>:",
+        "<blockquote>function findGreaterOrEqual(a, b) {<br>  return (a === b) ? \"a and b are equal\" : (a > b) ? \"a is greater\" : \"b is greater\";<br>}</blockquote>",
+        "<hr>",
+        "Use multiple <code>conditional operators</code> in the <code>checkSign</code> function to check if a number is positive, negative or zero."
+      ],
+      "challengeSeed": [
+        "function checkSign(num) {",
+        "  ",
+        "}",
+        "",
+        "checkSign(10);"
+      ],
+      "tail": [],
+      "solutions": [],
+      "tests": [
+        "assert(/.+?\\s*?\\?\\s*?.+?\\s*?:\\s*?.+?\\s*?\\?\\s*?.+?\\s*?:\\s*?.+?/gi.test(code), 'message: <code>checkSign</code> should use multiple <code>conditional operators</code>');",
+        "assert(checkSign(10) === 'positive', 'message: <code>checkSign(10)</code> should return \"positive\". Note that capitalization matters');",
+        "assert(checkSign(-12) === 'negative', 'message: <code>checkSign(-12)</code> should return \"negative\". Note that capitalization matters');",
+        "assert(checkSign(0) === 'zero', 'message: <code>checkSign(0)</code> should return \"zero\". Note that capitalization matters');"
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "releasedOn": "February 17, 2017",
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/claim-your-javascript-algorithms-and-data-structures.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/claim-your-javascript-algorithms-and-data-structures.json
new file mode 100644
index 0000000000..fc734893dc
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/claim-your-javascript-algorithms-and-data-structures.json
@@ -0,0 +1,240 @@
+{
+  "name": "Claim Your JavaScript Algorithms and Data Structures Certificate",
+  "order": 13,
+  "time": "5 minutes",
+  "challenges": [
+    {
+      "id": "587d7b7f367417b2b2512b25",
+      "title": "Claim Your JavaScript Algorithms and Data Structures Certificate",
+      "description": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "An image of our Front End Development Certificate",
+          "This challenge will give you your verified Front End Development Certificate. Before we issue your certificate, we must verify that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. You must also accept our Academic Honesty Pledge. Click the button below to start this process.",
+          ""
+        ],
+        [
+          "//i.imgur.com/uLPsUko.jpg",
+          "The definition of plagiarism: Plagiarism (noun) - copying someone else’s work and presenting it as your own without crediting them",
+          "By clicking below, you pledge that all of your submitted code A) is code you or your pair personally wrote, or B) comes from open source libraries like jQuery, or C) has been clearly attributed to its original authors. You also give us permission to audit your challenge solutions and revoke your certificate if we discover evidence of plagiarism.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/UedoV2G.jpg",
+          "An image of the text \"Front End Development Certificate requirements\"",
+          "Let's confirm that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. Click the button below to verify this.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/Q5Za9U6.jpg",
+          "An image of the word \"Congratulations\"",
+          "Congratulations! We've added your Front End Development Certificate to your portfolio page. Unless you choose to hide your solutions, this certificate will remain publicly visible and verifiable.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        {
+          "properties": [
+            "isHonest",
+            "isFrontEndCert"
+          ],
+          "apis": [
+            "/certificate/honest",
+            "/certificate/verify/front-end"
+          ],
+          "stepIndex": [
+            1,
+            2
+          ]
+        }
+      ],
+      "tests": [
+        {
+          "id": "a202eed8fc186c8434cb6d61",
+          "title": "Reverse a String"
+        },
+        {
+          "id": "a302f7aae1aa3152a5b413bc",
+          "title": "Factorialize a Number"
+        },
+        {
+          "id": "aaa48de84e1ecc7c742e1124",
+          "title": "Check for Palindromes"
+        },
+        {
+          "id": "a26cbbe9ad8655a977e1ceb5",
+          "title": "Find the Longest Word in a String"
+        },
+        {
+          "id": "ab6137d4e35944e21037b769",
+          "title": "Title Case a Sentence"
+        },
+        {
+          "id": "a789b3483989747d63b0e427",
+          "title": "Return Largest Numbers in Arrays"
+        },
+        {
+          "id": "acda2fb1324d9b0fa741e6b5",
+          "title": "Confirm the Ending"
+        },
+        {
+          "id": "afcc8d540bea9ea2669306b6",
+          "title": "Repeat a string repeat a string"
+        },
+        {
+          "id": "ac6993d51946422351508a41",
+          "title": "Truncate a string"
+        },
+        {
+          "id": "a9bd25c716030ec90084d8a1",
+          "title": "Chunky Monkey"
+        },
+        {
+          "id": "579e2a2c335b9d72dd32e05c",
+          "title": "Splice and Slice"
+        },
+        {
+          "id": "af2170cad53daa0770fabdea",
+          "title": "Mutations"
+        },
+        {
+          "id": "adf08ec01beb4f99fc7a68f2",
+          "title": "Falsy Bouncer"
+        },
+        {
+          "id": "a39963a4c10bc8b4d4f06d7e",
+          "title": "Seek and Destroy"
+        },
+        {
+          "id": "a24c1a4622e3c05097f71d67",
+          "title": "Where do I belong"
+        },
+        {
+          "id": "a3566b1109230028080c9345",
+          "title": "Sum All Numbers in a Range"
+        },
+        {
+          "id": "a5de63ebea8dbee56860f4f2",
+          "title": "Diff Two Arrays"
+        },
+        {
+          "id": "a7f4d8f2483413a6ce226cac",
+          "title": "Roman Numeral Converter"
+        },
+        {
+          "id": "a8e512fbe388ac2f9198f0fa",
+          "title": "Wherefore art thou"
+        },
+        {
+          "id": "a0b5010f579e69b815e7c5d6",
+          "title": "Search and Replace"
+        },
+        {
+          "id": "aa7697ea2477d1316795783b",
+          "title": "Pig Latin"
+        },
+        {
+          "id": "afd15382cdfb22c9efe8b7de",
+          "title": "DNA Pairing"
+        },
+        {
+          "id": "af7588ade1100bde429baf20",
+          "title": "Missing letters"
+        },
+        {
+          "id": "a77dbc43c33f39daa4429b4f",
+          "title": "Boo who"
+        },
+        {
+          "id": "a105e963526e7de52b219be9",
+          "title": "Sorted Union"
+        },
+        {
+          "id": "a6b0bb188d873cb2c8729495",
+          "title": "Convert HTML Entities"
+        },
+        {
+          "id": "a103376db3ba46b2d50db289",
+          "title": "Spinal Tap Case"
+        },
+        {
+          "id": "a5229172f011153519423690",
+          "title": "Sum All Odd Fibonacci Numbers"
+        },
+        {
+          "id": "a3bfc1673c0526e06d3ac698",
+          "title": "Sum All Primes"
+        },
+        {
+          "id": "ae9defd7acaf69703ab432ea",
+          "title": "Smallest Common Multiple"
+        },
+        {
+          "id": "a6e40f1041b06c996f7b2406",
+          "title": "Finders Keepers"
+        },
+        {
+          "id": "a5deed1811a43193f9f1c841",
+          "title": "Drop it"
+        },
+        {
+          "id": "ab306dbdcc907c7ddfc30830",
+          "title": "Steamroller"
+        },
+        {
+          "id": "a8d97bd4c764e91f9d2bda01",
+          "title": "Binary Agents"
+        },
+        {
+          "id": "a10d2431ad0c6a099a4b8b52",
+          "title": "Everything Be True"
+        },
+        {
+          "id": "a97fd23d9b809dac9921074f",
+          "title": "Arguments Optional"
+        },
+        {
+          "id": "56533eb9ac21ba0edf2244e2",
+          "title": "Caesars Cipher"
+        },
+        {
+          "id": "a2f1d72d9b908d0bd72bb9f6",
+          "title": "Make a Person"
+        },
+        {
+          "id": "af4afb223120f7348cdfc9fd",
+          "title": "Map the Debris"
+        }
+      ],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "descriptionEs": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "Una imagen que muestra nuestro certificado de Desarrollo de interfaces",
+          "Este desafío te otorga tu certificado autenticado de Desarrollo de interfaces. Antes de que podamos emitir tu certificado, debemos verificar que has completado todos los desafíos básicos e intermedios de diseño de algoritmos, y todos los proyectos básicos e intermedios de desarrollo de interfaces. También debes aceptar nuestro Juramento de honestidad académica. Pulsa el botón siguiente para iniciar este proceso.",
+          ""
+        ],
+        [
+          "//i.imgur.com/HArFfMN.jpg",
+          "Plagio (nombre): acción y efecto de plagiar. Plagiar (verbo) - copiar en lo sustancial obras ajenas, dándolas como propias.",
+          "Al pulsar el botón siguiente, juras que todo el código en tus soluciones a los desafíos A) es código que tú o tu compañero escribieron personalmente, o B) proviene de librerías de código abierto como jQuery, o C) ha sido claramente atribuido a sus autores originales. También nos otorgas el permiso para auditar tus soluciones a los desafíos y revocar tu certificado si encontramos evidencia de plagio.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/14F2Van.jpg",
+          "Una imagen del texto \"Front End Development Certificate requirements\"",
+          "Confirmemos que has completado todos nuestros desafíos básicos e intermedios de diseño de algoritmos, y todos nuestros proyectos básicos e intermedios de desarrollo de interfaces. Pulsa el botón siguiente para hacer la verificación.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/16SIhHO.jpg",
+          "Una imagen de la palabra \"Congratulations\"",
+          "¡Felicitaciones! Hemos agregado tu certificado de Desarrollo de interfaces a tu portafolio. A menos que elijas no mostrar tus soluciones, este certificado será públicamente visible y verificable.",
+          ""
+        ]
+      ],
+      "titleEs": "Reclama tu certificado de Desarrollo de interfaces"
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/debugging.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/debugging.json
new file mode 100644
index 0000000000..0c60ae2726
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/debugging.json
@@ -0,0 +1,386 @@
+{
+  "name": "Debugging",
+  "order": 4,
+  "time": "1 hour",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7b83367417b2b2512b32",
+      "title": "Introduction to the Debugging Challenges",
+      "description": [
+        [
+          "http://imgs.xkcd.com/comics/debugging.png",
+          "XKCD web comic walking through the convoluted process of debugging. The programmer moves from a browser problem, to a keyboard driver issue, receives a cryptic system utility error message, and ends by finding the sword of Martin the Warrior.",
+          "Debugging is a valuable and (unfortunately) necessary tool for programmers. It follows the testing phase of checking if your code works as intended, and discovering it does not. Debugging is the process of finding exactly what isn't working and fixing it.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "After spending time creating a brilliant block of code, it is tough realizing it may have errors. These issues generally come in three forms: 1) syntax errors that prevent a program from running, 2) runtime errors when code fails to execute or has unexpected behavior, and 3) semantic (or logical) errors when code doesn't do what it's meant to.<br><br>Modern code editors (and experience) can help identify syntax errors. Semantic and runtime errors are harder to find. They may cause your program to crash, make it run forever, or give incorrect output. Think of debugging as trying to understand why your code is behaving the way it is.<br><br>Example of a syntax error - often detected by the code editor:<br><br><blockquote>funtion willNotWork( {<br>&nbsp;&nbsp;console.log(\"Yuck\");<br>}<br>// \"function\" keyword is misspelled and there's a missing parenthesis</blockquote><br><br>Here's an example of a runtime error - often detected while the program executes:<br><br><blockquote>function loopy() {<br>&nbsp;&nbsp;while(true) {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Hello, world!\");<br>&nbsp;&nbsp;}<br>}<br>// Calling loopy starts an infinite loop, which may crash your browser</blockquote><br><br>Example of a semantic error - often detected after testing code output:<br><br><blockquote>function calcAreaOfRect(w, h) {<br>&nbsp;&nbsp;return w + h; // This should be w * h<br>}<br>let myRectArea = calcAreaOfRect(2, 3);<br>// Correct syntax and the program executes, but this gives the wrong answer</blockquote>",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Debugging is frustrating, but it helps to develop (and follow) a step-by-step approach to review your code. This means checking the intermediate values and types of variables to see if they are what they should be. You can start with a simple process of elimination.<br><br>For example, if function A works and returns what it's supposed to, then function B may have the issue. Or start checking values in a block of code from the middle to try to cut the search space in half. A problem in one spot indicates a bug in the first half of the code. If not, it's likely in the second.<br><br>This section will cover a couple helpful tools to find bugs, and some of the common forms they take. Fortunately, debugging is a learnable skill that just requires a little patience and practice to master.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7b83367417b2b2512b33",
+      "title": "Use the JavaScript Console to Check the Value of a Variable",
+      "description": [
+        "Both Chrome and Firefox have excellent JavaScript consoles, also known as DevTools, for debugging your JavaScript.",
+        "You can find Developer tools in your Chrome's menu or Web Console in FireFox's menu. If you're using a different browser, or a mobile phone, we strongly recommend switching to desktop Firefox or Chrome.",
+        "The <code>console.log()</code> method, which \"prints\" the output of what's within its parentheses to the console, will likely be the most helpful debugging tool. Placing it at strategic points in your code can show you the intermediate values of variables. It's good practice to have an idea of what the output should be before looking at what it is. Having check points to see the status of your calculations throughout your code will help narrow down where the problem is.",
+        "Here's an example to print 'Hello world!' to the console:",
+        "<code>console.log('Hello world!');</code>",
+        "<hr>",
+        "Use the <code>console.log()</code> method to print the value of the variable <code>a</code> where noted in the code."
+      ],
+      "challengeSeed": [
+        "let a = 5;",
+        "let b = 1;",
+        "a++;",
+        "// Add your code below this line",
+        "",
+        "",
+        "let sumAB = a + b;",
+        "console.log(sumAB);"
+      ],
+      "tests": [
+        "assert(code.match(/console\\.log\\(a\\)/g), 'message: Your code should use <code>console.log()</code> to check the value of the variable <code>a</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b84367417b2b2512b34",
+      "title": "Use typeof to Check the Type of a Variable",
+      "description": [
+        "You can use <code>typeof</code> to check the data structure, or type, of a variable. This is useful in debugging when working with multiple data types. If you think you're adding two numbers, but one is actually a string, the results can be unexpected. Type errors can lurk in calculations or function calls. Especially take care when you're accessing and working with external data in the form of a JavaScript object (JSON).",
+        "Here are some examples using <code>typeof</code>:",
+        "<blockquote>console.log(typeof \"\"); // outputs \"string\"<br>console.log(typeof 0); // outputs \"number\"<br>console.log(typeof []); // outputs \"object\"<br>console.log(typeof {}); // outputs \"object\"</blockquote>",
+        "JavaScript recognizes six primitive (immutable) data types: <code>Boolean</code>, <code>Null</code>, <code>Undefined</code>, <code>Number</code>, <code>String</code>, and <code>Symbol</code> (new with ES6) and one type for mutable items: <code>Object</code>. Note that in JavaScript, arrays are technically a type of object.",
+        "<hr>",
+        "Add two <code>console.log()</code> statements to check the <code>typeof</code> each of the two variables <code>seven</code> and <code>three</code> in the code."
+      ],
+      "challengeSeed": [
+        "let seven = 7;",
+        "let three = \"3\";",
+        "console.log(seven + three);",
+        "// Add your code below this line",
+        ""
+      ],
+      "tests": [
+        "assert(code.match(/console\\.log\\(typeof[\\( ].*\\)?\\);/g).length == 2, 'message: Your code should use <code>typeof</code> in two <code>console.log()</code> statements to check the type of the variables.');",
+        "assert(code.match(/typeof[\\( ]seven\\)?/g), 'message: Your code should use <code>typeof</code> to check the type of the variable <code>seven</code>.');",
+        "assert(code.match(/typeof[\\( ]three\\)?/g), 'message: Your code should use <code>typeof</code> to check the type of the variable <code>three</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b84367417b2b2512b35",
+      "title": "Catch Misspelled Variable and Function Names",
+      "description": [
+        "The <code>console.log()</code> and <code>typeof</code> methods are the two primary ways to check intermediate values and types of program output. Now it's time to get into the common forms that bugs take. One syntax-level issue that fast typers can commiserate with is the humble spelling error.",
+        "Transposed, missing, or mis-capitalized characters in a variable or function name will have the browser looking for an object that doesn't exist - and complain in the form of a reference error. JavaScript variable and function names are case-sensitive.",
+        "<hr>",
+        "Fix the two spelling errors in the code so the <code>netWorkingCapital</code> calculation works."
+      ],
+      "challengeSeed": [
+        "let receivables = 10;",
+        "let payables = 8;",
+        "let netWorkingCapital = recievables - payable;",
+        "console.log(`Net working capital is: ${netWorkingCapital}`);"
+      ],
+      "tests": [
+        "assert(netWorkingCapital === 2, 'message: Check the spelling of the two variables used in the netWorkingCapital calculation, the console output should show that \"Net working capital is: 2\".');",
+        "assert(!code.match(/recievables/g), 'message: There should be no instances of mis-spelled variables in the code.');",
+        "assert(code.match(/receivables/g).length == 2, 'message: The <code>receivables</code> variable should be declared and used properly in the code.');",
+        "assert(!code.match(/payable;/g), 'message: There should be no instances of mis-spelled variables in the code.');",
+        "assert(code.match(/payables/g).length == 2, 'message: The <code>payables</code> variable should be declared and used properly in the code.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b84367417b2b2512b36",
+      "title": "Catch Unclosed Parentheses, Brackets, Braces and Quotes",
+      "description": [
+        "Another syntax error to be aware of is that all opening parentheses, brackets, curly braces, and quotes have a closing pair. Forgetting a piece tends to happen when you're editing existing code and inserting items with one of the pair types. Also, take care when nesting code blocks into others, such as adding a callback function as an argument to a method.",
+        "One way to avoid this mistake is as soon as the opening character is typed, immediately include the closing match, then move the cursor back between them and continue coding. Fortunately, most modern code editors generate the second half of the pair automatically.",
+        "<hr>",
+        "Fix the two pair errors in the code."
+      ],
+      "challengeSeed": [
+        "let myArray = [1, 2, 3;",
+        "let arraySum = myArray.reduce((previous, current =>  previous + current);",
+        "console.log(`Sum of array values is: ${arraySum}`);"
+      ],
+      "tests": [
+        "assert(code.match(/myArray\\s*?=\\s*?\\[\\s*?1\\s*?,\\s*?2\\s*?,\\s*?3\\s*?\\];/g), 'message: Your code should fix the missing piece of the array.');",
+        "assert(arraySum === 6, 'message: Your code should fix the missing piece of the <code>.reduce()</code> method. The console output should show that \"Sum of array values is: 6\".');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b84367417b2b2512b37",
+      "title": "Catch Mixed Usage of Single and Double Quotes",
+      "description": [
+        "JavaScript allows the use of both single ('') and double (\"\") quotes to declare a string. Deciding which one to use generally comes down to personal preference, with some exceptions.",
+        "Having two choices is great when a string has contractions or another piece of text that's in quotes. Just be careful that you don't close the string too early, which causes a syntax error.",
+        "Here are some examples of mixing quotes:",
+        "<blockquote>// These are correct:<br>const grouchoContraction = \"I've had a perfectly wonderful evening, but this wasn't it.\";<br>const quoteInString = \"Groucho Marx once said 'Quote me as saying I was mis-quoted.'\";<br>// This is incorrect:<br>const uhOhGroucho = 'I've had a perfectly wonderful evening, but this wasn't it.';</blockquote>",
+        "Of course, it is okay to use only one style of quotes. You can escape the quotes inside the string by using the backslash (\\) escape character:",
+        "<blockquote>// Correct use of same quotes:<br>const allSameQuotes = 'I\\'ve had a perfectly wonderful evening, but this wasn\\'t it.';</blockquote>",
+        "<hr>",
+        "Fix the string so it either uses different quotes for the <code>href</code> value, or escape the existing ones. Keep the double quote marks around the entire string."
+      ],
+      "challengeSeed": [
+        "let innerHtml = \"<p>Click here to <a href=\"#Home\">return home</a></p>\";",
+        "console.log(innerHtml);"
+      ],
+      "tests": [
+        "assert(code.match(/<a href=\\s*?('|\\\\\")#Home\\1\\s*?>/g), 'message: Your code should fix the quotes around the <code>href</code> value \"#Home\" by either changing or escaping them.');",
+        "assert(code.match(/\"<p>.*?<\\/p>\";/g), 'message: Your code should keep the double quotes around the entire string.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b85367417b2b2512b38",
+      "title": "Catch Use of Assignment Operator Instead of Equality Operator",
+      "description": [
+        "Branching programs, i.e. ones that do different things if certain conditions are met, rely on <code>if</code>, <code>else if</code>, and <code>else</code> statements in JavaScript. The condition sometimes takes the form of testing whether a result is equal to a value.",
+        "This logic is spoken (in English, at least) as \"if x equals y, then ...\" which can literally translate into code using the <code>=</code>, or assignment operator. This leads to unexpected control flow in your program.",
+        "As covered in previous challenges, the assignment operator (<code>=</code>) in JavaScript assigns a value to a variable name. And the <code>==</code> and <code>===</code> operators check for equality (the triple <code>===</code> tests for strict equality, meaning both value and type are the same).",
+        "The code below assigns <code>x</code> to be 2, which evaluates as <code>true</code>. Almost every value on its own in JavaScript evaluates to <code>true</code>, except what are known as the \"falsy\" values: <code>false</code>, <code>0</code>, <code>\"\"</code> (an empty string), <code>NaN</code>, <code>undefined</code>, and <code>null</code>.",
+        "<blockquote>let x = 1;<br>let y = 2;<br>if (x = y) {<br>&nbsp;&nbsp;// this code block will run for any value of y (unless y were originally set as a falsy)<br>} else {<br>&nbsp;&nbsp;// this code block is what should run (but won't) in this example<br>}</blockquote>",
+        "<hr>",
+        "Fix the condition so the program runs the right branch, and the appropriate value is assigned to <code>result</code>."
+      ],
+      "challengeSeed": [
+        "let x = 7;",
+        "let y = 9;",
+        "let result = \"to come\";",
+        "",
+        "if(x = y) {",
+        "  result = \"Equal!\";",
+        "} else {",
+        "  result = \"Not equal!\";",
+        "}",
+        "",
+        "console.log(result);"
+      ],
+      "tests": [
+        "assert(result == \"Not equal!\", 'message: Your code should fix the condition so it checks for equality, instead of using assignment.');",
+        "assert(code.match(/x\\s*?===?\\s*?y/g), 'message: The condition can use either <code>==</code> or <code>===</code> to test for equality.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b85367417b2b2512b39",
+      "title": "Catch Missing Open and Closing Parenthesis After a Function Call",
+      "description": [
+        "When a function or method doesn't take any arguments, you may forget to include the (empty) opening and closing parentheses when calling it. Often times the result of a function call is saved in a variable for other use in your code. This error can be detected by logging variable values (or their types) to the console and seeing that one is set to a function reference, instead of the expected value the function returns.",
+        "The variables in the following example are different:",
+        "<blockquote>function myFunction() {<br>&nbsp;&nbsp;return \"You rock!\";<br>}<br>let varOne = myFunction; // set to equal a function<br>let varTwo = myFunction(); // set to equal the string \"You rock!\"</blockquote>",
+        "<hr>",
+        "Fix the code so the variable <code>result</code> is set to the value returned from calling the function <code>getNine</code>."
+      ],
+      "challengeSeed": [
+        "function getNine() {",
+        "  let x = 6;",
+        "  let y = 3;",
+        "  return x + y;",
+        "}",
+        "",
+        "let result = getNine;",
+        "console.log(result);"
+      ],
+      "tests": [
+        "assert(result == 9, 'message: Your code should fix the variable <code>result</code> so it is set to the number that the function <code>getNine</code> returns.');",
+        "assert(code.match(/getNine\\(\\)/g).length == 2, 'message: Your code should call the <code>getNine</code> function.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b85367417b2b2512b3a",
+      "title": "Catch Arguments Passed in the Wrong Order When Calling a Function",
+      "description": [
+        "Continuing the discussion on calling functions, the next bug to watch out for is when a function's arguments are supplied in the incorrect order. If the arguments are different types, such as a function expecting an array and an integer, this will likely throw a runtime error. If the arguments are the same type (all integers, for example), then the logic of the code won't make sense. Make sure to supply all required arguments, in the proper order to avoid these issues.",
+        "<hr>",
+        "The function <code>raiseToPower</code> raises a base to an exponent. Unfortunately, it's not called properly - fix the code so the value of <code>power</code> is the expected 8."
+      ],
+      "challengeSeed": [
+        "function raiseToPower(b, e) {",
+        "  return Math.pow(b, e);",
+        "}",
+        "",
+        "let base = 2;",
+        "let exp = 3;",
+        "let power = raiseToPower(exp, base);",
+        "console.log(power);"
+      ],
+      "tests": [
+        "assert(power == 8, 'message: Your code should fix the variable <code>power</code> so it equals 2 raised to the 3rd power, not 3 raised to the 2nd power.');",
+        "assert(code.match(/raiseToPower\\(\\s*?base\\s*?,\\s*?exp\\s*?\\);/g), 'message: Your code should use the correct order of the arguments for the <code>raiseToPower</code> function call.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b86367417b2b2512b3b",
+      "title": "Catch Off By One Errors When Using Indexing",
+      "description": [
+        "<code>Off by one errors</code> (sometimes called OBOE) crop up when you're trying to target a specific index of a string or array (to slice or access a segment), or when looping over the indices of them. JavaScript indexing starts at zero, not one, which means the last index is always one less than the length of the item. If you try to access an index equal to the length, the program may throw an \"index out of range\" reference error or print <code>undefined</code>.",
+        "When you use string or array methods that take index ranges as arguments, it helps to read the documentation and understand if they are inclusive (the item at the given index is part of what's returned) or not. Here are some examples of off by one errors:",
+        "<blockquote>let alphabet = \"abcdefghijklmnopqrstuvwxyz\";<br>let len = alphabet.length;<br>for (let i = 0; i <= len; i++) {<br>&nbsp;&nbsp;// loops one too many times at the end<br>&nbsp;&nbsp;console.log(alphabet[i]);<br>}<br>for (let j = 1; j < len; j++) {<br>&nbsp;&nbsp;// loops one too few times and misses the first character at index 0<br>&nbsp;&nbsp;console.log(alphabet[j]);<br>}<br>for (let k = 0; k < len; k++) {<br>&nbsp;&nbsp;// Goldilocks approves - this is just right<br>&nbsp;&nbsp;console.log(alphabet[k]);<br>}</blockquote>",
+        "<hr>",
+        "Fix the two indexing errors in the following function so all the numbers 1 through 5 are printed to the console."
+      ],
+      "challengeSeed": [
+        "function countToFive() {",
+        "  let firstFive = \"12345\";",
+        "  let len = firstFive.length;",
+        "  // Fix the line below",
+        "  for (let i = 1; i <= len; i++) {",
+        "  // Do not alter code below this line",
+        "    console.log(firstFive[i]);",
+        "  }",
+        "}",
+        "",
+        "countToFive();"
+      ],
+      "tests": [
+        "assert(code.match(/i\\s*?=\\s*?0\\s*?;/g).length == 1, 'message: Your code should set the initial condition of the loop so it starts at the first index.');",
+        "assert(!code.match(/i\\s?=\\s*?1\\s*?;/g), 'message: Your code should fix the initial condition of the loop so that the index starts at 0.');",
+        "assert(code.match(/i\\s*?<\\s*?len\\s*?;/g).length == 1, 'message: Your code should set the terminal condition of the loop so it stops at the last index.');",
+        "assert(!code.match(/i\\s*?<=\\s*?len;/g), 'message: Your code should fix the terminal condition of the loop so that it stops at 1 before the length.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b86367417b2b2512b3c",
+      "title": "Use Caution When Reinitializing Variables Inside a Loop",
+      "description": [
+        "Sometimes it's necessary to save information, increment counters, or re-set variables within a loop. A potential issue is when variables either should be reinitialized, and aren't, or vice versa. This is particularly dangerous if you accidentally reset the variable being used for the terminal condition, causing an infinite loop.",
+        "Printing variable values with each cycle of your loop by using <code>console.log()</code> can uncover buggy behavior related to resetting, or failing to reset a variable.",
+        "<hr>",
+        "The following function is supposed to create a two-dimensional array with <code>m</code> rows and <code>n</code> columns of zeroes. Unfortunately, it's not producing the expected output because the <code>row</code> variable isn't being reinitialized (set back to an empty array) in the outer loop. Fix the code so it returns a correct 3x2 array of zeroes, which looks like <code>[[0, 0], [0, 0], [0, 0]]</code>."
+      ],
+      "challengeSeed": [
+        "function zeroArray(m, n) {",
+        "  // Creates a 2-D array with m rows and n columns of zeroes",
+        "  let newArray = [];",
+        "  let row = [];",
+        "  for (let i = 0; i < m; i++) {",
+        "    // Adds the m-th row into newArray",
+        "    ",
+        "    for (let j = 0; j < n; j++) {",
+        "      // Pushes n zeroes into the current row to create the columns",
+        "      row.push(0);",
+        "    }",
+        "    // Pushes the current row, which now has n zeroes in it, to the array",
+        "    newArray.push(row);",
+        "  }",
+        "  return newArray;",
+        "}",
+        "",
+        "let matrix = zeroArray(3, 2);",
+        "console.log(matrix);"
+      ],
+      "tests": [
+        "assert(JSON.stringify(matrix) == \"[[0,0],[0,0],[0,0]]\", 'message: Your code should set the <code>matrix</code> variable to an array holding 3 rows of 2 columns of zeroes each.');",
+        "assert(matrix.length == 3, 'message: The <code>matrix</code> variable should have 3 rows.');",
+        "assert(matrix[0].length == 2 && matrix[1].length === 2 && matrix[2].length === 2, 'message: The <code>matrix</code> variable should have 2 columns in each row.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b86367417b2b2512b3d",
+      "title": "Prevent Infinite Loops with a Valid Terminal Condition",
+      "description": [
+        "The final topic is the dreaded infinite loop. Loops are great tools when you need your program to run a code block a certain number of times or until a condition is met, but they need a terminal condition that ends the looping. Infinite loops are likely to freeze or crash the browser, and cause general program execution mayhem, which no one wants.",
+        "There was an example of an infinite loop in the introduction to this section - it had no terminal condition to break out of the <code>while</code> loop inside <code>loopy()</code>. Do NOT call this function!",
+        "<blockquote>function loopy() {<br>&nbsp;&nbsp;while(true) {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Hello, world!\");<br>&nbsp;&nbsp;}<br>}</blockquote>",
+        "It's the programmer's job to ensure that the terminal condition, which tells the program when to break out of the loop code, is eventually reached. One error is incrementing or decrementing a counter variable in the wrong direction from the terminal condition. Another one is accidentally resetting a counter or index variable within the loop code, instead of incrementing or decrementing it.",
+        "<hr>",
+        "The <code>myFunc()</code> function contains an infinite loop because the terminal condition <code>i != 4</code> will never evaluate to <code>false</code> (and break the looping) - <code>i</code> will increment by 2 each pass, and jump right over 4 since <code>i</code> is odd to start. Fix the comparison operator in the terminal condition so the loop only runs for <code>i</code> less than or equal to 4."
+      ],
+      "challengeSeed": [
+        "function myFunc() {",
+        "  for (let i = 1; i != 4; i += 2) {",
+        "    console.log(\"Still going!\");",
+        "  }",
+        "}"
+      ],
+      "tests": [
+        "assert(code.match(/i\\s*?<=\\s*?4;/g).length == 1, 'message: Your code should change the comparison operator in the terminal condition (the middle part) of the <code>for</code> loop.');",
+        "assert(!code.match(/i\\s*?!=\\s*?4;/g), 'message: Your code should fix the comparison operator in the terminal condition of the loop.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/es6.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/es6.json
new file mode 100644
index 0000000000..cda04ccd00
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/es6.json
@@ -0,0 +1,841 @@
+{
+  "name": "ES6",
+  "order": 2,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7b86367417b2b2512b3e",
+      "title": "Introduction to the ES6 Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "ECMAScript is a standardized version of JavaScript with the goal of unifying the language's specifications and features. As all major browsers and JavaScript-runtimes follow this specification, the term <i>ECMAScript</i> is interchangeable with the term <i>JavaScript</i>.<br><br>Most of the challenges on freeCodeCamp use the ECMAScript 5 (ES5) specification of the language, finalized in 2009. But JavaScript is an evolving programming language. As features are added and revisions are made, new versions of the language are released for use by developers.<br><br>The most recent standardized version is called ECMAScript 6 (ES6), released in 2015. This new version of the language adds some powerful features that will be covered in this section of challenges, including:<br><br><ul><li>Arrow functions</li><li>Classes</li><li>Modules</li><li>Promises</li><li>Generators</li><li><code>let</code> and <code>const</code></li></ul><br><br><strong>Note</strong><br>Not all browsers support ES6 features. If you use ES6 in your own projects, you may need to use a program (transpiler) to convert your ES6 code into ES5 until browsers support ES6.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7b87367417b2b2512b3f",
+      "title": "Explore Problems with the var Keyword",
+      "description": [
+        "One of the biggest problems with declaring variables with the <code>var</code> keyword is that you can overwrite variable declarations without an error.",
+        "<blockquote>var camper = 'James';<br>var camper = 'David';<br>console.log(camper);<br>// logs 'David'</blockquote>",
+        "In a small application, you might not run into this type of problem, but when your code becomes larger, you might accidently overwrite a variable that you did not intend to overwrite. Because this behaviour does not throw an error, searching and fixing bugs becomes more difficult.",
+        "Another problem with the <code>var</code> keyword is that it is hoisted to the top of your code when it compiles. This means that you can use a variable before you declare it.",
+        "<blockquote>console.log(camper);<br>var camper = 'David';<br>// logs undefined</blockquote>",
+        "The code runs in the following order:",
+        "<ol><li>The variable <code>camper</code> is declared as undefined.</li><li>The value of <code>camper</code> is logged.</li><li>David is assigned to <code>camper</code>.</li></ol>",
+        "This code will run without an error.",
+        "A new keyword called <code>let</code> was introduced in ES6 to solve the problems with the <code>var</code> keyword. With the <code>let</code> keyword, all the examples we just saw will cause an error to appear. We can no longer overwrite variables or use a variable before we declare it. Some modern browsers require you to add <code>\"use strict\";</code> to the top of your code before you can use the new features of ES6.",
+        "Let's try using the <code>let</code> keyword.",
+        "<hr>",
+        "Fix the code so that it only uses the <code>let</code> keyword and makes the errors go away.",
+        "<strong>Note</strong><br>Remember to add <code>\"use strict\";</code> to the top of your code."
+      ],
+      "challengeSeed": [
+        "var favorite = redNosedReindeer + \" is Santa's favorite reindeer.\";",
+        "var redNosedReindeer = \"Rudolph\";",
+        "var redNosedReindeer = \"Comet\";"
+      ],
+      "tests": [
+        "assert(redNosedReindeer === \"Rudolph\", 'message: <code>redNosedReindeer</code> should be Rudolph.');",
+        "assert(favorite === \"Rudolph is Santa's favorite reindeer.\", \"message: <code>favorite</code> should return Santa's favorite reindeer.\");"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b87367417b2b2512b40",
+      "title": "Compare Scopes of the var and let Keywords",
+      "description": [
+        "When you declare a variable with the <code>var</code> keyword, it is declared globally, or locally if declared inside a function.",
+        "The <code>let</code> keyword behaves similarly, but with some extra features. When you declare a variable with the <code>let</code> keyword inside a block, statement, or expression, its scope is limited to that block, statement, or expression.",
+        "For example:",
+        "<blockquote>var numArray = [];<br>for (var i = 0; i < 3; i++) {<br>  numArray.push(i);<br>}<br>console.log(numArray);<br>// returns [0, 1, 2]<br>console.log(i);<br>// returns 3</blockquote>",
+        "With the <code>var</code> keyword, <code>i</code> is declared globally. So when <code>i++</code> is executed, it updates the global variable. This code is similiar to the following:",
+        "<blockquote>var numArray = [];<br>var i;<br>for (i = 0; i < 3; i++) {<br>  numArray.push(i);<br>}<br>console.log(numArray);<br>// returns [0, 1, 2]<br>console.log(i);<br>// returns 3</blockquote>",
+        "This behavior will cause problems if you were to create a function and store it for later use inside a for loop that uses the <code>i</code> variable. This is because the stored function will always refer to the value of the updated global <code>i</code> variable.",
+        "<blockquote>var printNumTwo;<br>for (var i = 0; i < 3; i++) {<br>  if(i === 2){<br>    printNumTwo = function() {<br>      return i;<br>    };<br>  }<br>}<br>console.log(printNumTwo());<br>// returns 3</blockquote>",
+        "As you can see, <code>printNumTwo()</code> prints 3 and not 2. This is because the value assigned to <code>i</code> was updated and the <code>printNumTwo()</code> returns the global <code>i</code> and not the value <code>i</code> had when the function was created in the for loop. The <code>let</code> keyword does not follow this behavior:",
+        "<blockquote>'use strict';<br>let printNumTwo;<br>for (let i = 0; i < 3; i++) {<br>  if (i === 2) {<br>    printNumTwo = function() {<br>      return i;<br>    };<br>  }<br>}<br>console.log(printNumTwo());<br>// returns 2<br>console.log(i);<br>// returns \"i is not defined\"</blockquote>",
+        "<code>i</code> is not defined because it was not declared in the global scope. It is only declared within the for loop statement. <code>printNumTwo()</code> returned the correct value because three different <code>i</code> variables with unique values (0, 1, and 2) were created by the <code>let</code> keyword within the loop statement.",
+        "<hr>",
+        "Fix the code so that <code>i</code> declared in the if statement is a separate variable than <code>i</code> declared in the first line of the function. Be certain not to use the <code>var</code> keyword anywhere in your code.",
+        "<strong>Note</strong><br>Remember to add <code>\"use strict\";</code> to the top of your code.",
+        "This exercise is designed to illustrate the difference between how <code>var</code> and <code>let</code> keywords assign scope to the declared variable. When programming a function similar to the one used in this exercise, it is often better to use different variable names to avoid confusion."
+      ],
+      "challengeSeed": [
+        "function checkScope() {",
+        "  var i = \"function scope\";",
+        "  if (true) {",
+        "    i = \"block scope\";",
+        "    console.log(\"Block scope i is: \", i);",
+        "  }",
+        "  console.log(\"Function scope i is: \", i);",
+        "  return i;",
+        "}",
+        "// only change the code above this line",
+        "checkScope();"
+      ],
+      "tests": [
+        "// TEMPORARILY COMMENTED OUT: assert(!/var/g.test(code) && /let/g.test(code), 'message: The <code>var</code> keyword should be replaced with <code>let</code>. (This test is temporarily disabled)');",
+        "assert(code.match(/(i\\s*=\\s*).*\\s*.*\\s*.*\\1('|\")block\\s*scope\\2/g), 'message: The variable <code>i</code> declared in the if statement should equal \"block scope\".');",
+        "assert(checkScope() === \"function scope\", 'message: <code>checkScope()</code> should return \"function scope\"');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b87367417b2b2512b41",
+      "title": "Declare a Read-Only Variable with the const Keyword",
+      "description": [
+        "<code>let</code> is not the only new way to declare variables. In ES6, you can also declare variables using the <code>const</code> keyword.",
+        "<code>const</code> has all the awesome features that <code>let</code> has, with the added bonus that variables declared using <code>const</code> are read-only. They are a constant value, which means that once a variable is assigned with <code>const</code>, it cannot be reassigned.",
+        "<blockquote>\"use strict\"<br>const FAV_PET = \"Cats\";<br>FAV_PET = \"Dogs\"; // returns error</blockquote>",
+        "As you can see, trying to reassign a variable declared with <code>const</code> will throw an error. You should always name variables you don't want to reassign using the <code>const</code> keyword. This helps when you accidentally attempt to reassign a variable that is meant to stay constant. A common practice is to name your constants in all upper-cases and with an underscore to separate words (e.g. <code>EXAMPLE_VARIABLE</code>).",
+        "<hr>",
+        "Change the code so that all variables are declared using <code>let</code> or <code>const</code>. Use <code>let</code> when you want the variable to change, and <code>const</code> when you want the variable to remain constant. Also, rename variables declared with <code>const</code> to conform to common practices.",
+        "<strong>Note</strong><br>Don't forget to add <code>\"use strict\";</code> to the top of your code."
+      ],
+      "challengeSeed": [
+        "// change 'var' to 'let' or 'const'",
+        "// rename constant variables",
+        "var pi = 3.14;",
+        "var radius = 10;",
+        "var calculateCircumference = function(r) {",
+        "  var diameter = 2 * r;",
+        "  var result = pi * diameter;",
+        "  return result;",
+        "};",
+        "// Test your code",
+        "console.log(calculateCircumference(radius));"
+      ],
+      "tests": [
+        "// Test user replaced all var keyword",
+        "// Test PI is const",
+        "// Test calculateCircumference is const",
+        "// Test pi and calculateCircumference has been renamed"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b87367417b2b2512b42",
+      "title": "Mutate an Array Declared with const",
+      "description": [
+        "The <code>const</code> declaration has many use cases in modern JavaScript.",
+        "Some developers prefer to assign all their variables using <code>const</code> by default, unless they know they will need to reassign the value. Only in that case, they use <code>let</code>.",
+        "However, it is important to understand that objects (including arrays and functions) assigned to a variable using <code>const</code> are still mutable. Using the <code>const</code> declaration only prevents reassignment of the variable identifier.",
+        "<blockquote>\"use strict\";<br>const s = [5, 6, 7];<br>s = [1, 2, 3]; // throws error, trying to assign a const<br>s[2] = 45; // works just as it would with an array declared with var or let<br>console.log(s); // returns [5, 6, 45]</blockquote>",
+        "As you can see, you can mutate the object <code>[5, 6, 7]</code> itself and the variable <code>s</code> will still point to the altered array <code>[5, 6, 45]</code>. Like all arrays, the array elements in <code>s</code> are mutable, but because <code>const</code> was used, you cannot use the variable identifier <code>s</code> to point to a different array using the assignment operator.",
+        "<hr>",
+        "An array is declared as <code>const s = [5, 7, 2]</code>. Change the array to <code>[2, 5, 7]</code> using various element assignment.",
+        "<strong>Note</strong><br>Don't forget to add <code>\"use strict\";</code> to the top of your code."
+      ],
+      "challengeSeed": [
+        "const s = [5, 7, 2];",
+        "// change code below this line",
+        "",
+        "s = [2, 5, 7];",
+        "",
+        "// change code above this line",
+        "// Test your code",
+        "console.log(s);"
+      ],
+      "tests": [
+        "assert(code.match(/const/g), 'message: Do not replace <code>const</code> keyword.');",
+        "assert(code.match(/const\\s+s/g), 'message: <code>s</code> is declared with <code>const</code>.');",
+        "assert(code.match(/const\\s+s\\s*?=\\s*?\\[\\s*?2\\s*?,\\s*?5\\s*?,\\s*?7\\s*?\\]\\s*?;/g), 'message: Do not change the original array declaration.');",
+        "assert.deepEqual(s, [2, 5, 7], 'message: <code>s</code> should be equal to <code>[2, 5, 7]</code>.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b87367417b2b2512b43",
+      "title": "Use Arrow Functions to Write Concise Anonymous Functions",
+      "description": [
+        "In JavaScript, we often don't need to name our functions, especially when passing a function as an argument to another function. Instead, we create inline functions. We don't need to name these functions because we do not reuse them anywhere else.",
+        "To achieve this, we often use the following syntax:",
+        "<blockquote>const myFunc = function() {<br>  const myVar = \"value\";<br>  return myVar;<br>}</blockquote>",
+        "ES6 provides us with the syntactic sugar to not have to write anonymous functions this way. Instead, you can use <strong>arrow function syntax</strong>:",
+        "<blockquote>const myFunc = () => {<br>  const myVar = \"value\";<br>  return myVar;<br>}</blockquote>",
+        "When there is no function body, and only a return value, arrow function syntax allows you to omit the keyword <code>return</code> as well as the brackets surrounding the code. This helps simplify smaller functions into one-line statements:",
+        "<blockquote>const myFunc= () => \"value\"</blockquote>",
+        "This code will still return <code>value</code> by default.",
+        "<hr>",
+        "Rewrite the function assigned to the variable <code>magic</code> which returns a new <code>Date()</code> to use arrow function syntax. Also make sure nothing is defined using the keyword <code>var</code>.",
+        "Note",
+        "Don't forget to use strict mode."
+      ],
+      "challengeSeed": [
+        "// change code below this line",
+        "var magic = function() {",
+        "  return new Date();",
+        "}",
+        "// change code above this line",
+        "// test your code",
+        "console.log(magic());"
+      ],
+      "tests": [
+        "// Test user did replace var keyword",
+        "// Test magic is const",
+        "// Test magic is a function",
+        "// Test magic() returns the correct date",
+        "// Test function keyword was not used",
+        "// Test arrow => was used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b88367417b2b2512b44",
+      "title": "Write Arrow Functions with Parameters",
+      "description": [
+        "Just like a normal function, you can pass arguments into arrow functions.",
+        "<blockquote>// doubles input value and returns it<br>const doubler = (item) => item * 2;</blockquote>",
+        "You can pass more than one argument into arrow functions as well.",
+        "<hr>",
+        "Rewrite the <code>myConcat</code> function which appends contents of <code>arr2</code> to <code>arr1</code> so that the function uses arrow function syntax.",
+        "Note",
+        "Don't forget to use strict mode."
+      ],
+      "challengeSeed": [
+        "// change code below this line",
+        "var myConcat = function(arr1, arr2) {",
+        "  return arr1.concat(arr2);",
+        "}",
+        "// change code above this line",
+        "// test your code",
+        "console.log(myConcat([1, 2], [3, 4, 5]));"
+      ],
+      "tests": [
+        "// Test user did replace var keyword",
+        "// Test myConcat is const",
+        "assert(typeof myConcat === \"function\", 'message: <code>myConcat</code> should be a function');",
+        "// Test myConcat() returns the correct array",
+        "// Test function keyword was not used",
+        "// Test arrow => was used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b88367417b2b2512b45",
+      "title": "Write Higher Order Arrow Functions",
+      "description": [
+        "It's time we see how powerful arrow functions are when processing data.",
+        "Arrow functions work really well with higher order functions, such as <code>map()</code>, <code>filter()</code>, and <code>reduce()</code>, that take other functions as arguments for processing collections of data.",
+        "Read the following code:",
+        "<blockquote>FBPosts.filter(function(post) {<br>  return post.thumbnail !== null && post.shares > 100 && post.likes > 500;<br>})</blockquote>",
+        "We have written this with <code>filter()</code> to at least make it somewhat readable. Now compare it to the following code which uses arrow function syntax instead:",
+        "<blockquote>FBPosts.filter((post) => post.thumbnail !== null && post.shares > 100 && post.likes > 500)</blockquote>",
+        "This code is more succinct and accomplishes the same task with fewer lines of code.",
+        "<hr>",
+        "Use arrow function syntax to compute the square of only the positive integers (fractions are not integers) in the array <code>realNumberArray</code> and store the new array in the variable <code>squaredIntegers</code>.",
+        "Note",
+        "Don't forget to use strict mode."
+      ],
+      "challengeSeed": [
+        "const realNumberArray = [4, 5.6, -9.8, 3.14, 42, 6, 8.34];",
+        "// change code below this line",
+        "var squaredIntegers = realNumberArray;",
+        "// change code above this line",
+        "// test your code",
+        "console.log(squaredIntegers);"
+      ],
+      "tests": [
+        "// Test user did replace <code>var</code> keyword",
+        "// Test <code>squaredIntegers</code> is <code>const</code>",
+        "assert(Array.isArray(squaredIntegers), 'message: <code>squaredIntegers</code> should be an array');",
+        "assert(squaredIntegers[0] === 16 && squaredIntegers[1] === 1764 && squaredIntegers[2] === 36, 'message: <code>squaredIntegers</code> should be <code>[16, 1764, 36]</code>');",
+        "// Test <code>function</code> keyword was not used",
+        "// Test arrow <code>=></code> was used",
+        "assert(!code.match(/(for)|(while)/g), 'message: loop should not be used');",
+        "assert(code.match(/map/g) && code.match(/filter/g), 'message: <code>map</code> and <code>filter</code> should be used');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b88367417b2b2512b46",
+      "title": "Set Default Parameters for Your Functions",
+      "description": [
+        "In order to help us create more flexible functions, ES6 introduces <dfn>default parameters</dfn> for functions.",
+        "Check out this code:",
+        "<blockquote>function greeting(name = \"Anonymous\") {<br>  return \"Hello \" + name;<br>}<br>console.log(greeting(\"John\")); // Hello John<br>console.log(greeting()); // Hello Anonymous</blockquote>",
+        "The default parameter kicks in when the argument is not specified (it is undefined). As you can see in the example above, the parameter <code>name</code> will receive its default value <code>\"Anonymous\"</code> when you do not provide a value for the parameter. You can add default values for as many parameters as you want.",
+        "<hr>",
+        "Modify the function <code>increment</code> by adding default parameters so that it will add 1 to <code>number</code> if <code>value</code> is not specified.",
+        "<strong>Note</strong><br>Don't forget to use strict mode."
+      ],
+      "challengeSeed": [
+        "function increment(number, value) {",
+        "    return number + value;",
+        "}",
+        "console.log(increment(5, 2)); // returns 7",
+        "console.log(increment(5)); // returns NaN"
+      ],
+      "tests": [
+        "assert(increment(5, 2) === 7, \"The result of increment(5, 2) should be 7\");",
+        "assert(increment(5) === 6, \"The result of increment(5) should be 6\");",
+        "// Test default parameter was used for 'value'"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b88367417b2b2512b47",
+      "title": "Use the Rest Operator with Function Parameters",
+      "description": [
+        "In order to help us create more flexible functions, ES6 introduces the <dfn>rest operator</dfn> for function parameters. With the rest operator, you can create functions that take a variable number of arguments. These arguments are stored in an array that can be accessed later from inside the function.",
+        "Check out this code:",
+        "<blockquote>function howMany(...args) {<br>  return \"You have passed \" + args.length + \" arguments.\";<br>}<br>console.log(howMany(0, 1, 2)); // You have passed 3 arguments<br>console.log(howMany(\"string\", null, [1, 2, 3], { })); // You have passed 4 arguments.</blockquote>",
+        "The rest operator eliminates the need to check the <code>args</code> array and allows us to apply <code>map()</code>, <code>filter()</code> and <code>reduce()</code> on the parameters array.",
+        "<hr>",
+        "Modify the function <code>sum</code> so that is uses the rest operator and it works in the same way with any number of parameters.",
+        "<strong>Note</strong><br>Don't forget to use strict mode."
+      ],
+      "challengeSeed": [
+        "function sum(x, y, z) {",
+        "    const array = [ x, y, z ];",
+        "    return array.reduce((a, b) => a + b, 0);",
+        "}",
+        "console.log(sum(1, 2, 3)); // 6"
+      ],
+      "tests": [
+        "assert(sum(0,1,2) === 3, 'The result of sum(0,1,2) should be 3');",
+        "assert(sum(1,2,3,4) === 10, 'The result of sum(1,2,3,4) should be 10');",
+        "assert(sum(5) === 5, 'The result of sum(5) should be 5');",
+        "assert(sum() === 0, 'The result of sum() should be 0');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b89367417b2b2512b48",
+      "title": "Use the Spread Operator to Evaluate Arrays In-Place",
+      "description": [
+        "ES6 introduces the <dfn>spread operator</dfn>, which allows us to expand arrays and other expressions in places where multiple parameters or elements are expected.",
+        "The ES5 code below uses <code>apply()</code> to compute the maximum value in an array:",
+        "<blockquote>var arr = [6, 89, 3, 45];<br>var maximus = Math.max.apply(null, arr); // returns 89</blockquote>",
+        "We had to use <code>Math.max.apply(null, arr)</code> because <code>Math.max(arr)</code> returns <code>NaN</code>. <code>Math.max()</code> expects comma-separated arguments, but not an array.",
+        "The spread operator makes this syntax much better to read and maintain.",
+        "<blockquote>const arr = [6, 89, 3, 45];<br>const maximus = Math.max(...arr); // returns 89</blockquote>",
+        "<code>...arr</code> returns an unpacked array. In other words, it <em>spreads</em> the array.",
+        "However, the spread operator only works in-place, like in an argument to a function or in an array literal. The following code will not work:",
+        "<blockquote>const spreaded = ...arr; // will throw a syntax error</blockquote>",
+        "<hr>",
+        "Copy all contents of <code>arr1</code> into another array <code>arr2</code> using the spread operator."
+      ],
+      "challengeSeed": [
+        "const arr1 = ['JAN', 'FEB', 'MAR', 'APR', 'MAY'];",
+        "const arr2 = []; // change this line",
+        "arr1.push('JUN');",
+        "console.log(arr2); // arr2 should not be affected"
+      ],
+      "tests": [
+        "// Test arr2 is correct copy of arr1",
+        "// Test arr1 has changed",
+        "// Test spread operator was used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b89367417b2b2512b49",
+      "title": "Use Destructuring Assignment to Assign Variables from Objects",
+      "description": [
+        "We earlier saw how spread operator can effectively spread, or unpack, the contents of the array.",
+        "We can do something similar with objects as well. <dfn>Destructuring assignment</dfn> is special syntax for neatly assigning values taken directly from an object to variables.",
+        "Consider the following ES5 code:",
+        "<blockquote>var voxel = {x: 3.6, y: 7.4, z: 6.54 };<br>var x = voxel.x; // x = 3.6<br>var y = voxel.y; // y = 7.4<br>var z = voxel.z; // z = 6.54</blockquote>",
+        "Here's the same assignment statement with ES6 destructuring syntax:",
+        "<blockquote>const { x, y, z } = voxel; // x = 3.6, y = 7.4, z = 6.54</blockquote>",
+        "If instead you want to store the values of <code>voxel.x</code> into <code>a</code>, <code>voxel.y</code> into <code>b</code>, and <code>voxel.z</code> into <code>c</code>, you have that freedom as well.",
+        "<blockquote>const { x : a, y : b, z : c } = voxel // a = 3.6, b = 7.4, c = 6.54</blockquote>",
+        "You may read it as \"get the field <code>x</code> and copy the value into <code>a</code>,\" and so on.",
+        "<hr>",
+        "Use destructuring to obtain the length of the string <code>greeting</code>"
+      ],
+      "challengeSeed": [
+        "const greeting = 'itadakimasu';",
+        "// change code below this line",
+        "const length = 0; // change this",
+        "// change code above this line",
+        "console.log(length); // should be using destructuring"
+      ],
+      "tests": [
+        "// Test len is 11",
+        "// Test destructuring was used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b89367417b2b2512b4a",
+      "title": "Use Destructuring Assignment to Assign Variables from Nested Objects",
+      "description": [
+        "We can similarly destructure <em>nested</em> objects into variables.",
+        "Consider the following code:",
+        "<blockquote>const a = {<br>  start: { x: 5, y: 6},<br>  end: { x: 6, y: -9 }<br>};<br>const { start : { x: startX, y: startY }} = a;<br>console.log(startX, startY); // 5, 6</blockquote>",
+        "In the example above, the variable <code>start</code> is assigned the value of <code>a.start</code>, which is also an object.",
+        "<hr>",
+        "Use destructuring assignment to obtain <code>max</code> of <code>forecast.tomorrow</code> and assign it to <code>maxOfTomorrow</code>."
+      ],
+      "challengeSeed": [
+        "const forecast = {",
+        "  today: { min: 72, max: 83 },",
+        "  tomorrow: { min: 73.3, max: 84.6 }",
+        "};",
+        "// change code below this line",
+        "const maxOfTomorrow = undefined; // change this line",
+        "// change code above this line",
+        "console.log(maxOfTomorrow); // should be 84.6"
+      ],
+      "tests": [
+        "// Test maxOfTomorrow to be 84.6",
+        "// Test destructuring was used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b89367417b2b2512b4b",
+      "title": "Use Destructuring Assignment to Assign Variables from Arrays",
+      "description": [
+        "ES6 makes destructuring arrays as easy as destructuring objects.",
+        "One key difference between the spread operator and array destructuring is that the spread operator unpacks all contents of an array into a comma-separated list. Consequently, you cannot pick or choose which elements you want to assign to variables.",
+        "Destructuring an array lets us do exactly that:",
+        "<blockquote>const [a, b] = [1, 2, 3, 4, 5, 6];<br>console.log(a, b); // 1, 2</blockquote>",
+        "The variable <code>a</code> is assigned the first value of the array, and <code>b</code> is assigned the second value of the array.",
+        "We can also access the value at any index in an array with destructuring by using commas to reach the desired index:",
+        "<blockquote>const [a, b,,, c] = [1, 2, 3, 4, 5, 6];<br>console.log(a, b, c); // 1, 2, 5 </blockquote>",
+        "<hr>",
+        "Use destructuring assignment to swap the values of <code>a</code> and <code>b</code> so that <code>a</code> receives the value stored in <code>b</code>, and <code>b</code> receives the value stored in <code>a</code>."
+      ],
+      "challengeSeed": [
+        "let a = 8, b = 6;",
+        "// change code below this line",
+        "",
+        "// change code above this line",
+        "console.log(a); // should be 6",
+        "console.log(b); // should be 8"
+      ],
+      "tests": [
+        "assert(a === 6, 'message: Value of <code>a</code> should be 6, after swapping.');",
+        "assert(b === 8, 'message: Value of <code>b</code> should be 8, after swapping.');",
+        "// assert(/\\[\\s*(\\w)\\s*,\\s*(\\w)\\s*\\]\\s*=\\s*\\[\\s*\\2\\s*,\\s*\\1\\s*\\]/g.test(code), 'message: Use array destructuring to swap a and b.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8a367417b2b2512b4c",
+      "title": "Use Destructuring Assignment with the Rest Operator to Reassign Array Elements",
+      "description": [
+        "In some situations involving array destructuring, we might want to collect the rest of the elements into a separate array.",
+        "The result is similar to <code>Array.prototype.slice()</code>, as shown below:",
+        "<blockquote>const [a, b, ...arr] = [1, 2, 3, 4, 5, 7];<br>console.log(a, b); // 1, 2<br>console.log(arr); // [3, 4, 5, 7]</blockquote>",
+        "Variables <code>a</code> and <code>b</code> take the first and second values from the array. After that, because of rest operator's presence, <code>arr</code> gets rest of the values in the form of an array.",
+        "The rest element only works correctly as the last variable in the list. As in, you cannot use the rest operator to catch a subarray that leaves out last element of the original array.",
+        "<hr>",
+        "Use destructuring assignment with the rest operator to perform an effective <code>Array.prototype.slice()</code> so that <code>arr</code> is a sub-array of the original array <code>source</code> with the first two elements ommitted."
+      ],
+      "challengeSeed": [
+        "const source = [1,2,3,4,5,6,7,8,9,10];",
+        "// change code below this line",
+        "const arr = source; // change this",
+        "// change code below this line",
+        "console.log(arr); // should be [3,4,5,6,7,8,9,10]",
+        "console.log(source); // should be [1,2,3,4,5,6,7,8,9,10];"
+      ],
+      "tests": [
+        "// Test arr is [3,4,5,6,7,8,9,10];",
+        "// Test source is [1,2,3,4,5,6,7,8,9,10];",
+        "// Test destructuring was used",
+        "// Test slice was not used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8a367417b2b2512b4d",
+      "title": "Use Destructuring Assignment to Pass an Object as a Function's Parameters",
+      "description": [
+        "In some cases, you can destructure the object in a function argument itself.",
+        "Consider the code below:",
+        "<blockquote>const profileUpdate = (profileData) => {<br>  const { name, age, nationality, location } = profileData;<br>  // do something with these variables<br>}</blockquote>",
+        "This effectively destructures the object sent into the function. This can also be done in-place:",
+        "<blockquote>const profileUpdate = ({ name, age, nationality, location }) => {<br>  /* do something with these fields */<br>}</blockquote>",
+        "This removes some extra lines and makes our code look neat.",
+        "This has the added benefit of not having to manipulate an entire object in a function; only the fields that are needed are copied inside the function.",
+        "<hr>",
+        "Use destructuring assignment within the argument to the function <code>half</code> to send only <code>max</code> and <code>min</code> inside the function."
+      ],
+      "challengeSeed": [
+        "const stats = {",
+        "  max: 56.78,",
+        "  standard_deviation: 4.34,",
+        "  median: 34.54,",
+        "  mode: 23.87,",
+        "  min: -0.75,",
+        "  average: 35.85",
+        "};",
+        "// change code below this line",
+        "const half = (stats) => ((stats.max + stats.min) / 2.0); // use function argument destructurung",
+        "// change code above this line",
+        "console.log(stats); // should be object",
+        "console.log(half(stats)); // should be 28.015"
+      ],
+      "tests": [
+        "// Test stats is an object",
+        "// Test half is 28.015",
+        "// Test destructuring was used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8a367417b2b2512b4e",
+      "title": "Create Strings using Template Literals",
+      "description": [
+        "A new feature of ES6 is the <dfn>template literal</dfn>. This is a special type of string that allows you to use string interpolation features to create strings.",
+        "Consider the code below:",
+        "<blockquote>const person = {<br>  name: \"Zodiac Hasbro\",<br>  age: 56<br>};<br><br>// string interpolation<br>const greeting = `Hello, my name is ${person.name}!<br>I am ${person.age} years old.`;<br><br>console.log(greeting); // prints<br>// Hello, my name is Zodiac Hasbro!<br>// I am 56 years old.<br></blockquote>",
+        "A lot of things happened there.",
+        "Firstly, the <code>${variable}</code> syntax used above is a place holder. Basically, you won't have to use concatenation with the <code>+</code> operator anymore. To add variables to strings, you just drop the variable in a template string and wrap it with <code>${</code> and <code>}</code>.",
+        "Secondly, the example uses backticks (<code>`</code>), not quotes (<code>'</code> or <code>\"</code>), to wrap the string. Notice that the string is multi-line.",
+        "This new way of creating strings gives you more flexibility to create robust strings.",
+        "<hr>",
+        "Use template literal syntax with backticks to display each entry of the <code>result</code> object's <code>failure</code> array. Each entry should be wrapped inside an <code>li</code> element with the class attribute <code>text-warning</code>."
+      ],
+      "challengeSeed": [
+        "const result = {",
+        "  success: [\"max-length\", \"no-amd\", \"prefer-arrow-functions\"],",
+        "  failure: [\"no-var\", \"var-on-top\", \"linebreak\"],",
+        "  skipped: [\"id-blacklist\", \"no-dup-keys\"]",
+        "};",
+        "// change code below this line",
+        "const resultDisplay = null;",
+        "// change code above this line",
+        "console.log(resultDisplay);",
+        "/**",
+        " * should look like this",
+        " * <li class=\"text-warning\">no-var</li>",
+        " * <li class=\"text-warning\">var-on-top</li>",
+        " * <li class=\"text-warning\">linebreak</li>",
+        " **/"
+      ],
+      "tests": [
+        "// Test resultDisplay is a string",
+        "// Test resultDisplay is the desired output",
+        "// Test template strings were used"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8a367417b2b2512b4f",
+      "title": "Write Concise Object Literal Declarations Using Simple Fields",
+      "description": [
+        "ES6 adds some nice support for easily definining object literals.",
+        "Consider the following code:",
+        "<blockquote>const getMousePosition = (x, y) => ({<br>  x: x,<br>  y: y<br>});</blockquote>",
+        "<code>getMousePosition</code> is a simple function that returns an object containing two fields.",
+        "ES6 provides the syntactic sugar to eliminate the redundancy of having to write <code>x: x</code>. You can simply write <code>x</code> once, and it will be converted to<code>x: x</code> (or something equivalent) under the hood.",
+        "Here is the same function from above rewritten to use this new syntax:",
+        "<blockquote>const getMousePosition = (x, y) => ({ x, y });</blockquote>",
+        "<hr>",
+        "Use simple fields with object literals to create and return a <code>Person</code> object."
+      ],
+      "challengeSeed": [
+        "// change code below this line",
+        "const createPerson = (name, age, gender) => {",
+        "  return {",
+        "    name: name,",
+        "    age: age,",
+        "    gender: gender",
+        "  };",
+        "};",
+        "// change code above this line",
+        "console.log(createPerson(\"Zodiac Hasbro\", 56, \"male\")); // returns a proper object"
+      ],
+      "tests": [
+        "// Test the output is {name: \"Zodiac Hasbro\", age: 56, gender: \"male\"}",
+        "// Test no : was present"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8b367417b2b2512b50",
+      "title": "Write Concise Declarative Functions with ES6",
+      "description": [
+        "When defining functions within objects in ES5, we have to use the keyword <code>function</code> as follows:",
+        "<blockquote>const person = {<br>  name: \"Taylor\",<br>  sayHello: function() {<br>    return `Hello! My name is ${this.name}.`;<br>  }<br>};</blockquote>",
+        "With ES6, You can remove the <code>function</code> keyword and colon altogether when defining functions in objects. Here's an example of this syntax:",
+        "<blockquote>const person = {<br>  name: \"Taylor\",<br>  sayHello() {<br>    return `Hello! My name is ${this.name}.`;<br>  }<br>};</blockquote>",
+        "<hr>",
+        "Refactor the function <code>setGear</code> inside the object <code>bicycle</code> to use the shorthand syntax described above."
+      ],
+      "challengeSeed": [
+        "// change code below this line",
+        "const bicycle = {",
+        "  gear: 2,",
+        "  setGear: function(newGear) {",
+        "    this.gear = newGear;",
+        "  }",
+        "};",
+        "// change code above this line",
+        "bicycle.setGear(3);",
+        "console.log(bicycle.gear);"
+      ],
+      "tests": [
+        "// Test the output is Sending request to Yanoshi Mimoto",
+        "// Test no : was present"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8b367417b2b2512b53",
+      "title": "Use class Syntax to Define a Constructor Function",
+      "description": [
+        "ES6 provides a new syntax to help create objects, using the keyword <dfn>class</dfn>.",
+        "This is to be noted, that the <code>class</code> syntax is just a syntax, and not a full-fledged class based implementation of object oriented paradigm, unlike in languages like Java, or Python, or Ruby etc.",
+        "In ES5, we usually define a constructor function, and use the <code>new</code> keyword to instantiate an object.",
+        "<blockquote>var SpaceShuttle = function(targetPlanet){<br>  this.targetPlanet = targetPlanet;<br>}<br>var zeus = new spaceShuttle('Jupiter');</blockquote>",
+        "The class syntax simply replaces the constructor function creation:",
+        "<blockquote>class SpaceShuttle {<br>  constructor(targetPlanet){<br>    this.targetPlanet = targetPlanet;<br>  }<br>}<br>const zeus = new spaceShuttle('Jupiter');</blockquote>",
+        "Notice that the <code>class</code> keyword declares a new function, and a constructor was added, which would be invoked when <code>new</code> is called - to create a new object.",
+        "<hr>",
+        "Use <code>class</code> keyword and write a proper constructor to create the <code>Vegetable</code> class.",
+        "The <code>Vegetable</code> lets you create a vegetable object, with a property <code>name</code>, to be passed to constructor."
+      ],
+      "challengeSeed": [
+        "/* Alter code below this line */",
+        "const Vegetable = undefined;",
+        "/* Alter code above this line */",
+        "const carrot = new Vegetable('carrot');",
+        "console.log(carrot.name); // => should be 'carrot'"
+      ],
+      "tests": [
+        "// Test the Vegetable is a class",
+        "// Test that class keyword was used",
+        "// Test that other objects could be created with the class"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8c367417b2b2512b54",
+      "title": "Use getters and setters to Control Access to an Object",
+      "description": [
+        "You can obtain values from an object, and set a value of a property within an object.",
+        "These are classically called <dfn>getters</dfn> and <dfn>setters</dfn>.",
+        "Getter functions are meant to simply return (get) the value of an object's private variable to the user without the user directly accessing the private variable.",
+        "Setter functions are meant to modify (set) the value of an object's private variable based on the value passed into the setter function. This change could involve calculations, or even overwriting the previous value completely.",
+        "<blockquote>class Book {<br>  constructor(author) {<br>    this._author = author;<br>  }<br>  // getter<br>  get writer(){<br>    return this._author;<br>  }<br>  // setter<br>  set writer(updatedAuthor){<br>    this._author = updatedAuthor;<br>  }<br>}<br>const lol = new Book('anonymous');<br>console.log(lol.writer);<br>lol.writer = 'wut';<br>console.log(lol.writer);</blockquote>",
+        "Notice the syntax we are using to invoke the getter and setter - as if they are not even functions.",
+        "Getters and setters are important, because they hide internal implementation details.",
+        "<hr>",
+        "Use <code>class</code> keyword to create a Thermostat class. The constructor accepts Farenheit temperature.",
+        "Now create <code>getter</code> and <code>setter</code> in the class, to obtain the temperature in Celsius scale.",
+        "Remember that <code>F = C * 9.0 / 5 + 32</code>, where F is the value of temperature in Fahrenheit scale, and C is the value of the same temperature in Celsius scale",
+        "Note",
+        "When you implement this, you would be tracking the temperature inside the class in one scale - either Fahrenheit or Celsius.",
+        "This is the power of getter or setter - you are creating an API for another user, who would get the correct result, no matter which one you track.",
+        "In other words, you are abstracting implementation details from the consumer."
+      ],
+      "challengeSeed": [
+        "/* Alter code below this line */",
+        "const Thermostat = undefined;",
+        "/* Alter code above this line */",
+        "const thermos = new Thermostat(76); // setting in Farenheit scale",
+        "let temp = thermos.temperature; // 24.44 in C",
+        "thermos.temperature = 26;",
+        "temp = thermos.temperature; // 26 in C"
+      ],
+      "tests": [
+        "// Test the Thermostat is a class",
+        "// Test that class keyword was used",
+        "// Test that other objects could be created with the class"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8c367417b2b2512b55",
+      "title": "Understand the Differences Between import and require",
+      "description": [
+        "In the past, the function <code>require()</code> would be used to import the functions and code in external files and modules. While handy, this presents a problem: some files and modules are rather large, and you may only need certain code from those external resources.",
+        "ES6 gives us a very handy tool known as <dfn>import</dfn>. With it, we can choose which parts of a module or file to load into a given file, saving time and memory.",
+        "Consider the following example. Imagine that <code>math_array_functions</code> has about 20 functions, but I only need one, <code>countItems</code>, in my current file. The old <code>require()</code> approach would force me to bring in all 20 functions. With this new <code>import</code> syntax, I can bring in just the desired function, like so:",
+        "<blockquote>import { countItems } from \"math_array_functions\"</blockquote>",
+        "A description of the above code:",
+        "<blockquote>import { function } from \"file_path_goes_here\"<br>// We can also import variables the same way!</blockquote>",
+        "There are a few ways to write an <code>import</code> statement, but the above is a very common use-case.",
+        "<strong>Note</strong><br>the whitespace surrounding the function inside the curly braces is a best practice - it makes it easier to read the <code>import</code> statement.",
+        "<strong>Note</strong><br>The lessons in this section handle non-browser features. <code>import</code>, and the statements we introduce in the rest of these lessons, won't work on a browser directly, However, we can use various tools to create code out of this to make it work in browser.",
+        "<hr>",
+        "Add the appropriate <code>import</code> statement that will allow the current file to use the <code>capitalizeString</code> function. The file where this function lives is called <code>\"string_functions\"</code>, and it is in the same directory as the current file."
+      ],
+      "challengeSeed": [
+        "capitalizeString(\"hello!\");"
+      ],
+      "tests": [
+        "assert(code.match(/import\\s+\\{\\s?capitalizeString\\s?\\}\\s+from\\s+\"string_functions\"/ig)"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8c367417b2b2512b56",
+      "title": "Use export to Reuse a Code Block",
+      "description": [
+        "In the previous challenge, you learned about <code>import</code> and how it can be leveraged to import small amounts of code from large files. In order for this to work, though, we must utilize one of the statements that goes with <code>import</code>, known as <dfn>export</dfn>. When we want some code - a function, or a variable - to be usable in another file, we must export it in order to import it into another file. Like <code>import</code>, <code>export</code> is a non-browser feature.",
+        "The following is what we refer to as a <dfn>named export</dfn>. With this, we can import any code we export into another file with the <code>import</code> syntax you learned in the last lesson. Here's an example:",
+        "<blockquote>const capitalizeString = (string) => {<br>  return string.charAt(0).toUpperCase() + string.slice(1);<br>}<br>export { capitalizeString } //How to export functions.<br>export const foo = \"bar\"; //How to export variables.</blockquote>",
+        "Alternatively, if you would like to compact all your <code>export</code> statements into one line, you can take this approach:",
+        "<blockquote>const capitalizeString = (string) => {<br>  return string.charAt(0).toUpperCase() + string.slice(1);<br>}<br>const foo = \"bar\";<br>export { capitalizeString, foo }</blockquote>",
+        "Either approach is perfectly acceptable.",
+        "<hr>",
+        "Below are two variables that I want to make available for other files to use. Utilizing the first way I demonstrated <code>export</code>, export the two variables."
+      ],
+      "challengeSeed": [
+        "const foo = \"bar\";",
+        "const boo = \"far\";"
+      ],
+      "tests": [
+        "assert(code.match(/export\\s+const\\s+foo\\s+=+\\s\"bar\"/ig))",
+        "assert(code.match(/export\\s+const\\s+boo\\s+=+\\s\"far\"/ig))"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8c367417b2b2512b57",
+      "title": "Use * to Import Everything from a File",
+      "description": [
+        "Suppose you have a file that you wish to import all of its contents into the current file. This can be done with the <dfn>import *</dfn> syntax.",
+        "Here's an example where the contents of a file named <code>\"math_functions\"</code> are imported into a file in the same directory:",
+        "<blockquote>import * as myMathModule from \"math_functions\"<br>myMathModule.add(2,3);<br>myMathModule.subtract(5,3);</blockquote>",
+        "And breaking down that code:",
+        "<blockquote>import * as object_with_name_of_your_choice from \"file_path_goes_here\"<br>object_with_name_of_your_choice.imported_function</blockquote>",
+        "You may use any name following the <code>import *</code> as portion of the statement. In order to utilize this method, it requires an object that receives the imported values. From here, you will use the dot notation to call your imported values.",
+        "<hr>",
+        "The code below requires the contents of a file, <code>\"capitalize_strings\"</code>, found in the same directory as it, imported. Add the appropriate <code>import *</code> statement to the top of the file, using the object provided."
+      ],
+      "challengeSeed": [
+        "myStringModule.capitalize(\"foo\");",
+        "myStringModule.lowercase(\"Foo\");"
+      ],
+      "tests": [
+        "assert(code.match(/import\\s+\\*\\s+as\\s+myStringModule\\s+from\\s+\"capitalize_strings\"/ig))"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8c367417b2b2512b58",
+      "title": "Create an Export Fallback with export default",
+      "description": [
+        "In the <code>export</code> lesson, you learned about the syntax referred to as a <dfn>named export</dfn>. This allowed you to make multiple functions and variables available for use in other files.",
+        "There is another <code>export</code> syntax you need to know, known as <dfn>export default</dfn>. Usually you will use this syntax if only one value is being exported from a file. It is also used to create a fallback value for a file or module.",
+        "Here is a quick example of <code>export default</code>:",
+        "<blockquote>export default const add = (x,y) => {<br>  return x + y;<br>}</blockquote>",
+        "There is a one major feature of <code>export default</code> you must never forget - since it is used to declare a fallback value for a module or file, you can only have one value be a default export in each module or file.",
+        "<hr>",
+        "The following function should be the fallback value for the module. Please add the necessary code to do so."
+      ],
+      "challengeSeed": [
+        "const subtract = (x,y) => {return x - y;}"
+      ],
+      "tests": [
+        "assert(code.match(/export\\s+default\\s+const\\s+subtract\\s+=\\s+\\(x,y\\)\\s+=>\\s+{return\\s+x\\s-\\s+y;}/ig))"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8d367417b2b2512b59",
+      "title": "Import a Default Export",
+      "description": [
+        "In the last challenge, you learned about <code>export default</code> and its uses. It is important to note that, to import a default export, you need to use a different <code>import</code> syntax.",
+        "In the following example, we have a function, <code>add</code>, that is the default export of a file, <code>\"math_functions\"</code>. Here is how to import it:",
+        "<blockquote>import add from \"math_functions\";<br>add(5,4); //Will return 9</blockquote>",
+        "The syntax differs in one key place - the imported value, <code>add</code>, is not surrounded by curly braces, <code>{}</code>. Unlike exported values, the primary method of importing a default export is to simply write the value's name after <code>import</code>.",
+        "<hr>",
+        "In the following code, please import the default export, <code>subtract</code>, from the file <code>\"math_functions\"</code>, found in the same directory as this file."
+      ],
+      "challengeSeed": [
+        "subtract(7,4);"
+      ],
+      "tests": [
+        "assert(code.match(/import\\s+subtract\\s+from\\s+\"math_functions\"/ig))"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/functional-programming.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/functional-programming.json
new file mode 100644
index 0000000000..bf2b173c47
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/functional-programming.json
@@ -0,0 +1,1288 @@
+{
+  "name": "Functional Programming",
+  "order": 7,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7b8d367417b2b2512b5a",
+        "title": "Introduction to the Functional Programming Challenges",
+        "description": [
+          [
+            "http://imgs.xkcd.com/comics/functional.png",
+            "XKCD web comic with one person asking why the other likes functional programming so much, and the second responding that tail recursion is its own reward.",
+            "Functional programming is an approach to software development based around the evaluation of functions. Like mathematics, functions in programming map input to output to produce a result. You can combine basic functions in many ways to build more and more complex programs.<br><br>Functional programming follows a few core principles:<br><br><ul><li>Functions are independent from the state of the program or global variables. They only depend on the arguments passed into them to make a calculation</li><br><li>Functions try to limit any changes to the state of the program and avoid changes to the global objects holding data</li><br><li>Functions have minimal side effects in the program</li></ul><br><br>The functional programming software development approach breaks a program into small, testable parts. This section covers basic functional programming principles in JavaScript.",
+            ""
+          ]        ],
+        "releasedOn": "",
+        "challengeSeed": [],
+        "tests": [],
+        "type": "Waypoint",
+        "challengeType": 7,
+        "isRequired": false,
+        "titleEs": "",
+        "descriptionEs": [
+          []
+        ],
+        "titleFr": "",
+        "descriptionFr": [
+          []
+        ],
+        "titleDe": "",
+        "descriptionDe": [
+          []
+        ]
+    },
+    {
+      "id": "587d7b8d367417b2b2512b5b",
+      "title": "Learn About Functional Programming",
+      "description": [
+        "Functional programming is a style of programming where solutions are simple, isolated functions, without any side effects outside of the function scope.",
+        "<code>INPUT -> PROCESS -> OUTPUT</code>",
+        "Functional programming is about:",
+        "1) Isolated functions - there is no dependence on the state of the program, which includes global variables that are subject to change",
+        "2) Pure functions - the same input always gives the same output",
+        "3) Functions with limited side effects - any changes, or mutations, to the state of the program outside the function are carefully controlled",
+        "<hr>",
+        "The members of freeCodeCamp happen to love tea.",
+        "In the code editor, the <code>prepareTea</code> and <code>getTea</code> functions are already defined for you. Call the <code>getTea</code> function to get 40 cups of tea for the team, and store them in the <code>tea4TeamFCC</code> variable."
+      ],
+      "challengeSeed": [
+        "/**",
+        " * A long process to prepare tea.",
+        " * @return {string} A cup of tea.",
+        " **/",
+        "const prepareTea = () => 'greenTea';",
+        "",
+        "/**",
+        " * Get given number of cups of tea.",
+        " * @param {number} numOfCups Number of required cups of tea.",
+        " * @return {Array<string>} Given amount of tea cups.",
+        " **/",
+        "const getTea = (numOfCups) => {",
+        "  const teaCups = [];",
+        "  ",
+        "  for(let cups = 1; cups <= numOfCups; cups += 1) {",
+        "    const teaCup = prepareTea();",
+        "    teaCups.push(teaCup);",
+        "  }",
+        "",
+        "  return teaCups;",
+        "};",
+        "",
+        "// Add your code below this line",
+        "",
+        "const tea4TeamFCC = null; // :(",
+        "",
+        "// Add your code above this line",
+        "",
+        "console.log(tea4TeamFCC);"
+      ],
+      "tests": [
+        "assert(tea4TeamFCC.length === 40, 'message: The <code>tea4TeamFCC</code> variable should hold 40 cups of tea for the team.');",
+        "assert(tea4TeamFCC[0] === 'greenTea', 'message: The <code>tea4TeamFCC</code> variable should hold cups of green tea.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8e367417b2b2512b5c",
+      "title": "Understand Functional Programming Terminology",
+      "description": [
+        "The FCC Team had a mood swing and now wants two types of tea: green tea and black tea. General Fact: Client mood swings are pretty common.",
+        "With that information, we'll need to revisit the <code>getTea</code> function from last challenge to handle various tea requests. We can modify <code>getTea</code> to accept a function as a parameter to be able to change the type of tea it prepares. This makes <code>getTea</code> more flexible, and gives the programmer more control when client requests change.",
+        "But first, let's cover some functional terminology:",
+        "<code>Callbacks</code> are the functions that are slipped or passed into another function to decide the invocation of that function. You may have seen them passed to other methods, for example in <code>filter</code>, the callback function tells JavaScript the criteria for how to filter an array.",
+        "Functions that can be assigned to a variable, passed into another function, or returned from another function just like any other normal value, are called <code>first class</code> functions. In JavaScript, all functions are <code>first class</code> functions.",
+        "The functions that take a function as an argument, or return a function as a return value are called <code>higher order</code> functions.",
+        "When the functions are passed in to another function or returned from another function, then those functions which gets passed in or returned can be called a <code>lambda</code>.",
+        "<hr>",
+        "Prepare 27 cups of green tea and 13 cups of black tea and store them in <code>tea4GreenTeamFCC</code> and <code>tea4BlackTeamFCC</code> variables, respectively. Note that the <code>getTea</code> function has been modified so it now takes a function as the first argument.",
+        "Note: The data (the number of cups of tea) is supplied as the last argument. We'll discuss this more in later lessons."
+      ],
+      "challengeSeed": [
+        "/**",
+        " * A long process to prepare green tea.",
+        " * @return {string} A cup of green tea.",
+        " **/",
+        "const prepareGreenTea = () => 'greenTea';",
+        "",
+        "/**",
+        " * A long process to prepare black tea.",
+        " * @return {string} A cup of black tea.",
+        " **/",
+        "const prepareBlackTea = () => 'blackTea';",
+        "",
+        "/**",
+        " * Get given number of cups of tea.",
+        " * @param {function():string} prepareTea The type of tea preparing function.",
+        " * @param {number} numOfCups Number of required cups of tea.",
+        " * @return {Array<string>} Given amount of tea cups.",
+        " **/",
+        "const getTea = (prepareTea, numOfCups) => {",
+        "  const teaCups = [];",
+        "",
+        "  for(let cups = 1; cups <= numOfCups; cups += 1) {",
+        "    const teaCup = prepareTea();",
+        "    teaCups.push(teaCup);",
+        "  }",
+        "",
+        "  return teaCups;",
+        "};",
+        "",
+        "// Add your code below this line",
+        "",
+        "const tea4GreenTeamFCC = null; // :(",
+        "const tea4BlackTeamFCC = null; // :(",
+        "",
+        "// Add your code above this line",
+        "",
+        "console.log(",
+        "  tea4GreenTeamFCC,",
+        "  tea4BlackTeamFCC",
+        ");"
+      ],
+      "tests": [
+        "assert(tea4GreenTeamFCC.length === 27, 'message: The <code>tea4GreenTeamFCC</code> variable should hold 27 cups of green tea for the team.');",
+        "assert(tea4GreenTeamFCC[0] === 'greenTea', 'message: The <code>tea4GreenTeamFCC</code> variable should hold cups of green tea.');",
+        "assert(tea4BlackTeamFCC.length === 13, 'message: The <code>tea4BlackTeamFCC</code> variable should hold 13 cups of black tea.');",
+        "assert(tea4BlackTeamFCC[0] === 'blackTea', 'message: The <code>tea4BlackTeamFCC</code> variable should hold cups of black tea.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8e367417b2b2512b5d",
+      "title": "Understand the Hazards of Using Imperative Code",
+      "description": [
+        "Functional programming is a good habit. It keeps your code easy to manage, and saves you from sneaky bugs. But before we get there, let's look at an imperative approach to programming to highlight where you may have issues.",
+        "In English (and many other languages), the imperative tense is used to give commands. Similarly, an imperative style in programming is one that gives the computer a set of statements to perform a task.",
+        "Often the statements change the state of the program, like updating global variables. A classic example is writing a <code>for</code> loop that gives exact directions to iterate over the indices of an array.",
+        "In contrast, functional programming is a form of declarative programming. You tell the computer what you want done by calling a method or function.",
+        "JavaScript offers many predefined methods that handle common tasks so you don't need to write out how the computer should perform them. For example, instead of using the <code>for</code> loop mentioned above, you could call the <code>map</code> method which handles the details of iterating over an array. This helps to avoid semantic errors, like the \"Off By One Errors\" that were covered in the Debugging section.",
+        "Consider the scenario: you are browsing the web in your browser, and want to track the tabs you have opened. Let's try to model this using some simple object-oriented code.",
+        "A Window object is made up of tabs, and you usually have more than one Window open. The titles of each open site in each Window object is held in an array. After working in the browser (opening new tabs, merging windows, and closing tabs), you want to print the tabs that are still open. Closed tabs are removed from the array and new tabs (for simplicity) get added to the end of it.",
+        "The code editor shows an implementation of this functionality with functions for <code>tabOpen()</code>, <code>tabClose()</code>, and <code>join()</code>. The array <code>tabs</code> is part of the Window object that stores the name of the open pages.",
+        "<h4>Instructions<h4>",
+        "Run the code in the editor. It's using a method that has side effects in the program, causing incorrect output. The final list of open tabs should be <code>['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium', 'Netflix', 'YouTube', 'Vine', 'GMail', 'Work mail', 'Docs', 'freeCodeCamp', 'new tab']</code> but the output will be slightly different.",
+        "Work through the code and see if you can figure out the problem, then advance to the next challenge to learn more."
+      ],
+      "challengeSeed": [
+        "// tabs is an array of titles of each site open within the window",
+        "var Window = function(tabs) {",
+        "  this.tabs = tabs; // we keep a record of the array inside the object",
+        "};",
+        "",
+        "// When you join two windows into one window",
+        "Window.prototype.join = function (otherWindow) {",
+        "  this.tabs = this.tabs.concat(otherWindow.tabs);",
+        "  return this;",
+        "};",
+        "",
+        "// When you open a new tab at the end",
+        "Window.prototype.tabOpen = function (tab) {",
+        "  this.tabs.push('new tab'); // let's open a new tab for now",
+        "  return this;",
+        "};",
+        "",
+        "// When you close a tab",
+        "Window.prototype.tabClose = function (index) {",
+        "  var tabsBeforeIndex = this.tabs.splice(0, index); // get the tabs before the tab",
+        "  var tabsAfterIndex = this.tabs.splice(index); // get the tabs after the tab",
+        "",
+        "  this.tabs = tabsBeforeIndex.concat(tabsAfterIndex); // join them together ",
+        "  return this;",
+        " };",
+        "",
+        "// Let's create three browser windows",
+        "var workWindow = new Window(['GMail', 'Inbox', 'Work mail', 'Docs', 'freeCodeCamp']); // Your mailbox, drive, and other work sites",
+        "var socialWindow = new Window(['FB', 'Gitter', 'Reddit', 'Twitter', 'Medium']); // Social sites",
+        "var videoWindow = new Window(['Netflix', 'YouTube', 'Vimeo', 'Vine']); //  Entertainment sites",
+        "",
+        "// Now perform the tab opening, closing, and other operations",
+        "var finalTabs = socialWindow",
+        "                    .tabOpen() // Open a new tab for cat memes",
+        "                    .join(videoWindow.tabClose(2)) // Close third tab in video window, and join",
+        "                    .join(workWindow.tabClose(1).tabOpen());",
+        "",
+        "alert(finalTabs.tabs);"
+      ],
+      "tests": [
+        "assert(true, 'message: Move ahead to understand the error.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8e367417b2b2512b5e",
+      "title": "Avoid Mutations and Side Effects Using Functional Programming",
+      "description": [
+        "If you haven't already figured it out, the issue in the previous challenge was with the <code>splice</code> call in the <code>tabClose()</code> function. Unfortunately, <code>splice</code> changes the original array it is called on, so the second call to it used a modified array, and gave unexpected results.",
+        "This is a small example of a much larger pattern - you call a function on a variable, array, or an object, and the function changes the variable or something in the object.",
+        "One of the core principle of functional programming is to not change things. Changes lead to bugs. It's easier to prevent bugs knowing that your functions don't change anything, including the function arguments or any global variable.",
+        "The previous example didn't have any complicated operations but the <code>splice</code> method changed the original array, and resulted in a bug.",
+        "Recall that in functional programming, changing or altering things is called <code>mutation</code>, and the outcome is called a <code>side effect</code>. A function, ideally, should be a <code>pure function</code>, meaning that it does not cause any side effects.",
+        "Let's try to master this discipline and not alter any variable or object in our code.",
+        "<hr>",
+        "Fill in the code for the function <code>incrementer</code> so it returns the value of the global variable <code>fixedValue</code> increased by one."
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var fixedValue = 4;",
+        "",
+        "function incrementer () {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "",
+        "var newValue = incrementer(); // Should equal 5",
+        "console.log(fixedValue); // Should print 4"
+      ],
+      "tests": [
+        "assert(fixedValue === 4, 'message: Your function <code>incrementer</code> should not change the value of <code>fixedValue</code>.');",
+        "assert(newValue === 5, 'message: Your <code>incrementer</code> function should return a value that is one larger than the <code>fixedValue</code> value.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8e367417b2b2512b5f",
+      "title": "Pass Arguments to Avoid External Dependence in a Function",
+      "description": [
+        "The last challenge was a step closer to functional programming principles, but there is still something missing.",
+        "We didn't alter the global variable value, but the function <code>incrementer</code> would not work without the global variable <code>fixedValue</code> being there.",
+        "Another principle of functional programming is to always declare your dependencies explicitly. This means if a function depends on a variable or object being present, then pass that variable or object directly into the function as an argument.",
+        "There are several good consequences from this principle. The function is easier to test, you know exactly what input it takes, and it won't depend on anything else in your program.",
+        "This can give you more confidence when you alter, remove, or add new code. You would know what you can or cannot change and you can see where the potential traps are.",
+        "Finally, the function would always produce the same output for the same set of inputs, no matter what part of the code executes it.",
+        "<hr>",
+        "Let's update the <code>incrementer</code> function to clearly declare its dependencies.",
+        "Write the <code>incrementer</code> function so it takes an argument, and then increases the value by one."
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var fixedValue = 4;",
+        "",
+        "// Add your code below this line",
+        "function incrementer () {",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "",
+        "var newValue = incrementer(fixedValue); // Should equal 5",
+        "console.log(fixedValue); // Should print 4"
+      ],
+      "tests": [
+          "assert(fixedValue === 4, 'message: Your function <code>incrementer</code> should not change the value of <code>fixedValue</code>.');",
+          "assert(code.match(/function\\s+?incrementer\\(.+?\\)/g), 'message: Your <code>incrementer</code> function should take a parameter.');",
+          "assert(newValue === 5, 'message: Your <code>incrementer</code> function should return a value that is one larger than the <code>fixedValue</code> value.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8f367417b2b2512b60",
+      "title": "Refactor Global Variables Out of Functions",
+      "description": [
+        "So far, we have seen two distinct principles for functional programming:",
+        "1) Don't alter a variable or object - create new variables and objects and return them if need be from a function.",
+        "2) Declare function arguments - any computation inside a function depends only on the arguments, and not on any global object or variable.",
+        "Adding one to a number is not very exciting, but we can apply these principles when working with arrays or more complex objects.",
+        "<hr>",
+        "Refactor (rewrite) the code so the global array <code>bookList</code> is not changed inside either function. The <code>add</code> function should add the given <code>bookName</code> to the end of an array. The <code>remove</code> function should remove the given <code>bookName</code> from an array. Both functions should return an array, and any new parameters should be added before the <code>bookName</code> one."
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var bookList = [\"The Hound of the Baskervilles\", \"On The Electrodynamics of Moving Bodies\", \"Philosophiæ Naturalis Principia Mathematica\", \"Disquisitiones Arithmeticae\"];",
+        "",
+        "/* This function should add a book to the list and return the list */",
+        "// New parameters should come before the bookName one",
+        "",
+        "// Add your code below this line",
+        "function add (bookName) {",
+        "  ",
+        "  return bookList.push(bookName);",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "",
+        "/* This function should remove a book from the list and return the list */",
+        "// New parameters should come before the bookName one",
+        "",
+        "// Add your code below this line",
+        "function remove (bookName) {",
+        "  if (bookList.indexOf(bookName) >= 0) {",
+        "    ",
+        "    return bookList.splice(0, 1, bookName);",
+        "    ",
+        "    // Add your code above this line",
+        "    }",
+        "}",
+        "",
+        "var newBookList = add(bookList, 'A Brief History of Time');",
+        "var newerBookList = remove(bookList, 'On The Electrodynamics of Moving Bodies');",
+        "var newestBookList = remove(add(bookList, 'A Brief History of Time'), 'On The Electrodynamics of Moving Bodies');",
+        "",
+        "console.log(bookList);"
+      ],
+      "tests": [
+        "assert(JSON.stringify(bookList) === JSON.stringify([\"The Hound of the Baskervilles\", \"On The Electrodynamics of Moving Bodies\", \"Philosophiæ Naturalis Principia Mathematica\", \"Disquisitiones Arithmeticae\"]), 'message: <code>bookList</code> should not change and still equal <code>[\"The Hound of the Baskervilles\", \"On The Electrodynamics of Moving Bodies\", \"Philosophiæ Naturalis Principia Mathematica\", \"Disquisitiones Arithmeticae\"]</code>.');",
+        "assert(JSON.stringify(newBookList) === JSON.stringify(['The Hound of the Baskervilles', 'On The Electrodynamics of Moving Bodies', 'Philosophiæ Naturalis Principia Mathematica', 'Disquisitiones Arithmeticae', 'A Brief History of Time']), 'message: <code>newBookList</code> should equal <code>[\"The Hound of the Baskervilles\", \"On The Electrodynamics of Moving Bodies\", \"Philosophiæ Naturalis Principia Mathematica\", \"Disquisitiones Arithmeticae\", \"A Brief History of Time\"]</code>.');",
+        "assert(JSON.stringify(newerBookList) === JSON.stringify(['The Hound of the Baskervilles', 'Philosophiæ Naturalis Principia Mathematica', 'Disquisitiones Arithmeticae']), 'message: <code>newerBookList</code> should equal <code>[\"The Hound of the Baskervilles\", \"Philosophiæ Naturalis Principia Mathematica\", \"Disquisitiones Arithmeticae\"]</code>.');",
+        "assert(JSON.stringify(newestBookList) === JSON.stringify(['The Hound of the Baskervilles', 'Philosophiæ Naturalis Principia Mathematica', 'Disquisitiones Arithmeticae', 'A Brief History of Time']), 'message: <code>newestBookList</code> should equal <code>[\"The Hound of the Baskervilles\", \"Philosophiæ Naturalis Principia Mathematica\", \"Disquisitiones Arithmeticae\", \"A Brief History of Time\"]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [
+          "Look at how the functions are called to see the correct order of the parameters.",
+          "Consider using the concat method instead of push.",
+          "The slice method returns a new array without modifying the original."
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8f367417b2b2512b61",
+      "title": "Use the map Method to Extract Data from an Array",
+      "description": [
+        "So far we have learned to use pure functions to avoid side effects in a program. Also, we have seen the value in having a function only depend on its input arguments.",
+        "This is only the beginning. As its name suggests, functional programming is centered around a theory of functions.",
+        "It would make sense to be able to pass them as arguments to other functions, and return a function from another function. Functions are considered <code>First Class Objects</code> in JavaScript, which means they can be used like any other object. They can be saved in variables, stored in an object, or passed as function arguments.",
+        "Let's start with some simple array functions, which are methods on the array object prototype. In this exercise we are looking at <code>Array.prototype.map()</code>, or more simply <code>map</code>.",
+        "Remember that the <code>map</code> method is a way to iterate over each item in an array. It creates a new array (without changing the original one) after applying a callback function to every element.",
+        "<hr>",
+        "The <code>watchList</code> array holds objects with information on several movies. Use <code>map</code> to pull the title and rating from <code>watchList</code> and save the new array in the <code>rating</code> variable. The code in the editor currently uses a <code>for</code> loop to do this, replace the loop functionality with your <code>map</code> expression."
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var watchList = [",
+        "                 {  ",
+        "                   \"Title\": \"Inception\",",
+        "                   \"Year\": \"2010\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"16 Jul 2010\",",
+        "                   \"Runtime\": \"148 min\",",
+        "                   \"Genre\": \"Action, Adventure, Crime\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Christopher Nolan\",",
+        "                   \"Actors\": \"Leonardo DiCaprio, Joseph Gordon-Levitt, Ellen Page, Tom Hardy\",",
+        "                   \"Plot\": \"A thief, who steals corporate secrets through use of dream-sharing technology, is given the inverse task of planting an idea into the mind of a CEO.\",",
+        "                   \"Language\": \"English, Japanese, French\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 4 Oscars. Another 143 wins & 198 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMjAxMzY3NjcxNF5BMl5BanBnXkFtZTcwNTI5OTM0Mw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"74\",",
+        "                   \"imdbRating\": \"8.8\",",
+        "                   \"imdbVotes\": \"1,446,708\",",
+        "                   \"imdbID\": \"tt1375666\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {  ",
+        "                   \"Title\": \"Interstellar\",",
+        "                   \"Year\": \"2014\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"07 Nov 2014\",",
+        "                   \"Runtime\": \"169 min\",",
+        "                   \"Genre\": \"Adventure, Drama, Sci-Fi\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Jonathan Nolan, Christopher Nolan\",",
+        "                   \"Actors\": \"Ellen Burstyn, Matthew McConaughey, Mackenzie Foy, John Lithgow\",",
+        "                   \"Plot\": \"A team of explorers travel through a wormhole in space in an attempt to ensure humanity's survival.\",",
+        "                   \"Language\": \"English\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 1 Oscar. Another 39 wins & 132 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMjIxNTU4MzY4MF5BMl5BanBnXkFtZTgwMzM4ODI3MjE@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"74\",",
+        "                   \"imdbRating\": \"8.6\",",
+        "                   \"imdbVotes\": \"910,366\",",
+        "                   \"imdbID\": \"tt0816692\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {",
+        "                   \"Title\": \"The Dark Knight\",",
+        "                   \"Year\": \"2008\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"18 Jul 2008\",",
+        "                   \"Runtime\": \"152 min\",",
+        "                   \"Genre\": \"Action, Adventure, Crime\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Jonathan Nolan (screenplay), Christopher Nolan (screenplay), Christopher Nolan (story), David S. Goyer (story), Bob Kane (characters)\",",
+        "                   \"Actors\": \"Christian Bale, Heath Ledger, Aaron Eckhart, Michael Caine\",",
+        "                   \"Plot\": \"When the menace known as the Joker wreaks havoc and chaos on the people of Gotham, the caped crusader must come to terms with one of the greatest psychological tests of his ability to fight injustice.\",",
+        "                   \"Language\": \"English, Mandarin\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 2 Oscars. Another 146 wins & 142 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMTMxNTMwODM0NF5BMl5BanBnXkFtZTcwODAyMTk2Mw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"82\",",
+        "                   \"imdbRating\": \"9.0\",",
+        "                   \"imdbVotes\": \"1,652,832\",",
+        "                   \"imdbID\": \"tt0468569\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {  ",
+        "                   \"Title\": \"Batman Begins\",",
+        "                   \"Year\": \"2005\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"15 Jun 2005\",",
+        "                   \"Runtime\": \"140 min\",",
+        "                   \"Genre\": \"Action, Adventure\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Bob Kane (characters), David S. Goyer (story), Christopher Nolan (screenplay), David S. Goyer (screenplay)\",",
+        "                   \"Actors\": \"Christian Bale, Michael Caine, Liam Neeson, Katie Holmes\",",
+        "                   \"Plot\": \"After training with his mentor, Batman begins his fight to free crime-ridden Gotham City from the corruption that Scarecrow and the League of Shadows have cast upon it.\",",
+        "                   \"Language\": \"English, Urdu, Mandarin\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Nominated for 1 Oscar. Another 15 wins & 66 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BNTM3OTc0MzM2OV5BMl5BanBnXkFtZTYwNzUwMTI3._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"70\",",
+        "                   \"imdbRating\": \"8.3\",",
+        "                   \"imdbVotes\": \"972,584\",",
+        "                   \"imdbID\": \"tt0372784\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {",
+        "                   \"Title\": \"Avatar\",",
+        "                   \"Year\": \"2009\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"18 Dec 2009\",",
+        "                   \"Runtime\": \"162 min\",",
+        "                   \"Genre\": \"Action, Adventure, Fantasy\",",
+        "                   \"Director\": \"James Cameron\",",
+        "                   \"Writer\": \"James Cameron\",",
+        "                   \"Actors\": \"Sam Worthington, Zoe Saldana, Sigourney Weaver, Stephen Lang\",",
+        "                   \"Plot\": \"A paraplegic marine dispatched to the moon Pandora on a unique mission becomes torn between following his orders and protecting the world he feels is his home.\",",
+        "                   \"Language\": \"English, Spanish\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 3 Oscars. Another 80 wins & 121 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMTYwOTEwNjAzMl5BMl5BanBnXkFtZTcwODc5MTUwMw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"83\",",
+        "                   \"imdbRating\": \"7.9\",",
+        "                   \"imdbVotes\": \"876,575\",",
+        "                   \"imdbID\": \"tt0499549\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                }",
+        "];",
+        "",
+        "// Add your code below this line",
+        "",
+        "var rating = [];",
+        "for(var i=0; i < watchList.length; i++){",
+        "  rating.push({title: watchList[i][\"Title\"],  rating: watchList[i][\"imdbRating\"]});",
+        "}",
+        "",
+        "// Add your code above this line",
+        "",
+        "console.log(rating); "
+      ],
+      "tests": [
+        "assert(watchList[0].Title === \"Inception\" && watchList[4].Director == \"James Cameron\", 'message: The <code>watchList</code> variable should not change.');",
+        "assert(!code.match(/for\\s*?\\(.+?\\)/g), 'message: Your code should not use a <code>for</code> loop.');",
+        "assert(code.match(/\\.map/g), 'message: Your code should use the <code>map</code> method.');",
+        "assert(JSON.stringify(rating) === JSON.stringify([{\"title\":\"Inception\",\"rating\":\"8.8\"},{\"title\":\"Interstellar\",\"rating\":\"8.6\"},{\"title\":\"The Dark Knight\",\"rating\":\"9.0\"},{\"title\":\"Batman Begins\",\"rating\":\"8.3\"},{\"title\":\"Avatar\",\"rating\":\"7.9\"}]), 'message: <code>rating</code> should equal <code>[{\"title\":\"Inception\",\"rating\":\"8.8\"},{\"title\":\"Interstellar\",\"rating\":\"8.6\"},{\"title\":\"The Dark Knight\",\"rating\":\"9.0\"},{\"title\":\"Batman Begins\",\"rating\":\"8.3\"},{\"title\":\"Avatar\",\"rating\":\"7.9\"}]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8f367417b2b2512b62",
+      "title": "Implement map on a Prototype",
+      "description": [
+        "As you have seen from applying <code>Array.prototype.map()</code>, or simply <code>map()</code> earlier, the <code>map</code> method returns an array of the same length as the one it was called on. It also doesn't alter the original array, as long as its callback function doesn't.",
+        "In other words, <code>map</code> is a pure function, and its output depends solely on its inputs. Plus, it takes another function as its argument.",
+        "It would teach us a lot about <code>map</code> to try to implement a version of it that behaves exactly like the <code>Array.prototype.map()</code> with a <code>for</code> loop or <code>Array.prototype.forEach()</code>.",
+        "Note: A pure function is allowed to alter local variables defined within its scope, although, it's preferable to avoid that as well.",
+        "<hr>",
+        "Write your own <code>Array.prototype.myMap()</code>, which should behave exactly like <code>Array.prototype.map()</code>. You may use a <code>for</code> loop or the <code>forEach</code> method."
+      ],
+      "challengeSeed": [
+        "// the global Array",
+        "var s = [23, 65, 98, 5];",
+        "",
+        "Array.prototype.myMap = function(callback){",
+        "  var newArray = [];",
+        "  // Add your code below this line",
+        "  ",
+        "  // Add your code above this line",
+        "  return newArray;",
+        "",
+        "};",
+        "",
+        "var new_s = s.myMap(function(item){",
+        "  return item * 2;",
+        "});"
+      ],
+      "tests": [
+        "assert(JSON.stringify(new_s) === JSON.stringify([46, 130, 196, 10]), 'message: <code>new_s</code> should equal <code>[46, 130, 196, 10]</code>.');",
+        "assert(!code.match(/\\.map/g), 'message: Your code should not use the <code>map</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8f367417b2b2512b63",
+      "title": "Use the filter Method to Extract Data from an Array",
+      "description": [
+        "Another useful array function is <code>Array.prototype.filter()</code>, or simply <code>filter()</code>. The <code>filter</code> method returns a new array which is at most as long as the original array, but usually has fewer items.",
+        "<code>Filter</code> doesn't alter the original array, just like <code>map</code>. It takes a callback function that applies the logic inside the callback on each element of the array. If an element returns true based on the criteria in the callback function, then it is included in the new array.",
+        "<hr>",
+        "The variable <code>watchList</code> holds an array of objects with information on several movies. Use a combination of <code>filter</code> and <code>map</code> to return a new array of objects with only <code>title</code> and <code>rating</code> keys, but where <code>imdbRating</code> is greater than or equal to 8.0. Note that the rating values are saved as strings in the object and you may want to convert them into numbers to perform mathematical operations on them."
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var watchList = [",
+        "                 {  ",
+        "                   \"Title\": \"Inception\",",
+        "                   \"Year\": \"2010\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"16 Jul 2010\",",
+        "                   \"Runtime\": \"148 min\",",
+        "                   \"Genre\": \"Action, Adventure, Crime\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Christopher Nolan\",",
+        "                   \"Actors\": \"Leonardo DiCaprio, Joseph Gordon-Levitt, Ellen Page, Tom Hardy\",",
+        "                   \"Plot\": \"A thief, who steals corporate secrets through use of dream-sharing technology, is given the inverse task of planting an idea into the mind of a CEO.\",",
+        "                   \"Language\": \"English, Japanese, French\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 4 Oscars. Another 143 wins & 198 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMjAxMzY3NjcxNF5BMl5BanBnXkFtZTcwNTI5OTM0Mw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"74\",",
+        "                   \"imdbRating\": \"8.8\",",
+        "                   \"imdbVotes\": \"1,446,708\",",
+        "                   \"imdbID\": \"tt1375666\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {  ",
+        "                   \"Title\": \"Interstellar\",",
+        "                   \"Year\": \"2014\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"07 Nov 2014\",",
+        "                   \"Runtime\": \"169 min\",",
+        "                   \"Genre\": \"Adventure, Drama, Sci-Fi\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Jonathan Nolan, Christopher Nolan\",",
+        "                   \"Actors\": \"Ellen Burstyn, Matthew McConaughey, Mackenzie Foy, John Lithgow\",",
+        "                   \"Plot\": \"A team of explorers travel through a wormhole in space in an attempt to ensure humanity's survival.\",",
+        "                   \"Language\": \"English\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 1 Oscar. Another 39 wins & 132 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMjIxNTU4MzY4MF5BMl5BanBnXkFtZTgwMzM4ODI3MjE@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"74\",",
+        "                   \"imdbRating\": \"8.6\",",
+        "                   \"imdbVotes\": \"910,366\",",
+        "                   \"imdbID\": \"tt0816692\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {",
+        "                   \"Title\": \"The Dark Knight\",",
+        "                   \"Year\": \"2008\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"18 Jul 2008\",",
+        "                   \"Runtime\": \"152 min\",",
+        "                   \"Genre\": \"Action, Adventure, Crime\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Jonathan Nolan (screenplay), Christopher Nolan (screenplay), Christopher Nolan (story), David S. Goyer (story), Bob Kane (characters)\",",
+        "                   \"Actors\": \"Christian Bale, Heath Ledger, Aaron Eckhart, Michael Caine\",",
+        "                   \"Plot\": \"When the menace known as the Joker wreaks havoc and chaos on the people of Gotham, the caped crusader must come to terms with one of the greatest psychological tests of his ability to fight injustice.\",",
+        "                   \"Language\": \"English, Mandarin\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 2 Oscars. Another 146 wins & 142 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMTMxNTMwODM0NF5BMl5BanBnXkFtZTcwODAyMTk2Mw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"82\",",
+        "                   \"imdbRating\": \"9.0\",",
+        "                   \"imdbVotes\": \"1,652,832\",",
+        "                   \"imdbID\": \"tt0468569\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {  ",
+        "                   \"Title\": \"Batman Begins\",",
+        "                   \"Year\": \"2005\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"15 Jun 2005\",",
+        "                   \"Runtime\": \"140 min\",",
+        "                   \"Genre\": \"Action, Adventure\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Bob Kane (characters), David S. Goyer (story), Christopher Nolan (screenplay), David S. Goyer (screenplay)\",",
+        "                   \"Actors\": \"Christian Bale, Michael Caine, Liam Neeson, Katie Holmes\",",
+        "                   \"Plot\": \"After training with his mentor, Batman begins his fight to free crime-ridden Gotham City from the corruption that Scarecrow and the League of Shadows have cast upon it.\",",
+        "                   \"Language\": \"English, Urdu, Mandarin\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Nominated for 1 Oscar. Another 15 wins & 66 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BNTM3OTc0MzM2OV5BMl5BanBnXkFtZTYwNzUwMTI3._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"70\",",
+        "                   \"imdbRating\": \"8.3\",",
+        "                   \"imdbVotes\": \"972,584\",",
+        "                   \"imdbID\": \"tt0372784\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {",
+        "                   \"Title\": \"Avatar\",",
+        "                   \"Year\": \"2009\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"18 Dec 2009\",",
+        "                   \"Runtime\": \"162 min\",",
+        "                   \"Genre\": \"Action, Adventure, Fantasy\",",
+        "                   \"Director\": \"James Cameron\",",
+        "                   \"Writer\": \"James Cameron\",",
+        "                   \"Actors\": \"Sam Worthington, Zoe Saldana, Sigourney Weaver, Stephen Lang\",",
+        "                   \"Plot\": \"A paraplegic marine dispatched to the moon Pandora on a unique mission becomes torn between following his orders and protecting the world he feels is his home.\",",
+        "                   \"Language\": \"English, Spanish\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 3 Oscars. Another 80 wins & 121 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMTYwOTEwNjAzMl5BMl5BanBnXkFtZTcwODc5MTUwMw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"83\",",
+        "                   \"imdbRating\": \"7.9\",",
+        "                   \"imdbVotes\": \"876,575\",",
+        "                   \"imdbID\": \"tt0499549\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                }",
+        "];",
+        "",
+        "// Add your code below this line",
+        "",
+        "var filteredList;",
+        "",
+        "// Add your code above this line",
+        "",
+        "console.log(filteredList); "
+      ],
+      "tests": [
+        "assert(watchList[0].Title === \"Inception\" && watchList[4].Director == \"James Cameron\", 'message: The <code>watchList</code> variable should not change.');",
+        "assert(code.match(/\\.filter/g), 'message: Your code should use the <code>filter</code> method.');",
+        "assert(!code.match(/for\\s*?\\(.+?\\)/g), 'message: Your code should not use a <code>for</code> loop.');",
+        "assert.deepEqual(filteredList, [{\"title\": \"Inception\",\"rating\": \"8.8\"},{\"title\": \"Interstellar\",\"rating\": \"8.6\"},{\"title\": \"The Dark Knight\",\"rating\": \"9.0\"},{\"title\": \"Batman Begins\",\"rating\": \"8.3\"}], 'message: <code>filteredList</code> should equal <code>[{\"title\": \"Inception\",\"rating\": \"8.8\"},{\"title\": \"Interstellar\",\"rating\": \"8.6\"},{\"title\": \"The Dark Knight\",\"rating\": \"9.0\"},{\"title\": \"Batman Begins\",\"rating\": \"8.3\"}]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b8f367417b2b2512b64",
+      "title": "Implement the filter Method on a Prototype",
+      "description": [
+        "It would teach us a lot about the <code>filter</code> method if we try to implement a version of it that behaves exactly like <code>Array.prototype.filter()</code>. It can use either a <code>for</code> loop or <code>Array.prototype.forEach()</code>.",
+        "Note: A pure function is allowed to alter local variables defined within its scope, although, it's preferable to avoid that as well.",
+        "<hr>",
+        "Write your own <code>Array.prototype.myFilter()</code>, which should behave exactly like <code>Array.prototype.filter()</code>. You may use a <code>for</code> loop or the <code>Array.prototype.forEach()</code> method."
+      ],
+      "challengeSeed": [
+        "// the global Array",
+        "var s = [23, 65, 98, 5];",
+        "",
+        "Array.prototype.myFilter = function(callback){",
+        "  var newArray = [];",
+        "  // Add your code below this line",
+        "  ",
+        "  // Add your code above this line",
+        "  return newArray;",
+        "",
+        "};",
+        "",
+        "var new_s = s.myFilter(function(item){",
+        "  return item % 2 === 1;",
+        "});"
+      ],
+      "tests": [
+        "assert(JSON.stringify(new_s) === JSON.stringify([23, 65, 5]), 'message: <code>new_s</code> should equal <code>[23, 65, 5]</code>.');",
+        "assert(!code.match(/\\.filter/g), 'message: Your code should not use the <code>filter</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7b90367417b2b2512b65",
+      "title": "Return Part of an Array Using the slice Method",
+      "description": [
+        "The <code>slice</code> method returns a copy of certain elements of an array. It can take two arguments, the first gives the index of where to begin the slice, the second is the index for where to end the slice (and it's non-inclusive). If the arguments are not provided, the default is to start at the beginning of the array through the end, which is an easy way to make a copy of the entire array. The <code>slice</code> method does not mutate the original array, but returns a new one.",
+        "Here's an example:",
+        "<blockquote>var arr = [\"Cat\", \"Dog\", \"Tiger\", \"Zebra\"];<br>var newArray = arr.slice(1, 3);<br>// Sets newArray to [\"Dog\", \"Tiger\"]</blockquote>",
+        "<hr>",
+        "Use the <code>slice</code> method in the <code>sliceArray</code> function to return part of the <code>anim</code> array given the provided <code>beginSlice</code> and <code>endSlice</code> indices. The function should return an array."
+      ],
+      "challengeSeed": [
+        "function sliceArray(anim, beginSlice, endSlice) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "var inputAnim = [\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"];",
+        "sliceArray(inputAnim, 1, 3);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.slice/g), 'message: Your code should use the <code>slice</code> method.');",
+        "assert(JSON.stringify(inputAnim) === JSON.stringify([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"]), 'message: The <code>inputAnim</code> variable should not change.');",
+        "assert(JSON.stringify(sliceArray([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"], 1, 3)) === JSON.stringify([\"Dog\", \"Tiger\"]), 'message: <code>sliceArray([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"], 1, 3)</code> should return <code>[\"Dog\", \"Tiger\"]</code>.');",
+        "assert(JSON.stringify(sliceArray([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"], 0, 1)) === JSON.stringify([\"Cat\"]), 'message: <code>sliceArray([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"], 0, 1)</code> should return <code>[\"Cat\"]</code>.');",
+        "assert(JSON.stringify(sliceArray([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"], 1, 4)) === JSON.stringify([\"Dog\", \"Tiger\", \"Zebra\"]), 'message: <code>sliceArray([\"Cat\", \"Dog\", \"Tiger\", \"Zebra\", \"Ant\"], 1, 4)</code> should return <code>[\"Dog\", \"Tiger\", \"Zebra\"]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "9d7123c8c441eeafaeb5bdef",
+      "title": "Remove Elements from an Array Using slice Instead of splice",
+      "description": [
+        "A common pattern while working with arrays is when you want to remove items and keep the rest of the array. JavaScript offers the <code>splice</code> method for this, which takes arguments for the index of where to start removing items, then the number of items to remove. If the second argument is not provided, the default is to remove items through the end. However, the <code>splice</code> method mutates the original array it is called on. Here's an example:",
+        "<blockquote>var cities = [\"Chicago\", \"Delhi\", \"Islamabad\", \"London\", \"Berlin\"];<br>cities.splice(3, 1); // Returns \"London\" and deletes it from the cities array<br>// cities is now [\"Chicago\", \"Delhi\", \"Islamabad\", \"Berlin\"]</blockquote>",
+        "As we saw in the last challenge, the <code>slice</code> method does not mutate the original array, but returns a new one which can be saved into a variable. Recall that the <code>slice</code> method takes two arguments for the indices to begin and end the slice (the end is non-inclusive), and returns those items in a new array. Using the <code>slice</code> method instead of <code>splice</code> helps to avoid any array-mutating side effects.",
+        "<hr>",
+        "Rewrite the function <code>nonMutatingSplice</code> by using <code>slice</code> instead of <code>splice</code>. It should limit the provided <code>cities</code> array to a length of 3, and return a new array with only the first three items.",
+        "Do not mutate the original array provided to the function."
+      ],
+      "challengeSeed": [
+        "function nonMutatingSplice(cities) {",
+        "  // Add your code below this line",
+        "  return cities.splice(3);",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "var inputCities = [\"Chicago\", \"Delhi\", \"Islamabad\", \"London\", \"Berlin\"];",
+        "nonMutatingSplice(inputCities);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.slice/g), 'message: Your code should use the <code>slice</code> method.');",
+        "assert(!code.match(/\\.splice/g), 'message: Your code should not use the <code>splice</code> method.');",
+        "assert(JSON.stringify(inputCities) === JSON.stringify([\"Chicago\", \"Delhi\", \"Islamabad\", \"London\", \"Berlin\"]), 'message: The <code>inputCities</code> array should not change.');",
+        "assert(JSON.stringify(nonMutatingSplice([\"Chicago\", \"Delhi\", \"Islamabad\", \"London\", \"Berlin\"])) === JSON.stringify([\"Chicago\", \"Delhi\", \"Islamabad\"]), 'message: <code>nonMutatingSplice([\"Chicago\", \"Delhi\", \"Islamabad\", \"London\", \"Berlin\"])</code> should return <code>[\"Chicago\", \"Delhi\", \"Islamabad\"]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7da9367417b2b2512b66",
+      "title": "Combine Two Arrays Using the concat Method",
+      "description": [
+        "<code>Concatenation</code> means to join items end to end. JavaScript offers the <code>concat</code> method for both strings and arrays that work in the same way. For arrays, the method is called on one, then another array is provided as the argument to <code>concat</code>, which is added to the end of the first array. It returns a new array and does not mutate either of the original arrays. Here's an example:",
+        "<blockquote>[1, 2, 3].concat([4, 5, 6]);<br>// Returns a new array [1, 2, 3, 4, 5, 6]</blockquote>",
+        "<hr>",
+        "Use the <code>concat</code> method in the <code>nonMutatingConcat</code> function to concatenate <code>attach</code> to the end of <code>original</code>. The function should return the concatenated array."
+      ],
+      "challengeSeed": [
+        "function nonMutatingConcat(original, attach) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "var first = [1, 2, 3];",
+        "var second = [4, 5];",
+        "nonMutatingConcat(first, second);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.concat/g), 'message: Your code should use the <code>concat</code> method.');",
+        "assert(JSON.stringify(first) === JSON.stringify([1, 2, 3]), 'message: The <code>first</code> array should not change.');",
+        "assert(JSON.stringify(second) === JSON.stringify([4, 5]), 'message: The <code>second</code> array should not change.');",
+        "assert(JSON.stringify(nonMutatingConcat([1, 2, 3], [4, 5])) === JSON.stringify([1, 2, 3, 4, 5]), 'message: <code>nonMutatingConcat([1, 2, 3], [4, 5])</code> should return <code>[1, 2, 3, 4, 5]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7da9367417b2b2512b67",
+      "title": "Add Elements to the End of an Array Using concat Instead of push",
+      "description": [
+        "Functional programming is all about creating and using non-mutating functions.",
+        "The last challenge introduced the <code>concat</code> method as a way to combine arrays into a new one without mutating the original arrays. Compare <code>concat</code> to the <code>push</code> method. <code>Push</code> adds an item to the end of the same array it is called on, which mutates that array. Here's an example:",
+        "<blockquote>var arr = [1, 2, 3];<br>arr.push([4, 5, 6]);<br>// arr is changed to [1, 2, 3, [4, 5, 6]]<br>// Not the functional programming way</blockquote>",
+        "<code>Concat</code> offers a way to add new items to the end of an array without any mutating side effects.",
+        "<hr>",
+        "Change the <code>nonMutatingPush</code> function so it uses <code>concat</code> to add <code>newItem</code> to the end of <code>original</code> instead of <code>push</code>. The function should return an array."
+      ],
+      "challengeSeed": [
+        "function nonMutatingPush(original, newItem) {",
+        "  // Add your code below this line",
+        "  return original.push(newItem);",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "var first = [1, 2, 3];",
+        "var second = [4, 5];",
+        "nonMutatingPush(first, second);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.concat/g), 'message: Your code should use the <code>concat</code> method.');",
+        "assert(!code.match(/\\.push/g), 'message: Your code should not use the <code>push</code> method.');",
+        "assert(JSON.stringify(first) === JSON.stringify([1, 2, 3]), 'message: The <code>first</code> array should not change.');",
+        "assert(JSON.stringify(second) === JSON.stringify([4, 5]), 'message: The <code>second</code> array should not change.');",
+        "assert(JSON.stringify(nonMutatingPush([1, 2, 3], [4, 5])) === JSON.stringify([1, 2, 3, 4, 5]), 'message: <code>nonMutatingPush([1, 2, 3], [4, 5])</code> should return <code>[1, 2, 3, 4, 5]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7da9367417b2b2512b68",
+      "title": "Use the reduce Method to Analyze Data",
+      "description": [
+        "<code>Array.prototype.reduce()</code>, or simply <code>reduce()</code>, is the most general of all array operations in JavaScript. You can solve almost any array processing problem using the <code>reduce</code> method.",
+        "This is not the case with the <code>filter</code> and <code>map</code> methods since they do not allow interaction between two different elements of the array. For example, if you want to compare elements of the array, or add them together, <code>filter</code> or <code>map</code> could not process that.",
+        "The <code>reduce</code> method allows for more general forms of array processing, and it's possible to show that both <code>filter</code> and <code>map</code> can be derived as a special application of <code>reduce</code>.",
+        "However, before we get there, let's practice using <code>reduce</code> first.",
+        "<hr>",
+        "The variable <code>watchList</code> holds an array of objects with information on several movies. Use <code>reduce</code> to find the average IMDB rating of the movies directed by Christopher Nolan. Recall from prior challenges how to <code>filter</code> data and <code>map</code> over it to pull what you need. You may need to create other variables, but save the final average into the variable <code>averageRating</code>. Note that the rating values are saved as strings in the object and need to be converted into numbers before they are used in any mathematical operations."
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var watchList = [",
+        "                 {  ",
+        "                   \"Title\": \"Inception\",",
+        "                   \"Year\": \"2010\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"16 Jul 2010\",",
+        "                   \"Runtime\": \"148 min\",",
+        "                   \"Genre\": \"Action, Adventure, Crime\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Christopher Nolan\",",
+        "                   \"Actors\": \"Leonardo DiCaprio, Joseph Gordon-Levitt, Ellen Page, Tom Hardy\",",
+        "                   \"Plot\": \"A thief, who steals corporate secrets through use of dream-sharing technology, is given the inverse task of planting an idea into the mind of a CEO.\",",
+        "                   \"Language\": \"English, Japanese, French\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 4 Oscars. Another 143 wins & 198 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMjAxMzY3NjcxNF5BMl5BanBnXkFtZTcwNTI5OTM0Mw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"74\",",
+        "                   \"imdbRating\": \"8.8\",",
+        "                   \"imdbVotes\": \"1,446,708\",",
+        "                   \"imdbID\": \"tt1375666\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {  ",
+        "                   \"Title\": \"Interstellar\",",
+        "                   \"Year\": \"2014\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"07 Nov 2014\",",
+        "                   \"Runtime\": \"169 min\",",
+        "                   \"Genre\": \"Adventure, Drama, Sci-Fi\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Jonathan Nolan, Christopher Nolan\",",
+        "                   \"Actors\": \"Ellen Burstyn, Matthew McConaughey, Mackenzie Foy, John Lithgow\",",
+        "                   \"Plot\": \"A team of explorers travel through a wormhole in space in an attempt to ensure humanity's survival.\",",
+        "                   \"Language\": \"English\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 1 Oscar. Another 39 wins & 132 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMjIxNTU4MzY4MF5BMl5BanBnXkFtZTgwMzM4ODI3MjE@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"74\",",
+        "                   \"imdbRating\": \"8.6\",",
+        "                   \"imdbVotes\": \"910,366\",",
+        "                   \"imdbID\": \"tt0816692\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {",
+        "                   \"Title\": \"The Dark Knight\",",
+        "                   \"Year\": \"2008\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"18 Jul 2008\",",
+        "                   \"Runtime\": \"152 min\",",
+        "                   \"Genre\": \"Action, Adventure, Crime\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Jonathan Nolan (screenplay), Christopher Nolan (screenplay), Christopher Nolan (story), David S. Goyer (story), Bob Kane (characters)\",",
+        "                   \"Actors\": \"Christian Bale, Heath Ledger, Aaron Eckhart, Michael Caine\",",
+        "                   \"Plot\": \"When the menace known as the Joker wreaks havoc and chaos on the people of Gotham, the caped crusader must come to terms with one of the greatest psychological tests of his ability to fight injustice.\",",
+        "                   \"Language\": \"English, Mandarin\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 2 Oscars. Another 146 wins & 142 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMTMxNTMwODM0NF5BMl5BanBnXkFtZTcwODAyMTk2Mw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"82\",",
+        "                   \"imdbRating\": \"9.0\",",
+        "                   \"imdbVotes\": \"1,652,832\",",
+        "                   \"imdbID\": \"tt0468569\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {  ",
+        "                   \"Title\": \"Batman Begins\",",
+        "                   \"Year\": \"2005\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"15 Jun 2005\",",
+        "                   \"Runtime\": \"140 min\",",
+        "                   \"Genre\": \"Action, Adventure\",",
+        "                   \"Director\": \"Christopher Nolan\",",
+        "                   \"Writer\": \"Bob Kane (characters), David S. Goyer (story), Christopher Nolan (screenplay), David S. Goyer (screenplay)\",",
+        "                   \"Actors\": \"Christian Bale, Michael Caine, Liam Neeson, Katie Holmes\",",
+        "                   \"Plot\": \"After training with his mentor, Batman begins his fight to free crime-ridden Gotham City from the corruption that Scarecrow and the League of Shadows have cast upon it.\",",
+        "                   \"Language\": \"English, Urdu, Mandarin\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Nominated for 1 Oscar. Another 15 wins & 66 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BNTM3OTc0MzM2OV5BMl5BanBnXkFtZTYwNzUwMTI3._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"70\",",
+        "                   \"imdbRating\": \"8.3\",",
+        "                   \"imdbVotes\": \"972,584\",",
+        "                   \"imdbID\": \"tt0372784\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                },",
+        "                {",
+        "                   \"Title\": \"Avatar\",",
+        "                   \"Year\": \"2009\",",
+        "                   \"Rated\": \"PG-13\",",
+        "                   \"Released\": \"18 Dec 2009\",",
+        "                   \"Runtime\": \"162 min\",",
+        "                   \"Genre\": \"Action, Adventure, Fantasy\",",
+        "                   \"Director\": \"James Cameron\",",
+        "                   \"Writer\": \"James Cameron\",",
+        "                   \"Actors\": \"Sam Worthington, Zoe Saldana, Sigourney Weaver, Stephen Lang\",",
+        "                   \"Plot\": \"A paraplegic marine dispatched to the moon Pandora on a unique mission becomes torn between following his orders and protecting the world he feels is his home.\",",
+        "                   \"Language\": \"English, Spanish\",",
+        "                   \"Country\": \"USA, UK\",",
+        "                   \"Awards\": \"Won 3 Oscars. Another 80 wins & 121 nominations.\",",
+        "                   \"Poster\": \"http://ia.media-imdb.com/images/M/MV5BMTYwOTEwNjAzMl5BMl5BanBnXkFtZTcwODc5MTUwMw@@._V1_SX300.jpg\",",
+        "                   \"Metascore\": \"83\",",
+        "                   \"imdbRating\": \"7.9\",",
+        "                   \"imdbVotes\": \"876,575\",",
+        "                   \"imdbID\": \"tt0499549\",",
+        "                   \"Type\": \"movie\",",
+        "                   \"Response\": \"True\"",
+        "                }",
+        "];",
+        "",
+        "// Add your code below this line",
+        "",
+        "var averageRating;",
+        "",
+        "// Add your code above this line",
+        "",
+        "console.log(averageRating); "
+      ],
+      "tests": [
+        "assert(watchList[0].Title === \"Inception\" && watchList[4].Director == \"James Cameron\", 'message: The <code>watchList</code> variable should not change.');",
+        "assert(code.match(/\\.reduce/g), 'message: Your code should use the <code>reduce</code> method.');",
+        "assert(averageRating == 8.675, 'message: The <code>averageRating</code> should equal 8.675.');",
+        "assert(!code.match(/for\\s*?\\(.*\\)/g), 'message: Your code should not use a <code>for</code> loop.');"
+      ],
+      "solutions": [],
+      "hints": [
+          "Try using .filter() to filter the watchList by Director.",
+          "Try using .map() to return an array of ratings.",
+          "You can use Number() to convert a string into a number."
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7da9367417b2b2512b69",
+      "title": "Sort an Array Alphabetically using the sort Method",
+      "description": [
+        "The <code>sort</code> method sorts the elements of an array according to the callback function.",
+        "For example:",
+        "<blockquote>function ascendingOrder(arr) {<br>&nbsp;&nbsp;return arr.sort(function(a, b) {<br>&nbsp;&nbsp;&nbsp;&nbsp;return a - b;<br>&nbsp;&nbsp;});<br>}<br>ascendingOrder([1, 5, 2, 3, 4]);<br>// Returns [1, 2, 3, 4, 5]<br><br>function reverseAlpha(arr) {<br>&nbsp;&nbsp;return arr.sort(function(a, b) {<br>&nbsp;&nbsp;&nbsp;&nbsp;return a < b;<br>&nbsp;&nbsp;});<br>}<br>reverseAlpha(['l', 'h', 'z', 'b', 's']);<br>// Returns ['z', 's', 'l', 'h', 'b']</blockquote>",
+        "Note: It's encouraged to provide a callback function to specify how to sort the array items. JavaScript's default sorting method is by string Unicode point value, which may return unexpected results.",
+        "<hr>",
+        "Use the <code>sort</code> method in the <code>alphabeticalOrder</code> function to sort the elements of <code>arr</code> in alphabetical order."
+      ],
+      "challengeSeed": [
+        "function alphabeticalOrder(arr) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "alphabeticalOrder([\"a\", \"d\", \"c\", \"a\", \"z\", \"g\"]);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.sort/g), 'message: Your code should use the <code>sort</code> method.');",
+        "assert(JSON.stringify(alphabeticalOrder([\"a\", \"d\", \"c\", \"a\", \"z\", \"g\"])) === JSON.stringify([\"a\", \"a\", \"c\", \"d\", \"g\", \"z\"]), 'message: <code>alphabeticalOrder([\"a\", \"d\", \"c\", \"a\", \"z\", \"g\"])</code> should return <code>[\"a\", \"a\", \"c\", \"d\", \"g\", \"z\"]</code>.');",
+        "assert(JSON.stringify(alphabeticalOrder([\"x\", \"h\", \"a\", \"m\", \"n\", \"m\"])) === JSON.stringify([\"a\", \"h\", \"m\", \"m\", \"n\", \"x\"]), 'message: <code>alphabeticalOrder([\"x\", \"h\", \"a\", \"m\", \"n\", \"m\"])</code> should return <code>[\"a\", \"h\", \"m\", \"m\", \"n\", \"x\"]</code>.');",
+        "assert(JSON.stringify(alphabeticalOrder([\"a\", \"a\", \"a\", \"a\", \"x\", \"t\"])) === JSON.stringify([\"a\", \"a\", \"a\", \"a\", \"t\", \"x\"]), 'message: <code>alphabeticalOrder([\"a\", \"a\", \"a\", \"a\", \"x\", \"t\"])</code> should return <code>[\"a\", \"a\", \"a\", \"a\", \"t\", \"x\"]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7da9367417b2b2512b6a",
+      "title": "Return a Sorted Array Without Changing the Original Array",
+      "description": [
+        "A side effect of the <code>sort</code> method is that it changes the order of the elements in the original array. In other words, it mutates the array in place. One way to avoid this is to first concatenate an empty array to the one being sorted (remember that <code>concat</code> returns a new array), then run the <code>sort</code> method.",
+        "<hr>",
+        "Use the <code>sort</code> method in the <code>nonMutatingSort</code> function to sort the elements of an array in ascending order. The function should return a new array, and not mutate the <code>globalArray</code> variable."
+      ],
+      "challengeSeed": [
+        "var globalArray = [5, 6, 3, 2, 9];",
+        "function nonMutatingSort(arr) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "nonMutatingSort(globalArray);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.sort/g), 'message: Your code should use the <code>sort</code> method.');",
+        "assert(code.match(/\\.concat/g), 'message: Your code should use the <code>concat</code> method.');",
+        "assert(JSON.stringify(globalArray) === JSON.stringify([5, 6, 3, 2, 9]), 'message: The <code>globalArray</code> variable should not change.');",
+        "assert(JSON.stringify(nonMutatingSort(globalArray)) === JSON.stringify([2, 3, 5, 6, 9]), 'message: <code>nonMutatingSort(globalArray)</code> should return <code>[2, 3, 5, 6, 9]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7daa367417b2b2512b6b",
+      "title": "Split a String into an Array Using the split Method",
+      "description": [
+        "The <code>split</code> method splits a string into an array of strings. It takes an argument for the delimiter, which can be a character to use to break up the string or a regular expression. For example, if the delimiter is a space, you get an array of words, and if the delimiter is an empty string, you get an array of each character in the string.",
+        "Here are two examples that split one string by spaces, then another by digits using a regular expression:",
+        "<blockquote>var str = \"Hello World\";<br>var bySpace = str.split(\" \");<br>// Sets bySpace to [\"Hello\", \"World\"]<br><br>var otherString = \"How9are7you2today\";<br>var byDigits = str.split(/\\d/);<br>// Sets byDigits to [\"How\", \"are\", \"you\", \"today\"]</blockquote>",
+        "Since strings are immutable, the <code>split</code> method makes it easier to work with them.",
+        "<hr>",
+        "Use the <code>split</code> method inside the <code>splitify</code> function to split <code>str</code> into an array of words. The function should return the array. Note that the words are not always separated by spaces, and the array should not contain punctuation."
+      ],
+      "challengeSeed": [
+        "function splitify(str) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "splitify(\"Hello World,I-am code\");"
+      ],
+      "tests": [
+        "assert(code.match(/\\.split/g), 'message: Your code should use the <code>split</code> method.');",
+        "assert(JSON.stringify(splitify(\"Hello World,I-am code\")) === JSON.stringify([\"Hello\", \"World\", \"I\", \"am\", \"code\"]), 'message: <code>splitify(\"Hello World,I-am code\")</code> should return <code>[\"Hello\", \"World\", \"I\", \"am\", \"code\"]</code>.');",
+        "assert(JSON.stringify(splitify(\"Earth-is-our home\")) === JSON.stringify([\"Earth\", \"is\", \"our\", \"home\"]), 'message: <code>splitify(\"Earth-is-our home\")</code> should return <code>[\"Earth\", \"is\", \"our\", \"home\"]</code>.');",
+        "assert(JSON.stringify(splitify(\"This.is.a-sentence\")) === JSON.stringify([\"This\", \"is\", \"a\", \"sentence\"]), 'message: <code>splitify(\"This.is.a-sentence\")</code> should return <code>[\"This\", \"is\", \"a\", \"sentence\"]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [
+          "The regex pre-defined character class for non-alphanumerics is \\W."
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7daa367417b2b2512b6c",
+      "title": "Combine an Array into a String Using the join Method",
+      "description": [
+        "The <code>join</code> method is used to join the elements of an array together to create a string. It takes an argument for the delimiter that is used to separate the array elements in the string.",
+        "Here's an example:",
+        "<blockquote>var arr = [\"Hello\", \"World\"];<br>var str = arr.join(\" \");<br>// Sets str to \"Hello World\"</blockquote>",
+        "<hr>",
+        "Use the <code>join</code> method (among others) inside the <code>sentensify</code> function to make a sentence from the words in the string <code>str</code>. The function should return a string. For example, \"I-like-Star-Wars\" would be converted to \"I like Star Wars\". For this challenge, do not use the <code>replace</code> method."
+      ],
+      "challengeSeed": [
+        "function sentensify(str) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "sentensify(\"May-the-force-be-with-you\");"
+      ],
+      "tests": [
+        "assert(code.match(/\\.join/g), 'message: Your code should use the <code>join</code> method.');",
+        "assert(!code.match(/\\.replace/g), 'message: Your code should not use the <code>replace</code> method.');",
+        "assert(typeof sentensify(\"May-the-force-be-with-you\") === \"string\", 'message: <code>sentensify(\"May-the-force-be-with-you\")</code> should return a string.');",
+        "assert(sentensify(\"May-the-force-be-with-you\") === \"May the force be with you\", 'message: <code>sentensify(\"May-the-force-be-with-you\")</code> should return <code>\"May the force be with you\"</code>.');",
+        "assert(sentensify(\"The.force.is.strong.with.this.one\") === \"The force is strong with this one\", 'message: <code>sentensify(\"The.force.is.strong.with.this.one\")</code> should return <code>\"The force is strong with this one\"</code>.');",
+        "assert(sentensify(\"There,has,been,an,awakening\") === \"There has been an awakening\", 'message: <code>sentensify(\"There,has,been,an,awakening\")</code> should return <code>\"There has been an awakening\"</code>.');"
+      ],
+      "solutions": [],
+      "hints": [
+          "First try to split the given string before applying the join method."
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dab367417b2b2512b6d",
+      "title": "Apply Functional Programming to Convert Strings to URL Slugs",
+      "description": [
+        "The last several challenges covered a number of useful array and string methods that follow functional programming principles. We've also learned about <code>reduce</code>, which is a powerful method used to reduce problems to simpler forms. From computing averages to sorting, any array operation can be achieved by applying it. Recall that <code>map</code> and <code>filter</code> are special cases of <code>reduce</code>.",
+        "Let's combine what we've learned to solve a practical problem.",
+        "Many content management sites (CMS) have the titles of a post added to part of the URL for simple bookmarking purposes. For example, if you write a Medium post titled \"Stop Using Reduce\", it's likely the URL would have some form of the title string in it (\".../stop-using-reduce\"). You may have already noticed this on the freeCodeCamp site.",
+        "<hr>",
+        "Fill in the <code>urlSlug</code> function so it converts a string <code>title</code> and returns the hyphenated version for the URL. You can use any of the methods covered in this section, and don't use <code>replace</code>. Here are the requirements:",
+        "The input is a string with spaces and title-cased words",
+        "The output is a string with the spaces between words replaced by a hyphen (<code>-</code>)",
+        "The output should be all lower-cased letters",
+        "The output should not have any spaces"
+      ],
+      "challengeSeed": [
+        "// the global variable",
+        "var globalTitle = \"Winter Is Coming\";",
+        "",
+        "// Add your code below this line",
+        "function urlSlug(title) {",
+        "  ",
+        "  ",
+        "}",
+        "// Add your code above this line",
+        "",
+        "var winterComing = urlSlug(globalTitle); // Should be \"winter-is-coming\""
+      ],
+      "tests": [
+        "assert(globalTitle === \"Winter Is Coming\", 'message: The <code>globalTitle</code> variable should not change.');",
+        "assert(!code.match(/\\.replace/g), 'message: Your code should not use the <code>replace</code> method for this challenge.');",
+        "assert(urlSlug(\"Winter Is Coming\") === \"winter-is-coming\", 'message: <code>urlSlug(\"Winter Is Coming\")</code> should return <code>\"winter-is-coming\"</code>.');",
+        "assert(urlSlug(\" Winter Is  Coming\") === \"winter-is-coming\", 'message: <code>urlSlug(\" Winter Is  &nbsp;Coming\")</code> should return <code>\"winter-is-coming\"</code>.');",
+        "assert(urlSlug(\"A Mind Needs Books Like A Sword Needs A Whetstone\") === \"a-mind-needs-books-like-a-sword-needs-a-whetstone\", 'message: <code>urlSlug(\"A Mind Needs Books Like A Sword Needs A Whetstone\")</code> should return <code>\"a-mind-needs-books-like-a-sword-needs-a-whetstone\"</code>.');",
+        "assert(urlSlug(\"Hold The Door\") === \"hold-the-door\", 'message: <code>urlSlug(\"Hold The Door\")</code> should return <code>\"hold-the-door\"</code>.');"
+      ],
+      "solutions": [],
+      "hints": [
+          "When several spaces in a row are split by space, it puts an empty string in the array.",
+          "You can use the .toLowerCase() method to make the title all lower case."
+      ],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dab367417b2b2512b6e",
+      "title": "Use the every Method to Check that Every Element in an Array Meets a Criteria",
+      "description": [
+        "The <code>every</code> method works with arrays to check if <em>every</em> element passes a particular test. It returns a Boolean value - <code>true</code> if all values meet the criteria, <code>false</code> if not.",
+        "For example, the following code would check if every element in the <code>numbers</code> array is less than 10:",
+        "<blockquote>var numbers = [1, 5, 8, 0, 10, 11];<br>numbers.every(function(currentValue) {<br>&nbsp;&nbsp;return currentValue < 10;<br>});<br>// Returns false</blockquote>",
+        "<hr>",
+        "Use the <code>every</code> method inside the <code>checkPositive</code> function to check if every element in <code>arr</code> is positive. The function should return a Boolean value."
+      ],
+      "challengeSeed": [
+        "function checkPositive(arr) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "checkPositive([1, 2, 3, -4, 5]);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.every/g), 'message: Your code should use the <code>every</code> method.');",
+        "assert(!checkPositive([1, 2, 3, -4, 5]), 'message: <code>checkPositive([1, 2, 3, -4, 5])</code> should return <code>false</code>.');",
+        "assert(checkPositive([1, 2, 3, 4, 5]), 'message: <code>checkPositive([1, 2, 3, 4, 5])</code> should return <code>true</code>.');",
+        "assert(!checkPositive([1, -2, 3, -4, 5]), 'message: <code>checkPositive([1, -2, 3, -4, 5])</code> should return <code>false</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dab367417b2b2512b6f",
+      "title": "Use the some Method to Check that Any Elements in an Array Meet a Criteria",
+      "description": [
+        "The <code>some</code> method works with arrays to check if <em>any</em> element passes a particular test. It returns a Boolean value - <code>true</code> if any of the values meet the criteria, <code>false</code> if not.",
+        "For example, the following code would check if any element in the <code>numbers</code> array is less than 10:",
+        "<blockquote>var numbers = [10, 50, 8, 220, 110, 11];<br>numbers.some(function(currentValue) {<br>&nbsp;&nbsp;return currentValue < 10;<br>});<br>// Returns true</blockquote>",
+        "<hr>",
+        "Use the <code>some</code> method inside the <code>checkPositive</code> function to check if any element in <code>arr</code> is positive. The function should return a Boolean value."
+      ],
+      "challengeSeed": [
+        "function checkPositive(arr) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "checkPositive([1, 2, 3, -4, 5]);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.some/g), 'message: Your code should use the <code>some</code> method.');",
+        "assert(checkPositive([1, 2, 3, -4, 5]), 'message: <code>checkPositive([1, 2, 3, -4, 5])</code> should return <code>true</code>.');",
+        "assert(checkPositive([1, 2, 3, 4, 5]), 'message: <code>checkPositive([1, 2, 3, 4, 5])</code> should return <code>true</code>.');",
+        "assert(!checkPositive([-1, -2, -3, -4, -5]), 'message: <code>checkPositive([-1, -2, -3, -4, -5])</code> should return <code>false</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dab367417b2b2512b70",
+      "title": "Introduction to Currying and Partial Application",
+      "description": [
+        "The <code>arity</code> of a function is the number of arguments it requires. <code>Currying</code> a function means to convert a function of N <code>arity</code> into N functions of <code>arity</code> 1.",
+        "In other words, it restructures a function so it takes one argument, then returns another function that takes the next argument, and so on.",
+        "Here's an example:",
+        "<blockquote>//Un-curried function<br>function unCurried(x, y, z) {<br>&nbsp;&nbsp;return x + y + z;<br>}<br><br>//Curried function<br>function curried(x) {<br>&nbsp;&nbsp;return function(y) {<br>&nbsp;&nbsp;&nbsp;&nbsp;return x + y;<br>&nbsp;&nbsp;}<br>}<br>curried(1)(2) // Returns 3</blockquote>",
+        "This is useful in your program if you can't supply all the arguments to a function at one time. You can save each function call into a variable, which will hold the returned function reference that takes the next argument when it's available. Here's an example using the <code>curried</code> function in the example above:",
+        "<blockquote>// Call a curried function in parts:<br>var funcForY = curried(1);<br>var funcForZ = funcForY(2);<br>console.log(funcForZ(3)); // Prints 6</blockquote>",
+        "Similarly, <code>partial application</code> can be described as applying a few arguments to a function at a time and returning another function that is applied to more arguments.",
+        "Here's an example:",
+        "<blockquote>//Impartial function<br>function impartial(x, y, z) {<br>&nbsp;&nbsp;return x + y + z;<br>}<br>var partialFn = impartial.bind(this, 1, 2);<br>partialFn(10); // Returns 13</blockquote>",
+        "<hr>",
+        "Fill in the body of the <code>add</code> function so it uses currying to add parameters <code>x</code>, <code>y</code>, and <code>z</code>."
+      ],
+      "challengeSeed": [
+        "function add(x) {",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "}",
+        "add(10)(20)(30);"
+      ],
+      "tests": [
+        "assert(add(10)(20)(30) === 60, 'message: <code>add(10)(20)(30)</code> should return <code>60</code>.');",
+        "assert(add(1)(2)(3) === 6, 'message: <code>add(1)(2)(3)</code> should return <code>6</code>.');",
+        "assert(add(11)(22)(33) === 66, 'message: <code>add(11)(22)(33)</code> should return <code>66</code>.');",
+        "assert(code.match(/[xyz]\\s*?\\+\\s*?[xyz]\\s*?\\+\\s*?[xyz]/g), 'message: Your code should include a final statement that returns <code>x + y + z</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting.json
new file mode 100644
index 0000000000..885c40291e
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/intermediate-algorithm-scripting.json
@@ -0,0 +1,1418 @@
+{
+  "name": "Intermediate Algorithm Scripting",
+  "order": 8,
+  "time": "50 hours",
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "id": "a3566b1109230028080c9345",
+      "title": "Sum All Numbers in a Range",
+      "description": [
+        "We'll pass you an array of two numbers. Return the sum of those two numbers plus the sum of all the numbers between them.",
+        "The lowest number will not always come first.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function sumAll(arr) {",
+        "  return 1;",
+        "}",
+        "",
+        "sumAll([1, 4]);"
+      ],
+      "hints": [
+        "Use Math.max() to find the maximum value of two numbers.",
+        "Use Math.min() to find the minimum value of two numbers.",
+        "Remember to that you must add all the numbers in between so this would require a way to get those numbers."
+      ],
+      "solutions": [
+        "function sumAll(arr) {\n  var sum = 0;\n  arr.sort(function(a,b) {return a-b;});\n  for (var i = arr[0]; i <= arr[1]; i++) {\n    sum += i; \n  }\n  return sum;\n}"
+      ],
+      "tests": [
+        "assert(typeof sumAll([1, 4]) === 'number', 'message: <code>sumAll([1, 4])</code> should return a number.');",
+        "assert.deepEqual(sumAll([1, 4]), 10, 'message: <code>sumAll([1, 4])</code> should return 10.');",
+        "assert.deepEqual(sumAll([4, 1]), 10, 'message: <code>sumAll([4, 1])</code> should return 10.');",
+        "assert.deepEqual(sumAll([5, 10]), 45, 'message: <code>sumAll([5, 10])</code> should return 45.');",
+        "assert.deepEqual(sumAll([10, 5]), 45, 'message: <code>sumAll([10, 5])</code> should return 45.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Math.max()",
+        "Math.min()",
+        "Array.prototype.reduce()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Suma todos los números en un rango",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Additionner tous les nombres d'une série",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a5de63ebea8dbee56860f4f2",
+      "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.",
+        "<strong>Note</strong><br>You can return the array with its elements in any order."
+      ],
+      "challengeSeed": [
+        "function diffArray(arr1, arr2) {",
+        "  var newArr = [];",
+        "  // Same, same; but different.",
+        "  return newArr;",
+        "}",
+        "",
+        "diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]);"
+      ],
+      "solutions": [
+        "function diffArray(arr1, arr2) {\n  var newArr = [];\n  var h1 = Object.create(null);\n  arr1.forEach(function(e) {\n    h1[e] = e;\n  });\n  \n  var h2 = Object.create(null);\n  arr2.forEach(function(e) {\n    h2[e] = e;\n  });\n  \n  Object.keys(h1).forEach(function(e) {\n     if (!(e in h2)) newArr.push(h1[e]);\n  });\n  Object.keys(h2).forEach(function(e) {\n     if (!(e in h1)) newArr.push(h2[e]);\n  });\n  // Same, same; but different.\n  return newArr;\n}"
+      ],
+      "tests": [
+        "assert(typeof diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]) === \"object\", 'message: <code>diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5])</code> should return an array.');",
+        "assert.sameMembers(diffArray([\"diorite\", \"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]), [\"pink wool\"], 'message: <code>[\"diorite\", \"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]</code> should return <code>[\"pink wool\"]</code>.');",
+        "assert(diffArray([\"diorite\", \"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]).length === 1, 'message: <code>[\"diorite\", \"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]</code> should return an array with one item.');",
+        "assert.sameMembers(diffArray([\"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]), [\"diorite\", \"pink wool\"], 'message: <code>[\"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]</code> should return <code>[\"diorite\", \"pink wool\"]</code>.');",
+        "assert(diffArray([\"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]).length === 2, 'message: <code>[\"andesite\", \"grass\", \"dirt\", \"pink wool\", \"dead shrub\"], [\"diorite\", \"andesite\", \"grass\", \"dirt\", \"dead shrub\"]</code> should return an array with two items.');",
+        "assert.sameMembers(diffArray([\"andesite\", \"grass\", \"dirt\", \"dead shrub\"], [\"andesite\", \"grass\", \"dirt\", \"dead shrub\"]), [], 'message: <code>[\"andesite\", \"grass\", \"dirt\", \"dead shrub\"], [\"andesite\", \"grass\", \"dirt\", \"dead shrub\"]</code> should return <code>[]</code>.');",
+        "assert(diffArray([\"andesite\", \"grass\", \"dirt\", \"dead shrub\"], [\"andesite\", \"grass\", \"dirt\", \"dead shrub\"]).length === 0, 'message: <code>[\"andesite\", \"grass\", \"dirt\", \"dead shrub\"], [\"andesite\", \"grass\", \"dirt\", \"dead shrub\"]</code> should return an empty array.');",
+        "assert.sameMembers(diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]), [4], 'message: <code>[1, 2, 3, 5], [1, 2, 3, 4, 5]</code> should return <code>[4]</code>.');",
+        "assert(diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]).length  === 1, 'message: <code>[1, 2, 3, 5], [1, 2, 3, 4, 5]</code> should return an array with one item.');",
+        "assert.sameMembers(diffArray([1, \"calf\", 3, \"piglet\"], [1, \"calf\", 3, 4]), [\"piglet\", 4], 'message: <code>[1, \"calf\", 3, \"piglet\"], [1, \"calf\", 3, 4]</code> should return <code>[\"piglet\", 4]</code>.');",
+        "assert(diffArray([1, \"calf\", 3, \"piglet\"], [1, \"calf\", 3, 4]).length === 2, 'message: <code>[1, \"calf\", 3, \"piglet\"], [1, \"calf\", 3, 4]</code> should return an array with two items.');",
+        "assert.sameMembers(diffArray([], [\"snuffleupagus\", \"cookie monster\", \"elmo\"]), [\"snuffleupagus\", \"cookie monster\", \"elmo\"], 'message: <code>[], [\"snuffleupagus\", \"cookie monster\", \"elmo\"]</code> should return <code>[\"snuffleupagus\", \"cookie monster\", \"elmo\"]</code>.');",
+        "assert(diffArray([], [\"snuffleupagus\", \"cookie monster\", \"elmo\"]).length === 3, 'message: <code>[], [\"snuffleupagus\", \"cookie monster\", \"elmo\"]</code> should return an array with three items.');",
+        "assert.sameMembers(diffArray([1, \"calf\", 3, \"piglet\"], [7, \"filly\"]), [1, \"calf\", 3, \"piglet\", 7, \"filly\"], 'message: <code>[1, \"calf\", 3, \"piglet\"], [7, \"filly\"]</code> should return <code>[1, \"calf\", 3, \"piglet\", 7, \"filly\"]</code>.');",
+        "assert(diffArray([1, \"calf\", 3, \"piglet\"], [7, \"filly\"]).length === 6, 'message: <code>[1, \"calf\", 3, \"piglet\"], [7, \"filly\"]</code> should return an array with six items.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Comparison Operators",
+        "Array.prototype.slice()",
+        "Array.prototype.filter()",
+        "Array.prototype.indexOf()",
+        "Array.prototype.concat()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Obtén la diferencia entre dos vectores",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Comparer 2 arrays",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "aaa48de84e1ecc7c742e1124",
+      "title": "Check for Palindromes",
+      "description": [
+        "Return <code>true</code> if the given string is a palindrome. Otherwise, return <code>false</code>.",
+        "A <dfn>palindrome</dfn> is a word or sentence that's spelled the same way both forward and backward, ignoring punctuation, case, and spacing.",
+        "<strong>Note</strong><br>You'll need to remove <strong>all non-alphanumeric characters</strong> (punctuation, spaces and symbols) and turn everything into the same case (lower or upper case) in order to check for palindromes.",
+        "We'll pass strings with varying formats, such as <code>\"racecar\"</code>, <code>\"RaceCar\"</code>, and <code>\"race CAR\"</code> among others.",
+        "We'll also pass strings with special symbols, such as <code>\"2A3*3a2\"</code>, <code>\"2A3  3a2\"</code>, and <code>\"2_A3*3#A2\"</code>.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function palindrome(str) {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "",
+        "",
+        "palindrome(\"eye\");"
+      ],
+      "tests": [
+        "assert(typeof palindrome(\"eye\") === \"boolean\", 'message: <code>palindrome(\"eye\")</code> should return a boolean.');",
+        "assert(palindrome(\"eye\") === true, 'message: <code>palindrome(\"eye\")</code> should return true.');",
+        "assert(palindrome(\"_eye\") === true, 'message: <code>palindrome(\"_eye\")</code> should return true.');",
+        "assert(palindrome(\"race car\") === true, 'message: <code>palindrome(\"race car\")</code> should return true.');",
+        "assert(palindrome(\"not a palindrome\") === false, 'message: <code>palindrome(\"not a palindrome\")</code> should return false.');",
+        "assert(palindrome(\"A man, a plan, a canal. Panama\") === true, 'message: <code>palindrome(\"A man, a plan, a canal. Panama\")</code> should return true.');",
+        "assert(palindrome(\"never odd or even\") === true, 'message: <code>palindrome(\"never odd or even\")</code> should return true.');",
+        "assert(palindrome(\"nope\") === false, 'message: <code>palindrome(\"nope\")</code> should return false.');",
+        "assert(palindrome(\"almostomla\") === false, 'message: <code>palindrome(\"almostomla\")</code> should return false.');",
+        "assert(palindrome(\"My age is 0, 0 si ega ym.\") === true, 'message: <code>palindrome(\"My age is 0, 0 si ega ym.\")</code> should return true.');",
+        "assert(palindrome(\"1 eye for of 1 eye.\") === false, 'message: <code>palindrome(\"1 eye for of 1 eye.\")</code> should return false.');",
+        "assert(palindrome(\"0_0 (: /-\\ :) 0-0\") === true, 'message: <code>palindrome(\"0_0 (: /-\\ :) 0-0\")</code> should return true.');",
+        "assert(palindrome(\"five|\\_/|four\") === false, 'message: <code>palindrome(\"five|\\_/|four\")</code> should return false.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function palindrome(str) {\n  var string = str.toLowerCase().split(/[^A-Za-z0-9]/gi).join('');\n  var aux = string.split('');\n  if (aux.join('') === aux.reverse().join('')){\n    return true;\n  }\n\n  return false;\n}"
+      ],
+      "MDNlinks": [
+        "String.prototype.replace()",
+        "String.prototype.toLowerCase()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Verifica si es palíndromo",
+          "description": [
+            "Crea una función que devuelva <code>true</code> si una cadena de texto dada es un palíndromo, y que devuelva <code>false</code> en caso contrario",
+            "Un palíndromo es una palabra u oración que se escribe de la misma forma en ambos sentidos, sin tomar en cuenta signos de puntuación, espacios y sin distinguir entre mayúsculas y minúsculas.",
+            "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 <code>\"2A3*3a2\"</code>, <code>\"2A3 3a2\"</code>, y <code>\"2_A3*3#A2\"</code>.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Procure por Palíndromos",
+          "description": [
+            "Retorne <code>true</code> se o texto fornecida é um palíndromo. Caso contrário, retorne <code>false</code>.",
+            "Um <dfn>palíndromo</dfn> é uma palavra ou sentença que é soletrada da mesma maneira tanto para a frente quanto para trás, ignorando pontuação, maiúsculas e minúsculas, e espaçamento.",
+            "<strong>Nota</strong><br>Você precisará remover <strong>todos caracteres não alfanuméricos</strong> (pontuação, espaços e símbolos) e transformar todas as letras em maiúsculas ou minúsculas para procurar por palíndromos.",
+            "Nós vamos passar textos de vários formatos, tais como <code>\"racecar\"</code>, <code>\"RaceCar\"</code> e <code>\"race CAR\"</code> entre outras.",
+            "Nós também vamos passar textos com símbolos especiais, tais como <code>\"2A3*3a2\"</code>, <code>\"2A3  3a2\"</code> e <code>\"2_A3*3#A2\"</code>.",
+            "Lembre-se de usar <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se você ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a39963a4c10bc8b4d4f06d7e",
+      "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.",
+        "<strong>Note</strong><br> You have to use the <code>arguments</code> object.",
+        "Remember to use <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function destroyer(arr) {",
+        "  // Remove all the values",
+        "  return arr;",
+        "}",
+        "",
+        "destroyer([1, 2, 3, 1, 2, 3], 2, 3);"
+      ],
+      "tests": [
+        "assert.deepEqual(destroyer([1, 2, 3, 1, 2, 3], 2, 3), [1, 1], 'message: <code>destroyer([1, 2, 3, 1, 2, 3], 2, 3)</code> should return <code>[1, 1]</code>.');",
+        "assert.deepEqual(destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3), [1, 5, 1], 'message: <code>destroyer([1, 2, 3, 5, 1, 2, 3], 2, 3)</code> should return <code>[1, 5, 1]</code>.');",
+        "assert.deepEqual(destroyer([3, 5, 1, 2, 2], 2, 3, 5), [1], 'message: <code>destroyer([3, 5, 1, 2, 2], 2, 3, 5)</code> should return <code>[1]</code>.');",
+        "assert.deepEqual(destroyer([2, 3, 2, 3], 2, 3), [], 'message: <code>destroyer([2, 3, 2, 3], 2, 3)</code> should return <code>[]</code>.');",
+        "assert.deepEqual(destroyer([\"tree\", \"hamburger\", 53], \"tree\", 53), [\"hamburger\"], 'message: <code>destroyer([\"tree\", \"hamburger\", 53], \"tree\", 53)</code> should return <code>[\"hamburger\"]</code>.');",
+        "assert.deepEqual(destroyer([\"possum\", \"trollo\", 12, \"safari\", \"hotdog\", 92, 65, \"grandma\", \"bugati\", \"trojan\", \"yacht\"], \"yacht\", \"possum\", \"trollo\", \"safari\", \"hotdog\", \"grandma\", \"bugati\", \"trojan\"), [12,92,65], 'message: <code>destroyer([\"possum\", \"trollo\", 12, \"safari\", \"hotdog\", 92, 65, \"grandma\", \"bugati\", \"trojan\", \"yacht\"], \"yacht\", \"possum\", \"trollo\", \"safari\", \"hotdog\", \"grandma\", \"bugati\", \"trojan\")</code> should return <code>[12,92,65]</code>.');"
+      ],
+      "type": "bonfire",
+      "isRequired": true,
+      "solutions": [
+        "function destroyer(arr) {\n  var hash = Object.create(null);\n  [].slice.call(arguments, 1).forEach(function(e) {\n    hash[e] = true;\n  });\n  // Remove all the values\n  return arr.filter(function(e) { return !(e in hash);});\n}\n\ndestroyer([1, 2, 3, 1, 2, 3], 2, 3);\n"
+      ],
+      "MDNlinks": [
+        "Arguments object",
+        "Array.prototype.filter()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Buscar y Destruir",
+          "description": [
+            "Se te proveerá un arreglo inicial (el primer argumento en la función <code>destroyer</code>), 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Buscar e Destruir",
+          "description": [
+            "Será fornecido a você uma matriz inicial (o primeiro argumento da função destroyer), seguido por um ou mais argumentos. Remova todos os elementos da matriz inicial que possuem o mesmo valor desses argumentos.",
+            "<strong>Nota</strong><br> Você precisa usar o objeto <code>arguments</code>.",
+            "Lembre-se de usar <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se você ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a8e512fbe388ac2f9198f0fa",
+      "title": "Wherefore art thou",
+      "description": [
+        "Make a function that looks through an array of objects (first argument) and returns an array of all objects that have matching name and value pairs (second argument). Each name 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 <code>[{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }]</code>, and the second argument is <code>{ last: \"Capulet\" }</code>, then you must return the third object from the array (the first argument), because it contains the name and its value, that was passed on as the second argument.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Write your own code."
+      ],
+      "challengeSeed": [
+        "function whatIsInAName(collection, source) {",
+        "  // What's in a name?",
+        "  var arr = [];",
+        "  // Only change code below this line",
+        "  ",
+        "  ",
+        "  // Only change code above this line",
+        "  return arr;",
+        "}",
+        "",
+        "whatIsInAName([{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }], { last: \"Capulet\" });"
+      ],
+      "solutions": [
+        "function whatIsInAName(collection, source) {\n  var arr = [];\n  var keys = Object.keys(source);\n  collection.forEach(function(e) {\n    if(keys.every(function(key) {return e[key] === source[key];})) {\n      arr.push(e);  \n    }\n  });\n  return arr;\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(whatIsInAName([{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }], { last: \"Capulet\" }), [{ first: \"Tybalt\", last: \"Capulet\" }], 'message: <code>whatIsInAName([{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }], { last: \"Capulet\" })</code> should return <code>[{ first: \"Tybalt\", last: \"Capulet\" }]</code>.');",
+        "assert.deepEqual(whatIsInAName([{ \"apple\": 1 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2 }], { \"apple\": 1 }), [{ \"apple\": 1 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2 }], 'message: <code>whatIsInAName([{ \"apple\": 1 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2 }], { \"apple\": 1 })</code> should return <code>[{ \"apple\": 1 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2 }]</code>.');",
+        "assert.deepEqual(whatIsInAName([{ \"apple\": 1, \"bat\": 2 }, { \"bat\": 2 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }], { \"apple\": 1, \"bat\": 2 }), [{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }], 'message: <code>whatIsInAName([{ \"apple\": 1, \"bat\": 2 }, { \"bat\": 2 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }], { \"apple\": 1, \"bat\": 2 })</code> should return <code>[{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }]</code>.');",
+        "assert.deepEqual(whatIsInAName([{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }], { \"apple\": 1, \"cookie\": 2 }), [{ \"apple\": 1, \"bat\": 2, \"cookie\": 2 }], 'message: <code>whatIsInAName([{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }], { \"apple\": 1, \"cookie\": 2 })</code> should return <code>[{ \"apple\": 1, \"bat\": 2, \"cookie\": 2 }]</code>.');",
+        "assert.deepEqual(whatIsInAName([{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }, {\"bat\":2}], { \"apple\": 1, \"bat\": 2 }), [{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1, \"bat\": 2, \"cookie\":2 }], 'message: <code>whatIsInAName([{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1 }, { \"apple\": 1, \"bat\": 2, \"cookie\": 2 }, { \"bat\":2 }], { \"apple\": 1, \"bat\": 2 })</code> should return <code>[{ \"apple\": 1, \"bat\": 2 }, { \"apple\": 1, \"bat\": 2, \"cookie\":2 }]</code>.');",
+        "assert.deepEqual(whatIsInAName([{ \"a\": 1, \"b\": 2, \"c\": 3 }], { \"a\": 1, \"b\": 9999, \"c\": 3 }), [], 'message: <code>whatIsInAName([{\"a\": 1, \"b\": 2, \"c\": 3}], {\"a\": 1, \"b\": 9999, \"c\": 3})</code> should return <code>[]</code>');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Global Object",
+        "Object.prototype.hasOwnProperty()",
+        "Object.keys()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "¿Dónde estás que no te veo?",
+          "description": [
+            "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 <code>[{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }]</code>, y el segundo argumento es <code>{ last: \"Capulet\" }</code>, 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "O Roméo! Roméo!",
+          "description": [
+            "É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 <code>[{ first: \"Romeo\", last: \"Montague\" }, { first: \"Mercutio\", last: null }, { first: \"Tybalt\", last: \"Capulet\" }]</code>, et le second argument est <code>{ last: \"Capulet\" }</code>, 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a103376db3ba46b2d50db289",
+      "title": "Spinal Tap Case",
+      "description": [
+        "Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function spinalCase(str) {",
+        "  // \"It's such a fine line between stupid, and clever.\"",
+        "  // --David St. Hubbins",
+        "  return str;",
+        "}",
+        "",
+        "spinalCase('This Is Spinal Tap');"
+      ],
+      "solutions": [
+        "function spinalCase(str) {\n  // \"It's such a fine line between stupid, and clever.\"\n  // --David St. Hubbins\n  str = str.replace(/([a-z](?=[A-Z]))/g, '$1 ');\n  return str.toLowerCase().replace(/\\ |\\_/g, '-');\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(spinalCase(\"This Is Spinal Tap\"), \"this-is-spinal-tap\", 'message: <code>spinalCase(\"This Is Spinal Tap\")</code> should return <code>\"this-is-spinal-tap\"</code>.');",
+        "assert.strictEqual(spinalCase('thisIsSpinalTap'), \"this-is-spinal-tap\", 'message: <code>spinalCase(\"thisIsSpinal<wbr>Tap\")</code> should return <code>\"this-is-spinal-tap\"</code>.');",
+        "assert.strictEqual(spinalCase(\"The_Andy_Griffith_Show\"), \"the-andy-griffith-show\", 'message: <code>spinalCase(\"The_Andy_<wbr>Griffith_Show\")</code> should return <code>\"the-andy-griffith-show\"</code>.');",
+        "assert.strictEqual(spinalCase(\"Teletubbies say Eh-oh\"), \"teletubbies-say-eh-oh\", 'message: <code>spinalCase(\"Teletubbies say Eh-oh\")</code> should return <code>\"teletubbies-say-eh-oh\"</code>.');",
+        "assert.strictEqual(spinalCase(\"AllThe-small Things\"), \"all-the-small-things\", 'message: <code>spinalCase(\"AllThe-small Things\")</code> should return <code>\"all-the-small-things\"</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "RegExp",
+        "String.prototype.replace()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "separado-por-guiones",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Trait d'union",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a7f4d8f2483413a6ce226cac",
+      "title": "Roman Numeral Converter",
+      "description": [
+        "Convert the given number into a roman numeral.",
+        "All <a href=\"http://www.mathsisfun.com/roman-numerals.html\" target=\"_blank\">roman numerals</a> answers should be provided in upper-case.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function convertToRoman(num) {",
+        " return num;",
+        "}",
+        "",
+        "convertToRoman(36);"
+      ],
+      "solutions": [
+        "function convertToRoman(num) {\n  var ref = [['M', 1000], ['CM', 900], ['D', 500], ['CD', 400], ['C', 100], ['XC', 90], ['L', 50], ['XL', 40], ['X', 10], ['IX', 9], ['V', 5], ['IV', 4], ['I', 1]];\n  var res = [];\n  ref.forEach(function(p) {\n    while (num >= p[1]) {\n      res.push(p[0]);\n      num -= p[1];\n    }\n  });\n  return res.join('');\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(convertToRoman(2), \"II\", 'message: <code>convertToRoman(2)</code> should return \"II\".');",
+        "assert.deepEqual(convertToRoman(3), \"III\", 'message: <code>convertToRoman(3)</code> should return \"III\".');",
+        "assert.deepEqual(convertToRoman(4), \"IV\", 'message: <code>convertToRoman(4)</code> should return \"IV\".');",
+        "assert.deepEqual(convertToRoman(5), \"V\", 'message: <code>convertToRoman(5)</code> should return \"V\".');",
+        "assert.deepEqual(convertToRoman(9), \"IX\", 'message: <code>convertToRoman(9)</code> should return \"IX\".');",
+        "assert.deepEqual(convertToRoman(12), \"XII\", 'message: <code>convertToRoman(12)</code> should return \"XII\".');",
+        "assert.deepEqual(convertToRoman(16), \"XVI\", 'message: <code>convertToRoman(16)</code> should return \"XVI\".');",
+        "assert.deepEqual(convertToRoman(29), \"XXIX\", 'message: <code>convertToRoman(29)</code> should return \"XXIX\".');",
+        "assert.deepEqual(convertToRoman(44), \"XLIV\", 'message: <code>convertToRoman(44)</code> should return \"XLIV\".');",
+        "assert.deepEqual(convertToRoman(45), \"XLV\", 'message: <code>convertToRoman(45)</code> should return \"XLV\"');",
+        "assert.deepEqual(convertToRoman(68), \"LXVIII\", 'message: <code>convertToRoman(68)</code> should return \"LXVIII\"');",
+        "assert.deepEqual(convertToRoman(83), \"LXXXIII\", 'message: <code>convertToRoman(83)</code> should return \"LXXXIII\"');",
+        "assert.deepEqual(convertToRoman(97), \"XCVII\", 'message: <code>convertToRoman(97)</code> should return \"XCVII\"');",
+        "assert.deepEqual(convertToRoman(99), \"XCIX\", 'message: <code>convertToRoman(99)</code> should return \"XCIX\"');",
+        "assert.deepEqual(convertToRoman(400), \"CD\", 'message: <code>convertToRoman(400)</code> should return \"CD\"');",
+        "assert.deepEqual(convertToRoman(500), \"D\", 'message: <code>convertToRoman(500)</code> should return \"D\"');",
+        "assert.deepEqual(convertToRoman(501), \"DI\", 'message: <code>convertToRoman(501)</code> should return \"DI\"');",
+        "assert.deepEqual(convertToRoman(649), \"DCXLIX\", 'message: <code>convertToRoman(649)</code> should return \"DCXLIX\"');",
+        "assert.deepEqual(convertToRoman(798), \"DCCXCVIII\", 'message: <code>convertToRoman(798)</code> should return \"DCCXCVIII\"');",
+        "assert.deepEqual(convertToRoman(891), \"DCCCXCI\", 'message: <code>convertToRoman(891)</code> should return \"DCCCXCI\"');",
+        "assert.deepEqual(convertToRoman(1000), \"M\", 'message: <code>convertToRoman(1000)</code> should return \"M\"');",
+        "assert.deepEqual(convertToRoman(1004), \"MIV\", 'message: <code>convertToRoman(1004)</code> should return \"MIV\"');",
+        "assert.deepEqual(convertToRoman(1006), \"MVI\", 'message: <code>convertToRoman(1006)</code> should return \"MVI\"');",
+        "assert.deepEqual(convertToRoman(1023), \"MXXIII\", 'message: <code>convertToRoman(1023)</code> should return \"MXXIII\"');",
+        "assert.deepEqual(convertToRoman(2014), \"MMXIV\", 'message: <code>convertToRoman(2014)</code> should return \"MMXIV\"');",
+        "assert.deepEqual(convertToRoman(3999), \"MMMCMXCIX\", 'message: <code>convertToRoman(3999)</code> should return \"MMMCMXCIX\"');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Roman Numerals",
+        "Array.prototype.splice()",
+        "Array.prototype.indexOf()",
+        "Array.prototype.join()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Convertior de números romanos",
+          "description": [
+            "Convierte el número dado en numeral romano.",
+            "Todos los <a href=\"http://www.mathsisfun.com/roman-numerals.html\" target=\"_blank\">numerales romanos</a> en las respuestas deben estar en mayúsculas.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Convertir en chiffres romains",
+          "description": [
+            "Convertis le nombre donné en chiffres romains.",
+            "Tous les <a href=\"http://www.mathsisfun.com/roman-numerals.html\" target=\"_blank\">chiffres romains</a> doivent être en lettres capitales.",
+            "N'oublie pas d'utiliser <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "56533eb9ac21ba0edf2244e2",
+      "title": "Caesars Cipher",
+      "description": [
+        "One of the simplest and most widely known <dfn>ciphers</dfn> is a <code>Caesar cipher</code>, also known as a <code>shift cipher</code>. In a <code>shift cipher</code> the meanings of the letters are shifted by some set amount.",
+        "A common modern use is the <a href=\"https://en.wikipedia.org/wiki/ROT13\" target='_blank'>ROT13</a> cipher, where the values of the letters are shifted by 13 places. Thus 'A' &harr; 'N', 'B' &harr;  'O' and so on.",
+        "Write a function which takes a <a href=\"https://en.wikipedia.org/wiki/ROT13\" target='_blank'>ROT13</a> 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function rot13(str) { // LBH QVQ VG!",
+        "  ",
+        "  return str;",
+        "}",
+        "",
+        "// Change the inputs below to test",
+        "rot13(\"SERR PBQR PNZC\");"
+      ],
+      "tail": [
+        ""
+      ],
+      "solutions": [
+        "var lookup = {\n  'A': 'N','B': 'O','C': 'P','D': 'Q',\n  'E': 'R','F': 'S','G': 'T','H': 'U',\n  'I': 'V','J': 'W','K': 'X','L': 'Y',\n  'M': 'Z','N': 'A','O': 'B','P': 'C',\n  'Q': 'D','R': 'E','S': 'F','T': 'G',\n  'U': 'H','V': 'I','W': 'J','X': 'K',\n  'Y': 'L','Z': 'M' \n};\n\nfunction rot13(encodedStr) {\n  var codeArr = encodedStr.split(\"\");  // String to Array\n  var decodedArr = []; // Your Result goes here\n  // Only change code below this line\n  \n  decodedArr = codeArr.map(function(letter) {\n    if(lookup.hasOwnProperty(letter)) {\n      letter = lookup[letter];\n    }\n    return letter;\n  });\n\n  // Only change code above this line\n  return decodedArr.join(\"\"); // Array to String\n}"
+      ],
+      "tests": [
+        "assert(rot13(\"SERR PBQR PNZC\") === \"FREE CODE CAMP\", 'message: <code>rot13(\"SERR PBQR PNZC\")</code> should decode to <code>FREE CODE CAMP</code>');",
+        "assert(rot13(\"SERR CVMMN!\") === \"FREE PIZZA!\", 'message: <code>rot13(\"SERR CVMMN!\")</code> should decode to <code>FREE PIZZA!</code>');",
+        "assert(rot13(\"SERR YBIR?\") === \"FREE LOVE?\", 'message: <code>rot13(\"SERR YBIR?\")</code> should decode to <code>FREE LOVE?</code>');",
+        "assert(rot13(\"GUR DHVPX OEBJA SBK WHZCF BIRE GUR YNML QBT.\") === \"THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.\", 'message: <code>rot13(\"GUR DHVPX OEBJA SBK WHZCF BIRE GUR YNML QBT.\")</code> should decode to <code>THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.</code>');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "String.prototype.charCodeAt()",
+        "String.fromCharCode()"
+      ],
+      "challengeType": 5,
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "translations": {
+        "es": {
+          "title": "Cifrado César",
+          "description": [
+            "Uno de los <dfn>cifrados</dfn> más simples y ampliamente conocidos es el <code>cifrado César</code>, también llamado <code>cifrado por desplazamiento</code>. En un <code>cifrado por desplazamiento</code> los significados de las letras se desplazan por una cierta cantidad.",
+            "Un uso moderno común es el cifrado <a href=\"https://es.wikipedia.org/wiki/ROT13\" target='_blank'>ROT13</a> , donde los valores de las letras se desplazan 13 espacios. De esta forma 'A' &harr; 'N', 'B' &harr;  'O' y así.",
+            "Crea una función que tome una cadena de texto cifrada en <a href=\"https://es.wikipedia.org/wiki/ROT13\" target='_blank'>ROT13</a> 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "pt-br": {
+          "title": "Cifra de César",
+          "description": [
+            "Uma das mais simples e mais conhecidas <dfn>cifras</dfn> é a <code>cifra de César</code>, também conhecida como <code>cifra de troca</code>. Em uma <code>cifra de troca</code> os significados das letras são deslocados por um determinado valor.",
+            "Um uso moderno comum é a cifra <a href=\"https://en.wikipedia.org/wiki/ROT13\" target='_blank'>ROT13</a>, aonde os valores das letras são deslocados por 13 lugares. Logo 'A' &harr; 'N', 'B' &harr;  'O' e assim por diante.",
+            "Escreva uma função que recebe um texto criptografado com <a href=\"https://en.wikipedia.org/wiki/ROT13\" target='_blank'>ROT13</a> como entrada e retorna o texto desencriptado.",
+            "Todas as letras serão maiúsculas. Não transforme nenhum caracter não alfanuméricos (como espaços, pontuação), mas passe-os adiante.",
+            "Lembre-se de usar <a href=\"http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514\" target=\"_blank\">Ler-Pesquisar-Perguntar</a> se você ficar travado. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "aa7697ea2477d1316795783b",
+      "title": "Pig Latin",
+      "description": [
+        "Translate the provided string to pig latin.",
+        "<a href=\"http://en.wikipedia.org/wiki/Pig_Latin\" target=\"_blank\">Pig Latin</a> 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function translatePigLatin(str) {",
+        "  return str;",
+        "}",
+        "",
+        "translatePigLatin(\"consonant\");"
+      ],
+      "solutions": [
+        "function translatePigLatin(str) {\n  if (isVowel(str.charAt(0))) return str + \"way\";\n  var front = [];\n  str = str.split('');\n  while (str.length && !isVowel(str[0])) {\n    front.push(str.shift());\n  }\n  return [].concat(str, front).join('') + 'ay';\n}\n\nfunction isVowel(c) {\n  return ['a', 'e', 'i', 'o', 'u'].indexOf(c.toLowerCase()) !== -1;\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(translatePigLatin(\"california\"), \"aliforniacay\", 'message: <code>translatePigLatin(\"california\")</code> should return \"aliforniacay\".');",
+        "assert.deepEqual(translatePigLatin(\"paragraphs\"), \"aragraphspay\", 'message: <code>translatePigLatin(\"paragraphs\")</code> should return \"aragraphspay\".');",
+        "assert.deepEqual(translatePigLatin(\"glove\"), \"oveglay\", 'message: <code>translatePigLatin(\"glove\")</code> should return \"oveglay\".');",
+        "assert.deepEqual(translatePigLatin(\"algorithm\"), \"algorithmway\", 'message: <code>translatePigLatin(\"algorithm\")</code> should return \"algorithmway\".');",
+        "assert.deepEqual(translatePigLatin(\"eight\"), \"eightway\", 'message: <code>translatePigLatin(\"eight\")</code> should return \"eightway\".');",
+        "assert.deepEqual(translatePigLatin(\"schwartz\"), \"artzschway\", 'message: Should handle words where the first vowel comes in the end of the word.');",
+        "assert.deepEqual(translatePigLatin(\"rhythm\"), \"rhythmay\", 'message: Should handle words without vowels.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.prototype.indexOf()",
+        "Array.prototype.push()",
+        "Array.prototype.join()",
+        "String.prototype.substring()",
+        "String.prototype.split()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Latín de los cerdos",
+          "description": [
+            "Traduce la cadena de texto que se te provee al Latín de los cerdos (Pig Latin)",
+            "<a href=\"http://es.wikipedia.org/wiki/Pig_Latin\" target=\"_blank\">Pig Latin</a> 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.",
+            "Cadenas de entrada están garantizadas de ser palabras en Inglés en minúscula.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Pig latin",
+          "description": [
+            "Traduis la phrase donnée en pig latin (verlan anglais)",
+            "Le <a href=\"http://fr.wikipedia.org/wiki/Pig_Latin\" target=\"_blank\">Pig Latin</a> 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a0b5010f579e69b815e7c5d6",
+      "title": "Search and Replace",
+      "description": [
+        "Perform a search and replace on the sentence using the arguments provided and return the new sentence.",
+        "First argument is the sentence to perform the search and replace on.",
+        "Second argument is the word that you will be replacing (before).",
+        "Third argument is what you will be replacing the second argument with (after).",
+        "<strong>Note</strong><br> Preserve the case of the first character in 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function myReplace(str, before, after) {",
+        "  return str;",
+        "}",
+        "",
+        "myReplace(\"A quick brown fox jumped over the lazy dog\", \"jumped\", \"leaped\");"
+      ],
+      "solutions": [
+        "function myReplace(str, before, after) {\n  if (before.charAt(0) === before.charAt(0).toUpperCase()) {\n    after = after.charAt(0).toUpperCase() + after.substring(1);\n  } else {\n    after = after.charAt(0).toLowerCase() + after.substring(1);\n  }\n  return str.replace(before, after);\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(myReplace(\"Let us go to the store\", \"store\", \"mall\"), \"Let us go to the mall\", 'message: <code>myReplace(\"Let us go to the store\", \"store\", \"mall\")</code> should return \"Let us go to the mall\".');",
+        "assert.deepEqual(myReplace(\"He is Sleeping on the couch\", \"Sleeping\", \"sitting\"), \"He is Sitting on the couch\", 'message: <code>myReplace(\"He is Sleeping on the couch\", \"Sleeping\", \"sitting\")</code> should return \"He is Sitting on the couch\".');",
+        "assert.deepEqual(myReplace(\"This has a spellngi error\", \"spellngi\", \"spelling\"), \"This has a spelling error\", 'message: <code>myReplace(\"This has a spellngi error\", \"spellngi\", \"spelling\")</code> should return \"This has a spelling error\".');",
+        "assert.deepEqual(myReplace(\"His name is Tom\", \"Tom\", \"john\"), \"His name is John\", 'message: <code>myReplace(\"His name is Tom\", \"Tom\", \"john\")</code> should return \"His name is John\".');",
+        "assert.deepEqual(myReplace(\"Let us get back to more Coding\", \"Coding\", \"algorithms\"), \"Let us get back to more Algorithms\", 'message: <code>myReplace(\"Let us get back to more Coding\", \"Coding\", \"algorithms\")</code> should return \"Let us get back to more Algorithms\".');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.prototype.splice()",
+        "String.prototype.replace()",
+        "Array.prototype.join()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Buscar y reemplazar",
+          "description": [
+            "Crea una función que busque un fragmento en una frase dada y lo reemplace por otro fragmento, devolviendo la nueva frase.",
+            "El primer argumento es la frase en la que se ejecutará la búsqueda y el reemplazo",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Cherche et remplace",
+          "description": [
+            "Crée une fonction qui cherche et remplace une partie de la phrase en utilisant les arguments et renvoie la nouvelle phrase.",
+            "Le premier argument est la phrase à modifier.",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "afd15382cdfb22c9efe8b7de",
+      "title": "DNA Pairing",
+      "description": [
+        "The DNA strand is missing the pairing element. Take each character, get its pair, and return the results as a 2d array.",
+        "<a href=\"http://en.wikipedia.org/wiki/Base_pair\" target=\"_blank\">Base pairs</a> are a pair of AT and CG. Match the missing element to the provided character.",
+        "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function pairElement(str) {",
+        "  return str;",
+        "}",
+        "",
+        "pairElement(\"GCG\");"
+      ],
+      "solutions": [
+        "var lookup = Object.create(null);\nlookup.A = 'T';\nlookup.T = 'A';\nlookup.C = 'G';\nlookup.G = 'C';\n\nfunction pairElement(str) {\n return str.split('').map(function(p) {return [p, lookup[p]];});\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(pairElement(\"ATCGA\"),[[\"A\",\"T\"],[\"T\",\"A\"],[\"C\",\"G\"],[\"G\",\"C\"],[\"A\",\"T\"]], 'message: <code>pairElement(\"ATCGA\")</code> should return <code>[[\"A\",\"T\"],[\"T\",\"A\"],[\"C\",\"G\"],[\"G\",\"C\"],[\"A\",\"T\"]]</code>.');",
+        "assert.deepEqual(pairElement(\"TTGAG\"),[[\"T\",\"A\"],[\"T\",\"A\"],[\"G\",\"C\"],[\"A\",\"T\"],[\"G\",\"C\"]], 'message: <code>pairElement(\"TTGAG\")</code> should return <code>[[\"T\",\"A\"],[\"T\",\"A\"],[\"G\",\"C\"],[\"A\",\"T\"],[\"G\",\"C\"]]</code>.');",
+        "assert.deepEqual(pairElement(\"CTCTA\"),[[\"C\",\"G\"],[\"T\",\"A\"],[\"C\",\"G\"],[\"T\",\"A\"],[\"A\",\"T\"]], 'message: <code>pairElement(\"CTCTA\")</code> should return <code>[[\"C\",\"G\"],[\"T\",\"A\"],[\"C\",\"G\"],[\"T\",\"A\"],[\"A\",\"T\"]]</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.prototype.push()",
+        "String.prototype.split()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Emparejando bases de ADN",
+          "description": [
+            "A la cadena de ADN que se te pasa le hace falta una hebra. Toma cada una de las letras, obtén su pareja correspondiente y devuelve los resultados en un segundo vector",
+            "<a href=\"http://es.wikipedia.org/wiki/Apareamiento_de_bases\" target=\"_blank\">Parejas de bases</a> son pares de AT y CG. Encuentra el elemento que hace falta para cada una de las letras que se te presentan.",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Coupler les bases d'ADN",
+          "description": [
+            "Une base d'ADN a perdu sa paire. Assemble chaque paire de caractères et renvoie les résultats dans un second tableau.",
+            "Les <a href=\"https://fr.wikipedia.org/wiki/Paire_de_bases\" target=\"_blank\">paires de bases</a> sont des paires d'AT et CG. Associe l'élement manquant au caractère donné.",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "af7588ade1100bde429baf20",
+      "title": "Missing letters",
+      "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function fearNotLetter(str) {",
+        "  return str;",
+        "}",
+        "",
+        "fearNotLetter(\"abce\");"
+      ],
+      "solutions": [
+        "function fearNotLetter (str) {\n  for (var i = str.charCodeAt(0); i <= str.charCodeAt(str.length - 1); i++) {\n    var letter = String.fromCharCode(i);\n    if (str.indexOf(letter) === -1) {\n      return letter;\n    }\n  }\n  \n  return undefined;\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(fearNotLetter('abce'), 'd', 'message: <code>fearNotLetter(\"abce\")</code> should return \"d\".');",
+        "assert.deepEqual(fearNotLetter('abcdefghjklmno'), 'i', 'message: <code>fearNotLetter(\"abcdefghjklmno\")</code> should return \"i\".');",
+        "assert.deepEqual(fearNotLetter('stvwx'), 'u', 'message: <code>fearNotLetter(\"stvwx\")</code> should return \"u\".');",
+        "assert.deepEqual(fearNotLetter('bcdf'), 'e', 'message: <code>fearNotLetter(\"bcdf\")</code> should return \"e\".');",
+        "assert.isUndefined(fearNotLetter('abcdefghijklmnopqrstuvwxyz'), 'message: <code>fearNotLetter(\"abcdefghijklmnopqrstuvwxyz\")</code> should return undefined.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "String.prototype.charCodeAt()",
+        "String.fromCharCode()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Letras perdidas",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Lettres perdues",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a105e963526e7de52b219be9",
+      "title": "Sorted Union",
+      "description": [
+        "Write a function that takes two or more arrays and returns a new array of unique values in the order of the original provided arrays.",
+        "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function uniteUnique(arr) {",
+        "  return arr;",
+        "}",
+        "",
+        "uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]);"
+      ],
+      "solutions": [
+        "function uniteUnique(arr) {\n  return [].slice.call(arguments).reduce(function(a, b) {\n    return [].concat(a, b.filter(function(e) {return a.indexOf(e) === -1;}));\n  }, []);\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]), [1, 3, 2, 5, 4], 'message: <code>uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1])</code> should return <code>[1, 3, 2, 5, 4]</code>.');",
+        "assert.deepEqual(uniteUnique([1, 3, 2], [1, [5]], [2, [4]]), [1, 3, 2, [5], [4]], 'message: <code>uniteUnique([1, 3, 2], [1, [5]], [2, [4]])</code> should return <code>[1, 3, 2, [5], [4]]</code>.');",
+        "assert.deepEqual(uniteUnique([1, 2, 3], [5, 2, 1]), [1, 2, 3, 5], 'message: <code>uniteUnique([1, 2, 3], [5, 2, 1])</code> should return <code>[1, 2, 3, 5]</code>.');",
+        "assert.deepEqual(uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8]), [1, 2, 3, 5, 4, 6, 7, 8], 'message: <code>uniteUnique([1, 2, 3], [5, 2, 1, 4], [2, 1], [6, 7, 8])</code> should return <code>[1, 2, 3, 5, 4, 6, 7, 8]</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Arguments object",
+        "Array.prototype.reduce()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Intersección ordenada",
+          "description": [
+            "Escribe una función que tome dos o más vectores y que devuelva un nuevo vector con los valores únicos en el orden de aparición de los vectores que se te pasaron",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Union arrangée",
+          "description": [
+            "Crée une fonction qui accepte deux tableaux ou plus et renvoie un nouvel array de valeurs uniques dans l'ordre des tableaux donnés.",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a6b0bb188d873cb2c8729495",
+      "title": "Convert HTML Entities",
+      "description": [
+        "Convert the characters <code>&</code>, <code><</code>, <code>></code>, <code>\"</code> (double quote), and <code>'</code> (apostrophe), in a string to their corresponding HTML entities.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function convertHTML(str) {",
+        "  // &colon;&rpar;",
+        "  return str;",
+        "}",
+        "",
+        "convertHTML(\"Dolce & Gabbana\");"
+      ],
+      "solutions": [
+        "var MAP = { '&': '&amp;',\n            '<': '&lt;',\n            '>': '&gt;',\n            '\"': '&quot;',\n            \"'\": '&apos;'};\n\nfunction convertHTML(str) {\n  return str.replace(/[&<>\"']/g, function(c) {\n    return MAP[c];\n  });\n}"
+      ],
+      "tests": [
+        "assert.match(convertHTML(\"Dolce & Gabbana\"), /Dolce &amp; Gabbana/, 'message: <code>convertHTML(\"Dolce & Gabbana\")</code> should return <code>Dolce &&#8203;amp; Gabbana</code>.');",
+        "assert.match(convertHTML(\"Hamburgers < Pizza < Tacos\"), /Hamburgers &lt; Pizza &lt; Tacos/, 'message: <code>convertHTML(\"Hamburgers < Pizza < Tacos\")</code> should return <code>Hamburgers &&#8203;lt; Pizza &&#8203;lt; Tacos</code>.');",
+        "assert.match(convertHTML(\"Sixty > twelve\"), /Sixty &gt; twelve/, 'message: <code>convertHTML(\"Sixty > twelve\")</code> should return <code>Sixty &&#8203;gt; twelve</code>.');",
+        "assert.match(convertHTML('Stuff in \"quotation marks\"'), /Stuff in &quot;quotation marks&quot;/, 'message: <code>convertHTML(&apos;Stuff in \"quotation marks\"&apos;)</code> should return <code>Stuff in &&#8203;quot;quotation marks&&#8203;quot;</code>.');",
+        "assert.match(convertHTML(\"Schindler's List\"), /Schindler&apos;s List/, 'message: <code>convertHTML(\"Schindler&apos;s List\")</code> should return <code>Schindler&&#8203;apos;s List</code>.');",
+        "assert.match(convertHTML('<>'), /&lt;&gt;/, 'message: <code>convertHTML(\"<>\")</code> should return <code>&&#8203;lt;&&#8203;gt;</code>.');",
+        "assert.strictEqual(convertHTML('abc'), 'abc', 'message: <code>convertHTML(\"abc\")</code> should return <code>abc</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "RegExp",
+        "HTML Entities",
+        "String.prototype.replace()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Convierte entidades HTML",
+          "description": [
+            "Convierte los caracteres <code>&</code>, <code>&lt;<code>, <code>&gt;<code>, <code>\"<code>' (comilla), y <code>'<code> (apóstrofe), contenidos en la cadena de texto que se te pasa, en sus entidades HTML correspondientes",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Convertir les entités HTML",
+          "description": [
+            "Convertis les caractères <code>&</code>, <code>&lt;<code>, <code>&gt;<code>, <code>\"<code>' (guillemet), y <code>'<code> (apostrophe), contenus dans la chaîne de caractères en entités HTML.",
+            "N'oublie pas d'utiliser <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a5229172f011153519423690",
+      "title": "Sum All Odd Fibonacci Numbers",
+      "description": [
+        "Given a positive integer <code>num</code>, return the sum of all odd Fibonacci numbers that are less than or equal to <code>num</code>.",
+        "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, <code>sumFibs(10)</code> should return <code>10</code> because all odd Fibonacci numbers less than or equal to <code>10</code> are 1, 1, 3, and 5.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function sumFibs(num) {",
+        "  return num;",
+        "}",
+        "",
+        "sumFibs(4);"
+      ],
+      "solutions": [
+        "function sumFibs(num) {\n  var a = 1; \n  var b = 1;\n  var s = 0;\n  while (a <= num) {\n    if (a % 2 !== 0) {   \n      s += a; \n    }\n    a = [b, b=b+a][0];\n  }\n  return s;\n}"
+      ],
+      "tests": [
+        "assert(typeof sumFibs(1) === \"number\", 'message: <code>sumFibs(1)</code> should return a number.');",
+        "assert(sumFibs(1000) === 1785, 'message: <code>sumFibs(1000)</code> should return 1785.');",
+        "assert(sumFibs(4000000) === 4613732, 'message: <code>sumFibs(4000000)</code> should return 4613732.');",
+        "assert(sumFibs(4) === 5, 'message: <code>sumFibs(4)</code> should return 5.');",
+        "assert(sumFibs(75024) === 60696, 'message: <code>sumFibs(75024)</code> should return 60696.');",
+        "assert(sumFibs(75025) === 135721, 'message: <code>sumFibs(75025)</code> should return 135721.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Remainder"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Suma todos los números de Fibonacci que son impares",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Additionner tous les nombre de Fibonacci impairs",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a3bfc1673c0526e06d3ac698",
+      "title": "Sum All Primes",
+      "description": [
+        "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function sumPrimes(num) {",
+        "  return num;",
+        "}",
+        "",
+        "sumPrimes(10);"
+      ],
+      "solutions": [
+        "function eratosthenesArray(n) {\n    var primes = [];\n    if (n > 2) {\n        var half = n>>1;\n        var sieve = Array(half);\n        for (var i = 1, limit = Math.sqrt(n)>>1; i <= limit; i++) {\n            if (!sieve[i]) {\n                for (var step = 2*i+1, j = (step*step)>>1; j < half; j+=step) {\n                    sieve[j] = true;\n                }\n            }\n        }\n        primes.push(2);\n        for (var p = 1; p < half; p++) {\n            if (!sieve[p]) primes.push(2*p+1);\n        }\n    }\n    return primes;\n}\n\nfunction sumPrimes(num) {\n  return eratosthenesArray(num+1).reduce(function(a,b) {return a+b;}, 0);\n}\n\nsumPrimes(10);"
+      ],
+      "tests": [
+        "assert.deepEqual(typeof sumPrimes(10), 'number', 'message: <code>sumPrimes(10)</code> should return a number.');",
+        "assert.deepEqual(sumPrimes(10), 17, 'message: <code>sumPrimes(10)</code> should return 17.');",
+        "assert.deepEqual(sumPrimes(977), 73156, 'message: <code>sumPrimes(977)</code> should return 73156.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "For Loops",
+        "Array.prototype.push()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Suma todos los números primos",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Additionner tous les nombres primaires",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "ae9defd7acaf69703ab432ea",
+      "title": "Smallest Common Multiple",
+      "description": [
+        "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.",
+        "For example, if given 1 and 3, find the smallest common multiple of both 1 and 3 that is also evenly divisible by all numbers <em>between</em> 1 and 3. The answer here would be 6.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function smallestCommons(arr) {",
+        "  return arr;",
+        "}",
+        "",
+        "",
+        "smallestCommons([1,5]);"
+      ],
+      "solutions": [
+        "function gcd(a, b) {\n    while (b !== 0) {\n        a = [b, b = a % b][0];\n    }\n    return a;\n}\n\nfunction lcm(a, b) {\n    return (a * b) / gcd(a, b);\n}\n\nfunction smallestCommons(arr) {\n  arr.sort(function(a,b) {return a-b;});\n  var rng = [];\n  for (var i = arr[0]; i <= arr[1]; i++) {\n    rng.push(i);\n  }\n  return rng.reduce(lcm);\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(typeof smallestCommons([1, 5]), 'number', 'message: <code>smallestCommons([1, 5])</code> should return a number.');",
+        "assert.deepEqual(smallestCommons([1, 5]), 60, 'message: <code>smallestCommons([1, 5])</code> should return 60.');",
+        "assert.deepEqual(smallestCommons([5, 1]), 60, 'message: <code>smallestCommons([5, 1])</code> should return 60.');",
+        "assert.deepEqual(smallestCommons([2, 10]), 2520, 'message: <code>smallestCommons([2, 10])</code> should return 2520.');",
+        "assert.deepEqual(smallestCommons([1, 13]), 360360, 'message: <code>smallestCommons([1, 13])</code> should return 360360.');",
+        "assert.deepEqual(smallestCommons([23, 18]), 6056820, 'message: <code>smallestCommons([23, 18])</code> should return 6056820.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Smallest Common Multiple"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Mínimo común múltiplo",
+          "description": [
+            "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 <em>entre</em> 1 y 3.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Plus petit commun multiple",
+          "description": [
+            "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 <em>entre</em> 1 et 3/",
+            "N'oublie pas d'utiliser <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a5deed1811a43193f9f1c841",
+      "title": "Drop it",
+      "description": [
+        "Given the array <code>arr</code>, iterate through and remove each element starting from the first element (the 0 index) until the function <code>func</code> returns <code>true</code> when the iterated element is passed through it.",
+        "Then return the rest of the array once the condition is satisfied, otherwise, <code>arr</code> should be returned as an empty array.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function dropElements(arr, func) {",
+        "  // Drop them elements.",
+        "  return arr;",
+        "}",
+        "",
+        "dropElements([1, 2, 3], function(n) {return n < 3; });"
+      ],
+      "solutions": [
+        "function dropElements(arr, func) {\n  // Drop them elements.\n  while (arr.length && !func(arr[0])) {\n    arr.shift();\n  }\n  return arr;\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(dropElements([1, 2, 3, 4], function(n) {return n >= 3;}), [3, 4], 'message: <code>dropElements([1, 2, 3, 4], function(n) {return n >= 3;})</code> should return <code>[3, 4]</code>.');",
+        "assert.deepEqual(dropElements([0, 1, 0, 1], function(n) {return n === 1;}), [1, 0, 1], 'message: <code>dropElements([0, 1, 0, 1], function(n) {return n === 1;})</code> should return <code>[1, 0, 1]</code>.');",
+        "assert.deepEqual(dropElements([1, 2, 3], function(n) {return n > 0;}), [1, 2, 3], 'message: <code>dropElements([1, 2, 3], function(n) {return n > 0;})</code> should return <code>[1, 2, 3]</code>.');",
+        "assert.deepEqual(dropElements([1, 2, 3, 4], function(n) {return n > 5;}), [], 'message: <code>dropElements([1, 2, 3, 4], function(n) {return n > 5;})</code> should return <code>[]</code>.');",
+        "assert.deepEqual(dropElements([1, 2, 3, 7, 4], function(n) {return n > 3;}), [7, 4], 'message: <code>dropElements([1, 2, 3, 7, 4], function(n) {return n > 3;})</code> should return <code>[7, 4]</code>.');",
+        "assert.deepEqual(dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;}), [3, 9, 2], 'message: <code>dropElements([1, 2, 3, 9, 2], function(n) {return n > 2;})</code> should return <code>[3, 9, 2]</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Arguments object",
+        "Array.prototype.shift()",
+        "Array.prototype.slice()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "¡Fuera de aquí!",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Laisse tomber",
+          "description": [
+            "É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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "ab306dbdcc907c7ddfc30830",
+      "title": "Steamroller",
+      "description": [
+        "Flatten a nested array. You must account for varying levels of nesting.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function steamrollArray(arr) {",
+        "  // I'm a steamroller, baby",
+        "  return arr;",
+        "}",
+        "",
+        "steamrollArray([1, [2], [3, [[4]]]]);"
+      ],
+      "solutions": [
+        "function steamrollArray(arr) {\n  if (!Array.isArray(arr)) {\n    return [arr];\n  }\n  var out = [];\n  arr.forEach(function(e) {\n    steamrollArray(e).forEach(function(v) {\n      out.push(v);\n    });\n  });\n  return out;\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(steamrollArray([[[\"a\"]], [[\"b\"]]]), [\"a\", \"b\"], 'message: <code>steamrollArray([[[\"a\"]], [[\"b\"]]])</code> should return <code>[\"a\", \"b\"]</code>.');",
+        "assert.deepEqual(steamrollArray([1, [2], [3, [[4]]]]), [1, 2, 3, 4], 'message: <code>steamrollArray([1, [2], [3, [[4]]]])</code> should return <code>[1, 2, 3, 4]</code>.');",
+        "assert.deepEqual(steamrollArray([1, [], [3, [[4]]]]), [1, 3, 4], 'message: <code>steamrollArray([1, [], [3, [[4]]]])</code> should return <code>[1, 3, 4]</code>.');",
+        "assert.deepEqual(steamrollArray([1, {}, [3, [[4]]]]), [1, {}, 3, 4], 'message: <code>steamrollArray([1, {}, [3, [[4]]]])</code> should return <code>[1, {}, 3, 4]</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.isArray()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Aplanadora",
+          "description": [
+            "Aplana el vector anidado que se te provee. Tu función debe poder aplanar vectores de cualquier forma.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Rouleau compresseur",
+          "description": [
+            "Aplatis le tableau donné. Ta fonction doit pour gérer différentes formes de tableaux.",
+            "N'oublie pas d'utiliser <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a8d97bd4c764e91f9d2bda01",
+      "title": "Binary Agents",
+      "description": [
+        "Return an English translated sentence of the passed binary string.",
+        "The binary string will be space separated.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function binaryAgent(str) {",
+        "  return str;",
+        "}",
+        "",
+        "binaryAgent(\"01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111\");"
+      ],
+      "solutions": [
+        "function binaryAgent(str) {\n  return str.split(' ').map(function(s) { return parseInt(s, 2); }).map(function(b) { return String.fromCharCode(b);}).join('');\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(binaryAgent('01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111'), \"Aren't bonfires fun!?\", 'message: <code>binaryAgent(\"01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111\")</code> should return \"Aren&#39;t bonfires fun!?\"');",
+        "assert.deepEqual(binaryAgent('01001001 00100000 01101100 01101111 01110110 01100101 00100000 01000110 01110010 01100101 01100101 01000011 01101111 01100100 01100101 01000011 01100001 01101101 01110000 00100001'), \"I love FreeCodeCamp!\", 'message: <code>binaryAgent(\"01001001 00100000 01101100 01101111 01110110 01100101 00100000 01000110 01110010 01100101 01100101 01000011 01101111 01100100 01100101 01000011 01100001 01101101 01110000 00100001\")</code> should return \"I love FreeCodeCamp!\"');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "String.prototype.charCodeAt()",
+        "String.fromCharCode()"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Mensaje secreto",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Agent binaire",
+          "description": [
+            "Traduis la chaîne binaire donnée en anglais.",
+            "La chaîne binaire comporte des espaces.",
+            "N'oublie pas d'utiliser <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a10d2431ad0c6a099a4b8b52",
+      "title": "Everything Be True",
+      "description": [
+        "Check if the predicate (second argument) is <dfn>truthy</dfn> on all elements of a collection (first argument).",
+        "In other words, you are given an array collection of objects. The predicate <code>pre</code> will be an object property and you need to return <code>true</code> if its value is <code>truthy</code>. Otherwise, return <code>false</code>.",
+        "In JavaScript, <code>truthy</code> values are values that translate to <code>true</code> when evaluated in a Boolean context.",
+        "Remember, you can access object properties through either dot notation or <code>[]</code> notation.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function truthCheck(collection, pre) {",
+        "  // Is everyone being true?",
+        "  return pre;",
+        "}",
+        "",
+        "truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\"}, {\"user\": \"Dipsy\", \"sex\": \"male\"}, {\"user\": \"Laa-Laa\", \"sex\": \"female\"}, {\"user\": \"Po\", \"sex\": \"female\"}], \"sex\");"
+      ],
+      "solutions": [
+        "function truthCheck(collection, pre) {\n  // Does everyone have one of these?\n  return collection.every(function(e) { return e[pre]; });\n}"
+      ],
+      "tests": [
+        "assert.strictEqual(truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\"}, {\"user\": \"Dipsy\", \"sex\": \"male\"}, {\"user\": \"Laa-Laa\", \"sex\": \"female\"}, {\"user\": \"Po\", \"sex\": \"female\"}], \"sex\"), true, 'message: <code>truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\"}, {\"user\": \"Dipsy\", \"sex\": \"male\"}, {\"user\": \"Laa-Laa\", \"sex\": \"female\"}, {\"user\": \"Po\", \"sex\": \"female\"}], \"sex\")</code> should return true.');",
+        "assert.strictEqual(truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\"}, {\"user\": \"Dipsy\"}, {\"user\": \"Laa-Laa\", \"sex\": \"female\"}, {\"user\": \"Po\", \"sex\": \"female\"}], \"sex\"), false, 'message: <code>truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\"}, {\"user\": \"Dipsy\"}, {\"user\": \"Laa-Laa\", \"sex\": \"female\"}, {\"user\": \"Po\", \"sex\": \"female\"}], \"sex\")</code> should return false.');",
+        "assert.strictEqual(truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\", \"age\": 2}, {\"user\": \"Dipsy\", \"sex\": \"male\", \"age\": 0}, {\"user\": \"Laa-Laa\", \"sex\": \"female\", \"age\": 5}, {\"user\": \"Po\", \"sex\": \"female\", \"age\": 4}], \"age\"), false, 'message: <code>truthCheck([{\"user\": \"Tinky-Winky\", \"sex\": \"male\", \"age\": 0}, {\"user\": \"Dipsy\", \"sex\": \"male\", \"age\": 3}, {\"user\": \"Laa-Laa\", \"sex\": \"female\", \"age\": 5}, {\"user\": \"Po\", \"sex\": \"female\", \"age\": 4}], \"age\")</code> should return false.');",
+        "assert.strictEqual(truthCheck([{\"name\": \"Pete\", \"onBoat\": true}, {\"name\": \"Repeat\", \"onBoat\": true}, {\"name\": \"FastFoward\", \"onBoat\": null}], \"onBoat\"), false, 'message: <code>truthCheck([{\"name\": \"Pete\", \"onBoat\": true}, {\"name\": \"Repeat\", \"onBoat\": true}, {\"name\": \"FastFoward\", \"onBoat\": null}], \"onBoat\")</code> should return false');",
+        "assert.strictEqual(truthCheck([{\"name\": \"Pete\", \"onBoat\": true}, {\"name\": \"Repeat\", \"onBoat\": true, \"alias\": \"Repete\"}, {\"name\": \"FastFoward\", \"onBoat\": true}], \"onBoat\"), true, 'message: <code>truthCheck([{\"name\": \"Pete\", \"onBoat\": true}, {\"name\": \"Repeat\", \"onBoat\": true, \"alias\": \"Repete\"}, {\"name\": \"FastFoward\", \"onBoat\": true}], \"onBoat\")</code> should return true');",
+        "assert.strictEqual(truthCheck([{\"single\": \"yes\"}], \"single\"), true, 'message: <code>truthCheck([{\"single\": \"yes\"}], \"single\")</code> should return true');",
+        "assert.strictEqual(truthCheck([{\"single\": \"\"}, {\"single\": \"double\"}], \"single\"), false, 'message: <code>truthCheck([{\"single\": \"\"}, {\"single\": \"double\"}], \"single\")</code> should return false');",
+        "assert.strictEqual(truthCheck([{\"single\": \"double\"}, {\"single\": undefined}], \"single\"), false, 'message: <code>truthCheck([{\"single\": \"double\"}, {\"single\": undefined}], \"single\")</code> should return false');",
+        "assert.strictEqual(truthCheck([{\"single\": \"double\"}, {\"single\": NaN}], \"single\"), false, 'message: <code>truthCheck([{\"single\": \"double\"}, {\"single\": NaN}], \"single\")</code> should return false');"
+      ],
+      "isRequired": true,
+      "type": "bonfire",
+      "MDNlinks": [
+        "Truthy",
+        "Falsy"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Que todo sea verdadero",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Tout doit être vrai",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a97fd23d9b809dac9921074f",
+      "title": "Arguments Optional",
+      "description": [
+        "Create a function that sums two arguments together. If only one argument is provided, then return a function that expects one argument and returns the sum.",
+        "For example, <code>addTogether(2, 3)</code> should return <code>5</code>, and <code>addTogether(2)</code> should return a function.",
+        "Calling this returned function with a single argument will then return the sum:",
+        "<code>var sumTwoAnd = addTogether(2);</code>",
+        "<code>sumTwoAnd(3)</code> returns <code>5</code>.",
+        "If either argument isn't a valid number, return undefined.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function addTogether() {",
+        "  return false;",
+        "}",
+        "",
+        "addTogether(2,3);"
+      ],
+      "solutions": [
+        "function addTogether() {\n  var a = arguments[0];\n  if (toString.call(a) !== '[object Number]') return;  \n  if (arguments.length === 1) {\n    return function(b) {\n      if (toString.call(b) !== '[object Number]') return;\n      return a + b;\n    };\n  }\n  var b = arguments[1];\n  if (toString.call(b) !== '[object Number]') return;  \n  return a + arguments[1];\n}"
+      ],
+      "tests": [
+        "assert.deepEqual(addTogether(2, 3), 5, 'message: <code>addTogether(2, 3)</code> should return 5.');",
+        "assert.deepEqual(addTogether(2)(3), 5, 'message: <code>addTogether(2)(3)</code> should return 5.');",
+        "assert.isUndefined(addTogether(\"http://bit.ly/IqT6zt\"), 'message: <code>addTogether(\"http://bit.ly/IqT6zt\")</code> should return undefined.');",
+        "assert.isUndefined(addTogether(2, \"3\"), 'message: <code>addTogether(2, \"3\")</code> should return undefined.');",
+        "assert.isUndefined(addTogether(2)([3]), 'message: <code>addTogether(2)([3])</code> should return undefined.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Closures",
+        "Arguments object"
+      ],
+      "isRequired": true,
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Argumentos opcionales",
+          "description": [
+            "Crea una función que sume dos argumentos. Si sólo se le pasa un argumento a la función, haz que devuelva otra función que acepte un argumento y que devuelva la suma correspondiente.",
+            "Por ejemplo, <code>add(2, 3)</code> debe devolver <code>5</code>, y <code>add(2)</code> debe devolver una función.",
+            "Al llamar esta función con un único argumento devolverá la suma:",
+            "<code>var sumTwoAnd = add(2);</code>",
+            "<code>sumTwoAnd(3)</code> devuelve <code>5</code>.",
+            "Si alguno de los argumentos no es un número válido, haz que devuelva undefined.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "fr": {
+          "title": "Arguments optionnels",
+          "description": [
+            "Crée une fonction qui additionne deux arguments. Si un seul argument est donné, renvoie une fonction qui attend un argument et renvoie la somme.",
+            "Par exemple, <code>add(2, 3)</code>, doit renvoyer <code>5</code>, et <code>add(2)</code> doit renvoyer une fonction.",
+            "Appeler cette fonction avec un seul argument renvoie la somme:",
+            "<code>var sumTwoAnd = add(2);</code>",
+            "<code>sumTwoAnd(3)</code> renvoie <code>5</code>.",
+            "Si aucun argument n'est un nombre, renvoie undefined.",
+            "N'oublie pas d'utiliser <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Lire-Chercher-Demander</a> si tu es bloqué. Essaye de trouver un partenaire. Écris ton propre code."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a2f1d72d9b908d0bd72bb9f6",
+      "title": "Make a Person",
+      "description": [
+        "Fill in the object constructor with the following methods below:",
+        "<blockquote>getFirstName()\ngetLastName()\ngetFullName()\nsetFirstName(first)\nsetLastName(last)\nsetFullName(firstAndLast)</blockquote>",
+        "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "var Person = function(firstAndLast) {",
+        "  // Complete the method below and implement the others similarly",
+        "  this.getFullName = function() {",
+        "    return \"\";",
+        "  };",
+        "  return firstAndLast;",
+        "};",
+        "",
+        "var bob = new Person('Bob Ross');",
+        "bob.getFullName();"
+      ],
+      "solutions": [
+        "var Person = function(firstAndLast) {\n\n  var firstName, lastName;\n\n  function updateName(str) {    \n    firstName = str.split(\" \")[0];\n    lastName = str.split(\" \")[1];    \n  }\n\n  updateName(firstAndLast);\n\n  this.getFirstName = function(){\n    return firstName;\n  };\n  \n  this.getLastName = function(){\n    return lastName;\n  };\n  \n  this.getFullName = function(){\n    return firstName + \" \" + lastName;\n  };\n  \n  this.setFirstName = function(str){\n    firstName = str;\n  };\n  \n\n  this.setLastName = function(str){\n    lastName = str;\n  };\n  \n  this.setFullName = function(str){\n    updateName(str);\n  };\n};\n\nvar bob = new Person('Bob Ross');\nbob.getFullName();"
+      ],
+      "tests": [
+        "assert.deepEqual(Object.keys(bob).length, 6, 'message: <code>Object.keys(bob).length</code> should return 6.');",
+        "assert.deepEqual(bob instanceof Person, true, 'message: <code>bob instanceof Person</code> should return true.');",
+        "assert.deepEqual(bob.firstName, undefined, 'message: <code>bob.firstName</code> should return undefined.');",
+        "assert.deepEqual(bob.lastName, undefined, 'message: <code>bob.lastName</code> should return undefined.');",
+        "assert.deepEqual(bob.getFirstName(), 'Bob', 'message: <code>bob.getFirstName()</code> should return \"Bob\".');",
+        "assert.deepEqual(bob.getLastName(), 'Ross', 'message: <code>bob.getLastName()</code> should return \"Ross\".');",
+        "assert.deepEqual(bob.getFullName(), 'Bob Ross', 'message: <code>bob.getFullName()</code> should return \"Bob Ross\".');",
+        "assert.strictEqual((function () { bob.setFirstName(\"Haskell\"); return bob.getFullName(); })(), 'Haskell Ross', 'message: <code>bob.getFullName()</code> should return \"Haskell Ross\" after <code>bob.setFirstName(\"Haskell\")</code>.');",
+        "assert.strictEqual((function () { var _bob=new Person('Haskell Ross'); _bob.setLastName(\"Curry\"); return _bob.getFullName(); })(), 'Haskell Curry', 'message: <code>bob.getFullName()</code> should return \"Haskell Curry\" after <code>bob.setLastName(\"Curry\")</code>.');",
+        "assert.strictEqual((function () { bob.setFullName(\"Haskell Curry\"); return bob.getFullName(); })(), 'Haskell Curry', 'message: <code>bob.getFullName()</code> should return \"Haskell Curry\" after <code>bob.setFullName(\"Haskell Curry\")</code>.');",
+        "assert.strictEqual((function () { bob.setFullName(\"Haskell Curry\"); return bob.getFirstName(); })(), 'Haskell', 'message: <code>bob.getFirstName()</code> should return \"Haskell\" after <code>bob.setFullName(\"Haskell Curry\")</code>.');",
+        "assert.strictEqual((function () { bob.setFullName(\"Haskell Curry\"); return bob.getLastName(); })(), 'Curry', 'message: <code>bob.getLastName()</code> should return \"Curry\" after <code>bob.setFullName(\"Haskell Curry\")</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Closures",
+        "Details of the Object Model"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Crea una Persona",
+          "description": [
+            "Completa el constructor de objetos con los métodos especificados a continuación:",
+            "<blockquote>getFirstName()\ngetLastName()\ngetFullName()\nsetFirstName(first)\nsetLastName(last)\nsetFullName(firstAndLast)</blockquote>",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Crea una Persona",
+          "description": [
+            "Completa il costruttore dell'oggetto con i metodi specificati qui sotto:",
+            "<blockquote>getFirstName()\ngetLastName()\ngetFullName()\nsetFirstName(first)\nsetLastName(last)\nsetFullName(firstAndLast)</blockquote>",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Faça uma Pessoa",
+          "description": [
+            "Preencha o contrutor do objeto com seguintes métodos:",
+            "<blockquote>getFirstName()\ngetLastName()\ngetFullName()\nsetFirstName(first)\nsetLastName(last)\nsetFullName(firstAndLast)</blockquote>",
+            "Rode os testes para ver o resultado esperado de cada método.",
+            "Os métodos que recebem um argumento deve aceitar somente um argumento e deve ser uma string.",
+            "Esses métodos devem ser o único meio de interação com o objeto.",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "af4afb223120f7348cdfc9fd",
+      "title": "Map the Debris",
+      "description": [
+        "Return a new array that transforms the elements' average altitude into their orbital periods (in seconds).",
+        "The array will contain objects in the format <code>{name: 'name', avgAlt: avgAlt}</code>.",
+        "You can read about orbital periods <a href=\"http://en.wikipedia.org/wiki/Orbital_period\" target='_blank'>on Wikipedia</a>.",
+        "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 km<sup>3</sup>s<sup>-2</sup>.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function orbitalPeriod(arr) {",
+        "  var GM = 398600.4418;",
+        "  var earthRadius = 6367.4447;",
+        "  return arr;",
+        "}",
+        "",
+        "orbitalPeriod([{name : \"sputnik\", avgAlt : 35873.5553}]);"
+      ],
+      "solutions": [
+        "function orbitalPeriod(arr) {\n  var GM = 398600.4418;\n  var earthRadius = 6367.4447;\n  var TAU = 2 * Math.PI; \n  return arr.map(function(obj) {\n    return {\n      name: obj.name,\n      orbitalPeriod: Math.round(TAU * Math.sqrt(Math.pow(obj.avgAlt+earthRadius, 3)/GM))\n    };\n  });\n}\n\norbitalPeriod([{name : \"sputkin\", avgAlt : 35873.5553}]);\n"
+      ],
+      "tests": [
+        "assert.deepEqual(orbitalPeriod([{name : \"sputnik\", avgAlt : 35873.5553}]), [{name: \"sputnik\", orbitalPeriod: 86400}], 'message: <code>orbitalPeriod([{name : \"sputnik\", avgAlt : 35873.5553}])</code> should return <code>[{name: \"sputnik\", orbitalPeriod: 86400}]</code>.');",
+        "assert.deepEqual(orbitalPeriod([{name: \"iss\", avgAlt: 413.6}, {name: \"hubble\", avgAlt: 556.7}, {name: \"moon\", avgAlt: 378632.553}]), [{name : \"iss\", orbitalPeriod: 5557}, {name: \"hubble\", orbitalPeriod: 5734}, {name: \"moon\", orbitalPeriod: 2377399}], 'message: <code>orbitalPeriod([{name: \"iss\", avgAlt: 413.6}, {name: \"hubble\", avgAlt: 556.7}, {name: \"moon\", avgAlt: 378632.553}])</code> should return <code>[{name : \"iss\", orbitalPeriod: 5557}, {name: \"hubble\", orbitalPeriod: 5734}, {name: \"moon\", orbitalPeriod: 2377399}]</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Math.pow()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Ubica los Escombros",
+          "description": [
+            "Crea una función que devuelva un nuevo arreglo que transforme la altitud promedio del elemento en su período orbital.",
+            "El arreglo debe contener objetos en el formato <code>{name: 'name', avgAlt: avgAlt}</code>.",
+            "Puedes leer acerca de períodos orbitales <a href=\"http://en.wikipedia.org/wiki/Orbital_period\" target='_blank'>en Wikipedia</a>.",
+            "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 km<sup>3</sup>s<sup>-2</sup>.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Mappa i Detriti",
+          "description": [
+            "Ritorna un nuovo array che trasformi l'altitudine media degli elementi nel loro periodo orbitale.",
+            "L'array conterrà oggetti in formato <code>{name: 'name', avgAlt: avgAlt}</code>.",
+            "Puoi leggere riguardo i periodi orbitali <a href=\"http://en.wikipedia.org/wiki/Orbital_period\" target='_blank'>su Wikipedia</a>.",
+            "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 km<sup>3</sup>s<sup>-2</sup>.",
+            "Ricorda di usare <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Mapeie o Lixo espacial",
+          "description": [
+            "Retorne uma nova matriz que transforma a altitude média do elemento em seu período orbital.",
+            "A matriz vai conter objetos no formato <code>{name: 'name', avgAlt: avgAlt}</code>.",
+            "Você pode ler sobre período orbital <a href=\"https://pt.wikipedia.org/wiki/Per%C3%ADodo_orbital\" target='_blank'>na Wikipedia</a>.",
+            "Os valores devem ser arredondados para número inteiro mais próximo. O corpe sendo orbitado é a Terra.",
+            "O raio da terra é 6367.4447 quilômetros, e o valor GM da terra é 398600.4418 km<sup>3</sup>s<sup>-2</sup>.",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/object-oriented-programming.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/object-oriented-programming.json
new file mode 100644
index 0000000000..ef9a16e36b
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/object-oriented-programming.json
@@ -0,0 +1,1063 @@
+{
+  "name": "Object Oriented Programming",
+  "order": 6,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7dac367417b2b2512b72",
+      "title": "Introduction to the Object Oriented Programming Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "At its core, software development solves a problem or achieves a result with computation. The software development process first defines a problem, then presents a solution. Object oriented programming is one of several major approaches to the software development process.<br><br>As its name implies, object oriented programming organizes code into object definitions. These are sometimes called classes, and they group together data with related behavior. The data is an object's attributes, and the behavior (or functions) are methods.<br><br>The object structure makes it flexible within a program. Objects can transfer information by calling and passing data to another object's methods. Also, new classes can receive, or inherit, all the features from a base or parent class. This helps to reduce repeated code.<br><br>Your choice of programming approach depends on a few factors. These include the type of problem, as well as how you want to structure your data and algorithms. This section covers object oriented programming principles in JavaScript.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7dac367417b2b2512b73",
+      "title": "Create a Basic JavaScript Object",
+      "description": [
+        "Think about things people see everyday, like cars, shops, and birds. These are all <code>objects</code>: tangible things people can observe and interact with.",
+        "What are some qualities of these <code>objects</code>? A car has wheels. Shops sell items. Birds have wings.",
+        "These qualities, or <code>properties</code>, define what makes up an <code>object</code>. Note that similar <code>objects</code> share the same <code>properties</code>, but may have different values for those <code>properties</code>. For example, all cars have wheels, but not all cars have the same number of wheels.",
+        "<code>Objects</code> in JavaScript are used to model real-world objects, giving them <code>properties</code> and behavior just like their real-world counterparts. Here's an example using these concepts to create a <code>duck</code> <code>object</code>:",
+        "<blockquote>let duck = {<br>&nbsp;&nbsp;name: \"Aflac\",<br>&nbsp;&nbsp;numLegs: 2<br>};</blockquote>",
+        "This <code>duck</code> <code>object</code> has two property/value pairs: a <code>name</code> of \"Aflac\" and a <code>numLegs</code> of 2.",
+        "<hr>",
+        "Create a <code>dog</code> <code>object</code> with <code>name</code> and <code>numLegs</code> properties, and set them to a string and a number, respectively."
+      ],
+      "challengeSeed": [
+        "let dog = {",
+        "  ",
+        "};"
+      ],
+      "tests": [
+        "assert(typeof(dog) === 'object', 'message: <code>dog</code> should be an <code>object</code>.');",
+        "assert(typeof(dog.name) === 'string', 'message: <code>dog</code> should have a <code>name</code> property set to a <code>string</code>.');",
+        "assert(typeof(dog.numLegs) === 'number', 'message: <code>dog</code> should have a <code>numLegs</code> property set to a <code>number</code>.');"
+      ],
+      "solutions": [
+        "let dog = {\n  name: '',\n  numLegs: 4\n};"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dac367417b2b2512b74",
+      "title": "Use Dot Notation to Access the Properties of an Object",
+      "description": [
+        "The last challenge created an <code>object</code> with various <code>properties</code>, now you'll see how to access the values of those <code>properties</code>. Here's an example:",
+        "<blockquote>let duck = {<br>&nbsp;&nbsp;name: \"Aflac\",<br>&nbsp;&nbsp;numLegs: 2<br>};<br>console.log(duck.name);<br>// This prints \"Aflac\" to the console</blockquote>",
+        "Dot notation is used on the <code>object</code> name, <code>duck</code>, followed by the name of the <code>property</code>, <code>name</code>, to access the value of \"Aflac\".",
+        "<hr>",
+        "Print both <code>properties</code> of the <code>dog</code> object below to your console."
+      ],
+      "challengeSeed": [
+        "let dog = {",
+        "  name: \"Spot\",",
+        "  numLegs: 4",
+        "};",
+        "// Add your code below this line",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(/console.log\\(.*dog\\.name.*\\)/g.test(code), 'message: Your should use <code>console.log</code> to print the value for the <code>name</code> property of the <code>dog</code> object.');",
+        "assert(/console.log\\(.*dog\\.numLegs.*\\)/g.test(code), 'message: Your should use <code>console.log</code> to print the value for the <code>numLegs</code> property of the <code>dog</code> object.');"
+      ],
+      "solutions": [
+        "let dog = {\n  name: \"Spot\",\n  numLegs: 4\n};\nconsole.log(dog.name);\nconsole.log(dog.numLegs);"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dad367417b2b2512b75",
+      "title": "Create a Method on an Object",
+      "description": [
+        "<code>Objects</code> can have a special type of <code>property</code>, called a <code>method</code>.",
+        "<code>Methods</code> are <code>properties</code> that are functions. This adds different behavior to an <code>object</code>. Here is the <code>duck</code> example with a method:",
+        "<blockquote>let duck = {<br>&nbsp;&nbsp;name: \"Aflac\",<br>&nbsp;&nbsp;numLegs: 2,<br>&nbsp;&nbsp;sayName: function() {return \"The name of this duck is \" + duck.name + \".\";}<br>};<br>duck.sayName();<br>// Returns \"The name of this duck is Aflac.\"</blockquote>",
+        "The example adds the <code>sayName</code> <code>method</code>, which is a function that returns a sentence giving the name of the <code>duck</code>.",
+        "Notice that the <code>method</code> accessed the <code>name</code> property in the return statement using <code>duck.name</code>. The next challenge will cover another way to do this.",
+        "<hr>",
+        "Using the <code>dog</code> <code>object</code>, give it a method called <code>sayLegs</code>. The method should return the sentence \"This dog has 4 legs.\""
+      ],
+      "challengeSeed": [
+        "let dog = {",
+        "  name: \"Spot\",",
+        "  numLegs: 4,",
+        "  ",
+        "};",
+        "",
+        "dog.sayLegs();"
+      ],
+      "tests": [
+        "assert(typeof(dog.sayLegs) === 'function', 'message: <code>dog.sayLegs()</code> should be a function.');",
+        "assert(dog.sayLegs() === 'This dog has 4 legs.', 'message: <code>dog.sayLegs()</code> should return the given string - note that punctuation and spacing matter.');"
+      ],
+      "solutions": [
+        "let dog = {\n  name: \"Spot\",\n  numLegs: 4,\n  sayLegs () {\n    return 'This dog has ' + this.numLegs + ' legs.';\n  }\n};\n\ndog.sayLegs();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dad367417b2b2512b76",
+      "title": "Make Code More Reusable with the this Keyword",
+      "description": [
+        "The last challenge introduced a <code>method</code> to the <code>duck</code> object. It used <code>duck.name</code> dot notation to access the value for the <code>name</code> property within the return statement:",
+        "<code>sayName: function() {return \"The name of this duck is \" + duck.name + \".\";}</code>",
+        "While this is a valid way to access the object's property, there is a pitfall here. If the variable name changes, any code referencing the original name would need to be updated as well. In a short object definition, it isn't a problem, but if an object has many references to its properties there is a greater chance for error.",
+        "A way to avoid these issues is with the <code>this</code> keyword:",
+        "<blockquote>let duck = {<br>&nbsp;&nbsp;name: \"Aflac\",<br>&nbsp;&nbsp;numLegs: 2,<br>&nbsp;&nbsp;sayName: function() {return \"The name of this duck is \" + this.name + \".\";}<br>};</blockquote>",
+        "<code>this</code> is a deep topic, and the above example is only one way to use it. In the current context, <code>this</code> refers to the object that the method is associated with: <code>duck</code>.",
+        "If the object's name is changed to <code>mallard</code>, it is not necessary to find all the references to <code>duck</code> in the code. It makes the code reusable and easier to read.",
+        "<hr>",
+        "Modify the <code>dog.sayLegs</code> method to remove any references to <code>dog</code>. Use the <code>duck</code> example for guidance."
+      ],
+      "challengeSeed": [
+        "",
+        "let dog = {",
+        "  name: \"Spot\",",
+        "  numLegs: 4,",
+        "  sayLegs: function() {return \"This dog has \" + dog.numLegs + \" legs.\";}",
+        "};",
+        "",
+        "dog.sayLegs();"
+      ],
+      "tests": [
+        "assert(dog.sayLegs() === 'This dog has 4 legs.', 'message: <code>dog.sayLegs()</code> should return the given string.');",
+        "assert(code.match(/this\\.numLegs/g), 'message: Your code should use the <code>this</code> keyword to access the <code>numLegs</code> property of <code>dog</code>.');"
+      ],
+      "solutions": [
+        "let dog = {\n  name: \"Spot\",\n  numLegs: 4,\n  sayLegs () {\n    return 'This dog has ' + this.numLegs + ' legs.';\n  }\n};\n\ndog.sayLegs();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dad367417b2b2512b77",
+      "title": "Define a Constructor Function",
+      "description": [
+        "<code>Constructors</code> are functions that create new objects. They define properties and behaviors that will belong to the new object. Think of them as a blueprint for the creation of new objects.",
+        "Here is an example of a <code>constructor</code>:",
+        "<blockquote>function Bird() {<br>&nbsp;&nbsp;this.name = \"Albert\";<br>&nbsp;&nbsp;this.color = \"blue\";<br>&nbsp;&nbsp;this.numLegs = 2;<br>}</blockquote>",
+        "This <code>constructor</code> defines a <code>Bird</code> object with properties <code>name</code>, <code>color</code>, and <code>numLegs</code> set to Albert, blue, and 2, respectively.",
+        "<code>Constructors</code> follow a few conventions:",
+        "<ul><li><code>Constructors</code> are defined with a capitalized name to distinguish them from other functions that are not <code>constructors</code>.</li><li><code>Constructors</code> use the keyword <code>this</code> to set properties of the object they will create. Inside the <code>constructor</code>, <code>this</code> refers to the new object it will create.</li><li><code>Constructors</code> define properties and behaviors instead of returning a value as other functions might.</li></ul>",
+        "<hr>",
+        "Create a <code>constructor</code>, <code>Dog</code>, with properties <code>name</code>, <code>color</code>, and <code>numLegs</code> that are set to a string, a string, and a number, respectively."
+      ],
+      "challengeSeed": [
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(typeof (new Dog()).name === 'string', 'message: <code>Dog</code> should have a <code>name</code> property set to a string.');",
+        "assert(typeof (new Dog()).color === 'string', 'message: <code>Dog</code> should have a <code>color</code> property set to a string.');",
+        "assert(typeof (new Dog()).numLegs === 'number', 'message: <code>Dog</code> should have a <code>numLegs</code> property set to a number.');"
+      ],
+      "solutions": [
+        "function Dog (name, color, numLegs) {\n  this.name = 'name';\n  this.color = 'color';\n  this.numLegs = 4;\n}"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dad367417b2b2512b78",
+      "title": "Use a Constructor to Create Objects",
+      "description": [
+        "Here's the <code>Bird</code> constructor from the previous challenge:",
+        "<blockquote>function Bird() {<br>&nbsp;&nbsp;this.name = \"Albert\";<br>&nbsp;&nbsp;this.color  = \"blue\";<br>&nbsp;&nbsp;this.numLegs = 2;<br>&nbsp;&nbsp;// \"this\" inside the constructor always refers to the object being created<br>}<br><br>let blueBird = new Bird();</blockquote>",
+        "Notice that the <code>new</code> operator is used when calling a constructor. This tells JavaScript to create a new <code>instance</code> of <code>Bird</code> called <code>blueBird</code>. Without the <code>new</code> operator, <code>this</code> inside the constructor would not point to the newly created object, giving unexpected results.",
+        "Now <code>blueBird</code> has all the properties defined inside the <code>Bird</code> constructor:",
+        "<blockquote>blueBird.name; // => Albert<br>blueBird.color; // => blue<br>blueBird.numLegs; // => 2</blockquote>",
+        "Just like any other object, its properties can be accessed and modified:",
+        "<blockquote>blueBird.name = 'Elvira';<br>blueBird.name; // => Elvira</blockquote>",
+        "<hr>",
+        "Use the <code>Dog</code> constructor from the last lesson to create a new instance of <code>Dog</code>, assigning it to a variable <code>hound</code>."
+      ],
+      "challengeSeed": [
+        "function Dog() {",
+        "  this.name = \"Rupert\";",
+        "  this.color = \"brown\";",
+        "  this.numLegs = 4;",
+        "}",
+        "// Add your code below this line",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(hound instanceof Dog, 'message: <code>hound</code> should be created using the <code>Dog</code> constructor.');",
+        "assert(code.match(/new/g), 'message: Your code should use the <code>new</code> operator to create an <code>instance</code> of <code>Dog</code>.');"
+      ],
+      "solutions": [
+        "function Dog() {\n  this.name = \"Rupert\";\n  this.color = \"brown\";\n  this.numLegs = 4;\n}\nconst hound = new Dog();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dae367417b2b2512b79",
+      "title": "Extend Constructors to Receive Arguments",
+      "description": [
+        "The <code>Bird</code> and <code>Dog</code> constructors from last challenge worked well. However, notice that all <code>Birds</code> that are created with the <code>Bird</code> constructor are automatically named Albert, are blue in color, and have two legs. What if you want birds with different values for name and color? It's possible to change the properties of each bird manually but that would be a lot of work:",
+        "<blockquote>let swan = new Bird();<br>swan.name = \"Carlos\";<br>swan.color = \"white\";</blockquote>",
+        "Suppose you were writing a program to keep track of hundreds or even thousands of different birds in an aviary. It would take a lot of time to create all the birds, then change the properties to different values for every one.",
+        "To more easily create different <code>Bird</code> objects, you can design your Bird constructor to accept parameters:",
+        "<blockquote>function Bird(name, color) {<br>&nbsp;&nbsp;this.name = name;<br>&nbsp;&nbsp;this.color = color;<br>&nbsp;&nbsp;this.numLegs = 2;<br>}</blockquote>",
+        "Then pass in the values as arguments to define each unique bird into the <code>Bird</code> constructor:",
+        "<code>let cardinal = new Bird(\"Bruce\", \"red\");</code>",
+        "This gives a new instance of <code>Bird</code> with name and color properties set to Bruce and red, respectively. The <code>numLegs</code> property is still set to 2.",
+        "The <code>cardinal</code> has these properties:",
+        "<blockquote>cardinal.name // => Bruce<br>cardinal.color // => red<br>cardinal.numLegs // => 2</blockquote>",
+        "The constructor is more flexible. It's now possible to define the properties for each <code>Bird</code> at the time it is created, which is one way that JavaScript constructors are so useful. They group objects together based on shared characteristics and behavior and define a blueprint that automates their creation.",
+        "<hr>",
+        "Create another <code>Dog</code> constructor. This time, set it up to take the parameters <code>name</code> and <code>color</code>, and have the property <code>numLegs</code> fixed at 4. Then create a new <code>Dog</code> saved in a variable <code>terrier</code>. Pass it two strings as arguments for the <code>name</code> and <code>color</code> properties."
+      ],
+      "challengeSeed": [
+        "function Dog() {",
+        "  ",
+        "}",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert((new Dog('Clifford')).name === 'Clifford', 'message: <code>Dog</code> should receive an argument for <code>name</code>.');",
+        "assert((new Dog('Clifford', 'yellow')).color === 'yellow', 'message: <code>Dog</code> should receive an argument for <code>color</code>.');",
+        "assert((new Dog('Clifford')).numLegs === 4, 'message: <code>Dog</code> should have property <code>numLegs</code> set to 4.');",
+        "assert(terrier instanceof Dog, 'message: <code>terrier</code> should be created using the <code>Dog</code> constructor.');"
+      ],
+      "solutions": [
+        "function Dog (name, color) {\n  this.numLegs = 4;\n  this.name = name;\n  this.color = color;\n}\n\nconst terrier = new Dog();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dae367417b2b2512b7a",
+      "title": "Verify an Object's Constructor with instanceof",
+      "description": [
+        "Anytime a constructor function creates a new object, that object is said to be an <code>instance</code> of its constructor. JavaScript gives a convenient way to verify this with the <code>instanceof</code> operator. <code>instanceof</code> allows you to compare an object to a constructor, returning <code>true</code> or <code>false</code> based on whether or not that object was created with the constructor. Here's an example:",
+        "<blockquote>let Bird = function(name, color) {<br>&nbsp;&nbsp;this.name = name;<br>&nbsp;&nbsp;this.color = color;<br>&nbsp;&nbsp;this.numLegs = 2;<br>}<br><br>let crow = new Bird(\"Alexis\", \"black\");<br><br>crow instanceof Bird; // => true</blockquote>",
+        "If an object is created without using a constructor, <code>instanceof</code> will verify that it is not an instance of that constructor:",
+        "<blockquote>let canary = {<br>&nbsp;&nbsp;name: \"Mildred\",<br>&nbsp;&nbsp;color: \"Yellow\",<br>&nbsp;&nbsp;numLegs: 2<br>};<br><br>canary instanceof Bird; // => false</blockquote>",
+        "<hr>",
+        "Create a new instance of the <code>House</code> constructor, calling it <code>myHouse</code> and passing a number of bedrooms. Then, use <code>instanceof</code> to verify that it is an instance of <code>House</code>."
+      ],
+      "challengeSeed": [
+        "/* jshint expr: true */",
+        "",
+        "function House(numBedrooms) {",
+        "  this.numBedrooms = numBedrooms;",
+        "}",
+        "",
+        "// Add your code below this line",
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(typeof myHouse.numBedrooms === 'number', 'message: <code>myHouse</code> should have a <code>numBedrooms</code> attribute set to a number.');",
+        "assert(/myHouse\\s*instanceof\\s*House/.test(code), 'message: Be sure to verify that <code>myHouse</code> is an instance of <code>House</code> using the <code>instanceof</code> operator.');"
+      ],
+      "solutions": [
+        "function House(numBedrooms) {\n  this.numBedrooms = numBedrooms;\n}\nconst myHouse = new House(4);\nconsole.log(myHouse instanceof House);"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dae367417b2b2512b7b",
+      "title": "Understand Own Properties",
+      "description": [
+        "In the following example, the <code>Bird</code> constructor defines two properties: <code>name</code> and <code>numLegs</code>:",
+        "<blockquote>function Bird(name) {<br>&nbsp;&nbsp;this.name  = name;<br>&nbsp;&nbsp;this.numLegs = 2;<br>}<br><br>let duck = new Bird(\"Donald\");<br>let canary = new Bird(\"Tweety\");</blockquote>",
+        "<code>name</code> and <code>numLegs</code> are called <code>own</code> properties, because they are defined directly on the instance object. That means that <code>duck</code> and <code>canary</code> each has its own separate copy of these properties.",
+        "In fact every instance of <code>Bird</code> will have its own copy of these properties.",
+        "The following code adds all of the <code>own</code> properties of <code>duck</code> to the array <code>ownProps</code>:",
+        "<blockquote>let ownProps = [];<br><br>for (let property in duck) {<br>&nbsp;&nbsp;if(duck.hasOwnProperty(property)) {<br>&nbsp;&nbsp;&nbsp;&nbsp;ownProps.push(property);<br>&nbsp;&nbsp;}<br>}<br><br>console.log(ownProps); // prints [ \"name\", \"numLegs\" ]</blockquote>",
+        "<hr>",
+        "Add the <code>own</code> properties of <code>canary</code> to the array <code>ownProps</code>."
+      ],
+      "challengeSeed": [
+        "function Bird(name) {",
+        "  this.name = name;",
+        "  this.numLegs = 2;",
+        "}",
+        "",
+        "let canary = new Bird(\"Tweety\");",
+        "let ownProps = [];",
+        "// Add your code below this line",
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(ownProps.indexOf('name') !== -1 && ownProps.indexOf('numLegs') !== -1, 'message: <code>ownProps</code> should include the values <code>\"numLegs\"</code> and <code>\"name\"</code>.');",
+        "assert(!/\\Object.keys/.test(code), 'message: Solve this challenge without using the built in method <code>Object.keys()</code>.');"
+      ],
+      "solutions": [
+        "function Bird(name) {\n  this.name = name;\n  this.numLegs = 2;\n}\n\nlet canary = new Bird(\"Tweety\");\nfunction getOwnProps (obj) {\n  const props = [];\n  \n  for (let prop in obj) {\n    if (obj.hasOwnProperty(prop)) {\n      props.push(prop);\n    }\n  }\n  \n  return props;\n}\n\nconst ownProps = getOwnProps(canary);"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dae367417b2b2512b7c",
+      "title": "Use Prototype Properties to Reduce Duplicate Code",
+      "description": [
+        "Since <code>numLegs</code> will probably have the same value for all instances of <code>Bird</code>, you essentially have a duplicated variable <code>numLegs</code> inside each <code>Bird</code> instance.",
+        "This may not be an issue when there are only two instances, but imagine if there are millions of instances. That would be a lot of duplicated variables.",
+        "A better way is to use <code>Bird’s</code> <code>prototype</code>. The <code>prototype</code> is an object that is shared among ALL instances of <code>Bird</code>. Here's how to add <code>numLegs</code> to the <code>Bird prototype</code>:",
+        "<blockquote>Bird.prototype.numLegs = 2;</blockquote>",
+        "Now all instances of <code>Bird</code> have the <code>numLegs</code> property.",
+        "<blockquote>console.log(duck.numLegs);  // prints 2<br>console.log(canary.numLegs);  // prints 2</blockquote>",
+        "Since all instances automatically have the properties on the <code>prototype</code>, think of a <code>prototype</code> as a \"recipe\" for creating objects.",
+        "Note that the <code>prototype</code> for <code>duck</code> and <code>canary</code> is part of the <code>Bird</code> constructor as <code>Bird.prototype</code>. Nearly every object in JavaScript has a <code>prototype</code> property which is part of the constructor function that created it.",
+        "<hr>",
+        "Add a <code>numLegs</code> property to the <code>prototype</code> of <code>Dog</code>"
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name;",
+        "}",
+        "",
+        "",
+        "",
+        "// Add your code above this line",
+        "let beagle = new Dog(\"Snoopy\");"
+      ],
+      "tests": [
+        "assert(beagle.numLegs !== undefined, 'message: <code>beagle</code> should have a <code>numLegs</code> property.');",
+        "assert(typeof(beagle.numLegs) === 'number' , 'message: <code>beagle.numLegs</code> should be a number.');",
+        "assert(beagle.hasOwnProperty('numLegs') === false, 'message: <code>numLegs</code> should be a <code>prototype</code> property not an <code>own</code> property.');"
+      ],
+      "solutions": [
+        "function Dog (name) {\n  this.name = name;\n}\nDog.prototype.numLegs = 4;\nlet beagle = new Dog(\"Snoopy\");"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7daf367417b2b2512b7d",
+      "title": "Iterate Over All Properties",
+      "description": [
+        "You have now seen two kinds of properties: <code>own</code> properties and <code>prototype</code> properties. <code>Own</code> properties are defined directly on the object instance itself. And <code>prototype</code> properties are defined on the <code>prototype</code>.",
+        "<blockquote>function Bird(name) {<br>&nbsp;&nbsp;this.name = name;  //own property<br>}<br><br>Bird.prototype.numLegs = 2; // prototype property<br><br>let duck = new Bird(\"Donald\");</blockquote>",
+        "Here is how you add <code>duck’s</code> <code>own</code> properties to the array <code>ownProps</code> and <code>prototype</code> properties to the array <code>prototypeProps</code>:",
+        "<blockquote>let ownProps = [];<br>let prototypeProps = [];<br><br>for (let property in duck) {<br>&nbsp;&nbsp;if(duck.hasOwnProperty(property)) {<br>&nbsp;&nbsp;&nbsp;&nbsp;ownProps.push(property);<br>&nbsp;&nbsp;} else {<br>&nbsp;&nbsp;&nbsp;&nbsp;prototypeProps.push(property);<br>&nbsp;&nbsp;}<br>}<br><br>console.log(ownProps); // prints [\"name\"]<br>console.log(prototypeProps); // prints [\"numLegs\"]</blockquote>",
+        "<hr>",
+        "Add all of the <code>own</code> properties of <code>beagle</code> to the array <code>ownProps</code>. Add all of the <code>prototype</code> properties of <code>Dog</code> to the array <code>prototypeProps</code>."
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name;",
+        "}",
+        "",
+        "Dog.prototype.numLegs = 4;",
+        "",
+        "let beagle = new Dog(\"Snoopy\");",
+        "",
+        "let ownProps = [];",
+        "let prototypeProps = [];",
+        "",
+        "// Add your code below this line ",
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(ownProps.indexOf('name') !== -1, 'message: The <code>ownProps</code> array should include <code>\"name\"</code>.');",
+        "assert(prototypeProps.indexOf('numLegs') !== -1, 'message: The <code>prototypeProps</code> array should include <code>\"numLegs\"</code>.');",
+        "assert(!/\\Object.keys/.test(code), 'message: Solve this challenge without using the built in method <code>Object.keys()</code>.');"
+      ],
+      "solutions": [
+        "function Dog(name) {\n  this.name = name;\n}\n\nDog.prototype.numLegs = 4;\n\nlet beagle = new Dog(\"Snoopy\");\n\nlet ownProps = [];\nlet prototypeProps = [];\nfor (let prop in beagle) {\n  if (beagle.hasOwnProperty(prop)) {\n    ownProps.push(prop);\n  } else {\n    prototypeProps.push(prop);\n  }\n}"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7daf367417b2b2512b7e",
+      "title": "Understand the Constructor Property",
+      "description": [
+        "There is a special <code>constructor</code> property located on the object instances <code>duck</code> and <code>beagle</code> that were created in the previous challenges:",
+        "<blockquote>let duck = new Bird();<br>let beagle = new Dog();<br><br>console.log(duck.constructor === Bird);  //prints true<br>console.log(beagle.constructor === Dog);  //prints true</blockquote>",
+        "Note that the <code>constructor</code> property is a reference to the constructor function that created the instance.",
+        "The advantage of the <code>constructor</code> property is that it's possible to check for this property to find out what kind of object it is. Here's an example of how this could be used:",
+        "<blockquote>function joinBirdFraternity(candidate) {<br>&nbsp;&nbsp;if (candidate.constructor === Bird) {<br>&nbsp;&nbsp;&nbsp;&nbsp;return true;<br>&nbsp;&nbsp;} else {<br>&nbsp;&nbsp;&nbsp;&nbsp;return false;<br>&nbsp;&nbsp;}<br>}</blockquote>",
+        "<strong>Note</strong><br>Since the <code>constructor</code> property can be overwritten (which will be covered in the next two challenges) it’s generally better to use the <code>instanceof</code> method to check the type of an object.",
+        "<hr>",
+        "Write a <code>joinDogFraternity</code> function that takes a <code>candidate</code> parameter and, using the <code>constructor</code> property, return <code>true</code> if the candidate is a <code>Dog</code>, otherwise return <code>false</code>."
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name;",
+        "}",
+        "",
+        "// Add your code below this line",
+        "function joinDogFraternity(candidate) {",
+        "  ",
+        "}",
+        ""
+      ],
+      "tests": [
+        "assert(typeof(joinDogFraternity) === 'function', 'message: <code>joinDogFraternity</code> should be defined as a function.');",
+        "assert(joinDogFraternity(new Dog(\"\")) === true, 'message: <code>joinDogFraternity</code> should return true if<code>candidate</code> is an instance of <code>Dog</code>.');",
+        "assert(/\\.constructor/.test(code) && !/instanceof/.test(code), 'message: <code>joinDogFraternity</code> should use the <code>constructor</code> property.');"
+      ],
+      "solutions": [
+        "function Dog(name) {\n  this.name = name;\n}\nfunction joinDogFraternity(candidate) {\n  return candidate.constructor === Dog;\n}"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7daf367417b2b2512b7f",
+      "title": "Change the Prototype to a New Object",
+      "description": [
+        "Up until now you have been adding properties to the <code>prototype</code> individually:",
+        "<blockquote>Bird.prototype.numLegs = 2;</blockquote>",
+        "This becomes tedious after more than a few properties.",
+        "<blockquote>Bird.prototype.eat = function() {<br>&nbsp;&nbsp;console.log(\"nom nom nom\");<br>}<br><br>Bird.prototype.describe = function() {<br>&nbsp;&nbsp;console.log(\"My name is \" + this.name);<br>}</blockquote>",
+        "A more efficient way is to set the <code>prototype</code> to a new object that already contains the properties. This way, the properties are added all at once:",
+        "<blockquote>Bird.prototype = {<br>&nbsp;&nbsp;numLegs: 2, <br>&nbsp;&nbsp;eat: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"nom nom nom\");<br>&nbsp;&nbsp;},<br>&nbsp;&nbsp;describe: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"My name is \" + this.name);<br>&nbsp;&nbsp;}<br>};</blockquote>",
+        "<hr>",
+        "Add the property <code>numLegs</code> and the two methods <code>eat()</code> and <code>describe()</code> to the <code>prototype</code> of <code>Dog</code> by setting the <code>prototype</code> to a new object."
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name; ",
+        "}",
+        "",
+        "Dog.prototype = {",
+        "  // Add your code below this line",
+        "  ",
+        "};"
+      ],
+      "tests": [
+        "assert((/Dog\\.prototype\\s*?=\\s*?{/).test(code), 'message: <code>Dog.prototype</code> should be set to a new object.');",
+        "assert(Dog.prototype.numLegs !== undefined, 'message: <code>Dog.prototype</code> should have the property <code>numLegs</code>.');",
+        "assert(typeof Dog.prototype.eat === 'function', 'message: <code>Dog.prototype</code> should have the method <code>eat()</code>.'); ",
+        "assert(typeof Dog.prototype.describe === 'function', 'message: <code>Dog.prototype</code> should have the method <code>describe()</code>.'); "
+      ],
+      "solutions": [
+        "function Dog(name) {\n  this.name = name; \n}\nDog.prototype = {\nnumLegs: 4,\n  eat () {\n    console.log('nom nom nom');\n  },\n  describe () {\n    console.log('My name is ' + this.name);\n  }\n};"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7daf367417b2b2512b80",
+      "title": "Remember to Set the Constructor Property when Changing the Prototype",
+      "description": [
+        "There is one crucial side effect of manually setting the <code>prototype</code> to a new object. It erased the <code>constructor</code> property! The code in the previous challenge would print the following for <code>duck</code>:",
+        "<blockquote>console.log(duck.constructor)<br>// prints ‘undefined’ - Oops!</blockquote>",
+        "To fix this, whenever a prototype is manually set to a new object, remember to define the <code>constructor</code> property:",
+        "<blockquote>Bird.prototype = {<br>&nbsp;&nbsp;constructor: Bird, // define the constructor property<br>&nbsp;&nbsp;numLegs: 2,<br>&nbsp;&nbsp;eat: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"nom nom nom\");<br>&nbsp;&nbsp;},<br>&nbsp;&nbsp;describe: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"My name is \" + this.name); <br>&nbsp;&nbsp;}<br>};</blockquote>",
+        "<hr>",
+        "Define the <code>constructor</code> property on the <code>Dog</code> <code>prototype</code>."
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name; ",
+        "}",
+        "",
+        "// Modify the code below this line",
+        "Dog.prototype = {",
+        "  ",
+        "  numLegs: 2, ",
+        "  eat: function() {",
+        "    console.log(\"nom nom nom\"); ",
+        "  }, ",
+        "  describe: function() {",
+        "    console.log(\"My name is \" + this.name); ",
+        "  }",
+        "};"
+      ],
+      "tests": [
+        "assert(Dog.prototype.constructor === Dog, 'message: <code>Dog.prototype</code> should set the <code>constructor</code> property.');"
+      ],
+      "solutions": [
+        "function Dog(name) {\n  this.name = name; \n}\nDog.prototype = {\n  constructor: Dog,\n  numLegs: 2, \n  eat: function() {\n    console.log(\"nom nom nom\"); \n  }, \n  describe: function() {\n    console.log(\"My name is \" + this.name); \n  }\n};"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db0367417b2b2512b81",
+      "title": "Understand Where an Object’s Prototype Comes From",
+      "description": [
+        "Just like people inherit genes from their parents, an object inherits its <code>prototype</code> directly from the constructor function that created it. For example, here the <code>Bird</code> constructor creates the <code>duck</code> object:",
+        "<blockquote>function Bird(name) {<br>&nbsp;&nbsp;this.name = name;<br>}<br><br>let duck = new Bird(\"Donald\");</blockquote>",
+        "<code>duck</code> inherits its <code>prototype</code> from the <code>Bird</code> constructor function. You can show this relationship with the <code>isPrototypeOf</code> method:",
+        "<blockquote>Bird.prototype.isPrototypeOf(duck);<br>// returns true</blockquote>",
+        "<hr>",
+        "Use <code>isPrototypeOf</code> to check the <code>prototype</code> of <code>beagle</code>."
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name;",
+        "}",
+        "",
+        "let beagle = new Dog(\"Snoopy\");",
+        "",
+        "// Add your code below this line",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(/Dog\\.prototype\\.isPrototypeOf\\(beagle\\)/.test(code), 'message: Show that <code>Dog.prototype</code> is the <code>prototype</code> of <code>beagle</code>');"
+      ],
+      "solutions": [
+        "function Dog(name) {\n  this.name = name;\n}\nlet beagle = new Dog(\"Snoopy\");\nDog.prototype.isPrototypeOf(beagle);"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db0367417b2b2512b82",
+      "title": "Understand the Prototype Chain",
+      "description": [
+        "All objects in JavaScript (with a few exceptions) have a <code>prototype</code>. Also, an object’s <code>prototype</code> itself is an object.",
+        "<blockquote>function Bird(name) {<br>&nbsp;&nbsp;this.name = name;<br>}<br><br>typeof Bird.prototype; // => object</blockquote>",
+        "Because a <code>prototype</code> is an object, a <code>prototype</code> can have its own <code>prototype</code>! In this case, the <code>prototype</code> of <code>Bird.prototype</code> is <code>Object.prototype</code>:",
+        "<blockquote>Object.prototype.isPrototypeOf(Bird.prototype);<br>// returns true</blockquote>",
+        "How is this useful? You may recall the <code>hasOwnProperty</code> method from a previous challenge:",
+        "<blockquote>let duck = new Bird(\"Donald\");<br>duck.hasOwnProperty(\"name\"); // => true</blockquote>",
+        "The <code>hasOwnProperty</code> method is defined in <code>Object.prototype</code>, which can be accessed by <code>Bird.prototype</code>, which can then be accessed by <code>duck</code>. This is an example of the <code>prototype</code> chain.",
+        "In this <code>prototype</code> chain, <code>Bird</code> is the <code>supertype</code> for <code>duck</code>, while <code>duck</code> is the <code>subtype</code>. <code>Object</code> is a <code>supertype</code> for both <code>Bird</code> and <code>duck</code>.",
+        "<code>Object</code> is a <code>supertype</code> for all objects in JavaScript. Therefore, any object can use the <code>hasOwnProperty</code> method.",
+        "<hr>",
+        "Modify the code to show the correct prototype chain."
+      ],
+      "challengeSeed": [
+        "function Dog(name) {",
+        "  this.name = name;",
+        "}",
+        "",
+        "let beagle = new Dog(\"Snoopy\");",
+        "",
+        "Dog.prototype.isPrototypeOf(beagle);  // => true",
+        "",
+        "// Fix the code below so that it evaluates to true",
+        "???.isPrototypeOf(Dog.prototype);",
+        ""
+      ],
+      "tests": [
+        "assert(/Object\\.prototype\\.isPrototypeOf/.test(code), \"message: Your code should show that <code>Object.prototype</code> is the prototype of <code>Dog.prototype</code>\");"
+      ],
+      "solutions": [
+        "function Dog(name) {\n  this.name = name;\n}\nlet beagle = new Dog(\"Snoopy\");\nDog.prototype.isPrototypeOf(beagle);\nObject.prototype.isPrototypeOf(Dog.prototype);"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db0367417b2b2512b83",
+      "title": "Use Inheritance So You Don't Repeat Yourself",
+      "description": [
+        "There's a principle in programming called <code>Don't Repeat Yourself (DRY)</code>. The reason repeated code is a problem is because any change requires fixing code in multiple places. This usually means more work for programmers and more room for errors.",
+        "Notice in the example below that the <code>describe</code> method is shared by <code>Bird</code> and <code>Dog</code>:",
+        "<blockquote>Bird.prototype = {<br>&nbsp;&nbsp;constructor: Bird,<br>&nbsp;&nbsp;describe: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"My name is \" + this.name);<br>&nbsp;&nbsp;}<br>};<br><br>Dog.prototype = {<br>&nbsp;&nbsp;constructor: Dog,<br>&nbsp;&nbsp;describe: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"My name is \" + this.name);<br>&nbsp;&nbsp;}<br>};</blockquote>",
+        "The <code>describe</code> method is repeated in two places. The code can be edited to follow the <code>DRY</code> principle by creating a <code>supertype</code> (or parent) called <code>Animal</code>:",
+        "<blockquote>function Animal() { };<br><br>Animal.prototype = {<br>&nbsp;&nbsp;constructor: Animal, <br>&nbsp;&nbsp;describe: function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"My name is \" + this.name);<br>&nbsp;&nbsp;}<br>};</blockquote>",
+        "Since <code>Animal</code> includes the <code>describe</code> method, you can remove it from <code>Bird</code> and <code>Dog</code>:",
+        "<blockquote>Bird.prototype = {<br>&nbsp;&nbsp;constructor: Bird<br>};<br><br>Dog.prototype = {<br>&nbsp;&nbsp;constructor: Dog<br>};</blockquote>",
+        "<hr>",
+        "The <code>eat</code> method is repeated in both <code>Cat</code> and <code>Bear</code>. Edit the code in the spirit of <code>DRY</code> by moving the <code>eat</code> method to the <code>Animal</code> <code>supertype</code>."
+      ],
+      "challengeSeed": [
+        "function Cat(name) {",
+        "  this.name = name; ",
+        "}",
+        "",
+        "Cat.prototype = {",
+        "  constructor: Cat, ",
+        "  eat: function() {",
+        "    console.log(\"nom nom nom\");",
+        "  }",
+        "};",
+        "",
+        "function Bear(name) {",
+        "  this.name = name; ",
+        "}",
+        "",
+        "Bear.prototype = {",
+        "  constructor: Bear, ",
+        "  eat: function() {",
+        "    console.log(\"nom nom nom\");",
+        "  }",
+        "};",
+        "",
+        "function Animal() { }",
+        "",
+        "Animal.prototype = {",
+        "  constructor: Animal,",
+        "  ",
+        "};"
+      ],
+      "tests": [
+        "assert(Animal.prototype.hasOwnProperty('eat'), 'message: <code>Animal.prototype</code> should have the <code>eat</code> property.');",
+        "assert(!(Bear.prototype.hasOwnProperty('eat')), 'message: <code>Bear.prototype</code> should not have the <code>eat</code> property.');",
+        "assert(!(Cat.prototype.hasOwnProperty('eat')), 'message: <code>Cat.prototype</code> should not have the <code>eat</code> property.');"
+      ],
+      "solutions": [
+        "function Cat(name) {\n  this.name = name; \n}\n\nCat.prototype = {\n  constructor: Cat\n};\n\nfunction Bear(name) {\n  this.name = name; \n}\n\nBear.prototype = {\n  constructor: Bear\n};\n\nfunction Animal() { }\n\nAnimal.prototype = {\n  constructor: Animal,\n  eat: function() {\n    console.log(\"nom nom nom\");\n  }\n};"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db0367417b2b2512b84",
+      "title": "Inherit Behaviors from a Supertype",
+      "description": [
+        "In the previous challenge, you created a <code>supertype</code> called <code>Animal</code> that defined behaviors shared by all animals:",
+        "<blockquote>function Animal() { }<br>Animal.prototype.eat = function() {<br>&nbsp;&nbsp;console.log(\"nom nom nom\");<br>};</blockquote>",
+        "This and the next challenge will cover how to reuse <code>Animal's</code> methods inside <code>Bird</code> and <code>Dog</code> without defining them again. It uses a technique called <code>inheritance</code>.",
+        "This challenge covers the first step: make an instance of the <code>supertype</code> (or parent).",
+        "You already know one way to create an instance of <code>Animal</code> using the <code>new</code> operator:",
+        "<blockquote>let animal = new Animal();</blockquote>",
+        "There are some disadvantages when using this syntax for <code>inheritance</code>, which are too complex for the scope of this challenge. Instead, here's an alternative approach without those disadvantages:",
+        "<blockquote>let animal = Object.create(Animal.prototype);</blockquote>",
+        "<code>Object.create(obj)</code> creates a new object, and sets <code>obj</code> as the new object's <code>prototype</code>. Recall that the <code>prototype</code> is like the \"recipe\" for creating an object. By setting the <code>prototype</code> of <code>animal</code> to be <code>Animal's</code> <code>prototype</code>, you are effectively giving the <code>animal</code> instance the same \"recipe\" as any other instance of <code>Animal</code>.",
+        "<blockquote>animal.eat(); // prints \"nom nom nom\"<br>animal instanceof Animal; // => true</blockquote>",
+        "<hr>",
+        "Use <code>Object.create</code> to make two instances of <code>Animal</code> named <code>duck</code> and <code>beagle</code>."
+      ],
+      "challengeSeed": [
+        "function Animal() { }",
+        "",
+        "Animal.prototype = {",
+        "  constructor: Animal, ",
+        "  eat: function() {",
+        "    console.log(\"nom nom nom\");",
+        "  }",
+        "};",
+        "",
+        "// Add your code below this line",
+        "",
+        "let duck; // Change this line",
+        "let beagle; // Change this line",
+        "",
+        "duck.eat(); // Should print \"nom nom nom\"",
+        "beagle.eat(); // Should print \"nom nom nom\" "
+      ],
+      "tests": [
+        "assert(typeof duck !== \"undefined\", 'message: The <code>duck</code> variable should be defined.');",
+        "assert(typeof beagle !== \"undefined\", 'message: The <code>beagle</code> variable should be defined.');",
+        "assert(duck instanceof Animal, 'message: <code>duck</code> should have a <code>prototype</code> of <code>Animal</code>.');",
+        "assert(beagle instanceof Animal, 'message: <code>beagle</code> should have a <code>prototype</code> of <code>Animal</code>.');"
+      ],
+      "solutions": [
+        "function Animal() { }\n\nAnimal.prototype = {\n  constructor: Animal, \n  eat: function() {\n    console.log(\"nom nom nom\");\n  }\n};\nlet duck = Object.create(Animal.prototype);\nlet beagle = Object.create(Animal.prototype);\n\nduck.eat();\nbeagle.eat();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db1367417b2b2512b85",
+      "title": "Set the Child's Prototype to an Instance of the Parent",
+      "description": [
+        "In the previous challenge you saw the first step for inheriting behavior from the <code>supertype</code> (or parent) <code>Animal</code>: making a new instance of <code>Animal</code>.",
+        "This challenge covers the next step: set the <code>prototype</code> of the <code>subtype</code> (or child)&mdash;in this case, <code>Bird</code>&mdash;to be an instance of <code>Animal</code>.",
+        "<blockquote>Bird.prototype = Object.create(Animal.prototype);</blockquote>",
+        "Remember that the <code>prototype</code> is like the \"recipe\" for creating an object. In a way, the recipe for <code>Bird</code> now includes all the key \"ingredients\" from <code>Animal</code>.",
+        "<blockquote>let duck = new Bird(\"Donald\");<br>duck.eat(); // prints \"nom nom nom\"</blockquote>",
+        "<code>duck</code> inherits all of <code>Animal</code>'s properties, including the <code>eat</code> method.",
+        "<hr>",
+        "Modify the code so that instances of <code>Dog</code> inherit from <code>Animal</code>."
+      ],
+      "challengeSeed": [
+        "function Animal() { }",
+        "",
+        "Animal.prototype = {",
+        "  constructor: Animal,",
+        "  eat: function() {",
+        "    console.log(\"nom nom nom\");",
+        "  }",
+        "};",
+        "",
+        "function Dog() { }",
+        "",
+        "// Add your code below this line",
+        "",
+        "",
+        "let beagle = new Dog();",
+        "beagle.eat();  // Should print \"nom nom nom\""
+      ],
+      "tests": [
+        "assert(Animal.prototype.isPrototypeOf(Dog.prototype), 'message: <code>Dog.prototype</code> should be an instance of <code>Animal</code>.');"
+      ],
+      "solutions": [
+        "function Animal() { }\n\nAnimal.prototype = {\n  constructor: Animal,\n  eat: function() {\n    console.log(\"nom nom nom\");\n  }\n};\n\nfunction Dog() { }\nDog.prototype = Object.create(Animal.prototype);\n\nlet beagle = new Dog();\nbeagle.eat();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db1367417b2b2512b86",
+      "title": "Reset an Inherited Constructor Property",
+      "description": [
+        "When an object inherits its <code>prototype</code> from another object, it also inherits the <code>supertype</code>'s constructor property.",
+        "Here's an example:",
+        "<blockquote>function Bird() { }<br>Bird.prototype = Object.create(Animal.prototype);<br>let duck = new Bird();<br>duck.constructor // function Animal(){...}</blockquote>",
+        "But <code>duck</code> and all instances of <code>Bird</code> should show that they were constructed by <code>Bird</code> and not <code>Animal</code>. To do so, you can manually set <code>Bird's</code> constructor property to the <code>Bird</code> object:",
+        "<blockquote>Bird.prototype.constructor = Bird;<br>duck.constructor // function Bird(){...}</blockquote>",
+        "<hr>",
+        "Fix the code so <code>duck.constructor</code> and <code>beagle.constructor</code> return their respective constructors."
+      ],
+      "challengeSeed": [
+        "function Animal() { }",
+        "function Bird() { }",
+        "function Dog() { }",
+        "",
+        "Bird.prototype = Object.create(Animal.prototype);",
+        "Dog.prototype = Object.create(Animal.prototype);",
+        "",
+        "// Add your code below this line",
+        "",
+        "",
+        "",
+        "let duck = new Bird();",
+        "let beagle = new Dog();"
+      ],
+      "tests": [
+        "assert(Animal.prototype.isPrototypeOf(Bird.prototype), 'message: <code>Bird.prototype</code> should be an instance of <code>Animal</code>.');",
+        "assert(duck.constructor === Bird, 'message: <code>duck.constructor</code> should return <code>Bird</code>.');",
+        "assert(Animal.prototype.isPrototypeOf(Dog.prototype), 'message: <code>Dog.prototype</code> should be an instance of <code>Animal</code>.');",
+        "assert(beagle.constructor === Dog, 'message: <code>beagle.constructor</code> should return <code>Dog</code>.');"
+      ],
+      "solutions": [
+        "function Animal() { }\nfunction Bird() { }\nfunction Dog() { }\nBird.prototype = Object.create(Animal.prototype);\nDog.prototype = Object.create(Animal.prototype);\nDog.prototype.constructor = Dog;\nBird.prototype.constructor = Bird;\nlet duck = new Bird();\nlet beagle = new Dog();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db1367417b2b2512b87",
+      "title": "Add Methods After Inheritance",
+      "description": [
+        "A constructor function that inherits its <code>prototype</code> object from a <code>supertype</code> constructor function can still have its own methods in addition to inherited methods.",
+        "For example, <code>Bird</code> is a constructor that inherits its <code>prototype</code> from <code>Animal</code>:",
+        "<blockquote>function Animal() { }<br>Animal.prototype.eat = function() {<br>&nbsp;&nbsp;console.log(\"nom nom nom\");<br>};<br>function Bird() { }<br>Bird.prototype = Object.create(Animal.prototype);<br>Bird.prototype.constructor = Bird;</blockquote>",
+        "In addition to what is inherited from <code>Animal</code>, you want to add behavior that is unique to <code>Bird</code> objects. Here, <code>Bird</code> will get a <code>fly()</code> function. Functions are added to <code>Bird's</code> <code>prototype</code> the same way as any constructor function:",
+        "<blockquote>Bird.prototype.fly = function() {<br>&nbsp;&nbsp;console.log(\"I'm flying!\");<br>};</blockquote>",
+        "Now instances of <code>Bird</code> will have both <code>eat()</code> and <code>fly()</code> methods:",
+        "<blockquote>let duck = new Bird();<br>duck.eat(); // prints \"nom nom nom\"<br>duck.fly(); // prints \"I'm flying!\"</blockquote>",
+        "<hr>",
+        "Add all necessary code so the <code>Dog</code> object inherits from <code>Animal</code> and the <code>Dog's</code> <code>prototype</code> constructor is set to Dog. Then add a <code>bark()</code> method to the <code>Dog</code> object so that <code>beagle</code> can both <code>eat()</code> and <code>bark()</code>. The <code>bark()</code> method should print \"Woof!\" to the console."
+      ],
+      "challengeSeed": [
+        "function Animal() { }",
+        "Animal.prototype.eat = function() { console.log(\"nom nom nom\"); };",
+        "",
+        "function Dog() { }",
+        "",
+        "// Add your code below this line",
+        "",
+        "",
+        "",
+        "",
+        "// Add your code above this line",
+        "",
+        "let beagle = new Dog();",
+        "",
+        "beagle.eat(); // Should print \"nom nom nom\"",
+        "beagle.bark(); // Should print \"Woof!\""
+      ],
+      "tests": [
+        "assert(typeof Animal.prototype.bark == \"undefined\", 'message: <code>Animal</code> should not respond to the <code>bark()</code> method.');",
+        "assert(typeof Dog.prototype.eat == \"function\", 'message: <code>Dog</code> should inherit the <code>eat()</code> method from <code>Animal</code>.');",
+        "assert(Dog.prototype.hasOwnProperty('bark'), 'message: <code>Dog</code> should have the <code>bark()</code> method as an <code>own</code> property.');",
+        "assert(beagle instanceof Animal, 'message: <code>beagle</code> should be an <code>instanceof</code> <code>Animal</code>.');",
+        "assert(beagle.constructor === Dog, 'message: The constructor for <code>beagle</code> should be set to <code>Dog</code>.');"
+      ],
+      "solutions": [
+        "function Animal() { }\nAnimal.prototype.eat = function() { console.log(\"nom nom nom\"); };\n\nfunction Dog() { }\nDog.prototype = Object.create(Animal.prototype);\nDog.prototype.constructor = Dog;\nDog.prototype.bark = function () {\n  console.log('Woof!');\n};\nlet beagle = new Dog();\n\nbeagle.eat();\nbeagle.bark();"
+      ],
+      "hints": [
+        "Objects inherit methods from other objects by cloning their prototype. The Object.create method will come in handy, and don't forget to reset the constructor property afterward!"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db1367417b2b2512b88",
+      "title": "Override Inherited Methods",
+      "description": [
+        "In previous lessons, you learned that an object can inherit its behavior (methods) from another object by cloning its <code>prototype</code> object:",
+        "<blockquote>ChildObject.prototype = Object.create(ParentObject.prototype);</blockquote>",
+        "Then the <code>ChildObject</code> received its own methods by chaining them onto its <code>prototype</code>:",
+        "<blockquote>ChildObject.prototype.methodName = function() {...};</blockquote>",
+        "It's possible to override an inherited method. It's done the same way - by adding a method to <code>ChildObject.prototype</code> using the same method name as the one to override.",
+        "Here's an example of <code>Bird</code> overriding the <code>eat()</code> method inherited from <code>Animal</code>:",
+        "<blockquote>function Animal() { }<br>Animal.prototype.eat = function() {<br>&nbsp;&nbsp;return \"nom nom nom\";<br>};<br>function Bird() { }<br><br>// Inherit all methods from Animal<br>Bird.prototype = Object.create(Animal.prototype);<br><br>// Bird.eat() overrides Animal.eat()<br>Bird.prototype.eat = function() {<br>&nbsp;&nbsp;return \"peck peck peck\";<br>};</blockquote>",
+        "If you have an instance <code>let duck = new Bird();</code> and you call <code>duck.eat()</code>, this is how JavaScript looks for the method on <code>duck’s</code> <code>prototype</code> chain:",
+        "1. duck => Is eat() defined here? No.",
+        "2. Bird => Is eat() defined here? => Yes. Execute it and stop searching.",
+        "3. Animal => eat() is also defined, but JavaScript stopped searching before reaching this level.",
+        "4. Object => JavaScript stopped searching before reaching this level.",
+        "<hr>",
+        "Override the <code>fly()</code> method for <code>Penguin</code> so that it returns \"Alas, this is a flightless bird.\""
+      ],
+      "challengeSeed": [
+        "function Bird() { }",
+        "",
+        "Bird.prototype.fly = function() { return \"I am flying!\"; };",
+        "",
+        "function Penguin() { }",
+        "Penguin.prototype = Object.create(Bird.prototype);",
+        "Penguin.prototype.constructor = Penguin;",
+        "",
+        "// Add your code below this line",
+        "",
+        "",
+        "",
+        "// Add your code above this line",
+        "",
+        "let penguin = new Penguin();",
+        "console.log(penguin.fly());"
+      ],
+      "tests": [
+        "assert(penguin.fly() === \"Alas, this is a flightless bird.\", 'message: <code>penguin.fly()</code> should return the string \"Alas, this is a flightless bird.\"');",
+        "assert((new Bird()).fly() === \"I am flying!\", 'message: The <code>bird.fly()</code> method should return \"I am flying!\"');"
+      ],
+      "solutions": [
+        "function Bird() { }\n\nBird.prototype.fly = function() { return \"I am flying!\"; };\n\nfunction Penguin() { }\nPenguin.prototype = Object.create(Bird.prototype);\nPenguin.prototype.constructor = Penguin;\nPenguin.prototype.fly = () => 'Alas, this is a flightless bird.';\nlet penguin = new Penguin();\nconsole.log(penguin.fly());"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db2367417b2b2512b89",
+      "title": "Use a Mixin to Add Common Behavior Between Unrelated Objects",
+      "description": [
+        "As you have seen, behavior is shared through inheritance. However, there are cases when inheritance is not the best solution. Inheritance does not work well for unrelated objects like <code>Bird</code> and <code>Airplane</code>. They can both fly, but a <code>Bird</code> is not a type of <code>Airplane</code> and vice versa.",
+        "For unrelated objects, it's better to use <code>mixins</code>. A <code>mixin</code> allows other objects to use a collection of functions.",
+        "<blockquote>let flyMixin = function(obj) {<br>&nbsp;&nbsp;obj.fly = function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Flying, wooosh!\");<br>&nbsp;&nbsp;}<br>};</blockquote>",
+        "The <code>flyMixin</code> takes any object and gives it the <code>fly</code> method.",
+        "<blockquote>let bird = {<br>&nbsp;&nbsp;name: \"Donald\",<br>&nbsp;&nbsp;numLegs: 2<br>};<br><br>let plane = {<br>&nbsp;&nbsp;model: \"777\",<br>&nbsp;&nbsp;numPassengers: 524<br>};<br><br>flyMixin(bird);<br>flyMixin(plane);</blockquote>",
+        "Here <code>bird</code> and <code>plane</code> are passed into <code>flyMixin</code>, which then assigns the <code>fly</code> function to each object. Now <code>bird</code> and <code>plane</code> can both fly:",
+        "<blockquote>bird.fly(); // prints \"Flying, wooosh!\"<br>plane.fly(); // prints \"Flying, wooosh!\"</blockquote>",
+        "Note how the <code>mixin</code> allows for the same <code>fly</code> method to be reused by unrelated objects <code>bird</code> and <code>plane</code>.",
+        "<hr>",
+        "Create a <code>mixin</code> named <code>glideMixin</code> that defines a method named <code>glide</code>. Then use the <code>glideMixin</code> to give both <code>bird</code> and <code>boat</code> the ability to glide."
+      ],
+      "challengeSeed": [
+        "let bird = {",
+        "  name: \"Donald\",",
+        "  numLegs: 2",
+        "};",
+        "",
+        "let boat = {",
+        "  name: \"Warrior\",",
+        "  type: \"race-boat\"",
+        "};",
+        "",
+        "// Add your code below this line",
+        "",
+        "",
+        "",
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(typeof glideMixin === \"function\", 'message: Your code should declare a <code>glideMixin</code> variable that is a function.');",
+        "assert(typeof bird.glide === \"function\", 'message: Your code should use the <code>glideMixin</code> on the <code>bird</code> object to give it the <code>glide</code> method.');",
+        "assert(typeof boat.glide === \"function\", 'message: Your code should use the <code>glideMixin</code> on the <code>boat</code> object to give it the <code>glide</code> method.');"
+      ],
+      "solutions": [
+        "let bird = {\n  name: \"Donald\",\n  numLegs: 2\n};\n\nlet boat = {\n  name: \"Warrior\",\n  type: \"race-boat\"\n};\nfunction glideMixin (obj) {\n  obj.glide = () => 'Gliding!';\n}\n\nglideMixin(bird);\nglideMixin(boat);"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db2367417b2b2512b8a",
+      "title": "Use Closure to Protect Properties Within an Object from Being Modified Externally",
+      "description": [
+        "In the previous challenge, <code>bird</code> had a public property <code>name</code>. It is considered public because it can be accessed and changed outside of <code>bird</code>'s definition.",
+        "<blockquote>bird.name = \"Duffy\";</blockquote>",
+        "Therefore, any part of your code can easily change the name of <code>bird</code> to any value. Think about things like passwords and bank accounts being easily changeable by any part of your codebase. That could cause a lot of issues.",
+        "The simplest way to make properties private is by creating a variable within the constructor function. This changes the scope of that variable to be within the constructor function versus available globally. This way, the property can only be accessed and changed by methods also within the constructor function.",
+        "<blockquote>function Bird() {<br>&nbsp;&nbsp;let hatchedEgg = 10; // private property<br><br>&nbsp;&nbsp;this.getHatchedEggCount = function() { // publicly available method that a bird object can use<br>&nbsp;&nbsp;&nbsp;&nbsp;return hatchedEgg;<br>&nbsp;&nbsp;};<br>}<br>let ducky = new Bird();<br>ducky.getHatchedEggCount(); // returns 10</blockquote>",
+        "Here <code>getHachedEggCount</code> is a privileged method, because it has access to the private variable <code>hatchedEgg</code>. This is possible because <code>hatchedEgg</code> is declared in the same context as <code>getHachedEggCount</code>. In JavaScript, a function always has access to the context in which it was created. This is called <code>closure</code>.",
+        "<hr>",
+        "Change how <code>weight</code> is declared in the <code>Bird</code> function so it is a private variable. Then, create a method <code>getWeight</code> that returns the value of <code>weight</code>."
+      ],
+      "challengeSeed": [
+        "function Bird() {",
+        "  this.weight = 15;",
+        "  ",
+        "  ",
+        "}",
+        ""
+      ],
+      "tests": [
+        "assert(!code.match(/this\\.weight/g), 'message: The <code>weight</code> property should be a private variable.');",
+        "assert((new Bird()).getWeight() === 15, 'message: Your code should create a method in <code>Bird</code> called <code>getWeight</code> that returns the <code>weight</code>.');"
+      ],
+      "solutions": [
+        "function Bird() {\n  let weight = 15;\n  \n  this.getWeight = () => weight;\n}"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db2367417b2b2512b8b",
+      "title": "Understand the Immediately Invoked Function Expression (IIFE)",
+      "description": [
+        "A common pattern in JavaScript is to execute a function as soon as it is declared:",
+        "<blockquote>(function () {<br>&nbsp;&nbsp;console.log(\"Chirp, chirp!\");<br>})(); // this is an anonymous function expression that executes right away<br>// Outputs \"Chirp, chirp!\" immediately</blockquote>",
+        "Note that the function has no name and is not stored in a variable. The two parentheses () at the end of the function expression cause it to be immediately executed or invoked. This pattern is known as an <code>immediately invoked function expression</code> or <code>IIFE</code>.",
+        "<hr>",
+        "Rewrite the function <code>makeNest</code> and remove its call so instead it's an anonymous <code>immediately invoked function expression</code> (<code>IIFE</code>)."
+      ],
+      "challengeSeed": [
+        "function makeNest() {",
+        "  console.log(\"A cozy nest is ready\");",
+        "}",
+        "",
+        "makeNest(); "
+      ],
+      "tests": [
+        "assert(/\\(\\s*?function\\s*?\\(\\s*?\\)\\s*?{/.test(code), 'message: The function should be anonymous.');",
+        "assert(/}\\s*?\\)\\s*?\\(\\s*?\\)/.test(code), 'message: Your function should have parentheses at the end of the expression to call it immediately.');"
+      ],
+      "solutions": [
+        "(function () {\n  console.log(\"A cozy nest is ready\");\n})();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db2367417b2b2512b8c",
+      "title": "Use an IIFE to Create a Module",
+      "description": [
+        "An <code>immediately invoked function expression</code> (<code>IIFE</code>) is often used to group related functionality into a single object or <code>module</code>. For example, an earlier challenge defined two mixins:",
+        "<blockquote>function glideMixin(obj) {<br>&nbsp;&nbsp;obj.glide = function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Gliding on the water\");<br>&nbsp;&nbsp;};<br>}<br>function flyMixin(obj) {<br>&nbsp;&nbsp;obj.fly = function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Flying, wooosh!\");<br>&nbsp;&nbsp;};<br>}</blockquote>",
+        "We can group these <code>mixins</code> into a module as follows:",
+        "<blockquote>let motionModule = (function () {<br>&nbsp;&nbsp;return {<br>&nbsp;&nbsp;&nbsp;&nbsp;glideMixin: function (obj) {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;obj.glide = function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Gliding on the water\");<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;};<br>&nbsp;&nbsp;&nbsp;&nbsp;},<br>&nbsp;&nbsp;&nbsp;&nbsp;flyMixin: function(obj) {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;obj.fly = function() {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;console.log(\"Flying, wooosh!\");<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;};<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>&nbsp;&nbsp;}<br>}) (); // The two parentheses cause the function to be immediately invoked</blockquote>",
+        "Note that you have an <code>immediately invoked function expression</code> (<code>IIFE</code>) that returns an object <code>motionModule</code>. This returned object contains all of the <code>mixin</code> behaviors as properties of the object.",
+        "The advantage of the <code>module</code> pattern is that all of the motion behaviors can be packaged into a single object that can then be used by other parts of your code. Here is an example using it:",
+        "<blockquote>motionModule.glideMixin(duck);<br>duck.glide();</blockquote>",
+        "<hr>",
+        "Create a <code>module</code> named <code>funModule</code> to wrap the two <code>mixins</code> <code>isCuteMixin</code> and <code>singMixin</code>. <code>funModule</code> should return an object."
+      ],
+      "challengeSeed": [
+        "let isCuteMixin = function(obj) {",
+        "  obj.isCute = function() {",
+        "    return true;",
+        "  };",
+        "};",
+        "let singMixin = function(obj) {",
+        "  obj.sing = function() {",
+        "    console.log(\"Singing to an awesome tune\");",
+        "  };",
+        "};"
+      ],
+      "tests": [
+        "assert(typeof funModule === \"object\", 'message: <code>funModule</code> should be defined and return an object.');",
+        "assert(typeof funModule.isCuteMixin === \"function\", 'message: <code>funModule.isCuteMixin</code> should access a function.');",
+        "assert(typeof funModule.singMixin === \"function\", 'message: <code>funModule.singMixin</code> should access a function.');"
+      ],
+      "solutions": [
+        "const funModule = (function () {\n  return {\n    isCuteMixin: obj => {\n      obj.isCute = () => true;\n    },\n    singMixin: obj => {\n      obj.sing = () => console.log(\"Singing to an awesome tune\");\n    }\n  };\n})();"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/02-javascript-algorithms-and-data-structures/regular-expressions.json b/seed/math-challenges/02-javascript-algorithms-and-data-structures/regular-expressions.json
new file mode 100644
index 0000000000..893067c4ee
--- /dev/null
+++ b/seed/math-challenges/02-javascript-algorithms-and-data-structures/regular-expressions.json
@@ -0,0 +1,998 @@
+{
+  "name": "Regular Expressions",
+  "order": 3,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7db3367417b2b2512b8d",
+      "title": "Introduction to the Regular Expression Challenges",
+      "description": [
+        [
+          "https://camo.githubusercontent.com/85ac1a6783961ce77add6b2e8630dbf6521d33b2/687474703a2f2f696d67732e786b63642e636f6d2f636f6d6963732f726567756c61725f65787072657373696f6e732e706e67",
+          "XKCD web comic showing how regular expressions can save the day",
+          "Regular expressions are special strings that represent a search pattern. Also known as \"regex\" or \"regexp\", they help programmers match, search, and replace text. Regular expressions can appear cryptic because a few characters have special meaning. The goal is to combine the symbols and text into a pattern that matches what you want, but only what you want. This section will cover the characters, a few shortcuts, and the common uses for writing regular expressions.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7db3367417b2b2512b8e",
+      "title": "Using the Test Method",
+      "description": [
+        "Regular expressions are used in programming languages to match parts of strings. You create patterns to help you do that matching.",
+        "If you want to find the word <code>\"the\"</code> in the string <code>\"The dog chased the cat\"</code>, you could use the following regular expression: <code>/the/</code>. Notice that quote marks are not required within the regular expression.",
+        "JavaScript has multiple ways to use regexes. One way to test a regex is using the <code>.test()</code> method. The <code>.test()</code> method takes the regex, applies it to a string (which is placed inside the parentheses), and returns <code>true</code> or <code>false</code> if your pattern finds something or not.",
+        "<blockquote>let testStr = \"freeCodeCamp\";<br>let testRegex = /Code/;<br>testRegex.test(testStr);<br>// Returns true</blockquote>",
+        "<hr>",
+        "Apply the regex <code>myRegex</code> on the string <code>myString</code> using the <code>.test()</code> method."
+      ],
+      "challengeSeed": [
+        "let myString = \"Hello, World!\";",
+        "let myRegex = /Hello/;",
+        "let result = myRegex; // Change this line"
+      ],
+      "tests": [
+        "assert(code.match(/myRegex.test\\(\\s*myString\\s*\\)/), 'message: You should use <code>.test()</code> to test the regex.');",
+        "assert(result === true, 'message: Your result should return <code>true</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db3367417b2b2512b8f",
+      "title": "Match Literal Strings",
+      "description": [
+        "In the last challenge, you searched for the word <code>\"Hello\"</code> using the regular expression <code>/Hello/</code>. That regex searched for a literal match of the string <code>\"Hello\"</code>. Here's another example searching for a literal match of the string <code>\"Kevin\"</code>:",
+        "<blockquote>let testStr = \"Hello, my name is Kevin.\";<br>let testRegex = /Kevin/;<br>testRegex.test(testStr);<br>// Returns true</blockquote>",
+        "Any other forms of <code>\"Kevin\"</code> will not match. For example, the regex <code>/Kevin/</code> will not match <code>\"kevin\"</code> or <code>\"KEVIN\"</code>.",
+        "<blockquote>let wrongRegex = /kevin/;<br>wrongRegex.test(testStr);<br>// Returns false</blockquote>",
+        "A future challenge will show how to match those other forms as well.",
+        "<hr>",
+        "Complete the regex <code>waldoRegex</code> to find <code>\"Waldo\"</code> in the string <code>waldoIsHiding</code> with a literal match."
+      ],
+      "challengeSeed": [
+        "let waldoIsHiding = \"Somewhere Waldo is hiding in this text.\";",
+        "let waldoRegex = /search/; // Change this line",
+        "let result = waldoRegex.test(waldoIsHiding);"
+      ],
+      "tests": [
+        "assert(waldoRegex.test(waldoIsHiding), 'message: Your regex <code>waldoRegex</code> should find <code>\"Waldo\"</code>');",
+        "assert(!waldoRegex.test('Somewhere is hiding in this text.'), 'message: Your regex <code>waldoRegex</code> should not search for anything else.');",
+        "assert(!/\\/.*\\/i/.test(code), 'message: You should perform a literal string match with your regex.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db4367417b2b2512b90",
+      "title": "Match a Literal String with Different Possibilities",
+      "description": [
+        "Using regexes like <code>/coding/</code>, you can look for the pattern <code>\"coding\"</code> in another string.",
+        "This is powerful to search single strings, but it's limited to only one pattern. You can search for multiple patterns using the <code>alternation</code> or <code>OR</code> operator: <code>|</code>.",
+        "This operator matches patterns either before or after it. For example, if you wanted to match <code>\"yes\"</code> or <code>\"no\"</code>, the regex you want is <code>/yes|no/</code>.",
+        "You can also search for more than just two patterns. You can do this by adding more patterns with more <code>OR</code> operators separating them, like <code>/yes|no|maybe/</code>.",
+        "<hr>",
+        "Complete the regex <code>petRegex</code> to match the pets <code>\"dog\"</code>, <code>\"cat\"</code>, <code>\"bird\"</code>, or <code>\"fish\"</code>."
+      ],
+      "challengeSeed": [
+        "let petString = \"James has a pet cat.\";",
+        "let petRegex = /change/; // Change this line",
+        "let result = petRegex.test(petString);"
+      ],
+      "tests": [
+        "assert(petRegex.test('John has a pet dog.'), 'message: Your regex <code>petRegex</code> should return <code>true</code> for the string <code>\"John has a pet dog.\"</code>');",
+        "assert(!petRegex.test('Emma has a pet rock.'), 'message: Your regex <code>petRegex</code> should return <code>false</code> for the string <code>\"Emma has a pet rock.\"</code>');",
+        "assert(petRegex.test('Emma has a pet bird.'), 'message: Your regex <code>petRegex</code> should return <code>true</code> for the string <code>\"Emma has a pet bird.\"</code>');",
+        "assert(petRegex.test('Liz has a pet cat.'), 'message: Your regex <code>petRegex</code> should return <code>true</code> for the string <code>\"Liz has a pet cat.\"</code>');",
+        "assert(!petRegex.test('Kara has a pet dolphin.'), 'message: Your regex <code>petRegex</code> should return <code>false</code> for the string <code>\"Kara has a pet dolphin.\"</code>');",
+        "assert(petRegex.test('Alice has a pet fish.'), 'message: Your regex <code>petRegex</code> should return <code>true</code> for the string <code>\"Alice has a pet fish.\"</code>');",
+        "assert(!petRegex.test('Jimmy has a pet computer.'), 'message: Your regex <code>petRegex</code> should return <code>false</code> for the string <code>\"Jimmy has a pet computer.\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db4367417b2b2512b91",
+      "title": "Ignore Case While Matching",
+      "description": [
+        "Up until now, you've looked at regexes to do literal matches of strings. But sometimes, you might want to also match case differences.",
+        "Case (or sometimes letter case) is the difference between uppercase letters and lowercase letters. Examples of uppercase are <code>\"A\"</code>, <code>\"B\"</code>, and <code>\"C\"</code>. Examples of lowercase are <code>\"a\"</code>, <code>\"b\"</code>, and <code>\"c\"</code>.",
+        "You can match both cases using what is called a flag. There are other flags but here you'll focus on the flag that ignores case - the <code>i</code> flag. You can use it by appending it to the regex.  An example of using this flag is <code>/ignorecase/i</code>. This regex can match the strings <code>\"ignorecase\"</code>, <code>\"igNoreCase\"</code>, and <code>\"IgnoreCase\"</code>.",
+        "<hr>",
+        "Write a regex <code>fccRegex</code> to match <code>\"freeCodeCamp\"</code>, no matter its case. Your regex should not match any abbreviations or variations with spaces."
+      ],
+      "challengeSeed": [
+        "let myString = \"freeCodeCamp\";",
+        "let fccRegex = /change/; // Change this line",
+        "let result = fccRegex.test(myString);"
+      ],
+      "tests": [
+        "assert(fccRegex.test('freeCodeCamp'), 'message: Your regex should match <code>freeCodeCamp</code>');",
+        "assert(fccRegex.test('FreeCodeCamp'), 'message: Your regex should match <code>FreeCodeCamp</code>');",
+        "assert(fccRegex.test('FreecodeCamp'), 'message: Your regex should match <code>FreecodeCamp</code>');",
+        "assert(fccRegex.test('FreeCodecamp'), 'message: Your regex should match <code>FreeCodecamp</code>');",
+        "assert(!fccRegex.test('Free Code Camp'), 'message: Your regex should not match <code>Free Code Camp</code>');",
+        "assert(fccRegex.test('FreeCOdeCamp'), 'message: Your regex should match <code>FreeCOdeCamp</code>');",
+        "assert(!fccRegex.test('FCC'), 'message: Your regex should not match <code>FCC</code>');",
+        "assert(fccRegex.test('FrEeCoDeCamp'), 'message: Your regex should match <code>FrEeCoDeCamp</code>');",
+        "assert(fccRegex.test('FrEeCodECamp'), 'message: Your regex should match <code>FrEeCodECamp</code>');",
+        "assert(fccRegex.test('FReeCodeCAmp'), 'message: Your regex should match <code>FReeCodeCAmp</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db4367417b2b2512b92",
+      "title": "Extract Matches",
+      "description": [
+        "So far, you have only been checking if a pattern exists or not within a string. You can also extract the actual matches you found with the <code>.match()</code> method.",
+        "To use the <code>.match()</code> method, apply the method on a string and pass in the regex inside the parentheses. Here's an example:",
+        "<blockquote>\"Hello, World!\".match(/Hello/);<br>// Returns [\"Hello\"]<br>let ourStr = \"Regular expressions\";<br>let ourRegex = /expressions/;<br>ourStr.match(ourRegex);<br>// Returns [\"expressions\"]</blockquote>",
+        "<hr>",
+        "Apply the <code>.match()</code> method to extract the word <code>coding</code>."
+      ],
+      "challengeSeed": [
+        "let extractStr = \"Extract the word 'coding' from this string.\";",
+        "let codingRegex = /change/; // Change this line",
+        "let result = extractStr; // Change this line"
+      ],
+      "tests": [
+        "assert(result.join() === \"coding\", 'message: The <code>result</code> should have the word <code>coding</code>');",
+        "assert(codingRegex.source === \"coding\", 'message: Your regex <code>codingRegex</code> should search for <code>coding</code>');",
+        "assert(code.match(/\\.match\\(.*\\)/), 'message: You should use the <code>.match()</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db4367417b2b2512b93",
+      "title": "Find More Than the First Match",
+      "description": [
+        "So far, you have only been able to extract or search a pattern once.",
+        "<blockquote>let testStr = \"Repeat, Repeat, Repeat\";<br>let ourRegex = /Repeat/;<br>testStr.match(ourRegex);<br>// Returns [\"Repeat\"]</blockquote>",
+        "To search or extract a pattern more than once, you can use the <code>g</code> flag.",
+        "<blockquote>let repeatRegex = /Repeat/g;<br>testStr.match(repeatRegex);<br>// Returns [\"Repeat\", \"Repeat\", \"Repeat\"]</blockquote>",
+        "<hr>",
+        "Using the regex <code>starRegex</code>, find and extract both <code>\"Twinkle\"</code> words from the string <code>twinkleStar</code>.",
+        "<strong>Note</strong><br>You can have multiple flags on your regex like <code>/search/gi</code>"
+      ],
+      "challengeSeed": [
+        "let twinkleStar = \"Twinkle, twinkle, little star\";",
+        "let starRegex = /change/; // Change this line",
+        "let result = twinkleStar; // Change this line"
+      ],
+      "tests": [
+        "assert(starRegex.flags.match(/g/).length == 1, 'message: Your regex <code>starRegex</code> should use the global flag <code>g</code>');",
+        "assert(starRegex.flags.match(/i/).length == 1, 'message: Your regex <code>starRegex</code> should use the case insensitive flag <code>i</code>');",
+        "assert(result.sort().join() == twinkleStar.match(/twinkle/gi).sort().join(), 'message: Your match should match both occurrences of the word <code>\"Twinkle\"</code>');",
+        "assert(result.length == 2, 'message: Your match <code>result</code> should have two elements in it.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db5367417b2b2512b94",
+      "title": "Match Anything with Wildcard Period",
+      "description": [
+        "Sometimes you won't (or don't need to) know the exact characters in your patterns. Thinking of all words that match, say, a misspelling would take a long time. Luckily, you can save time using the wildcard character: <code>.</code>",
+        "The wildcard character <code>.</code> will match any one character. The wildcard is also called <code>dot</code> and <code>period</code>. You can use the wildcard character just like any other character in the regex. For example, if you wanted to match <code>\"hug\"</code>, <code>\"huh\"</code>, <code>\"hut\"</code>, and <code>\"hum\"</code>, you can use the regex <code>/hu./</code> to match all four words.",
+        "<blockquote>let humStr = \"I'll hum a song\";<br>let hugStr = \"Bear hug\";<br>let huRegex = /hu./;<br>humStr.match(huRegex); // Returns [\"hum\"]<br>hugStr.match(huRegex); // Returns [\"hug\"]</blockquote>",
+        "<hr>",
+        "Complete the regex <code>unRegex</code> so that it matches the strings <code>\"run\"</code>, <code>\"sun\"</code>, <code>\"fun\"</code>, <code>\"pun\"</code>, <code>\"nun\"</code>, and <code>\"bun\"</code>. Your regex should use the wildcard character."
+      ],
+      "challengeSeed": [
+        "let exampleStr = \"Let's have fun with regular expressions!\";",
+        "let unRegex = /change/; // Change this line",
+        "let result = unRegex.test(exampleStr);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.test\\(.*\\)/), 'message: You should use the <code>.test()</code> method.');",
+        "assert(/\\./.test(unRegex.source), 'message: You should use the wildcard character in your regex <code>unRegex</code>');",
+        "assert(unRegex.test(\"Let us go on a run.\"), 'message: Your regex <code>unRegex</code> should match <code>\"run\"</code> in <code>\"Let us go on a run.\"</code>');",
+        "assert(unRegex.test(\"The sun is out today.\"), 'message: Your regex <code>unRegex</code> should match <code>\"sun\"</code> in <code>\"The sun is out today.\"</code>');",
+        "assert(unRegex.test(\"Coding is a lot of fun.\"), 'message: Your regex <code>unRegex</code> should match <code>\"fun\"</code> in <code>\"Coding is a lot of fun.\"</code>');",
+        "assert(unRegex.test(\"Seven days without a pun makes one weak.\"), 'message: Your regex <code>unRegex</code> should match <code>\"pun\"</code> in <code>\"Seven days without a pun makes one weak.\"</code>');",
+        "assert(unRegex.test(\"One takes a vow to be a nun.\"), 'message: Your regex <code>unRegex</code> should match <code>\"nun\"</code> in <code>\"One takes a vow to be a nun.\"</code>');",
+        "assert(unRegex.test(\"She got fired from the hot dog stand for putting her hair in a bun.\"), 'message: Your regex <code>unRegex</code> should match <code>\"bun\"</code> in <code>\"She got fired from the hot dog stand for putting her hair in a bun.\"</code>');",
+        "assert(!unRegex.test(\"There is a bug in my code.\"), 'message: Your regex <code>unRegex</code> should not match <code>\"There is a bug in my code.\"</code>');",
+        "assert(!unRegex.test(\"Can me if you can.\"), 'message: Your regex <code>unRegex</code> should not match <code>\"Catch me if you can.\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db5367417b2b2512b95",
+      "title": "Match Single Character with Multiple Possibilities",
+      "description": [
+        "You learned how to match literal patterns (<code>/literal/</code>) and wildcard character (<code>/./</code>). Those are the extremes of regular expressions, where one finds exact matches and the other matches everything. There are options that are a balance between the two extremes.",
+        "You can search for a literal pattern with some flexibility with <code>character classes</code>. Character classes allow you to define a group of characters you wish to match by placing them inside square (<code>[</code> and <code>]</code>) brackets.",
+        "For example, you want to match <code>\"bag\"</code>, <code>\"big\"</code>, and <code>\"bug\"</code> but not <code>\"bog\"</code>. You can create the regex <code>/b[aiu]g/</code> to do this. The <code>[aiu]</code> is the character class that will only match the characters <code>\"a\"</code>, <code>\"i\"</code>, or <code>\"u\"</code>.",
+        "<blockquote>let bigStr = \"big\";<br>let bagStr = \"bag\";<br>let bugStr = \"bug\";<br>let bogStr = \"bog\";<br>let bgRegex = /b[aiu]g/;<br>bigStr.match(bgRegex); // Returns [\"big\"]<br>bagStr.match(bgRegex); // Returns [\"bag\"]<br>bugStr.match(bgRegex); // Returns [\"bug\"]<br>bogStr.match(bgRegex); // Returns null</blockquote>",
+        "<hr>",
+        "Use a character class with vowels (<code>a</code>, <code>e</code>, <code>i</code>, <code>o</code>, <code>u</code>) in your regex <code>vowelRegex</code> to find all the vowels in the string <code>quoteSample</code>.",
+        "<strong>Note</strong><br>Be sure to match both upper- and lowercase vowels."
+      ],
+      "challengeSeed": [
+        "let quoteSample = \"Beware of bugs in the above code; I have only proved it correct, not tried it.\";",
+        "let vowelRegex = /change/; // Change this line",
+        "let result = vowelRegex; // Change this line"
+      ],
+      "tests": [
+        "assert(result.length == 25, 'message: You should find all 25 vowels.');",
+        "assert(/\\[.*\\]/.test(vowelRegex.source), 'message: Your regex <code>vowelRegex</code> should use a character class.');",
+        "assert(vowelRegex.flags.match(/g/).length == 1, 'message: Your regex <code>vowelRegex</code> should use the global flag.');",
+        "assert(vowelRegex.flags.match(/i/).length == 1, 'message: Your regex <code>vowelRegex</code> should use the case insensitive flag.');",
+        "assert(!/[b-df-hj-np-tv-z]/gi.test(result.join()), 'message: Your regex should not match any consonants.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db5367417b2b2512b96",
+      "title": "Match Letters of the Alphabet",
+      "description": [
+        "You saw how you can use <code>character sets</code> to specify a group of characters to match, but that's a lot of typing when you need to match a large range of characters (for example, every letter in the alphabet). Fortunately, there is a built-in feature that makes this short and simple.",
+        "Inside a <code>character set</code>, you can define a range of characters to match using a <code>hyphen</code> character: <code>-</code>.",
+        "For example, to match lowercase letters <code>a</code> through <code>e</code> you would use <code>[a-e]</code>.",
+        "<blockquote>let catStr = \"cat\";<br>let batStr = \"bat\";<br>let matStr = \"mat\";<br>let bgRegex = /[a-e]at/;<br>catStr.match(bgRegex); // Returns [\"cat\"]<br>batStr.match(bgRegex); // Returns [\"bat\"]<br>matStr.match(bgRegex); // Returns null</blockquote>",
+        "<hr>",
+        "Match all the letters in the string <code>quoteSample</code>.",
+        "<strong>Note</strong><br>Be sure to match both upper- and lowercase vowels."
+      ],
+      "challengeSeed": [
+        "let quoteSample = \"The quick brown fox jumps over the lazy dog.\";",
+        "let alphabetRegex = /change/; // Change this line",
+        "let result = alphabetRegex; // Change this line"
+      ],
+      "tests": [
+        "assert(result.length == 35, 'message: Your regex <code>alphabetRegex</code> should match 35 items.');",
+        "assert(alphabetRegex.flags.match(/g/).length == 1, 'message: Your regex <code>alphabetRegex</code> should use the global flag.');",
+        "assert(alphabetRegex.flags.match(/i/).length == 1, 'message: Your regex <code>alphabetRegex</code> should use the case insensitive flag.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db5367417b2b2512b97",
+      "title": "Match Numbers and Letters of the Alphabet",
+      "description": [
+        "Using the hyphen (<code>-</code>) to match a range of characters is not limited to letters. It also works to match a range of numbers.",
+        "For example, <code>/[0-5]/</code> matches any number between <code>0</code> and <code>5</code>, including the <code>0</code> and <code>5</code>.",
+        "Also, it is possible to combine a range of letters and numbers in a single character set.",
+        "<blockquote>let jennyStr = \"Jenny8675309\";<br>let myRegex = /[a-z0-9]/ig;<br>// matches all letters and numbers in jennyStr<br>jennyStr.match(myRegex);</blockquote>",
+        "<hr>",
+        "Create a single regex that matches a range of letters between <code>h</code> and <code>s</code>, and a range of numbers between <code>2</code> and <code>6</code>. Remember to include the appropriate flags in the regex."
+      ],
+      "challengeSeed": [
+        "let quoteSample = \"Blueberry 3.141592653s are delicious.\";",
+        "let myRegex = /change/; // Change this line",
+        "let result = myRegex; // Change this line"
+      ],
+      "tests": [
+        "assert(result.length == 17, 'message: Your regex <code>myRegex</code> should match 17 items.');",
+        "assert(myRegex.flags.match(/g/).length == 1, 'message: Your regex <code>myRegex</code> should use the global flag.');",
+        "assert(myRegex.flags.match(/i/).length == 1, 'message: Your regex <code>myRegex</code> should use the case insensitive flag.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db6367417b2b2512b98",
+      "title": "Match Single Characters Not Specified",
+      "description": [
+        "So far, you have created a set of characters that you want to match, but you could also create a set of characters that you do not want to match. These types of character sets are called <code>negated character sets</code>.",
+        "To create a <code>negated character set</code>, you place a <code>caret</code> character (<code>^</code>) after the opening bracket and before the characters you do not want to match.",
+        "For example, <code>/[^aeiou]/gi</code> matches all characters that are not a vowel. Note that characters like <code>.</code>, <code>!</code>, <code>[</code>, <code>@</code>, <code>/</code> and white space are matched - the negated vowel character set only excludes the vowel characters.",
+        "<hr>",
+        "Create a single regex that matches all characters that are not a number or a vowel. Remember to include the appropriate flags in the regex."
+      ],
+      "challengeSeed": [
+        "let quoteSample = \"3 blind mice.\";",
+        "let myRegex = /change/; // Change this line",
+        "let result = myRegex; // Change this line"
+      ],
+      "tests": [
+        "assert(result.length == 9, 'message: Your regex <code>myRegex</code> should match 9 items.');",
+        "assert(myRegex.flags.match(/g/).length == 1, 'message: Your regex <code>myRegex</code> should use the global flag.');",
+        "assert(myRegex.flags.match(/i/).length == 1, 'message: Your regex <code>myRegex</code> should use the case insensitive flag.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db6367417b2b2512b99",
+      "title": "Match Characters that Occur One or More Times",
+      "description": [
+        "Sometimes, you need to match a character (or group of characters) that appears one or more times in a row. This means it occurs at least once, and may be repeated.",
+        "You can use the <code>+</code> character to check if that is the case. Remember, the character or pattern has to be present consecutively. That is, the character has to repeat one after the other.",
+        "For example, <code>/a+/g</code> would find one match in <code>\"abc\"</code> and return <code>[\"a\"]</code>. Because of the <code>+</code>, it would also find a single match in <code>\"aabc\"</code> and return <code>[\"aa\"]</code>.",
+        "If it were instead checking the string <code>\"abab\"</code>, it would find two matches and return <code>[\"a\", \"a\"]</code> because the <code>a</code> characters are not in a row - there is a <code>b</code> between them. Finally, since there is no <code>\"a\"</code> in the string <code>\"bcd\"</code>, it wouldn't find a match.",
+        "<hr>",
+        "You want to find matches when the letter <code>s</code> occurs one or more times in <code>\"Mississippi\"</code>. Write a regex that uses the <code>+</code> sign."
+      ],
+      "challengeSeed": [
+        "let difficultSpelling = \"Mississippi\";",
+        "let myRegex = /change/; // Change this line",
+        "let result = difficultSpelling.match(myRegex);"
+      ],
+      "tests": [
+        "assert(/\\+/.test(myRegex.source), 'message: Your regex <code>myRegex</code> should use the <code>+</code> sign to match one or more <code>s</code> characters.');",
+        "assert(result.length == 2, 'message: Your regex <code>myRegex</code> should match 2 items.');",
+        "assert(result[0] == 'ss' && result[1] == 'ss', 'message: The <code>result</code> variable should be an array with two matches of <code>\"ss\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db6367417b2b2512b9a",
+      "title": "Match Characters that Occur Zero or More Times",
+      "description": [
+        "The last challenge used the plus <code>+</code> sign to look for characters that occur one or more times. There's also an option that matches characters that occur zero or more times.",
+        "The character to do this is the <code>asterisk</code> or <code>star</code>: <code>*</code>.",
+        "<blockquote>let sWord1 = \"seed\";<br>let sWord2 = \"saw\";<br>let kWord = \"kite\";<br>let sRegex = /s.*/; // Searches for words starting with s<br>sRegex.test(sWord1); // Returns true<br>sRegex.test(sWord2); // Returns true<br>sRegex.test(kWord); // Returns false<br></blockquote>",
+        "<hr>",
+        "Create a regex <code>starWarsRegex</code> that uses the <code>*</code> character to match all the movie titles that start with <code>\"Star Wars\"</code>. Your regex does not need flags."
+      ],
+      "challengeSeed": [
+        "let starWars = \"Star Wars\";",
+        "let starWarsRegex = /change/; // Change this line",
+        "let result = starWars.match(starWarsRegex);"
+      ],
+      "tests": [
+        "assert(starWarsRegex.test(\"Star Wars: The Phantom Menace\"), 'message: Your regex should match <code>\"Star Wars: The Phantom Menace\"</code>.');",
+        "assert(starWarsRegex.test(\"Star Wars: Attack of the Clones\"), 'message: Your regex should match <code>\"Star Wars: Attack of the Clones\"</code>.');",
+        "assert(starWarsRegex.test(\"Star Wars: Revenge of the Sith\"), 'message: Your regex should match <code>\"Star Wars: Revenge of the Sith\"</code>.');",
+        "assert(starWarsRegex.test(\"Star Wars: A New Hope\"), 'message: Your regex should match <code>\"Star Wars: A New Hope\"</code>.');",
+        "assert(starWarsRegex.test(\"Star Wars: The Empire Strikes Back\"), 'message: Your regex should match <code>\"Star Wars: The Empire Strikes Back\"</code>.');",
+        "assert(starWarsRegex.test(\"Star Wars: Return of the Jedi\"), 'message: Your regex should match <code>\"Star Wars: Return of the Jedi\"</code>.');",
+        "assert(starWarsRegex.test(\"Star Wars: The Force Awakens\"), 'message: Your regex should match <code>\"Star Wars: The Force Awakens\"</code>.');",
+        "assert(!starWarsRegex.test(\"The Clone Wars\"), 'message: Your regex should not match <code>\"The Clone Wars\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db6367417b2b2512b9b",
+      "title": "Find Characters with Lazy Matching",
+      "description": [
+        "In regular expressions, a <code>greedy</code> match finds the longest possible part of a string that fits the regex pattern and returns it as a match. The alternative is called a <code>lazy</code> match, which finds the smallest possible part of the string that satisfies the regex pattern.",
+        "You can apply the regex <code>/t[a-z]*i/</code> to the string <code>\"titanic\"</code>. This regex is basically a pattern that starts with <code>t</code>, ends with <code>i</code>, and has some letters in between.",
+        "Regular expressions are by default <code>greedy</code>, so the match would return <code>[\"titani\"]</code>. It finds the largest sub-string possible to fit the pattern.",
+        "However, you can use the <code>?</code> character to change it to <code>lazy</code> matching. <code>\"titanic\"</code> matched against the adjusted regex of <code>/t[a-z]*?i/</code> returns <code>[\"ti\"]</code>.",
+        "<hr>",
+        "Fix the regex <code>/&lt;.*&gt;/</code> to return the HTML tag <code>&lt;h1&gt;</code> and not the text <code>\"&lt;h1&gt;Winter is coming&lt;/h1&gt;\"</code>. Remember the wildcard <code>.</code> in a regular expression matches any character."
+      ],
+      "challengeSeed": [
+        "let text = \"<h1>Winter is coming</h1>\";",
+        "let myRegex = /<.*>/; // Change this line",
+        "let result = text.match(myRegex);"
+      ],
+      "tests": [
+        "assert(result[0] == '<h1>', 'message: The <code>result</code> variable should be an array with <code>&lt;h1&gt;</code> in it');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db7367417b2b2512b9c",
+      "title": "Find One or More Criminals in a Hunt",
+      "description": [
+        "Time to pause and test your new regex writing skills. A group of criminals escaped from jail and ran away, but you don't know how many. However, you do know that they stay close together when they are around other people. You are responsible for finding all of the criminals at once.",
+        "Here's an example to review how to do this:",
+        "The regex <code>/z+/</code> matches the letter <code>z</code> when it appears one or more times in a row. It would find matches in all of the following strings:",
+        "<blockquote>\"z\"<br>\"zzzzzz\"<br>\"ABCzzzz\"<br>\"zzzzABC\"<br>\"abczzzzzzzzzzzzzzzzzzzzzabc\"</blockquote>",
+        "But it does not find matches in the following strings since there are no letter <code>z</code> characters:",
+        "<blockquote>\"\"<br>\"ABC\"<br>\"abcabc\"</blockquote>",
+        "<hr>",
+        "Write a <code>greedy</code> regex that finds one or more criminals within a group of other people. A criminal is represented by the capital letter <code>C</code>."
+      ],
+      "challengeSeed": [
+        "// example crowd gathering",
+        "let crowd = 'P1P2P3P4P5P6CCCP7P8P9';",
+        "",
+        "let reCriminals = /./; // Change this line",
+        "",
+        "let matchedCriminals = crowd.match(reCriminals);",
+        "console.log(matchedCriminals);"
+      ],
+      "tests": [
+        "assert('C'.match(reCriminals) && 'C'.match(reCriminals)[0] == 'C', 'message: Your regex should match <em>one</em> criminal (\"<code>C</code>\") in <code>\"C\"</code>');",
+        "assert('CC'.match(reCriminals) && 'CC'.match(reCriminals)[0] == 'CC', 'message: Your regex should match <em>two</em> criminals (\"<code>CC</code>\") in <code>\"CC\"</code>');",
+        "assert('P1P5P4CCCP2P6P3'.match(reCriminals) && 'P1P5P4CCCP2P6P3'.match(reCriminals)[0] == 'CCC', 'message: Your regex should match <em>three</em> criminals (\"<code>CCC</code>\") in <code>\"P1P5P4CCCP2P6P3\"</code>');",
+        "assert('P6P2P7P4P5CCCCCP3P1'.match(reCriminals) && 'P6P2P7P4P5CCCCCP3P1'.match(reCriminals)[0] == 'CCCCC', 'message: Your regex should match <em>five</em> criminals (\"<code>CCCCC</code>\") in <code>\"P6P2P7P4P5CCCCCP3P1\"</code>');",
+        "assert(!reCriminals.test(''), 'message: Your regex should not match any criminals in <code>\"\"</code>');",
+        "assert(!reCriminals.test('P1P2P3'), 'message: Your regex should not match any criminals in <code>\"P1P2P3\"</code>');",
+        "assert('P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3'.match(reCriminals) && 'P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3'.match(reCriminals)[0] == \"CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC\", 'message: Your regex should match <em>fifty</em> criminals (\"<code>CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC</code>\") in <code>\"P2P1P5P4CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCP3\"</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db7367417b2b2512b9d",
+      "title": "Match Beginning String Patterns",
+      "description": [
+        "Prior challenges showed that regular expressions can be used to look for a number of matches. They are also used to search for patterns in specific positions in strings.",
+        "In an earlier challenge, you used the <code>caret</code> character (<code>^</code>) inside a <code>character set</code> to create a <code>negated character set</code> in the form <code>[^thingsThatWillNotBeMatched]</code>. Outside of a <code>character set</code>, the <code>caret</code> is used to search for patterns at the beginning of strings.",
+        "<blockquote>let firstString = \"Ricky is first and can be found.\";<br>let firstRegex = /^Ricky/;<br>firstRegex.test(firstString);<br>// Returns true<br>let notFirst = \"You can't find Ricky now.\";<br>firstRegex.test(notFirst);<br>// Returns false</blockquote>",
+        "<hr>",
+        "Use the <code>caret</code> character in a regex to find <code>\"Cal\"</code> only in the beginning of the string <code>rickyAndCal</code>."
+      ],
+      "challengeSeed": [
+        "let rickyAndCal = \"Cal and Ricky both like racing.\";",
+        "let calRegex = /change/; // Change this line",
+        "let result = calRegex.test(rickyAndCal);"
+      ],
+      "tests": [
+        "assert(calRegex.source == \"^Cal\", 'message: Your regex should search for <code>\"Cal\"</code> with a capital letter.');",
+        "assert(calRegex.flags == \"\", 'message: Your regex should not use any flags.');",
+        "assert(calRegex.test(\"Cal and Ricky both like racing.\"), 'message: Your regex should match <code>\"Cal\"</code> at the beginning of the string.');",
+        "assert(!calRegex.test(\"Ricky and Cal both like racing.\"), 'message: Your regex should not match <code>\"Cal\"</code> in the middle of a string.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db7367417b2b2512b9e",
+      "title": "Match Ending String Patterns",
+      "description": [
+        "In the last challenge, you learned to use the <code>caret</code> character to search for patterns at the beginning of strings. There is also a way to search for patterns at the end of strings.",
+        "You can search the end of strings using the <code>dollar sign</code> character <code>$</code> at the end of the regex.",
+        "<blockquote>let theEnding = \"This is a never ending story\";<br>let storyRegex = /story$/;<br>storyRegex.test(theEnding);<br>// Returns true<br>let noEnding = \"Sometimes a story will have to end\";<br>storyRegex.test(noEnding);<br>// Returns false<br></blockquote>",
+        "<hr>",
+        "Use the anchor character (<code>$</code>) to match the string <code>\"caboose\"</code> at the end of the string <code>caboose</code>."
+      ],
+      "challengeSeed": [
+        "let caboose = \"The last car on a train is the caboose\";",
+        "let lastRegex = /change/; // Change this line",
+        "let result = lastRegex.test(caboose);"
+      ],
+      "tests": [
+        "assert(lastRegex.source == \"caboose$\", 'message: You should search for <code>\"caboose\"</code> with the dollar sign <code>$</code> anchor in your regex.');",
+        "assert(lastRegex.flags == \"\", 'message: Your regex should not use any flags.');",
+        "assert(lastRegex.test(\"The last car on a train is the caboose\"), 'message: You should match <code>\"caboose\"</code> at the end of the string <code>\"The last car on a train is the caboose\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db7367417b2b2512b9f",
+      "title": "Match All Letters and Numbers",
+      "description": [
+        "Using character classes, you were able to search for all letters of the alphabet with <code>[a-z]</code>. This kind of character class is common enough that there is a shortcut for it, although it includes a few extra characters as well.",
+        "The closest character class in JavaScript to match the alphabet is <code>\\w</code>. This shortcut is equal to <code>[A-Za-z0-9_]</code>. This character class matches upper and lowercase letters plus numbers. Note, this character class also includes the underscore character (<code>_</code>).",
+        "<blockquote>let longHand = /[A-Za-z0-9_]+/;<br>let shortHand = /\\w+/;<br>let numbers = \"42\";<br>let varNames = \"important_var\";<br>longHand.test(numbers); // Returns true<br>shortHand.test(numbers); // Returns true<br>longHand.test(varNames); // Returns true<br>shortHand.test(varNames); // Returns true</blockquote>",
+        "These shortcut character classes are also known as <code>shorthand character classes</code>.",
+        "<hr>",
+        "Use the shorthand character class <code>\\w</code> to count the number of alphanumeric characters in various quotes and strings."
+      ],
+      "challengeSeed": [
+        "let quoteSample = \"The five boxing wizards jump quickly.\";",
+        "let alphabetRegexV2 = /change/; // Change this line",
+        "let result = quoteSample.match(alphabetRegexV2).length;"
+      ],
+      "tests": [
+        "assert(alphabetRegexV2.global, 'message: Your regex should use the global flag.');",
+        "assert(\"The five boxing wizards jump quickly.\".match(alphabetRegexV2).length === 31, 'message: Your regex should find 31 alphanumeric characters in <code>\"The five boxing wizards jump quickly.\"</code>');",
+        "assert(\"Pack my box with five dozen liquor jugs.\".match(alphabetRegexV2).length === 32, 'message: Your regex should find 32 alphanumeric characters in <code>\"Pack my box with five dozen liquor jugs.\"</code>');",
+        "assert(\"How vexingly quick daft zebras jump!\".match(alphabetRegexV2).length === 30, 'message: Your regex should find 30 alphanumeric characters in <code>\"How vexingly quick daft zebras jump!\"</code>');",
+        "assert(\"123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.\".match(alphabetRegexV2).length === 36, 'message: Your regex should find 36 alphanumeric characters in <code>\"123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db8367417b2b2512ba0",
+      "title": "Match Everything But Letters and Numbers",
+      "description": [
+        "You've learned that you can use a shortcut to match alphanumerics <code>[A-Za-z0-9_]</code> using <code>\\w</code>. A natural pattern you might want to search for is the opposite of alphanumerics.",
+        "You can search for the opposite of the <code>\\w</code> with <code>\\W</code>. Note, the opposite pattern uses a capital letter. This shortcut is the same as <code>[^A-Za-z0-9_]</code>.",
+        "<blockquote>let shortHand = /\\W/;<br>let numbers = \"42%\";<br>let sentence = \"Coding!\";<br>numbers.match(shortHand); // Returns [\"%\"]<br>sentence.match(shortHand); // Returns [\"!\"]<br></blockquote>",
+        "<hr>",
+        "Use the shorthand character class <code>\\W</code> to count the number of non-alphanumeric characters in various quotes and strings."
+      ],
+      "challengeSeed": [
+        "let quoteSample = \"The five boxing wizards jump quickly.\";",
+        "let nonAlphabetRegex = /change/; // Change this line",
+        "let result = quoteSample.match(nonAlphabetRegex).length;"
+      ],
+      "tests": [
+        "assert(nonAlphabetRegex.global, 'message: Your regex should use the global flag.');",
+        "assert(\"The five boxing wizards jump quickly.\".match(nonAlphabetRegex).length == 6, 'message: Your regex should find 6 non-alphanumeric characters in <code>\"The five boxing wizards jump quickly.\"</code>.');",
+        "assert(\"Pack my box with five dozen liquor jugs.\".match(nonAlphabetRegex).length == 8, 'message: Your regex should find 8 non-alphanumeric characters in <code>\"Pack my box with five dozen liquor jugs.\"</code>');",
+        "assert(\"How vexingly quick daft zebras jump!\".match(nonAlphabetRegex).length == 6, 'message: Your regex should find 6 non-alphanumeric characters in <code>\"How vexingly quick daft zebras jump!\"</code>');",
+        "assert(\"123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.\".match(nonAlphabetRegex).length == 12, 'message: Your regex should find 12 non-alphanumeric characters in <code>\"123 456 7890 ABC def GHI jkl MNO pqr STU vwx YZ.\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "5d712346c441eddfaeb5bdef",
+      "title": "Match All Numbers",
+      "description": [
+        "You've learned shortcuts for common string patterns like alphanumerics. Another common pattern is looking for just digits or numbers.",
+        "The shortcut to look for digit characters is <code>\\d</code>, with a lowercase <code>d</code>. This is equal to the character class <code>[0-9]</code>, which looks for a single character of any number between zero and nine.",
+        "<hr>",
+        "Use the shorthand character class <code>\\d</code> to count how many digits are in movie titles. Written out numbers (\"six\" instead of 6) do not count."
+      ],
+      "challengeSeed": [
+        "let numString = \"Your sandwich will be $5.00\";",
+        "let numRegex = /change/; // Change this line",
+        "let result = numString.match(numRegex).length;"
+      ],
+      "tests": [
+        "assert(/\\\\d/.test(numRegex.source), 'message: Your regex should use the shortcut character to match digit characters');",
+        "assert(numRegex.global, 'message: Your regex should use the global flag.');",
+        "assert(\"9\".match(numRegex).length == 1, 'message: Your regex should find 1 digit in <code>\"9\"</code>.');",
+        "assert(\"Catch 22\".match(numRegex).length == 2, 'message: Your regex should find 2 digits in <code>\"Catch 22\"</code>.');",
+        "assert(\"101 Dalmatians\".match(numRegex).length == 3, 'message: Your regex should find 3 digits in <code>\"101 Dalmatians\"</code>.');",
+        "assert(\"One, Two, Three\".match(numRegex) == null, 'message: Your regex should find no digits in <code>\"One, Two, Three\"</code>.');",
+        "assert(\"21 Jump Street\".match(numRegex).length == 2, 'message: Your regex should find 2 digits in <code>\"21 Jump Street\"</code>.');",
+        "assert(\"2001: A Space Odyssey\".match(numRegex).length == 4, 'message: Your regex should find 4 digits in <code>\"2001: A Space Odyssey\"</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db8367417b2b2512ba1",
+      "title": "Match All Non-Numbers",
+      "description": [
+        "The last challenge showed how to search for digits using the shortcut <code>\\d</code> with a lowercase <code>d</code>. You can also search for non-digits using a similar shortcut that uses an uppercase <code>D</code> instead.",
+        "The shortcut to look for non-digit characters is <code>\\D</code>. This is equal to the character class <code>[^0-9]</code>, which looks for a single character that is not a number between zero and nine.",
+        "<hr>",
+        "Use the shorthand character class for non-digits <code>\\D</code> to count how many non-digits are in movie titles."
+      ],
+      "challengeSeed": [
+        "let numString = \"Your sandwich will be $5.00\";",
+        "let noNumRegex = /change/; // Change this line",
+        "let result = numString.match(noNumRegex).length;"
+      ],
+      "tests": [
+        "assert(/\\\\D/.test(noNumRegex.source), 'message: Your regex should use the shortcut character to match non-digit characters');",
+        "assert(noNumRegex.global, 'message: Your regex should use the global flag.');",
+        "assert(\"9\".match(noNumRegex) == null, 'message: Your regex should find no non-digits in <code>\"9\"</code>.');",
+        "assert(\"Catch 22\".match(noNumRegex).length == 6, 'message: Your regex should find 6 non-digits in <code>\"Catch 22\"</code>.');",
+        "assert(\"101 Dalmatians\".match(noNumRegex).length == 11, 'message: Your regex should find 11 non-digits in <code>\"101 Dalmatians\"</code>.');",
+        "assert(\"One, Two, Three\".match(noNumRegex).length == 15, 'message: Your regex should find 15 non-digits in <code>\"One, Two, Three\"</code>.');",
+        "assert(\"21 Jump Street\".match(noNumRegex).length == 12, 'message: Your regex should find 12 non-digits in <code>\"21 Jump Street\"</code>.');",
+        "assert(\"2001: A Space Odyssey\".match(noNumRegex).length == 17, 'message: Your regex should find 17 non-digits in <code>\"2001: A Space Odyssey\"</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db8367417b2b2512ba2",
+      "title": "Restrict Possible Usernames",
+      "description": [
+        "Usernames are used everywhere on the internet. They are what give users a unique identity on their favorite sites.",
+        "You need to check all the usernames in a database. Here are some simple rules that users have to follow when creating their username.",
+        "1) The only numbers in the username have to be at the end. There can be zero or more of them at the end.",
+        "2) Username letters can be lowercase and uppercase.",
+        "3) Usernames have to be at least two characters long. A two-letter username can only use alphabet letter characters.",
+        "<hr>",
+        "Change the regex <code>userCheck</code> to fit the constraints listed above."
+      ],
+      "challengeSeed": [
+        "let username = \"JackOfAllTrades\";",
+        "let userCheck = /change/; // Change this line",
+        "let result = userCheck.test(username);"
+      ],
+      "tests": [
+        "assert(userCheck.test(\"JACK\"), 'message: Your regex should match <code>JACK</code>');",
+        "assert(!userCheck.test(\"J\"), 'message: Your regex should not match <code>J</code>');",
+        "assert(userCheck.test(\"Oceans11\"), 'message: Your regex should match <code>Oceans11</code>');",
+        "assert(userCheck.test(\"RegexGuru\"), 'message: Your regex should match <code>RegexGuru</code>');",
+        "assert(!userCheck.test(\"007\"), 'message: Your regex should not match <code>007</code>');",
+        "assert(!userCheck.test(\"9\"), 'message: Your regex should not match <code>9</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db8367417b2b2512ba3",
+      "title": "Match Whitespace",
+      "description": [
+        "The challenges so far have covered matching letters of the alphabet and numbers. You can also match the whitespace or spaces between letters.",
+        "You can search for whitespace using <code>\\s</code>, which is a lowercase <code>s</code>. This pattern not only matches whitespace, but also carriage return, tab, form feed, and new line characters. You can think of it as similar to the character class <code>[ \\r\\t\\f\\n\\v]</code>.",
+        "<blockquote>let whiteSpace = \"Whitespace. Whitespace everywhere!\"<br>let spaceRegex = /\\s/g;<br>whiteSpace.match(spaceRegex);<br>// Returns [\" \", \" \"]<br></blockquote>",
+        "<hr>",
+        "Change the regex <code>countWhiteSpace</code> to look for multiple whitespace characters in a string."
+      ],
+      "challengeSeed": [
+        "let sample = \"Whitespace is important in separating words\";",
+        "let countWhiteSpace = /change/; // Change this line",
+        "let result = sample.match(countWhiteSpace);"
+      ],
+      "tests": [
+        "assert(countWhiteSpace.global, 'message: Your regex should use the global flag.');",
+        "assert(\"Men are from Mars and women are from Venus.\".match(countWhiteSpace).length == 8, 'message: Your regex should find eight spaces in <code>\"Men are from Mars and women are from Venus.\"</code>');",
+        "assert(\"Space: the final frontier.\".match(countWhiteSpace).length == 3, 'message: Your regex should find three spaces in <code>\"Space: the final frontier.\"</code>');",
+        "assert(\"MindYourPersonalSpace\".match(countWhiteSpace) == null, 'message: Your regex should find no spaces in <code>\"MindYourPersonalSpace\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db9367417b2b2512ba4",
+      "title": "Match Non-Whitespace Characters",
+      "description": [
+        "You learned about searching for whitespace using <code>\\s</code>, with a lowercase <code>s</code>. You can also search for everything except whitespace.",
+        "Search for non-whitespace using <code>\\S</code>, which is an uppercase <code>s</code>. This pattern will not match whitespace, carriage return, tab, form feed, and new line characters. You can think of it being similar to the character class <code>[^ \\r\\t\\f\\n\\v]</code>.",
+        "<blockquote>let whiteSpace = \"Whitespace. Whitespace everywhere!\"<br>let nonSpaceRegex = /\\S/g;<br>whiteSpace.match(nonSpaceRegex).length; // Returns 32</blockquote>",
+        "<hr>",
+        "Change the regex <code>countNonWhiteSpace</code> to look for multiple non-whitespace characters in a string."
+      ],
+      "challengeSeed": [
+        "let sample = \"Whitespace is important in separating words\";",
+        "let countNonWhiteSpace = /change/; // Change this line",
+        "let result = sample.match(countNonWhiteSpace);"
+      ],
+      "tests": [
+        "assert(countNonWhiteSpace.global, 'message: Your regex should use the global flag.');",
+        "assert(\"Men are from Mars and women are from Venus.\".match(countNonWhiteSpace).length == 35, 'message: Your regex should find 35 non-spaces in <code>\"Men are from Mars and women are from Venus.\"</code>');",
+        "assert(\"Space: the final frontier.\".match(countNonWhiteSpace).length == 23, 'message: Your regex should find 23 non-spaces in <code>\"Space: the final frontier.\"</code>');",
+        "assert(\"MindYourPersonalSpace\".match(countNonWhiteSpace).length == 21, 'message: Your regex should find 21 non-spaces in <code>\"MindYourPersonalSpace\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db9367417b2b2512ba5",
+      "title": "Specify Upper and Lower Number of Matches",
+      "description": [
+        "Recall that you use the plus sign <code>+</code> to look for one or more characters and the asterisk <code>*</code> to look for zero or more characters. These are convenient but sometimes you want to match a certain range of patterns.",
+        "You can specify the lower and upper number of patterns with <code>quantity specifiers</code>. Quantity specifiers are used with curly brackets (<code>{</code> and <code>}</code>). You put two numbers between the curly brackets - for the lower and upper number of patterns.",
+        "For example, to match only the letter <code>a</code> appearing between <code>3</code> and <code>5</code> times in the string <code>\"ah\"</code>, your regex would be <code>/a{3,5}h/</code>.",
+        "<blockquote>let A4 = \"aaaah\";<br>let A2 = \"aah\";<br>let multipleA = /a{3,5}h/;<br>multipleA.test(A4); // Returns true<br>multipleA.test(A2); // Returns false</blockquote>",
+        "<hr>",
+        "Change the regex <code>ohRegex</code> to match only <code>3</code> to <code>6</code> letter <code>h</code>'s in the word <code>\"Oh no\"</code>."
+      ],
+      "challengeSeed": [
+        "let ohStr = \"Ohhh no\";",
+        "let ohRegex = /change/; // Change this line",
+        "let result = ohRegex.test(ohStr);"
+      ],
+      "tests": [
+        "assert(ohRegex.source.match(/{.*?}/).length > 0, 'message: Your regex should use curly brackets.');",
+        "assert(!ohRegex.test(\"Ohh no\"), 'message: Your regex should not match <code>\"Ohh no\"</code>');",
+        "assert(ohRegex.test(\"Ohhh no\"), 'message: Your regex should match <code>\"Ohhh no\"</code>');",
+        "assert(ohRegex.test(\"Ohhhh no\"), 'message: Your regex should match <code>\"Ohhhh no\"</code>');",
+        "assert(ohRegex.test(\"Ohhhhh no\"), 'message: Your regex should match <code>\"Ohhhhh no\"</code>');",
+        "assert(ohRegex.test(\"Ohhhhhh no\"), 'message: Your regex should match <code>\"Ohhhhhh no\"</code>');",
+        "assert(!ohRegex.test(\"Ohhhhhhh no\"), 'message: Your regex should not match <code>\"Ohhhhhhh no\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db9367417b2b2512ba6",
+      "title": "Specify Only the Lower Number of Matches",
+      "description": [
+        "You can specify the lower and upper number of patterns with <code>quantity specifiers</code> using curly brackets. Sometimes you only want to specify the lower number of patterns with no upper limit.",
+        "To only specify the lower number of patterns, keep the first number followed by a comma.",
+        "For example, to match only the string <code>\"hah\"</code> with the letter <code>a</code> appearing at least <code>3</code> times, your regex would be <code>/ha{3,}h/</code>.",
+        "<blockquote>let A4 = \"haaaah\";<br>let A2 = \"haah\";<br>let A100 = \"h\" + \"a\".repeat(100) + \"h\";<br>let multipleA = /ha{3,}h/;<br>multipleA.test(A4); // Returns true<br>multipleA.test(A2); // Returns false<br>multipleA.test(A100); // Returns true</blockquote>",
+        "<hr>",
+        "Change the regex <code>haRegex</code> to match the word <code>\"Hazzah\"</code> only when it has four or more letter <code>z</code>'s."
+      ],
+      "challengeSeed": [
+        "let haStr = \"Hazzzzah\";",
+        "let haRegex = /change/; // Change this line",
+        "let result = haRegex.test(haStr);"
+      ],
+      "tests": [
+        "assert(haRegex.source.match(/{.*?}/).length > 0, 'message: Your regex should use curly brackets.');",
+        "assert(!haRegex.test(\"Hazzah\"), 'message: Your regex should not match <code>\"Hazzah\"</code>');",
+        "assert(!haRegex.test(\"Hazzzah\"), 'message: Your regex should not match <code>\"Hazzzah\"</code>');",
+        "assert(haRegex.test(\"Hazzzzah\"), 'message: Your regex should match <code>\"Hazzzzah\"</code>');",
+        "assert(haRegex.test(\"Hazzzzzah\"), 'message: Your regex should match <code>\"Hazzzzzah\"</code>');",
+        "assert(haRegex.test(\"Hazzzzzzah\"), 'message: Your regex should match <code>\"Hazzzzzzah\"</code>');",
+        "assert(haRegex.test(\"Ha\" + \"z\".repeat(30) + \"ah\"), 'message: Your regex should match <code>\"Hazzah\"</code> with 30 <code>z</code>\\'s in it.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7db9367417b2b2512ba7",
+      "title": "Specify Exact Number of Matches",
+      "description": [
+        "You can specify the lower and upper number of patterns with <code>quantity specifiers</code> using curly brackets. Sometimes you only want a specific number of matches.",
+        "To specify a certain number of patterns, just have that one number between the curly brackets.",
+        "For example, to match only the word <code>\"hah\"</code> with the letter <code>a</code> <code>3</code> times, your regex would be <code>/ha{3}h/</code>.",
+        "<blockquote>let A4 = \"haaaah\";<br>let A3 = \"haaah\";<br>let A100 = \"h\" + \"a\".repeat(100) + \"h\";<br>let multipleHA = /a{3}h/;<br>multipleHA.test(A4); // Returns false<br>multipleHA.test(A3); // Returns true<br>multipleHA.test(A100); // Returns false</blockquote>",
+        "<hr>",
+        "Change the regex <code>timRegex</code> to match the word <code>\"Timber\"</code> only when it has four letter <code>m</code>'s."
+      ],
+      "challengeSeed": [
+        "let timStr = \"Timmmmber\";",
+        "let timRegex = /change/; // Change this line",
+        "let result = timRegex.test(timStr);"
+      ],
+      "tests": [
+        "assert(timRegex.source.match(/{.*?}/).length > 0, 'message: Your regex should use curly brackets.');",
+        "assert(!timRegex.test(\"Timber\"), 'message: Your regex should not match <code>\"Timber\"</code>');",
+        "assert(!timRegex.test(\"Timmber\"), 'message: Your regex should not match <code>\"Timmber\"</code>');",
+        "assert(!timRegex.test(\"Timmmber\"), 'message: Your regex should not match <code>\"Timmmber\"</code>');",
+        "assert(timRegex.test(\"Timmmmber\"), 'message: Your regex should match <code>\"Timmmmber\"</code>');",
+        "assert(!timRegex.test(\"Ti\" + \"m\".repeat(30) + \"ber\"), 'message: Your regex should not match <code>\"Timber\"</code> with 30 <code>m</code>\\'s in it.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dba367417b2b2512ba8",
+      "title": "Check for All or None",
+      "description": [
+        "Sometimes the patterns you want to search for may have parts of it that may or may not exist. However, it may be important to check for them nonetheless.",
+        "You can specify the possible existence of an element with a question mark, <code>?</code>. This checks for zero or one of the preceding element. You can think of this symbol as saying the previous element is optional.",
+        "For example, there are slight differences in American and British English and you can use the question mark to match both spellings.",
+        "<blockquote>let american = \"color\";<br>let british = \"colour\";<br>let rainbowRegex= /colou?r/;<br>rainbowRegex.test(american); // Returns true<br>rainbowRegex.test(british); // Returns true</blockquote>",
+        "<hr>",
+        "Change the regex <code>favRegex</code> to match both the American English (favorite) and the British English (favourite) version of the word."
+      ],
+      "challengeSeed": [
+        "let favWord = \"favorite\";",
+        "let favRegex = /change/; // Change this line",
+        "let result = favRegex.test(favWord);"
+      ],
+      "tests": [
+        "assert(favRegex.source.match(/\\?/).length > 0, 'message: Your regex should use the optional symbol, <code>?</code>.');",
+        "assert(favRegex.test(\"favorite\"), 'message: Your regex should match <code>\"favorite\"</code>');",
+        "assert(favRegex.test(\"favourite\"), 'message: Your regex should match <code>\"favourite\"</code>');",
+        "assert(!favRegex.test(\"fav\"), 'message: Your regex should not match <code>\"fav\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dba367417b2b2512ba9",
+      "title": "Positive and Negative Lookahead",
+      "description": [
+        "<code>Lookaheads</code> are patterns that tell JavaScript to look-ahead in your string to check for patterns further along. This can be useful when you want to search for multiple patterns over the same string.",
+        "There are two kinds of <code>lookaheads</code>: <code>positive lookahead</code> and <code>negative lookahead</code>.",
+        "A <code>positive lookahead</code> will look to make sure the element in the search pattern is there, but won't actually match it. A positive lookahead is used as <code>(?=...)</code> where the <code>...</code> is the required part that is not matched.",
+        "On the other hand, a <code>negative lookahead</code> will look to make sure the element in the search pattern is not there. A negative lookahead is used as <code>(?!...)</code> where the <code>...</code> is the pattern that you do not want to be there. The rest of the pattern is returned if the negative lookahead part is not present.",
+        "Lookaheads are a bit confusing but some examples will help.",
+        "<blockquote>let quit = \"qu\";<br>let noquit = \"qt\";<br>let quRegex= /q(?=u)/;<br>let qRegex = /q(?!u)/;<br>quit.match(quRegex); // Returns [\"q\"]<br>noquit.match(qRegex); // Returns [\"q\"]</blockquote>",
+        "A more practical use of <code>lookaheads</code> is to check two or more patterns in one string. Here is a (naively) simple password checker that looks for between 3 and 6 characters and at least one number:",
+        "<blockquote>let password = \"abc123\";<br>let checkPass = /(?=\\w{3,6})(?=\\D*\\d)/;<br>checkPass.test(password); // Returns true</blockquote>",
+        "<hr>",
+        "Use <code>lookaheads</code> in the <code>pwRegex</code> to match passwords that are greater than 5 characters long and have two consecutive digits."
+      ],
+      "challengeSeed": [
+        "let sampleWord = \"astronaut\";",
+        "let pwRegex = /change/; // Change this line",
+        "let result = pwRegex.test(sampleWord);"
+      ],
+      "tests": [
+        "assert(pwRegex.source.match(/\\(\\?=.*?\\)\\(\\?=.*?\\)/) !== null, 'message: Your regex should use two positive <code>lookaheads</code>.');",
+        "assert(!pwRegex.test(\"astronaut\"), 'message: Your regex should not match <code>\"astronaut\"</code>');",
+        "assert(!pwRegex.test(\"airplanes\"), 'message: Your regex should not match <code>\"airplanes\"</code>');",
+        "assert(pwRegex.test(\"bana12\"), 'message: Your regex should match <code>\"bana12\"</code>');",
+        "assert(pwRegex.test(\"abc123\"), 'message: Your regex should match <code>\"abc123\"</code>');",
+        "assert(!pwRegex.test(\"123\"), 'message: Your regex should not match <code>\"123\"</code>');",
+        "assert(!pwRegex.test(\"1234\"), 'message: Your regex should not match <code>\"1234\"</code>');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbb367417b2b2512baa",
+      "title": "Reuse Patterns Using Capture Groups",
+      "description": [
+        "Some patterns you search for will occur multiple times in a string. It is wasteful to manually repeat that regex. There is a better way to specify when you have multiple repeat substrings in your string.",
+        "You can search for repeat substrings using <code>capture groups</code>. Parentheses, <code>(</code> and <code>)</code>, are used to find repeat substrings. You put the regex of the pattern that will repeat in between the parentheses.",
+        "To specify where that repeat string will appear, you use a backslash (<code>\\</code>) and then a number. This number starts at 1 and increases with each additional capture group you use. An example would be <code>\\1</code> to match the first group.",
+        "The example below matches any word that occurs twice separated by a space:",
+        "<blockquote>let repeatStr = \"regex regex\";<br>let repeatRegex = /(\\w+)\\s\\1/;<br>repeatRegex.test(repeatStr); // Returns true<br>repeatStr.match(repeatRegex); // Returns [\"regex regex\", \"regex\"]</blockquote>",
+        "Using the <code>.match()</code> method on a string will return an array with the string it matches, along with its capture group.",
+        "<hr>",
+        "Use <code>capture groups</code> in <code>reRegex</code> to match numbers that are repeated only three times in a string, each separated by a space."
+      ],
+      "challengeSeed": [
+        "let repeatNum = \"42 42 42\";",
+        "let reRegex = /change/; // Change this line",
+        "let result = reRegex.test(repeatNum);"
+      ],
+      "tests": [
+        "assert(reRegex.source.match(/\\\\d/), 'message: Your regex should use the shorthand character class for digits.');",
+        "assert(reRegex.source.match(/\\\\\\d/g).length === 2, 'message: Your regex should reuse the capture group twice.');",
+        "assert(reRegex.source.match(/\\\\s/g).length === 2, 'message: Your regex should have two spaces separating the three numbers.');",
+        "assert(reRegex.test(\"42 42 42\"), 'message: Your regex should match <code>\"42 42 42\"</code>.');",
+        "assert(reRegex.test(\"100 100 100\"), 'message: Your regex should match <code>\"100 100 100\"</code>.');",
+        "assert.equal((\"42 42 42 42\").match(reRegex.source), null, 'message: Your regex should not match <code>\"42 42 42 42\"</code>.');",
+        "assert.equal((\"42 42\").match(reRegex.source), null, 'message: Your regex should not match <code>\"42 42\"</code>.');",
+        "assert(!reRegex.test(\"101 102 103\"), 'message: Your regex should not match <code>\"101 102 103\"</code>.');",
+        "assert(!reRegex.test(\"1 2 3\"), 'message: Your regex should not match <code>\"1 2 3\"</code>.');",
+        "assert(reRegex.test(\"10 10 10\"), 'message: Your regex should match <code>\"10 10 10\"</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbb367417b2b2512bab",
+      "title": "Use Capture Groups to Search and Replace",
+      "description": [
+        "Searching is useful. However, you can make searching even more powerful when it also changes (or replaces) the text you match.",
+        "You can search and replace text in a string using <code>.replace()</code> on a string. The inputs for <code>.replace()</code> is first the regex pattern you want to search for. The second parameter is the string to replace the match or a function to do something.",
+        "<blockquote>let wrongText = \"The sky is silver.\";<br>let silverRegex = /silver/;<br>wrongText.replace(silverRegex, \"blue\");<br>// Returns \"The sky is blue.\"</blockquote>",
+        "You can also access capture groups in the replacement string with dollar signs (<code>$</code>).",
+        "<blockquote>\"Code Camp\".replace(/(\\w+)\\s(\\w+)/, '$2 $1');<br>// Returns \"Camp Code\"</blockquote>",
+        "<hr>",
+        "Write a regex so that it will search for the string <code>\"good\"</code>. Then update the <code>replaceText</code> variable to replace <code>\"good\"</code> with <code>\"okey-dokey\"</code>."
+      ],
+      "challengeSeed": [
+        "let huhText = \"This sandwich is good.\";",
+        "let fixRegex = /change/; // Change this line",
+        "let replaceText = \"\"; // Change this line",
+        "let result = huhText.replace(fixRegex, replaceText);"
+      ],
+      "tests": [
+        "assert(code.match(/\\.replace\\(.*\\)/), 'message: You should use <code>.replace()</code> to search and replace.');",
+        "assert(result == \"This sandwich is okey-dokey.\" && replaceText === \"okey-dokey\", 'message: Your regex should change <code>\"This sandwich is good.\"</code> to <code>\"This sandwich is okey-dokey.\"</code>');",
+        "assert(code.match(/result\\s*=\\s*huhText\\.replace\\(.*?\\)/), 'message: You should not change the last line.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbb367417b2b2512bac",
+      "title": "Remove Whitespace from Start and End",
+      "description": [
+        "Sometimes whitespace characters around strings are not wanted but are there. Typical processing of strings is to remove the whitespace at the start and end of it.",
+        "<hr>",
+        "Write a regex and use the appropriate string methods to remove whitespace at the beginning and end of strings.",
+        "<strong>Note</strong><br>The <code>.trim()</code> method would work here, but you'll need to complete this challenge using regular expressions."
+      ],
+      "challengeSeed": [
+        "let hello = \"   Hello, World!  \";",
+        "let wsRegex = /change/; // Change this line",
+        "let result = hello; // Change this line"
+      ],
+      "tests": [
+        "assert(result == \"Hello, World!\", 'message: <code>result</code> should equal to <code>\"Hello, World!\"</code>');",
+        "assert(!code.match(/\\.trim\\(.*?\\)/), 'message: You should not use the <code>.trim()</code> method.');",
+        "assert(!code.match(/result\\s*=\\s*\".*?\"/), 'message: The <code>result</code> variable should not be set equal to a string.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "You can use .replace() to remove the matched items by replacing them with an empty string."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/03-front-end-libraries/bootstrap.json b/seed/math-challenges/03-front-end-libraries/bootstrap.json
new file mode 100644
index 0000000000..52d67a6249
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/bootstrap.json
@@ -0,0 +1,2543 @@
+{
+  "name": "Bootstrap",
+  "order": 2,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "required": [
+    {
+      "link": "https://cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/css/bootstrap.css"
+    }
+  ],
+  "challenges": [
+    {
+      "id": "bad87fee1348bd9acdeb9212",
+      "title": "Introduction to the Bootstrap Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "Bootstrap is a front-end framework used to design responsive web pages and web applications. It takes a mobile-first approach to web development. Bootstrap includes pre-built CSS styles and classes, plus some JavaScript functionality.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Bootstrap uses a responsive 12 column grid layout and has design templates for:<br><br><ul><li>buttons</li><li>images</li><li>tables</li><li>forms</li><li>navigation</li></ul><br>This section introduces some of the ways to use Bootstrap in your web projects.",
+          ""
+        ]
+      ],
+      "releasedOn": "",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "bad87fee1348bd9acde08712",
+      "title": "Use Responsive Design with Bootstrap Fluid Containers",
+      "description": [
+        "In the HTML5 and CSS section of freeCodeCamp we built a Cat Photo App. Now let's go back to it. This time, we'll style it using the popular Bootstrap responsive CSS framework.",
+        "Bootstrap will figure out how wide your screen is and respond by resizing your HTML elements - hence the name <code>Responsive Design</code>.",
+        "With responsive design, there is no need to design a mobile version of your website. It will look good on devices with screens of any width.",
+        "You can add Bootstrap to any app by adding the following code to the top of your HTML:",
+        "<code>&#60;link rel=\"stylesheet\" href=\"//maxcdn.bootstrapcdn.com/bootstrap/3.3.7/css/bootstrap.min.css\"/&#62;</code>",
+        "In this case, we've already added it for you to this page behind the scenes. Note that using either <code>></code> or <code>/></code> to close the <code>link</code> tag is acceptable.",
+        "To get started, we should nest all of our HTML (except the <code>link</code> tag and the <code>style</code> element) in a <code>div</code> element with the class <code>container-fluid</code>."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<h2 class=\"red-text\">CatPhotoApp</h2>",
+        "",
+        "<p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "<a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "<p>Things cats love:</p>",
+        "<ul>",
+        "  <li>cat nip</li>",
+        "  <li>laser pointers</li>",
+        "  <li>lasagna</li>",
+        "</ul>",
+        "<p>Top 3 things cats hate:</p>",
+        "<ol>",
+        "  <li>flea treatment</li>",
+        "  <li>thunder</li>",
+        "  <li>other cats</li>",
+        "</ol>",
+        "<form action=\"/submit-cat-photo\">",
+        "  <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "  <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "  <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "  <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "  <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "  <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "  <button type=\"submit\">Submit</button>",
+        "</form>"
+      ],
+      "tests": [
+        "assert($(\"div\").hasClass(\"container-fluid\"), 'message: Your <code>div</code> element should have the class <code>container-fluid</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure your <code>div</code> element has a closing tag.');",
+        "assert($(\".container-fluid\").children().length >= 8, 'message: Make sure you have nested all HTML elements after the closing <code>style</code> tag in <code>.container-fluid</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Usa diseño adaptativo con los contenedores fluidos de Bootstrap",
+          "description": [
+            "Ahora vamos de vuelta a nuestra aplicación de fotos de gatos. Esta vez, vamos a darle estilo utilizando la infraestructura CSS del popular Bootstrap.",
+            "Bootstrap determina qué tan ancha es la pantalla y adapta correspondientemente el tamaño de tus elementos HTML - por eso es que se llama <code>Diseño adaptativo</code> (responsive design).",
+            "Con diseño adaptativo, no hay necesidad de diseñar una versión móvil para tu sitio web. Se verá bien en dispositivos con pantallas de cualquier tamaño.",
+            "Puedes agregar Bootstrap a cualquier aplicación simplemente incluyendo el siguiente código al inicio de tu HTML:",
+            "<code>&#60;link rel=\"stylesheet\" href=\"//maxcdn.bootstrapcdn.com/bootstrap/3.3.1/css/bootstrap.min.css\"/&#62;</code>",
+            "En este caso, lo hemos agregado a esta página por ti.",
+            "Para iniciar, debemos anidar todo nuestro HTML en un elemento <code>div</code> con la clase <code>container-fluid</code>."
+          ]
+        },
+        "fr": {
+          "title": "Un design adaptatif (responsive design) utilisant les conteneurs fluides de Bootstrap",
+          "description": [
+            "Revenons à notre application de photos de chats. Cette fois-ci, nous allons lui donner un style grâce au renommé framework CSS Bootstrap.",
+            "Bootstrap saura reconnaître la largeur de notre écran et s'y adapter en redimensionnant les éléments HTML - d'où le nom <code>Responsive Design</code> (design adaptatif).",
+            "Avec le design responsive, il n'y a pas besoin de créer de version mobile de votre site. Il restera bien sur tous les appareils quelle que soit la taille de leurs écrans.",
+            "Vous pouvez ajouter Bootstrap à n'importe quelle application simplement en incluant le code suivant en haut de votre HTML:",
+            "<code>&#60;link rel=\"stylesheet\" href=\"//maxcdn.bootstrapcdn.com/bootstrap/3.3.1/css/bootstrap.min.css\"/&#62;</code>",
+            "Ici, nous l'avons déjà ajouté à la page pour vous dans l'arrière-boutique.",
+            "Pour commencer, nous devons envelopper nos éléments HTML dans un élément <code>div</code> possédant la classe <code>container-fluid</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9acde08812",
+      "title": "Make Images Mobile Responsive",
+      "description": [
+        "First, add a new image below the existing one. Set its <code>src</code> attribute to <code>https://bit.ly/fcc-running-cats</code>.",
+        "It would be great if this image could be exactly the width of our phone's screen.",
+        "Fortunately, with Bootstrap, all we need to do is add the <code>img-responsive</code> class to your image. Do this, and the image should perfectly fit the width of your page."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"img\").length === 2, 'message: You should have a total of two images.');",
+        "assert($(\"img:eq(1)\").hasClass(\"img-responsive\"), 'message: Your new image should be below your old one and have the class <code>img-responsive</code>.');",
+        "assert(!$(\"img:eq(1)\").hasClass(\"smaller-image\"), 'message: Your new image should not have the class <code>smaller-image</code>.');",
+        "assert($(\"img:eq(1)\").attr(\"src\") === \"https://bit.ly/fcc-running-cats\", 'message: Your new image should have a <code>src</code> of <code>https&#58;//bit.ly/fcc-running-cats</code>.');",
+        "assert(code.match(/<img/g) && code.match(/<img[^<]*>/g).length === 2 && code.match(/<img/g).length === 2, 'message: Make sure your new <code>img</code> element has a closing angle bracket.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Haz que las imágenes sean adaptativas en dispositivos móviles",
+          "description": [
+            "Primero, agrega una nueva imagen debajo que la que ya existe. Haz que su atributo <code>src</code> sea <code>https://bit.ly/fcc-running-cats</code>.",
+            "Sería genial si esta imagen fuera exactamente del tamaño de la pantalla de nuestro teléfono.",
+            "Afortunadamente, con Bootstrap, todo lo que tenemos que hacer es agregar la clase <code>img-responsive</code> a tu imagen. Hazlo, y verás que la imagen se ajustará perfectamente al ancho de tu página."
+          ]
+        },
+        "fr": {
+          "title": "Rendre des images adaptatives aux appareils mobiles",
+          "description": [
+            "It would be great if this image could be exactly the width of our phone's screen.",
+            "Fortunately, with Bootstrap, all we need to do is add the <code>img-responsive</code> class to your image. Do this, and the image should perfectly fit the width of your page.",
+            "D'abord, ajoutez une nouvelle image en dessous de celle qui eiste dejà. Changez l'attribut <code>src</src> en <code>https://bit.ly/fcc-running-cats</code>.",
+            "Ce serait absolument super si notre image pouvait être exactement de la largeur de l'écran du téléphone.",
+            "Heureusement, avec Bootstrap, il faut seulement ajouter la classe <code>img-responsive</code> à notre image. Faites le, et l'image devrait s'ajuster parfaitement à la largeur de la page."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd8acde08812",
+      "title": "Center Text with Bootstrap",
+      "description": [
+        "Now that we're using Bootstrap, we can center our heading element to make it look better. All we need to do is add the class <code>text-center</code> to our <code>h2</code> element.",
+        "Remember that you can add several classes to the same element by separating each of them with a space, like this:",
+        "<code>&#60h2 class=\"red-text text-center\"&#62your text&#60/h2&#62</code>"
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"h2\").hasClass(\"text-center\"), 'message: Your <code>h2</code> element should be centered by applying the class <code>text-center</code>');",
+        "assert($(\"h2\").hasClass(\"red-text\"), 'message: Your <code>h2</code> element should still have the class <code>red-text</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Centra el texto con Bootstrap",
+          "description": [
+            "Ahora que estamos usando Bootstrap, podemos centrar nuestro elemento de encabezado para hacerlo verse mejor. Todo lo que necesitamos hacer es agregar la clase <code>text-center</code> a nuestro elemento <code>h2</code>.",
+            "Recuerda que puedes agregar varias clases a un mismo elemento separando cada una de ellas con un espacio, de esta forma:",
+            "<code>&#60h2 class=\"red-text text-center\"&#62your text&#60/h2&#62</code>"
+          ]
+        },
+        "fr": {
+          "title": "Centrer du texte avec Bootstrap",
+          "description": [
+            "Maintenant que wous utilisons Bootstrap, nous pouvons centrer notre entête pour qu'il ait une meilleure apparence. Nous devons seulement ajouter la classe <code>text-center</code> à notre élément <code>h2</code>.",
+            "Souvenez vous que vous pouvez utiliser plusieurs classes pour un même élément en les séparant avec un espace, comme ceci:",
+            "<code>&#60h2 class=\"red-text text-center\"&#62Votre texte&#60/h2&#62</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348cd8acdf08812",
+      "title": "Create a Bootstrap Button",
+      "description": [
+        "Bootstrap has its own styles for <code>button</code> elements, which look much better than the plain HTML ones.",
+        "Create a new <code>button</code> element below your large kitten photo. Give it the class <code>btn</code> and the text of \"Like\"."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(new RegExp(\"like\",\"gi\").test($(\"button\").text()), 'message: Create a new <code>button</code> element with the text \"Like\".');",
+        "assert($(\"button\").hasClass(\"btn\"), 'message: Your new button should have the class <code>btn</code>.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure all your <code>button</code> elements have a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea un botón con Bootstrap",
+          "description": [
+            "Bootstrap tiene sus propios estilos para elementos <code>button</code>, los cuales se ven mejor que los estilos simples de HTML.",
+            "Crea un nuevo elemento <code>button</code> debajo de tu foto grande del gatito. Dale la clase <code>btn</code> y el texto \"Like\"."
+          ]
+        },
+        "fr": {
+          "title": "Créer un bouton avec Bootstrap",
+          "description": [
+            "Bootstrap possède ses propres styles pour les éléments <code>button</code>, qui sont beaucoup plus beaux que ceux issus du HTML seul.",
+            "Créez un nouvel élément <code>button</code> en dessous de votre grande photo de chaton. Donnez lui comme classe <code>btn</code> et comme texte \"Like\"."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348cd8acef08812",
+      "title": "Create a Block Element Bootstrap Button",
+      "description": [
+        "Normally, your <code>button</code> elements with a class of <code>btn</code> are only as wide as the text that they contain. For example:",
+        "<code>&lt;button class=\"btn\"&gt;Submit&lt;/button&gt;</code>",
+        "This button would only be as wide as the word \"Submit\".",
+        "<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>Submit</button>",
+        "By making them block elements with the additional class of <code>btn-block</code>, your button will stretch to fill your page's entire horizontal space and any elements following it will flow onto a \"new line\" below the block.",
+        "<code>&lt;button class=\"btn btn-block\"&gt;Submit&lt;/button&gt;</code>",
+        "This button would take up 100% of the available width.",
+        "<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>Submit</button>",
+        "Note that these buttons still need the <code>btn</code> class.",
+        "Add Bootstrap's <code>btn-block</code> class to your Bootstrap button."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <button class=\"btn\">Like</button>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"button\").hasClass(\"btn\"), 'message: Your button should still have the class <code>btn</code>.');",
+        "assert($(\"button\").hasClass(\"btn-block\"), 'message: Your button should have the class <code>btn-block</code>.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure all your <code>button</code> elements have a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea un elemento botón de bloque con Bootstrap",
+          "description": [
+            "Normalmente , los elementos de <code>button</code> con una clase de <code>btn</code> sólo son tan ancha como el texto que contienen. Por ejemplo:",
+            "<code>&lt;button class=\"btn\"&gt;Enviar&lt;/button&gt;</code>",
+            "Este botón sólo sería tan amplia como la palabra \"Enviar\"",
+            "<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>Enviar</button>",
+            "Haciéndolos bloquean elementos con la clase adicional de <code>btn-block</code>, el botón se amplía para llenar toda espacio horizontal de la página y los elementos siguientes fluirá sobre una \"nueva línea\" debajo del bloque .",
+            "<code>&lt;button class=\"btn btn-block\"&gt;Enviar&lt;/button&gt;</code>",
+            "Este botón llevaría hasta el 100% de la anchura disponible.",
+            "<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>Enviar</button>",
+            "Ten en cuenta que estos botones todavía necesitan la clase <code>btn</code>.",
+            "Agrega la clase de Bootstrap <code>btn-block</code> a tu botón Bootstrap."
+          ]
+        },
+        "fr": {
+          "title": "Créer un bouton bloc Bootstrap",
+          "description": [
+            "Normalement , vos éléments de <code>button</code> avec une classe de <code>btn</code> ne sont aussi larges que le texte qu'ils contiennent . Par exemple:",
+            "<code>&lt;button class=\"btn\"&gt;Soumettre&lt;/button&gt;</code>",
+            "Ce bouton ne serait plus large que le mot \"Soumettre\" .",
+            "<button class='btn' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>Soumettre</button>",
+            "En leur faisant bloquer les éléments avec la classe supplémentaire de <code>btn-block</code>, votre bouton étirer pour remplir tout l'espace horizontal de votre page et tous les éléments suivants, il coulera sur une \"nouvelle ligne\" en dessous du bloc .",
+            "<code>&lt;button class=\"btn btn-block\"&gt;Soumettre&lt;/button&gt;</code>",
+            "Ce bouton prendrait 100% de la largeur disponible .",
+            "<button class='btn btn-block' style='background-color: rgb(0, 100, 0);  color: rgb(255, 255, 255);'>Soumettre</button>",
+            "Notez que ces boutons ont toujours besoin de la classe <code>btn</code>",
+            "Ajoutez la classe Bootstrap <code>btn-block</code> à votre bouton Bootstrap."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348cd8acef08811",
+      "title": "Taste the Bootstrap Button Color Rainbow",
+      "description": [
+        "The <code>btn-primary</code> class is the main color you'll use in your app. It is useful for highlighting actions you want your user to take.",
+        "Add Bootstrap's <code>btn-primary</code> class to your button.",
+        "Note that this button will still need the <code>btn</code> and <code>btn-block</code> classes."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <button class=\"btn btn-block\">Like</button>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"button\").hasClass(\"btn-primary\"), 'message: Your button should have the class <code>btn-primary</code>.');",
+        "assert($(\"button\").hasClass(\"btn-block\") && $(\"button\").hasClass(\"btn\"), 'message: Your button should still have the <code>btn</code> and <code>btn-block</code> classes.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure all your <code>button</code> elements have a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Prueba el arcoíris de colores para botones que te ofrece Bootstrap",
+          "description": [
+            "La clase <code>btn-primary</code> es el color principal que utilizarás en tu aplicación. Es útil resaltar las acciones que quieres que tu usuario ejecute.",
+            "Agrega la clase <code>btn-primary</code> de Bootstrap a tu botón.",
+            "Ten en mente que este botón todavía necesita las clases <code>btn</code> y <code>btn-block</code>."
+          ]
+        },
+        "fr": {
+          "title": "Goutez à l'arc en ciel de couleurs des boutons de Bootstrap",
+          "description": [
+            "La classe <code>btn-primary</code> est la couleur principale que vous utiliserez dans votre application. Elle est utile pour mettre en valeur les actions que vous voulez faire réaliser par vos utilisateurs.",
+            "Ajoutez la classe Bootstrap <code>btn-primary</code> à votre bouton.",
+            "Notez que ce bouton a toujours besoin des classes <code>btn</code> et <code>btn-block</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348cd8acef08813",
+      "title": "Call out Optional Actions with btn-info",
+      "description": [
+        "Bootstrap comes with several pre-defined colors for buttons. The <code>btn-info</code> class is used to call attention to optional actions that the user can take.",
+        "Create a new block-level Bootstrap button below your \"Like\" button with the text \"Info\", and add Bootstrap's <code>btn-info</code> and <code>btn-block</code> classes to it.",
+        "Note that these buttons still need the <code>btn</code> and <code>btn-block</code> classes."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <button class=\"btn btn-block btn-primary\">Like</button>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(new RegExp(\"info\",\"gi\").test($(\"button\").text()), 'message: Create a new <code>button</code> element with the text \"Info\".');",
+        "assert($(\"button.btn-block.btn\").length > 1, 'message: Both of your Bootstrap buttons should have the <code>btn</code> and <code>btn-block</code> classes.');",
+        "assert($(\"button\").hasClass(\"btn-info\"), 'message: Your new button should have the class <code>btn-info</code>.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure all your <code>button</code> elements have a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Señala acciones opcionales con botones informativos",
+          "description": [
+            "Bootstrap incluye varios colores pre-definidos para botones. La clase <code>btn-info</code> se utiliza para llamar la atención a acciones opcionales que el usuario puede tomar.",
+            "Crea un nuevo botón a nivel de bloque de Bootstrap debajo de tu botón de \"Like\" con el texto \"Info\", y agrégale las clases de Bootstrap <code>btn-info</code> y <code>btn-block</code>.",
+            "Ten en mente que estos botones todavía necesitan las clases <code>btn</code> y <code>btn-block</code>."
+          ]
+        },
+        "fr": {
+          "title": "Indiquez les actions optionelles avec des boutons informatifs",
+          "description": [
+            "Bootstrap est livré avec plusieurs couleurs prédéfinies pour les boutons. La classe <code>btn-info</code> est utilisée pour indiquer des actions optionelles pour vos utilisateurs.",
+            "Créez un nouveau bouton Bootstrap bloc en dessous de votre bouton \"Like\" avec le texte \"Info\" et donnez lui les classes Bootstrap <code>btn-info</code> et <code>btn-block</code>.",
+            "Notez que ces boutons ont toujours besoins des classes <code>btn</code> and <code>btn-block</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348ce8acef08814",
+      "title": "Warn Your Users of a Dangerous Action with btn-danger",
+      "description": [
+        "Bootstrap comes with several pre-defined colors for buttons. The <code>btn-danger</code> class is the button color you'll use to notify users that the button performs a destructive action, such as deleting a cat photo.",
+        "Create a button with the text \"Delete\" and give it the class <code>btn-danger</code>.",
+        "Note that these buttons still need the <code>btn</code> and <code>btn-block</code> classes."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <button class=\"btn btn-block btn-primary\">Like</button>",
+        "  <button class=\"btn btn-block btn-info\">Info</button>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(new RegExp(\"Delete\",\"gi\").test($(\"button\").text()), 'message: Create a new <code>button</code> element with the text \"Delete\".');",
+        "assert($(\"button.btn-block.btn\").length > 2, 'message: All of your Bootstrap buttons should have the <code>btn</code> and <code>btn-block</code> classes.');",
+        "assert($(\"button\").hasClass(\"btn-danger\"), 'message: Your new button should have the class <code>btn-danger</code>.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure all your <code>button</code> elements have a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Advierte a tus usuarios sobre acciones peligrosas",
+          "description": [
+            "Bootstrap incluye varios colores pre-definidos para botones. La clase <code>btn-danger</code> es el color de botón que usarías para notificar a los usuarios que el botón ejecuta una acción destructiva, como por ejemplo eliminar la foto de un gato.",
+            "Crea un botón con el texto \"Delete\" y dale la clase <code>btn-danger</code>.",
+            "Recuerda que estos botones todavía requieren las clases <code>btn</codez> y <code>btn-block</code>."
+          ]
+        },
+        "fr": {
+          "title": "Prévenez vos utilisateurs d'une action dangereuse",
+          "description": [
+            "Bootstrap est livré avec plusieurs couleurs prédéfinies pour les boutons. La classe <code>btn-danger</code> est utilisée pour indiquer aux utilisateurs que le bouton actionne un processus destructif comme supprimer une photo de chat.",
+            "Créez un bouton ayant le texte \"Delete\" et donnez lui la classe <code>btn-danger</code>.",
+            "Notez que ces boutons ont toujours besoins des classes <code>btn</code> and <code>btn-block</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad88fee1348ce8acef08815",
+      "title": "Use the Bootstrap Grid to Put Elements Side By Side",
+      "description": [
+        "Bootstrap uses a responsive grid system, which makes it easy to put elements into rows and specify each element's relative width. Most of Bootstrap's classes can be applied to a <code>div</code> element.",
+        "Here's a diagram of how Bootstrap's 12-column grid layout works:",
+        "<a href=\"https://v4-alpha.getbootstrap.com/layout/grid/#example-stacked-to-horizontal\" target=\"_blank\"><img class=\"img-responsive\" src=\"//i.imgur.com/FaYuui8.png\" title=\"Click to view in the Bootstrap documentation\" alt=\"an image illustrating Bootstrap's grid system\"></a>",
+        "Note that in this illustration, the <code>col-md-*</code> class is being used. Here, <code>md</code> means medium, and <code>*</code> is a number specifying how many columns wide the element should be. In this case, the column width of an element on a medium-sized screen, such as a laptop, is being specified.",
+        "In the Cat Photo App that we're building, we'll use <code>col-xs-*</code>, where <code>xs</code> means extra small (like an extra-small mobile phone screen), and <code>*</code> is the number of columns specifying how many columns wide the element should be.",
+        "Put the <code>Like</code>, <code>Info</code> and <code>Delete</code> buttons side-by-side by nesting all three of them within one <code>&#60;div class=\"row\"&#62;</code> element, then each of them within a <code>&#60;div class=\"col-xs-4\"&#62;</code> element.",
+        "The <code>row</code> class is applied to a <code>div</code>, and the buttons themselves can be nested within it."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <button class=\"btn btn-block btn-primary\">Like</button>",
+        "  <button class=\"btn btn-block btn-info\">Info</button>",
+        "  <button class=\"btn btn-block btn-danger\">Delete</button>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.row:has(button)\").length > 0, 'message: Your buttons should all be nested within the same <code>div</code> element with the class <code>row</code>.');",
+        "assert($(\"div.col-xs-4:has(button)\").length > 2, 'message: Each of your Bootstrap buttons should be nested within its own <code>div</code> element with the class <code>col-xs-4</code>.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure each of your <code>button</code> elements has a closing tag.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure each of your <code>div</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Usa la cuadrícula de Bootstrap para poner elementos lado a lado",
+          "description": [
+            "Bootstrap utiliza un sistema de cuadrícula adaptativa que facilita el poner elementos en fila y especificar la anchura relativa de cada elemento. La mayoría de las clases de Bootstrap pueden ser aplicadas a un elemento <code>div</code>.",
+            "Aquí hay un diagrama del funcionamiento de la cuadrícula de 12 columnas Bootstrap:",
+            "<a href=\"https://v4-alpha.getbootstrap.com/layout/grid/#example-stacked-to-horizontal\" target=\"_blank\"><img class=\"img-responsive\" src=\"//i.imgur.com/FaYuui8.png\" title=\"Haga clic para ver la documentación rejilla Bootstrap\" alt=\"una imagen que muestra el sistema de cuadrícula de Bootstrap\"></a>",
+            "En esta ilustración se está utilizando la clase <code>col-md-*</code>. Aquí, <code>md</code> significa mediano, y <code>*</code> es un número que especifica la cantidad de columnas debe tomar el ancho del elemento. En este caso, se especifica el ancho de columna de un elemento en una pantalla de tamaño mediano, como una laptop.",
+            "En la aplicación de fotos de gatos que estamos construyendo, usaremos <code>col-xs-*</code>, donde <code>xs</code> significa extra pequeño (como una pantalla extra-pequeña de un teléfono), y <code>*</code> especifica el número de columnas que debe tomar el ancho del elemento.",
+            "Pon los botones de <code>Like</code>, <code>Info</code> y <code>Delete</code> lado a lado. Esto se hace anidando los tres botones dentro de un elemento <code>&#60;div class=\"row\"&#62;</code>, y luego cada uno de ellos dentro de un elemento <code>&#60;div class=\"col-xs-4\"&#62;</code>.",
+            "La clase <code>row</code> se aplica al elemento <code>div</code>, dentro del cual van anidados los botones."
+          ]
+        },
+        "fr": {
+          "title": "Utilisez la grille de Bootstrap pour mettre les éléments côte-à-côte.",
+          "description": [
+            "Bootstrap utilise un système de grille adaptative, qui rend plus simple le placement des éléments en rangées et la spécification de la largeur relative de chaque élément. La plupart des classes de Bootstrap peuvent être associés à un élément <code>div</code>",
+            "Voici un diagramme décrivant le fonctionnement du système de grille à 12 colonnes:",
+            "<a href=\"https://v4-alpha.getbootstrap.com/layout/grid/#example-stacked-to-horizontal\" target=\"_blank\"><img class=\"img-responsive\" src=\"https://i.imgur.com/FaYuui8.png\" title=\"Cliquez pour voir la documentation de la grille Bootstrap\" alt=\"Une image illustrant le système de grille Bootstrap\"></a>",
+            "Notez que dans cet exemple, nous avons utilisé la classe <code>col-md-*</code>. Ici, <code>md</code> signifie medium, et <code>*</code> donne le nombre de colonnes en largeur de l'élément. Dans le cas présenté, on a défini la largeur en colonnes d' un élément sur un écrand de taille medium, comme un ordinateur portable.",
+            "Dans l'application de photos de chats que nous sommes en train de construire, nous utiliserons <code>col-xs-*</code>, où <code>xs</code> signifie extrêmement petit (comme un écran de téléphone mobile), et <code>*</code> est le nombre de colonnes en largeur de l'élément.",
+            "Mettez les boutons <code>Like</code>, <code>info</code> et <code>Delete</code> côte-à-côte en les enveloppant tous dans un élément <code>&#60;div class=\"row\"&#62;</code>, puis chacun d'entre eux dans un élément <code>&#60;div class=\"col-xs-4\"&#62;</code> element.",
+            "La classe <code>row</code> est donnée à un <code>div</code>, et les boutons peuvent être insérés à l'intérieur de celui-ci."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1347bd9aedf08845",
+      "title": "Ditch Custom CSS for Bootstrap",
+      "description": [
+        "We can clean up our code and make our Cat Photo App look more conventional by using Bootstrap's built-in styles instead of the custom styles we created earlier.",
+        "Don't worry - there will be plenty of time to customize our CSS later.",
+        "Delete the <code>.red-text</code>, <code>p</code>, and <code>.smaller-image</code> CSS declarations from your <code>style</code> element so that the only declarations left in your <code>style</code> element are <code>h2</code> and <code>thick-green-border</code>.",
+        "Then delete the <code>p</code> element that contains a dead link. Then remove the <code>red-text</code> class from your <code>h2</code> element and replace it with the <code>text-primary</code> Bootstrap class.",
+        "Finally, remove the \"smaller-image\" class from your first <code>img</code> element and replace it with the <code>img-responsive</code> class."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  .red-text {",
+        "    color: red;",
+        "  }",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  p {",
+        "    font-size: 16px;",
+        "    font-family: Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "  .smaller-image {",
+        "    width: 100px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"red-text text-center\">CatPhotoApp</h2>",
+        "",
+        "  <p>Click here for <a href=\"#\">cat photos</a>.</p>",
+        "",
+        "  <a href=\"#\"><img class=\"smaller-image thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\">Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\">Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\">Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(!$(\"h2\").hasClass(\"red-text\"), 'message: Your h2 element should no longer have the class <code>red-text</code>.');",
+        "assert($(\"h2\").hasClass(\"text-primary\"), 'message: Your h2 element should now have the class <code>text-primary</code>.');",
+        "assert(!$(\"p\").css(\"font-family\").match(/monospace/i), 'message: Your paragraph elements should no longer use the font <code>Monospace</code>.');",
+        "assert(!$(\"img\").hasClass(\"smaller-image\"), 'message: Remove the <code>smaller-image</code> class from your top image.');",
+        "assert($(\".img-responsive\").length > 1, 'message: Add the <code>img-responsive</code> class to your top image.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Reemplaza el CSS personalizado por Bootstrap",
+          "description": [
+            "Podemos limpiar nuestro código y hacer que nuestra aplicación de fotos de gatos se vea más convencional, usando los estilos pre-construidos de Bootstrap, en lugar de los estilos personalizados que creamos antes.",
+            "No te preocupes, luego habrá más tiempo para personalizar nuestro CSS.",
+            "Elimina las declaraciones CSS <code>.red-text</code>, <code>p</code>, y <code>.smaller-image</code> de tu elemento <code>style</code>, de forma que las únicas declaraciones que queden en tu elemento <code>style</code> sean <code>h2</code> y <code>thick-green-border</code>.",
+            "Luego elimina el elemento <code>p</code> que contiene un enlace nulo. Después, elimina la clase <code>red-text</code> de tu elemento <code>h2</code> y reemplázalo con la clase <code>text-primary</code> de Bootstrap.",
+            "Por último, elimina la clase \"smaller-image\" de tu primer elemento <code>img</code> y reemplázalo con la clase <code>img-responsive</code>."
+          ]
+        },
+        "fr": {
+          "title": "Remplacez le CSS personnalisé par les styles Bootstrap",
+          "description": [
+            "Nous pouvons nettoyer notre code et rendre le look de notre appli Cat Photos plus conventionnel en utilisant les styles intégrés à Bootstrap à la place des styles personnalisés que nous avons créés auparavant.",
+            "Ne vous inquiétez pas - nous auront beaucoup de temps pour personnaliser notre CSS plus tard.",
+            "Supprimez les déclarations CSS <code>.red-text</code>, <code>p</code>, et <code>.smaller-image</code> de votre élément <code>style</code> pour que les seules déclarations restantes dans l'élément <code>style</code> soient <code>h2</code> et <code>thick-green-border</code>.",
+            "Ensuite supprimez l'élément <code>p</code> contenant un lien fantôme. Puis enlevez la classe <code>red-text</code> de votre élément <code>h2</code> et remplacez la par la classe Bootstrap <code>text-primary</code>",
+            "Enfin, enlevez la classe \"smaller-image\" dde votre premier élément <code>img</code> et remplacez le par la classe <code>img-responsive</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedf08845",
+      "title": "Use a span to Target Inline Elements",
+      "description": [
+        "You can use spans to create inline elements. Remember when we used the <code>btn-block</code> class to make the button fill the entire row?",
+        "This image illustrates the difference between <code>inline</code> elements and <code>block-level</code> elements:",
+        "<a href=\"//i.imgur.com/O32cDWE.png\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/O32cDWE.png\" title=\"Click to enlarge\" alt=\"An \"inline\" button is as small as the text it contains. In this image, it's centered. Below it is a \"block-level\" button, which stretches to fill the entire horizontal space.'></a>",
+        "By using the <code>span</code> element, you can put several elements together, and even style different parts of the same element differently.",
+        "Nest the word \"love\" in your \"Things cats love\" element below within a <code>span</code> element. Then give that <code>span</code> the class <code>text-danger</code> to make the text red.",
+        "Here's how you would do this with the \"Top 3 things cats hate\" element:",
+        "<code>&#60;p&#62;Top 3 things cats &#60;span class=\"text-danger\"&#62;hate:&#60;/span&#62;&#60;/p&#62;</code>"
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "",
+        "  <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\">Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\">Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\">Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats love:</p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"p span\") && $(\"p span\").length > 0, 'message: Your <code>span</code> element should be inside your <code>p</code> element.');",
+        "assert($(\"p span\") && $(\"p span\").text().match(/love/i) && !$(\"p span\").text().match(/Things cats/i), 'message: Your <code>span</code> element should have just the text <code>love</code>.');",
+        "assert($(\"span\").hasClass(\"text-danger\"), 'message: Your <code>span</code> element should have class <code>text-danger</code>.');",
+        "assert(code.match(/<\\/span>/g) && code.match(/<span/g) && code.match(/<\\/span>/g).length === code.match(/<span/g).length, 'message: Make sure your <code>span</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Usa span para elementos en línea",
+          "description": [
+            "Puedes utilizar span para crear elementos en línea. ¿Recuerdas cuando usamos la clase <code>btn-block</code> para hacer que el botón llenara toda la línea?",
+            "Esta imagen ilustra la diferencia entre elementos en línea (<code>inline</code>) y elementos a nivel de bloque (<code>block-level</code>):",
+            "<a href=\"//i.imgur.com/O32cDWE.png\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/O32cDWE.png\" title=\"Pulsa para agrandar\" alt=\"Un botón \"en línea\" es tan pequeño como el texto que contiene. En esta imagen, está centrado. Debajo de este hay un botón \"a nivel de bloque\", que se estira para llenar todo el espacio horizontal.'></a>",
+            "Al usar el elemento <code>span</code>, puedes poner varios elementos juntos, e incluso darle diferentes estilos a partes diferentes del mismo elemento.",
+            "Anida la palabra \"love\" en tu elemento \"Things cats love\" dentro de un elemento <code>span</code>. Luego, asigna a ese elemento <code>span</code> la clase <code>text-danger</code> para hacer que el texto sea rojo.",
+            "Así es como lo harías con el elemento \"Top 3 things cats hate\":",
+            "<code>&#60;p&#62;Top 3 things cats &#60;span class=\"text-danger\"&#62;hate:&#60;/span&#62;&#60;/p&#62;</code>"
+          ]
+        },
+        "fr": {
+          "title": "Utiliser Spans pour les éléments \"Inline\"",
+          "description": [
+            "Vous pouvez utiliser les spans pour créer des éléments inline. Vous rappelez vous quand nous avions utilisé la classe <code>btn-block</code> pour remplir la rangée entière?",
+            "Cette image illustre la différence entre les éléments <code>inline</code> (en ligne) et les éléments <code>block-level</code> (de blocs):",
+            "<a href=\"https://i.imgur.com/O32cDWE.png\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"https://i.imgur.com/O32cDWE.png\" title=\"Cliquez pour élargir\" alt=\"Un bouton \"inline\" est aussi petit que le texte qu'il contient. Dans cette image, c'est centré. En dessous il y a un bouton \"block-level\", qui s'étire à tout l'espace horizontal.'></a>",
+            "En utilisant un élément <code>span</code>, vous pouvez mettre ensemble plusieurs éléments, et même donner un style différent à plusieurs parties d'un même élément",
+            "Nichez le mot \"love\" dans votre élément \"Things cats love\" en dessous dans un élément <code>span</code>; Ensuite donnez à ce <code>span</code> la classe <code>text-danger</code> pour rendre le texte rouge.",
+            "Il faudrait que vous fassiez ainsi pour l'élément \"Top 3 things cats hate\":",
+            "<code>&#60;p&#62;Top 3 things cats &#60;span class=\"text-danger\"&#62;hate:&#60;/span&#62;&#60;/p&#62;</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aede08845",
+      "title": "Create a Custom Heading",
+      "description": [
+        "We will make a simple heading for our Cat Photo App by putting the title and relaxing cat image in the same row.",
+        "Remember, Bootstrap uses a responsive grid system, which makes it easy to put elements into rows and specify each element's relative width. Most of Bootstrap's classes can be applied to a <code>div</code> element.",
+        "Here's a diagram of how Bootstrap's 12-column grid layout works:",
+        "<a href=\"//i.imgur.com/FaYuui8.png\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/FaYuui8.png\" title=\"Click to enlarge\" alt=\"an image illustrating Bootstrap's grid system\"></a>",
+        "Note that in this illustration, the <code>col-md-*</code> class is being used. Here, <code>md</code> means medium, and <code>*</code> is a number specifying how many columns wide the element should be. In this case, the column width of an element on a medium-sized screen, such as a laptop, is being specified.",
+        "In the Cat Photo App that we're building, we'll use <code>col-xs-*</code>, where <code>xs</code> means extra small (like an extra-small mobile phone screen), and <code>*</code> is the number of columns specifying how many columns wide the element should be.",
+        "Nest your first image and your <code>h2</code> element within a single <code>&#60;div class=\"row\"&#62;</code> element. Nest your <code>h2</code> element within a <code>&#60;div class=\"col-xs-8\"&#62;</code> and your image in a <code>&#60;div class=\"col-xs-4\"&#62;</code> so that they are on the same line.",
+        "Notice how the image is now just the right size to fit along the text?"
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "",
+        "  <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\">Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\">Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\">Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.row:has(h2)\").length > 0 && $(\"div.row:has(img)\").length > 0, 'message: Your <code>h2</code> element and topmost <code>img</code> element should both be nested together within a <code>div</code> element with the class <code>row</code>.');",
+        "assert($(\"div.col-xs-4:has(img)\").length > 0 && $(\"div.col-xs-4:has(div)\").length === 0, 'message: Nest your topmost <code>img</code> element within a <code>div</code> with the class <code>col-xs-4</code>.');",
+        "assert($(\"div.col-xs-8:has(h2)\").length > 0 && $(\"div.col-xs-8:has(div)\").length === 0, 'message: Nest your <code>h2</code> element within a <code>div</code> with the class <code>col-xs-8</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure each of your <code>div</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea un encabezado personalizado",
+          "description": [
+            "Crearemos un encabezado simple para nuestra aplicación de fotos de gatos poniendo el título y la relajante imagen del gato en la misma línea.",
+            "Recuerda, Bootstrap usa un sistema de cuadrícula adaptativo, el cual facilita poner elementos en filas y especificar el ancho relativo de cada elemento. La mayoría de las clases de Bootstrap pueden aplicarse a un elemento <code>div</code>.",
+            "Aquí hay un diagrama del funcionamiento de la cuadrícula de 12 columnas Bootstrap:",
+            "<a href=\"//i.imgur.com/FaYuui8.png\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"//i.imgur.com/FaYuui8.png\" title=\"Pulsa para agrandar\" alt=\"una imagen que muestra el sistema de cuadrícula de Bootstrap\"></a>",
+            "En esta ilustración se está utilizando la clase <code>col-md-*</code>. Aquí, <code>md</code> significa mediano, y <code>*</code> es un número que especifica el número de columnas que debe tomar el ancho del elemento. En este caso, se especifica el ancho de columna de un elemento en una pantalla de tamaño mediano, como un computador portátil.",
+            "En la aplicación de fotos de gatos que estamos construyendo, usaremos <code>col-xs-*</code>, donde <code>xs</code> significa extra pequeño (como una pantalla extra-pequeña de un teléfono), y <code>*</code> especifica el número de columnas que debe tomar el ancho del elemento.",
+            "Anida tu primera imagen y tu elemento <code>h2</code> dentro de un solo elemento <code>&#60;div class=\"row\"&#62;</code>. Anida tu texto <code>h2</code> dentro de un <code>&#60;div class=\"col-xs-8\"&#62;</code> y tu imagen en un <code>&#60;div class=\"col-xs-4\"&#62;</code> de tal forma que estén en la misma línea.",
+            "¿Te diste cuenta de que la imagen es ahora justamente del tamaño apropiado para el texto?"
+          ]
+        },
+        "fr": {
+          "title": "Créer un entête personalisé",
+          "description": [
+            "Notice how the image is now just the right size to fit along the text?",
+            "Nous allons réaliser un entête tout simple pour notre appli Cat Photo App en plaçant le titre et l'image de chat relaxante dans la même rangée.",
+            "Rappelez-vous, Bootstrap utilise un système de grille adaptative, qui rend facile le placement des éléments en rangées et la définition de la largeur relative de chaque élément. La plupart des classes de Bootstrap peuvent être appliquées à un élément <code>div</code>.",
+            "Voici un diagramme du fonctionnement de la grille à 12 colonnes de Bootstrap:",
+            "<a href=\"https://i.imgur.com/FaYuui8.png\" data-lightbox=\"img-enlarge\"><img class=\"img-responsive\" src=\"https://i.imgur.com/FaYuui8.png\" title=\"Cliquer pour élargir\" alt=\"Une image illlustrant le système de grille de Bootstrap\"></a>",
+            "Notez que dans cet exemple, on utilise la classe <code>col-md-*</code>. Ici <code>md</code> signifie medium, et <code>*</code> est un nombre spécifiant le nombre de colonnes en largeur que l'élément devrait avoir.",
+            "Enveloppez votre première image et votre élément <code>h2</code> dans un seul élément <code>&#60;div class=\"row\"&#62;</code>. Mettez l'élément <code>h2</code> dans un <code>&#60;div class=\"col-xs-8\"&#62;</code> et votre image dans un <code>&#60;div class=\"col-xs-4\"&#62;</code> pour qu'ils soient sur la même ligne.",
+            "Voyez vous comme l'image est maintenant exactement ajustée à la bonne taille pour être à côté du texte?"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedd08845",
+      "title": "Add Font Awesome Icons to our Buttons",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css",
+          "raw": true
+        }
+      ],
+      "description": [
+        "Font Awesome is a convenient library of icons. These icons are vector graphics, stored in the <code>.svg</code> file format. These icons are treated just like fonts. You can specify their size using pixels, and they will assume the font size of their parent HTML elements.",
+        "You can include Font Awesome in any app by adding the following code to the top of your HTML:",
+        "<code>&#60;link rel=\"stylesheet\" href=\"//maxcdn.bootstrapcdn.com/font-awesome/4.5.0/css/font-awesome.min.css\"/&#62;</code>",
+        "In this case, we've already added it for you to this page behind the scenes.",
+        "The <code>i</code> element was originally used to make other elements italic, but is now commonly used for icons. You can add the Font Awesome classes to the <code>i</code> element to turn it into an icon, for example:",
+        "<code>&lt;i class=\"fa fa-info-circle\"&gt;&lt;/i&gt;</code>",
+        "Note that the <code>span</code> element is also acceptable for use with icons.",
+        "Use Font Awesome to add a <code>thumbs-up</code> icon to your like button by giving it an <code>i</code> element with the classes <code>fa</code> and <code>fa-thumbs-up</code>; make sure to keep the text \"Like\" next to the icon."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-8\">",
+        "      <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "    </div>",
+        "  </div>",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\">Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\">Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\">Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"i\").is(\".fa.fa-thumbs-up\") || $(\"span\").is(\".fa.fa-thumbs-up\"), 'message: Add an <code>i</code> element with the classes <code>fa</code> and <code>fa-thumbs-up</code>.');",
+        "assert(($(\"i.fa-thumbs-up\").parent().text().match(/Like/gi) && $(\".btn-primary > i\").is(\".fa.fa-thumbs-up\")) || ($(\"span.fa-thumbs-up\").parent().text().match(/Like/gi) && $(\".btn-primary > span\").is(\".fa.fa-thumbs-up\")), 'message: Your <code>fa-thumbs-up</code> icon should be located within the Like button.');",
+        "assert($(\"button\").children(\"i\").length > 0 || $(\"button\").children(\"span\").length > 0, 'message: Nest your <code>i</code> element within your <code>button</code> element.');",
+        "assert(code.match(/<\\/i>|<\\/span>/g), 'message: Make sure your icon element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Agrega iconos de Font Awesome a los botones",
+          "description": [
+            "Font Awesome es una librería de iconos muy conveniente. Estos iconos son imágenes vectoriales, almacenadas en formato <code>.svg</code>, y son tratados como si fueran fuentes. Puedes especificar su tamaño usando pixeles, y tomarán el tamaño de fuente de su elemento HTML padre.",
+            "Puedes añadir Font Awesome a cualquier aplicación sólo incluyendo y agregando el siguiente código al comienzo de tu HTML:",
+            "<code>&#60;link rel=\"stylesheet\" href=\"//maxcdn.bootstrapcdn.com/font-awesome/4.5.0/css/font-awesome.min.css\"/&#62;</code>",
+            "En este caso, ya lo hemos agregado por tí a esta página tras bambalinas.",
+            "El elemento <code>i</code> originalmente era usado para hacer textos en itálicas, pero ahora comunmente se usa para iconos.  Le agregas clases de Font Awesome al elemento <code>i</code> para convertirlo en un ícono, por ejemplo:",
+            "<code>&lt;i class=\"fa fa-info-circle\"&gt;&lt;/i&gt;</code>",
+            "Usa Font Awesome para agregar un icono de \"pulgar arriba\" <code>thumbs-up</code> a tu botón de like dándole un elemento <code>i</code> con las clases <code>fa</code> y <code>fa-thumbs-up</code>."
+          ]
+        },
+        "fr": {
+          "title": "Ajouter des icônes Font Awesome à nos boutons",
+          "description": [
+            "Font Awesome est une librairie d'icônes très pratique. Ces icones sont des images vectorielles, stockées en format <code>.svg</code>. Ces icônes sont traités exactemeent comme des polices. Vous pouvez choisir leur taille en pixel, et ils prendront la taille de police de leur élémment parent HTML.",
+            "Vous poyvez ajouter Font Awesome à n'importe quell application en ajoutant le code suivant en haut de votre HTML:",
+            "<code>&#60;link rel=\"stylesheet\" href=\"//maxcdn.bootstrapcdn.com/font-awesome/4.5.0/css/font-awesome.min.css\"/&#62;</code>",
+            "Ici, nous l'avons déjà ajouté pour vous dans le back-office.",
+            "La balise <code>i</code> eétait utilisé à la base pour mettre les autres éléments en italique, mais maintenant elle est utilisée pour les icones. Vous ajoutez des classes Font Awesome à un élément <code>i</code> pour les les transformer en icones, par exemple:",
+            "<code>&lt;i class=\"fa fa-info-circle\"&gt;&lt;/i&gt;</code>",
+            "Utilisez Font Awesome pour ajouter un icone <code>thumbs-up</code> à votre bouton de like en lui donnant un élément <code>i</code> ayant les classes <code>fa</code> et <code>fa-thumbs-up</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedc08845",
+      "title": "Add Font Awesome Icons to all of our Buttons",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css",
+          "raw": true
+        }
+      ],
+      "description": [
+        "Font Awesome is a convenient library of icons. These icons are vector graphics, stored in the <code>.svg</code> file format. These icons are treated just like fonts. You can specify their size using pixels, and they will assume the font size of their parent HTML elements.",
+        "Use Font Awesome to add an <code>info-circle</code> icon to your info button and a <code>trash</code> icon to your delete button.",
+        "Note: The <code>span</code> element is an acceptable alternative to the <code>i</code> element for the directions below."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-8\">",
+        "      <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "    </div>",
+        "  </div>",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\"><i class=\"fa fa-thumbs-up\"></i> Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\">Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\">Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".btn-info > i\").is(\".fa.fa-info-circle\") || $(\".btn-info > span\").is(\".fa.fa-info-circle\"), 'message: You should add a <code>&#60;i class=\"fa fa-info-circle\"&#62;&#60;/i&#62;</code> within your info button element.');",
+        "assert($(\".btn-danger > i\").is(\".fa.fa-trash\") || $(\".btn-danger > span\").is(\".fa.fa-trash\"), 'message: You should add a <code>&#60;i class=\"fa fa-trash\"&#62;&#60;/i&#62;</code> within your delete button element.');",
+        "assert(code.match(/<\\/i>|<\\/span/g) && code.match(/<\\/i|<\\/span>/g).length > 2 && ($(\".btn-primary > i\").is(\".fa.fa-thumbs-up\") || $(\".btn-primary > span\").is(\".fa.fa-thumbs-up\")), 'message: Make sure each of your <code>i</code> elements has a closing tag and <code>&#60;i class=\"fa fa-thumbs-up\"&#62;&#60;/i&#62;</code> is in your like button element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Agrega Font Awesome a todos los botones",
+          "description": [
+            "Font Awesome es una librería de iconos muy conveniente. Estos iconos son imágenes vectoriales, almacenadas en formato <code>.svg</code>, y son tratados como si fueran fuentes. Puedes especificar su tamaño usando pixeles, y tomarán el tamaño de fuente de su elemento HTML padre.",
+            "Utiliza Font Awesome para agregar un icono <code>info-circle</code> a tu botón informativo y un icono <code>trash</code> a tu botón de eliminar."
+          ]
+        },
+        "fr": {
+          "title": "Ajoutez des icones Font Awesome à tous nos boutons",
+          "description": [
+            "Font Awesome est une librairie d'icônes très pratique. Ces icones sont des images vectorielles, stockées en format <code>.svg</code>. Ces icônes sont traités exactemeent comme des polices. Vous pouvez choisir leur taille en pixel, et ils prendront la taille de police de leur élémment parent HTML.",
+            "Utilisez Font Awesome pour ajouter un icone <code>info-circle</code> à votre bouton d'info et un icone <code>trash</code> à votre bouton de suppression."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedb08845",
+      "title": "Responsively Style Radio Buttons",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css",
+          "raw": true
+        }
+      ],
+      "description": [
+        "You can use Bootstrap's <code>col-xs-*</code> classes on <code>form</code> elements, too! This way, our radio buttons will be evenly spread out across the page, regardless of how wide the screen resolution is.",
+        "Nest both your radio buttons within a <code>&#60;div class=\"row\"&#62;</code> element. Then nest each of them within a <code>&#60;div class=\"col-xs-6\"&#62;</code> element.",
+        "<strong>Note:</strong> As a reminder, radio buttons are <code>input</code> elements of type <code>radio</code>."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-8\">",
+        "      <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "    </div>",
+        "  </div>",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\"><i class=\"fa fa-thumbs-up\"></i> Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\"><i class=\"fa fa-info-circle\"></i> Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\"><i class=\"fa fa-trash\"></i> Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "    <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.row:has(input[type=\\\"radio\\\"])\").length > 0, 'message: Nest all of your radio buttons inside one <code>div</code> with the class <code>row</code>.');",
+        "assert($(\"div.col-xs-6:has(input[type=\\\"radio\\\"])\").length > 1, 'message: Nest each of your radio buttons inside its own <code>div</code> with the class <code>col-xs-6</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure each of your <code>div</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea botones de opción con estilo adaptativo",
+          "description": [
+            "¡Puedes utilizar las clases <code>col-xs-*</code> de Bootstrap en elementos <code>form</code> también! De esta forma, nuestros botones de opción estarán igualmente distribuidos en la página, sin importar qué tan ancha es la resolución de la pantalla.",
+            "Anida todos los botones de opción dentro de un elemento <code>&#60;div class=\"row\"&#62;</code>. Luego, anida cada uno de ellos dentro de un elemento <code>&#60;div class=\"col-xs-6\"&#62;</code>."
+          ]
+        },
+        "fr": {
+          "title": "Donnez un style responsive à vos boutons radio",
+          "description": [
+            "Vous pouvez utiliser la classe Bootstrap <code>col-xs-*</code> sur des éléments <code>form</code>. Comme ça, nos boutons radio serons disposés régulierement dans la page, quelle que soit la largeur de l'écran.",
+            "Nichez tous vous boutons radio dans un élément <code>&#60;div class=\"row\"&#62;</code>. Ensuite, nichezchacun d'entre eux dans un élément <code>&#60;div class=\"col-xs-6\"&#62;</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aeda08845",
+      "title": "Responsively Style Checkboxes",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css",
+          "raw": true
+        }
+      ],
+      "description": [
+        "You can use Bootstrap's <code>col-xs-*</code> classes on <code>form</code> elements, too! This way, our checkboxes will be evenly spread out across the page, regardless of how wide the screen resolution is.",
+        "Nest all three of your checkboxes in a <code>&#60;div class=\"row\"&#62;</code> element. Then nest each of them in a <code>&#60;div class=\"col-xs-4\"&#62;</code> element."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-8\">",
+        "      <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "    </div>",
+        "  </div>",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\"><i class=\"fa fa-thumbs-up\"></i> Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\"><i class=\"fa fa-info-circle\"></i> Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\"><i class=\"fa fa-trash\"></i> Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <div class=\"row\">",
+        "      <div class=\"col-xs-6\">",
+        "        <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "      </div>",
+        "      <div class=\"col-xs-6\">",
+        "        <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "      </div>",
+        "    </div>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "    <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.row:has(input[type=\\\"checkbox\\\"])\").length > 0, 'message: Nest all of your checkboxes inside one <code>div</code> with the class <code>row</code>.');",
+        "assert($(\"div.col-xs-4:has(input[type=\\\"checkbox\\\"])\").length > 2, 'message: Nest each of your checkboxes inside its own <code>div</code> with the class <code>col-xs-4</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure each of your <code>div</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea casillas de selección con estilo adaptativo",
+          "description": [
+            "¡Puedes utilizar las clases <code>col-xs-*</code> de Bootstrap en elementos <code>form</code> también! De esta forma, nuestros botones de opción estarán igualmente distribuidos en la página, sin importar qué tan ancha es la resolución de la pantalla.",
+            "Anida todas las casillas de selección en un elemento <code>&#60;div class=\"row\"&#62;</code>. Luego, anida cada una de ellas en un elemento <code>&#60;div class=\"col-xs-4\"&#62;</code>."
+          ]
+        },
+        "fr": {
+          "title": "Donnez un style responsive à vos checkbox (cases de séléction)",
+          "description": [
+            "Vous pouvez aussi utiliser la classe Bootstrap <code>col-xs-*</code> sur des éléments <code>form</code>! Comme ça, nos boutons radio serons disposés régulierement dans la page, quelle que soit la largeur de l'écran.",
+            "You can use Bootstrap's <code>col-xs-*</code> classes on <code>form</code> elements, too! This way, our checkboxes will be evenly spread out across the page, regardless of how wide the screen resolution is.",
+            "Nichez toustes vos checkbox dans un élément <code>&#60;div class=\"row\"&#62;</code>. Ensuite nichez chacun d'entre eux dans un élément <code>&#60;div class=\"col-xs-4\"&#62;</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed908845",
+      "title": "Style Text Inputs as Form Controls",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css",
+          "raw": true
+        }
+      ],
+      "description": [
+        "You can add the <code>fa-paper-plane</code> Font Awesome icon by adding <code>&#60;i class=\"fa fa-paper-plane\"&#62;&#60;/i&#62;</code> within your submit <code>button</code> element.",
+        "Give your form's text input field a class of <code>form-control</code>. Give your form's submit button the classes <code>btn btn-primary</code>. Also give this button the Font Awesome icon of <code>fa-paper-plane</code>.",
+        "All textual <code>&lt;input&gt;</code>, <code>&lt;textarea&gt;</code>, and <code>&lt;select&gt;</code> elements with the class <code>.form-control</code> have a width of 100%."
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-8\">",
+        "      <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "    </div>",
+        "  </div>",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\"><i class=\"fa fa-thumbs-up\"></i> Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\"><i class=\"fa fa-info-circle\"></i> Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\"><i class=\"fa fa-trash\"></i> Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <div class=\"row\">",
+        "      <div class=\"col-xs-6\">",
+        "        <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "      </div>",
+        "      <div class=\"col-xs-6\">",
+        "        <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"row\">",
+        "      <div class=\"col-xs-4\">",
+        "        <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "      </div>",
+        "      <div class=\"col-xs-4\">",
+        "        <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "      </div>",
+        "      <div class=\"col-xs-4\">",
+        "        <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "      </div>",
+        "    </div>",
+        "    <input type=\"text\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\">Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"button[type=\\\"submit\\\"]\").hasClass(\"btn btn-primary\"), 'message: Give the submit button in your form the classes <code>btn btn-primary</code>.');",
+        "assert($(\"button[type=\\\"submit\\\"]:has(i.fa.fa-paper-plane)\").length > 0, 'message: Add a <code>&#60;i class=\"fa fa-paper-plane\"&#62;&#60;/i&#62;</code> within your submit <code>button</code> element.');",
+        "assert($(\"input[type=\\\"text\\\"]\").hasClass(\"form-control\"), 'message: Give the text <code>input</code> in your form the class <code>form-control</code>.');",
+        "assert(code.match(/<\\/i>/g) && code.match(/<\\/i/g).length > 3, 'message: Make sure each of your <code>i</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Estiliza cajas de texto como controles de formulario",
+          "description": [
+            "Puedes agregar el icono <code>fa-paper-plane</code> de Font Awesome incluyendo <code>&#60;i class=\"fa fa-paper-plane\"&#62;&#60;/i&#62;</code> dentro de tu elemento <code>button</code> de envío.",
+            "Dale a la entrada de texto de tu formulario la clase <code>form-control</code>. Dale al botón de envío de tu formulario las clases <code>btn btn-primary</code>. También, incluye en ese botón el icono <code>fa-paper-plane</code> de Font Awesome."
+          ]
+        },
+        "fr": {
+          "title": "Donnez un style similaire au contrôles de formulaires à des zones de texte",
+          "description": [
+            "Vous pouvez ajouter l'icone Font Awesome <code>fa-paper-plane</code> en ajoutant <code>&#60;i class=\"fa fa-paper-plane\"&#62;&#60;/i&#62;</code> à l'intérieur de votre <code>button</code> de soumission du formulaire.",
+            "Donnez aux entrées texte de votre formulaire une classe <code>form-control</code>. Donnez à votre bouton de soumission de formulaire les classes <code>btn btn-primary</code>. Donnez lui aussi un icone Font Awesome <code>fa-paper-plane</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908845",
+      "title": "Line up Form Elements Responsively with Bootstrap",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/font-awesome/4.2.0/css/font-awesome.css",
+          "raw": true
+        }
+      ],
+      "description": [
+        "Now let's get your form <code>input</code> and your submission <code>button</code> on the same line. We'll do this the same way we have previously: by using a <code>div</code> element with the class <code>row</code>, and other <code>div</code> elements within it using the <code>col-xs-*</code> class.",
+        "Nest both your form's text <code>input</code> and submit <code>button</code> within a <code>div</code> with the class <code>row</code>. Nest your form's text <code>input</code> within a div with the class of <code>col-xs-7</code>. Nest your form's submit <code>button</code> in a <code>div</code> with the class <code>col-xs-5</code>.",
+        "This is the last challenge we'll do for our Cat Photo App for now. We hope you've enjoyed learning Font Awesome, Bootstrap, and responsive design!"
+      ],
+      "challengeSeed": [
+        "<link href=\"https://fonts.googleapis.com/css?family=Lobster\" rel=\"stylesheet\" type=\"text/css\">",
+        "<style>",
+        "  h2 {",
+        "    font-family: Lobster, Monospace;",
+        "  }",
+        "",
+        "  .thick-green-border {",
+        "    border-color: green;",
+        "    border-width: 10px;",
+        "    border-style: solid;",
+        "    border-radius: 50%;",
+        "  }",
+        "",
+        "</style>",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-8\">",
+        "      <h2 class=\"text-primary text-center\">CatPhotoApp</h2>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <a href=\"#\"><img class=\"img-responsive thick-green-border\" src=\"https://bit.ly/fcc-relaxing-cat\" alt=\"A cute orange cat lying on its back.\"></a>",
+        "    </div>",
+        "  </div>",
+        "  <img src=\"https://bit.ly/fcc-running-cats\" class=\"img-responsive\" alt=\"Three kittens running towards the camera.\">",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-primary\"><i class=\"fa fa-thumbs-up\"></i> Like</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-info\"><i class=\"fa fa-info-circle\"></i> Info</button>",
+        "    </div>",
+        "    <div class=\"col-xs-4\">",
+        "      <button class=\"btn btn-block btn-danger\"><i class=\"fa fa-trash\"></i> Delete</button>",
+        "    </div>",
+        "  </div>",
+        "  <p>Things cats <span class=\"text-danger\">love:</span></p>",
+        "  <ul>",
+        "    <li>cat nip</li>",
+        "    <li>laser pointers</li>",
+        "    <li>lasagna</li>",
+        "  </ul>",
+        "  <p>Top 3 things cats hate:</p>",
+        "  <ol>",
+        "    <li>flea treatment</li>",
+        "    <li>thunder</li>",
+        "    <li>other cats</li>",
+        "  </ol>",
+        "  <form action=\"/submit-cat-photo\">",
+        "    <div class=\"row\">",
+        "      <div class=\"col-xs-6\">",
+        "        <label><input type=\"radio\" name=\"indoor-outdoor\"> Indoor</label>",
+        "      </div>",
+        "      <div class=\"col-xs-6\">",
+        "        <label><input type=\"radio\" name=\"indoor-outdoor\"> Outdoor</label>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"row\">",
+        "      <div class=\"col-xs-4\">",
+        "        <label><input type=\"checkbox\" name=\"personality\"> Loving</label>",
+        "      </div>",
+        "      <div class=\"col-xs-4\">",
+        "        <label><input type=\"checkbox\" name=\"personality\"> Lazy</label>",
+        "      </div>",
+        "      <div class=\"col-xs-4\">",
+        "        <label><input type=\"checkbox\" name=\"personality\"> Crazy</label>",
+        "      </div>",
+        "    </div>",
+        "    <input type=\"text\" class=\"form-control\" placeholder=\"cat photo URL\" required>",
+        "    <button type=\"submit\" class=\"btn btn-primary\"><i class=\"fa fa-paper-plane\"></i> Submit</button>",
+        "  </form>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.row:has(input[type=\\\"text\\\"])\").length > 0 &&  $(\"div.row:has(button[type=\\\"submit\\\"])\").length > 0, 'message: Nest your form submission button and text input in a div with class <code>row</code>.');",
+        "assert($(\"div.col-xs-7:has(input[type=\\\"text\\\"])\").length > 0, 'message: Nest your form text input in a div with the class <code>col-xs-7</code>.');",
+        "assert($(\"div.col-xs-5:has(button[type=\\\"submit\\\"])\").length > 0, 'message: Nest your form submission button in a div with the class <code>col-xs-5</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure each of your <code>div</code> elements has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Alínea elementos de formulario de forma adaptativa con Bootstrap",
+          "description": [
+            "Ahora vamos a poner el elemento <code>input</code> y el elemento <code>button</code> que dice submit de tu formulario en la misma línea. Lo haremos de la misma forma que lo hicimos anteriormente: usando un elemento <code>div</code> con la clase <code>row</code>, y otros elementos <code>div</code> dentro de ese, usando la clase <code>col-xs-*</code>.",
+            "Anida ambos, el elemento <code>input</code> y el elemento <code>button</code> que dice submit de tu formulario dentro de un <code>div</code> con la clase <code>row</code>. Anida el elemento <code>input</code> de tu formulario dentro de un div con cla clase <code>col-xs-7</code>. Anida el elemento <code>button</code> que dice submit de tu formulario en un elemento <code>div</code> con la clase <code>col-xs-5</code>.",
+            "¡Este es el último desafío que haremos con nuestra aplicación de fotos de gato por ahora. Esperamos que hayas disfrutado aprender acerca de Font Awesome, Bootstrap y diseño adaptativo!"
+          ]
+        },
+        "fr": {
+          "title": "Aligner les éléments de formulaire de façon responsive avec Bootstrap",
+          "description": [
+            "Maintenant mettons sur la même ligne l'élément <code>input</code> et le <code>button</code> de soumission du formulaire. Nous procéderons de la même façon que précedemment: en utilisant un élément <code>div</code> avec la classe <code>row</code>, et un un autre div à l'intérieur qui aura la classe <code>col-xs-*</code>.",
+            "Nichez à la fois l'<code>input</code> texte de votre formulaire et le <code>button</code> de soumission de formulaire à l'intérieur d'un <code>div</code> avec la classe <code>row</code>. Nichez l'<code>input</code> texte du formulaire dans un div ayant la classe <code>col-xs-7</code>. Nichez votre <code>button</code> de soumission de formulaire dans un div ayant la classe <code>col-xs-5</code>.",
+            "C'est le dernier challenge qui concerne notre application de photos de chats. Nous espérons que vous avez aimé apprendre Font Awesome, Bootstrap et du design adaptatif!"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908846",
+      "title": "Create a Bootstrap Headline",
+      "description": [
+        "Now let's build something from scratch to practice our HTML, CSS and Bootstrap skills.",
+        "We'll build a jQuery playground, which we'll soon put to use in our jQuery challenges.",
+        "To start with, create an <code>h3</code> element, with the text <code>jQuery Playground</code>.",
+        "Color your <code>h3</code> element with the <code>text-primary</code> Bootstrap class, and center it with the <code>text-center</code> Bootstrap class."
+      ],
+      "challengeSeed": [
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert($(\"h3\") && $(\"h3\").length > 0, 'message: Add a <code>h3</code> element to your page.');",
+        "assert(code.match(/<\\/h3>/g) && code.match(/<h3/g) && code.match(/<\\/h3>/g).length === code.match(/<h3/g).length, 'message: Make sure your <code>h3</code> element has a closing tag.');",
+        "assert($(\"h3\").hasClass(\"text-primary\"), 'message: Your <code>h3</code> element should be colored by applying the class <code>text-primary</code>');",
+        "assert($(\"h3\").hasClass(\"text-center\"), 'message: Your <code>h3</code> element should be centered by applying the class <code>text-center</code>');",
+        "assert.isTrue((/jquery(\\s)+playground/gi).test($(\"h3\").text()), 'message: Your <code>h3</code> element should have the text <code>jQuery Playground</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea un encabezado con Bootstrap",
+          "description": [
+            "Ahora vamos a comenzar un proyecto desde cero para practicar nuestras habilidades con HTML, CSS y Bootstrap.",
+            "Crearemos un área de juego con jQuery, el cual utilizaremos en nuestros desafíos con jQuery.",
+            "Para empezar, crea un elemento <code>h3</code>, con el texto <code>jQuery Playground</code>.",
+            "Ponle color a tu elemento <code>h3</code> con la clase <code>text-primary</code> de Bootstrap, y céntrala con la clase <code>text-center</code> de Bootstrap."
+          ]
+        },
+        "fr": {
+          "title": "Créer un entête Bootstrap",
+          "description": [
+            "Maintenons, créons queqlque chose à partir de zéro pour pratiquer nos connaissances acquises sur HTML, CSS et Bootstrap.",
+            "Nous allons construire un terrain de jeu pour jQuery, que nous allons bientôt utiliser dans les challenges jQuery.",
+            "Pour commencer, créez un élément <code>h3</code>, contenant le texte <code>jQuery Playground</code>.",
+            "Colorez notre élément <code>h3</code> avec la classe Bootstrap <code>text-primary</code>, et centrez le en utilisant la classe Bootstrap <code>text-center</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908746",
+      "title": "House our page within a Bootstrap container-fluid div",
+      "description": [
+        "Now let's make sure all the content on your page is mobile-responsive.",
+        "Let's nest your <code>h3</code> element within a <code>div</code> element with the class <code>container-fluid</code>."
+      ],
+      "challengeSeed": [
+        "<h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert($(\"div\").hasClass(\"container-fluid\"), 'message: Your <code>div</code> element should have the class <code>container-fluid</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure each of your <code>div</code> elements has a closing tag.');",
+        "assert($(\"div\").children(\"h3\").length >0, 'message: Nest your <code>h3</code> element inside a <code>div</code> element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Aloja la página dentro de un elemento Div contenedor fluido de Bootstrap",
+          "description": [
+            "Ahora asegurémonos de que todo el contenido en nuestra página pueda adaptarse a dispositivos móviles.",
+            "Anida tu elemento <code>h3</code> dentro de un elemento <code>div</code> con la clase <code>container-fluid</code>."
+          ]
+        },
+        "fr": {
+          "title": "Loger notre page dans un conteneur Bootstrap Fluid Div",
+          "description": [
+            "Maintenant, assurons nous que tout le contenu de la page est mobile-responsive (adaptatif au téléphones mobiles).",
+            "Nichons notre element <code>h3</code> à l'intérieur d'un élément <code>div</code> ayant la classe <code>container-fluid</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9bec908846",
+      "title": "Create a Bootstrap Row",
+      "description": [
+        "Now we'll create a Bootstrap row for our inline elements.",
+        "Create a <code>div</code> element below the <code>h3</code> tag, with a class of <code>row</code>."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "",
+        "</div>",
+        ""
+      ],
+      "tests": [
+        "assert(($(\"div\").length > 1) && ($(\"div.row h3.text-primary\").length == 0) && ($(\"div.row + h3.text-primary\").length == 0) && ($(\"h3.text-primary + div.row\").length > 0), 'message: Add a <code>div</code> element below your <code>h3</code> element.');",
+        "assert($(\"div\").hasClass(\"row\"), 'message: Your <code>div</code> element should have the class <code>row</code>');",
+        "assert($(\"div.container-fluid div.row\").length > 0, 'message: Your <code>row div</code> should be nested inside the <code>container-fluid div</code>');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure your <code>div</code> element has a closing tag.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea una fila en Bootstrap",
+          "description": [
+            "Ahora crearemos una fila de Bootstrap con nuestros elementos en línea.",
+            "Crea un elemento <code>div</code> debajo de la etiqueta <code>h3</code>, con la clase <code>row</code>."
+          ]
+        },
+        "fr": {
+          "title": "Créer une rangée (row) Bootstrap",
+          "description": [
+            "Maintenant nous allons créer une rangée (row) Bootstrap pour nos éléments inline.",
+            "Créez un élément <code>div</code> en dessous de la balise <code>h3</code>, avec une classe <code>row</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908847",
+      "title": "Split Your Bootstrap Row",
+      "description": [
+        "Now that we have a Bootstrap Row, let's split it into two columns to house our elements.",
+        "Create two <code>div</code> elements within your row, both with the class <code>col-xs-6</code>."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "",
+        "",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.row > div.col-xs-6\").length > 1, 'message: Nest two <code>div class=\"col-xs-6\"</code> elements within your <code>div class=\"row\"</code> element.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure all your <code>div</code> elements have closing tags.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Parte tu fila en Bootstrap",
+          "description": [
+            "Ahora que tenemos una fila en Bootstrap, vamos a partirla en dos columnas para alojar nuestros elementos.",
+            "Crea dos elementos <code>div</code> dentro de tu fila, ambos con la clase <code>col-xs-6</code>."
+          ]
+        },
+        "fr": {
+          "title": "Séparer une rangée Bootstrap",
+          "description": [
+            "Maintenant que nous avons une rangée Bootstrap, séparons la en deux colonnes pour placer nos éléments.",
+            "Créez deux éléments <code>div</code>dans votre rangée, chacun ayant la classe <code>col-xs-6</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908848",
+      "title": "Create Bootstrap Wells",
+      "description": [
+        "Bootstrap has a class called <code>well</code> that can create a visual sense of depth for your columns.",
+        "Nest one <code>div</code> element with the class <code>well</code> within each of your <code>col-xs-6</code> <code>div</code> elements."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.col-xs-6\").not(\":has(>div.well)\").length < 1, 'message: Add a <code>div</code> element with the class <code>well</code> inside each of your <code>div</code> elements with the class <code>\"col-xs-6\"</code>');",
+        "assert($(\"div.row > div.col-xs-6\").length > 1, 'message: Nest both of your <code>div</code> elements with the class <code>\"col-xs-6\"</code> within your <code>div</code> element with the class <code>\"row\"</code>.');",
+        "assert(code.match(/<\\/div>/g) && code.match(/<div/g) && code.match(/<\\/div>/g).length === code.match(/<div/g).length, 'message: Make sure all your <code>div</code> elements have closing tags.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea pozos en Bootstrap",
+          "description": [
+            "Bootstrap tiene una clase llamada <code>well</code> que crea una sensación visual de profundidad para tus columnas.",
+            "Anida un elemento <code>div</code> con la clase <code>well</code> dentro de cada uno de tus elementos <code>div</code> que tienen la clase <code>col-xs-6</code>."
+          ]
+        },
+        "fr": {
+          "title": "Créez un \"puit\" (well) Bootstrap",
+          "description": [
+            "Bootstrap possède une classe appelée <code>well</code> qui peux créer une certaine profondeur pour vos colonnes.",
+            "Nichez un élément <code>div</code> avec la classe <code>well</code> dans chacun de vos éléments <code>col-xs-6</code> <code>div</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908849",
+      "title": "Add Elements within Your Bootstrap Wells",
+      "description": [
+        "Now we're several <code>div</code> elements deep on each column of our row. This is as deep as we'll need to go. Now we can add our <code>button</code> elements.",
+        "Nest three <code>button</code> elements within each of your <code>well</code> <code>div</code> elements."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "",
+        "",
+        "",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "",
+        "",
+        "",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"div.well:eq(0)\").children(\"button\").length === 3 && $(\"div.well:eq(1)\").children(\"button\").length === 3, 'message: Nest three <code>button</code> elements within each of your <code>div</code> elements with class <code>well</code>.');",
+        "assert($(\"button\") && $(\"button\").length > 5, 'message: You should have a total of 6 <code>button</code> elements.');",
+        "assert(code.match(/<\\/button>/g) && code.match(/<button/g) && code.match(/<\\/button>/g).length === code.match(/<button/g).length, 'message: Make sure all your <code>button</code> elements have closing tags.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Agrega elementos dentro de los pozos de Bootstrap",
+          "description": [
+            "Ahora estamos a una profundidad de varios elementos <code>div</code> dentro de cada columna de nuestra fila. No iremos más profundo que esto. Ahora podemos agregar nuestros elementos <code>button</code>.",
+            "Anida tres elementos <code>button</code> dentro de cada uno de tus elementos <code>div</code> que tienen la clase <code>well</code>."
+          ]
+        },
+        "fr": {
+          "title": "Ajouter des éléments dans un puit Bootstrap",
+          "description": [
+            "Nous avons maintenant plusieurs niveaux de profondeur d'éléments <code>div</code> dans chaque colonne de notre rangée. Ceci est suffisant pour le moment. Maintenant nous pouvons ajouter nos éléments <code>button</code>.",
+            "Nichez trois éléments <code>button</code> dans chaque élément <code>well</code> <code>div</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908850",
+      "title": "Apply the Default Bootstrap Button Style",
+      "description": [
+        "Bootstrap has another button class called <code>btn-default</code>.",
+        "Apply both the <code>btn</code> and <code>btn-default</code> classes to each of your <code>button</code> elements."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "        <button></button>",
+        "        <button></button>",
+        "        <button></button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "        <button></button>",
+        "        <button></button>",
+        "        <button></button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".btn\").length > 5, 'message: Apply the <code>btn</code> class to each of your <code>button</code> elements.');",
+        "assert($(\".btn-default\").length > 5, 'message: Apply the <code>btn-default</code> class to each of your <code>button</code> elements.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Aplica el estilo de botón predeterminado de Bootstrap",
+          "description": [
+            "Bootstrap tiene otra clase de botón llamada <code>btn-default</code>.",
+            "Aplica las clases <code>btn</code> y <code>btn-default</code> a cada uno de tus elementos <code>button</code>."
+          ]
+        },
+        "fr": {
+          "title": "Appliquer le style de bouton par défaut de Bootstrap",
+          "description": [
+            "Bootstrap possède une autre classe de bouton appelée <code>btn-default</code>.",
+            "Appliquez les deux classes <code>btn</code> et <code>btn-default</code> à chacun de vos éléments <code>button</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908852",
+      "title": "Create a Class to Target with jQuery Selectors",
+      "description": [
+        "Not every class needs to have corresponding CSS. Sometimes we create classes just for the purpose of selecting these elements more easily using jQuery.",
+        "Give each of your <code>button</code> elements the class <code>target</code>."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "        <button class=\"btn btn-default\"></button>",
+        "        <button class=\"btn btn-default\"></button>",
+        "        <button class=\"btn btn-default\"></button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "        <button class=\"btn btn-default\"></button>",
+        "        <button class=\"btn btn-default\"></button>",
+        "        <button class=\"btn btn-default\"></button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".target\").length > 5, 'message: Apply the <code>target</code> class to each of your <code>button</code> elements.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Crea una clase para usar con selectores de jQuery",
+          "description": [
+            "No todas las clases necesitan tener un código CSS correspondiente. A veces creamos clases sólo con el propósito de seleccionar esos elementos más fácilmente usando jQuery.",
+            "Dale a cada uno de tus elementos <code>button</code> la clase <code>target</code>."
+          ]
+        },
+        "fr": {
+          "title": "Créez une classe à cibler avec les sélécteurs jQuery",
+          "description": [
+            "Toutes les classes ne nécéssitent pas d'avoir un code CSS qui leur correspondent. Parfois ous créons des classes dans le seul but de pouvoir sélectionner ces éléments plus facilement en utilisant jQuery.",
+            "Donnez à chacun de vos éléments <code>button</code> la classe <code>target</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908853",
+      "title": "Add id Attributes to Bootstrap Elements",
+      "description": [
+        "Recall that in addition to class attributes, you can give each of your elements an <code>id</code> attribute.",
+        "Each id must be unique to a specific element and used only once per page.",
+        "Let's give a unique id to each of our <code>div</code> elements of class <code>well</code>.",
+        "Remember that you can give an element an id like this:",
+        "<code>&#60;div class=\"well\" id=\"center-well\"&#62;</code>",
+        "Give the well on the left the id of <code>left-well</code>. Give the well on the right the id of <code>right-well</code>."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <div class=\"well\">",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".col-xs-6\").children(\"#left-well\") && $(\".col-xs-6\").children(\"#left-well\").length > 0, 'message: Give your left <code>well</code> the id of <code>left-well</code>.');",
+        "assert($(\".col-xs-6\").children(\"#right-well\") && $(\".col-xs-6\").children(\"#right-well\").length > 0, 'message: Give your right <code>well</code> the id of <code>right-well</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Asígnales atributos de identificación (id) a tus elementos de Bootstrap",
+          "description": [
+            "Recuerda que, además de los atributos de clase, también puedes darle a cada uno de tus elementos un atributo <code>id</code>.",
+            "Cada id debe ser único para un elemento específico y ser usado solamente una vez por página.",
+            "Vamos a darle un id único a cada uno de nuestros elementos <code>div</code> que tienen la clase <code>well</code>.",
+            "Recuerda que puedes darle a un elemento un id como el siguiente:",
+            "<code>&#60;div class=\"well\" id=\"center-well\"&#62;</code>",
+            "Dale al pozo de la izquireda el id <code>left-well</code>. Al pozo de la derecha, dale un id <code>right-well</code>."
+          ]
+        },
+        "fr": {
+          "title": "Ajouter des attributs ID à vos éléments Bootstrap",
+          "description": [
+            "Rappelez vous qu'en plus des attributs classes, vous pouvez donnez à chacun de vos éléments un attribut <code>id</code>.",
+            "Chaque id doit être unique pour un élément donné et utilisé une seule fois par page.",
+            "Donnons un id unique à chacun de nos éléments <code>div</code> de classe <code>well</code>.",
+            "Rappelez vous que vous pouvez donner un id à un élément ainsi :",
+            "<code>&#60;div class=\"well\" id=\"center-well\"&#62;</code>",
+            "Donnez au puit sur la gauche un id de <code>left-well</code>. Donnez au puit sur la droite un id de <code>right-well</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908854",
+      "title": "Label Bootstrap Wells",
+      "description": [
+        "For the sake of clarity, let's label both of our wells with their ids.",
+        "Above your left-well, inside its <code>col-xs-6</code> <code>div</code> element, add a <code>h4</code> element with the text <code>#left-well</code>.",
+        "Above your right-well, inside its <code>col-xs-6</code> <code>div</code> element, add a <code>h4</code> element with the text <code>#right-well</code>."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".col-xs-6\").children(\"h4\") && $(\".col-xs-6\").children(\"h4\").length > 1, 'message: Add an <code>h4</code> element to each of your <code>&#60;div class=\"col-xs-6\"&#62;</code> elements.');",
+        "assert(new RegExp(\"#left-well\",\"gi\").test($(\"h4\").text()), 'message: One <code>h4</code> element should have the text <code>#left-well</code>.');",
+        "assert(new RegExp(\"#right-well\",\"gi\").test($(\"h4\").text()), 'message: One <code>h4</code> element should have the text <code>#right-well</code>.');",
+        "assert(code.match(/<\\/h4>/g) && code.match(/<h4/g) && code.match(/<\\/h4>/g).length === code.match(/<h4/g).length, 'message: Make sure all your <code>h4</code> elements have closing tags.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Etiqueta tus pozos de Bootstrap",
+          "description": [
+            "Para que todo esté más claro, vamos a ponerle a todos nuestros pozos una etiqueta que sea igual a su id.",
+            "Sobre tu pozo de la izquierda, dentro de su elemento <code>div</code> que tiene la clase <code>col-xs-6</code>, agrega un elemento <code>h4</code> con el texto <code>#left-well</code>.",
+            "Ahora, sobre tu pozo de la derecha, dentro de su elemento <code>div</code> que tiene la clase <code>col-xs-6</code>, agrega un elemento <code>h4</code> con el texto <code>#right-well</code>."
+          ]
+        },
+        "fr": {
+          "title": "Donner un nom aux puits Bootstrap",
+          "description": [
+            "Au nom de la clarté, donnons un nom à nos deux puits en accord avec leur ids",
+            "Au dessus de votre puit de gauche, à l'intérieur de ses éléments <code>col-xs-6</code> <code>div</code>,  ajoutez un élément <code>h4</code> ayant le texte <code>#left-well</code>.",
+            "Au dessus de votre puit de droite, à l'intérieur de ses éléments <code>col-xs-6</code> <code>div</code>,  ajoutez un élément <code>h4</code> ayant le texte <code>#right-well</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908855",
+      "title": "Give Each Element a Unique id",
+      "description": [
+        "We will also want to be able to use jQuery to target each button by its unique id.",
+        "Give each of your buttons a unique id, starting with <code>target1</code> and ending with <code>target6</code>.",
+        "Make sure that <code>target1</code> to <code>target3</code> are in <code>#left-well</code>, and <code>target4</code> to <code>target6</code> are in <code>#right-well</code>."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "        <button class=\"btn btn-default target\"></button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#left-well\").children(\"#target1\") && $(\"#left-well\").children(\"#target1\").length > 0, 'message: One <code>button</code> element should have the id <code>target1</code>.');",
+        "assert($(\"#left-well\").children(\"#target2\") && $(\"#left-well\").children(\"#target2\").length > 0, 'message: One <code>button</code> element should have the id <code>target2</code>.');",
+        "assert($(\"#left-well\").children(\"#target3\") && $(\"#left-well\").children(\"#target3\").length > 0, 'message: One <code>button</code> element should have the id <code>target3</code>.');",
+        "assert($(\"#right-well\").children(\"#target4\") && $(\"#right-well\").children(\"#target4\").length > 0, 'message: One <code>button</code> element should have the id <code>target4</code>.');",
+        "assert($(\"#right-well\").children(\"#target5\") && $(\"#right-well\").children(\"#target5\").length > 0, 'message: One <code>button</code> element should have the id <code>target5</code>.');",
+        "assert($(\"#right-well\").children(\"#target6\") && $(\"#right-well\").children(\"#target6\").length > 0, 'message: One <code>button</code> element should have the id <code>target6</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Dale a cada elemento un ID único",
+          "description": [
+            "También quisiéramos referirnos a cada botón por su id utilizando jQuery.",
+            "Dale a cada uno de tus botones un id único, comenzando con <code>target1</code> y terminando con <code>target6</code>.",
+            "Asegúrate que <code>target1</code> a <code>target3</code> queden en <code>#left-well</code>, mientras que <code>target4</code> a <code>target6</code> queden en <code>#right-well</code>."
+          ]
+        },
+        "fr": {
+          "title": "Donner à chaque élément un ID unique",
+          "description": [
+            "Nous désirerons aussi pouvoir être capable d'utiliser jQuery pour cibler chaque bouton suivant son id unique.",
+            "Donnez à chaque bouton un id unique, commençant par <code>target1</code> et finissant par <code>target6</code>.",
+            "Assurez vous que <code>target1</code> à <code>target3</code> sont dans le <code>#left-well</code>,  et que <code>target4</code> à <code>target6</code> sont dans le <code>#right-well</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908856",
+      "title": "Label Bootstrap Buttons",
+      "description": [
+        "Just like we labeled our wells, we want to label our buttons.",
+        "Give each of your <code>button</code> elements text that corresponds to its <code>id</code>'s selector."
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\"></button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\"></button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\"></button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\"></button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\"></button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\"></button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(new RegExp(\"#target1\",\"gi\").test($(\"#target1\").text()), 'message: Give your <code>button</code> element with the id <code>target1</code> the text <code>#target1</code>.');",
+        "assert(new RegExp(\"#target2\",\"gi\").test($(\"#target2\").text()), 'message: Give your <code>button</code> element with the id <code>target2</code> the text <code>#target2</code>.');",
+        "assert(new RegExp(\"#target3\",\"gi\").test($(\"#target3\").text()), 'message: Give your <code>button</code> element with the id <code>target3</code> the text <code>#target3</code>.');",
+        "assert(new RegExp(\"#target4\",\"gi\").test($(\"#target4\").text()), 'message: Give your <code>button</code> element with the id <code>target4</code> the text <code>#target4</code>.');",
+        "assert(new RegExp(\"#target5\",\"gi\").test($(\"#target5\").text()), 'message: Give your <code>button</code> element with the id <code>target5</code> the text <code>#target5</code>.');",
+        "assert(new RegExp(\"#target6\",\"gi\").test($(\"#target6\").text()), 'message: Give your <code>button</code> element with the id <code>target6</code> the text <code>#target6</code>.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Etiqueta los botones con Bootstrap",
+          "description": [
+            "De la misma forma en que etiquetamos nuestros pozos, ahora vamos a etiquetar nuestros botones.",
+            "Dale a cada uno de tus elementos <code>button</code> un texto que corresponda con su <code>id</code>."
+          ]
+        },
+        "fr": {
+          "title": "Donnez un nom à vos boutons Bootstrap",
+          "description": [
+            "De la même façon que nous avons donné un nom à nos puits, nous voulons nommer nos boutons.",
+            "Donnez à chaque élément <code>button</code> un texte qui corresponde à son <code>id</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aec908857",
+      "title": "Use Comments to Clarify Code",
+      "description": [
+        "When we start using jQuery, we will modify HTML elements without needing to actually change them in HTML.",
+        "Let's make sure that everyone knows they shouldn't actually modify any of this code directly.",
+        "Remember that you can start a comment with <code>&#60;!--</code> and end a comment with <code>--&#62;</code>",
+        "Add a comment at the top of your HTML that says <code>Only change code above this line.</code>"
+      ],
+      "challengeSeed": [
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/^\\s*<!--/), 'message: Start a comment with <code>&#60;!--</code> at the top of your HTML.');",
+        "assert(code.match(/<!--(?!(>|->|.*-->.*this line))\\s*.*this line.*\\s*-->/gi), 'message: Your comment should have the text <code>Only change code above this line</code>.');",
+        "assert(code.match(/-->.*\\n+.+/g), 'message: Be sure to close your comment with <code>--&#62;</code>.');",
+        "assert(code.match(/<!--/g).length === code.match(/-->/g).length, 'message: You should have the same number of comment openers and closers.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "es": {
+          "title": "Usa elementos para explicar tu código",
+          "description": [
+            "Cuando comencemos a usar jQuery, modificarmemos los elementos HTML sin necesidad de hacer cambios reales en el código HTML.",
+            "Vamos a asegurar que cualquier persona sepa que no debe modificar nada en este código directamente.",
+            "Recuerda que puedes iniciar un comentario usando <code>&#60;!--</code> y terminarlo usando <code>--&#62;</code>",
+            "Agrega un comentario al inicio de tu código HTML que diga <code>Only change code above this line.</code>"
+          ]
+        },
+        "fr": {
+          "title": "Utiliser des commentaires pour clarifier son code",
+          "description": [
+            "Quand nous commencerons à utiliser jQuery, nous modifierons les éléments HTML sans avoir besoin de les changer directement dans le fichier HTML.",
+            "Assurons nous que tout le monde sache qu'ils ne devraient pas modifier quoi que ce soit dans le code HTML.",
+            "Rappelez vous que vous pouvez commencer un commentaire avec <code>&#60;!--</code> et le finir avec <code>--&#62;</code>",
+            "Ajoutez un commentaire en haut de l'HTML qui annonce <code>Only change code above this line.</code> (Changez seulement le code au dessus de cette ligne.)"
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/03-front-end-libraries/claim-your-front-end-libraries-certificate.json b/seed/math-challenges/03-front-end-libraries/claim-your-front-end-libraries-certificate.json
new file mode 100644
index 0000000000..72b49701cc
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/claim-your-front-end-libraries-certificate.json
@@ -0,0 +1,108 @@
+{
+  "name": "Claim Your Front End Libraries Certificate",
+  "order": 13,
+  "time": "5 minutes",
+  "challenges": [
+    {
+      "id": "587d7dbb367417b2b2512bad",
+      "title": "Claim Your Front End Libraries Certificate",
+      "description": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "An image of our Front End Libraries Certificate",
+          "This challenge will give you your verified Front End Libraries Certificate. Before we issue your certificate, we must verify that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. You must also accept our Academic Honesty Pledge. Click the button below to start this process.",
+          ""
+        ],
+        [
+          "//i.imgur.com/uLPsUko.jpg",
+          "The definition of plagiarism: Plagiarism (noun) - copying someone else’s work and presenting it as your own without crediting them",
+          "By clicking below, you pledge that all of your submitted code A) is code you or your pair personally wrote, or B) comes from open source libraries like jQuery, or C) has been clearly attributed to its original authors. You also give us permission to audit your challenge solutions and revoke your certificate if we discover evidence of plagiarism.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/UedoV2G.jpg",
+          "An image of the text \"Front End Development Certificate requirements\"",
+          "Let's confirm that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. Click the button below to verify this.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/Q5Za9U6.jpg",
+          "An image of the word \"Congratulations\"",
+          "Congratulations! We've added your Front End Libraries Certificate to your portfolio page. Unless you choose to hide your solutions, this certificate will remain publicly visible and verifiable.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        {
+          "properties": [
+            "isHonest",
+            "isFrontEndCert"
+          ],
+          "apis": [
+            "/certificate/honest",
+            "/certificate/verify/front-end"
+          ],
+          "stepIndex": [
+            1,
+            2
+          ]
+        }
+      ],
+      "tests": [
+        {
+          "id": "bd7158d8c442eddfaeb5bd0f",
+          "title": "Build a Pomodoro Clock"
+        },
+        {
+          "id": "bd7158d8c442eddfaeb5bd17",
+          "title": "Build a JavaScript Calculator"
+        },
+        {
+          "id": "587d7dbc367417b2b2512bae",
+          "title": "Build a Drum Machine"
+        },
+        {
+          "id": "bd7157d8c242eddfaeb5bd13",
+          "title": "Build a Markdown Previewer"
+        },
+        {
+          "id": "bd7158d8c442eddfaeb5bd13",
+          "title": "Build a Random Quote Machine"
+        }
+      ],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "es": {
+          "title": "Reclama tu certificado de Desarrollo de interfaces",
+          "description": [
+            [
+              "//i.imgur.com/k8btNUB.jpg",
+              "Una imagen que muestra nuestro certificado de Desarrollo de interfaces",
+              "Este desafío te otorga tu certificado autenticado de Desarrollo de interfaces. Antes de que podamos emitir tu certificado, debemos verificar que has completado todos los desafíos básicos e intermedios de diseño de algoritmos, y todos los proyectos básicos e intermedios de desarrollo de interfaces. También debes aceptar nuestro Juramento de honestidad académica. Pulsa el botón siguiente para iniciar este proceso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/HArFfMN.jpg",
+              "Plagio (nombre): acción y efecto de plagiar. Plagiar (verbo) - copiar en lo sustancial obras ajenas, dándolas como propias.",
+              "Al pulsar el botón siguiente, juras que todo el código en tus soluciones a los desafíos A) es código que tú o tu compañero escribieron personalmente, o B) proviene de librerías de código abierto como jQuery, o C) ha sido claramente atribuido a sus autores originales. También nos otorgas el permiso para auditar tus soluciones a los desafíos y revocar tu certificado si encontramos evidencia de plagio.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/14F2Van.jpg",
+              "Una imagen del texto \"Front End Development Certificate requirements\"",
+              "Confirmemos que has completado todos nuestros desafíos básicos e intermedios de diseño de algoritmos, y todos nuestros proyectos básicos e intermedios de desarrollo de interfaces. Pulsa el botón siguiente para hacer la verificación.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/16SIhHO.jpg",
+              "Una imagen de la palabra \"Congratulations\"",
+              "¡Felicitaciones! Hemos agregado tu certificado de Desarrollo de interfaces a tu portafolio. A menos que elijas no mostrar tus soluciones, este certificado será públicamente visible y verificable.",
+              ""
+            ]
+          ]
+        }
+      }
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/03-front-end-libraries/front-end-libraries-projects.json b/seed/math-challenges/03-front-end-libraries/front-end-libraries-projects.json
new file mode 100644
index 0000000000..ff9fada698
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/front-end-libraries-projects.json
@@ -0,0 +1,138 @@
+{
+  "name": "Front End Frameworks Projects",
+  "order": 8,
+  "time": "150 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "bd7158d8c442eddfaeb5bd13",
+      "title": "Build a Random Quote Machine",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/qRZeGZ' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "image": "A9mEKIF",
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Crea una máquina de frases aleatorias",
+          "description": []
+        },
+        "ru": {
+          "title": "Создайте генератор случайных цитат",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7157d8c242eddfaeb5bd13",
+      "title": "Build a Markdown Previewer",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/GrZVVO' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "releasedOn": "January 10, 2017",
+      "image": "FFDvuCP",
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Crea una caja de recetas",
+          "description": []
+        },
+        "ru": {
+          "title": "Создайте хранилище рецептов",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "587d7dbc367417b2b2512bae",
+      "title": "Build a Drum Machine",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/MJyNMd' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "releasedOn": "February 17, 2017",
+      "image": "OkeFgKL",
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Crea un Juego de la vida",
+          "description": []
+        },
+        "ru": {
+          "title": "Создайте игру \"Жизнь\"",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eddfaeb5bd17",
+      "title": "Build a JavaScript Calculator",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/wgGVVX' target='_blank'>working example</a>. Try not to look at its code.",
+        "<strong>Note On Calculator Logic:</strong> It should be noted that there are two main schools of thought on calculator input logic: <dfn>immediate execution logic</dfn> and <dfn>formula logic</dfn>. Our example utilizes formula logic and observes order of operation precedence, immediate execution does not. Either is acceptable, but please note that depending on which you choose, your calculator may yield different results than ours for certain equations (see below example). As long as your math can be verified by another production calculator, please do not consider this a bug.",
+        "<strong>EXAMPLE:</strong> <code>3 + 5 x 6 - 2 / 4 =</code><br><ul><li><strong>Immediate Execution Logic:</strong> <code>11.5</code></li><li><strong>Formula/Expression Logic:</strong> <code>32.5</code></li></ul>",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "image": "xlAXPjX",
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": true,
+      "translations": {
+        "es": {
+          "title": "Crea una calculadora JavaScript",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eddfaeb5bd0f",
+      "title": "Build a Pomodoro Clock",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='http://codepen.io/freeCodeCamp/full/XpKrrW' target='_blank'>working example</a>. Try not to look at its code.",
+        "You can build your project by forking <a href='http://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "image": "u5RTBt4",
+      "tests": [],
+      "type": "zipline",
+      "isRequired": true,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Crea un reloj pomodoro",
+          "description": []
+        },
+        "ru": {
+          "title": "Создайте таймер Pomodoro",
+          "description": []
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/03-front-end-libraries/jquery.json b/seed/math-challenges/03-front-end-libraries/jquery.json
new file mode 100644
index 0000000000..73be2fd4a7
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/jquery.json
@@ -0,0 +1,1527 @@
+{
+  "name": "jQuery",
+  "order": 3,
+  "time": "3 hours",
+  "helpRoom": "Help",
+  "required": [
+    {
+      "link": "https://cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/css/bootstrap.css"
+    }
+  ],
+  "challenges": [
+    {
+      "id": "bad87fee1348bd9acdd08826",
+      "title": "Learn How Script Tags and Document Ready Work",
+      "description": [
+        "Now we're ready to learn jQuery, the most popular JavaScript tool of all time.",
+        "Before we can start using jQuery, we need to add some things to our HTML.",
+        "First, add a <code>script</code> element at the top of your page. Be sure to close it on the following line.",
+        "Your browser will run any JavaScript inside a <code>script</code> element, including jQuery.",
+        "Inside your <code>script</code> element, add this code: <code>$(document).ready(function() {</code> to your <code>script</code>. Then close it on the following line (still inside your <code>script</code> element) with: <code>});</code>",
+        "We'll learn more about <code>functions</code> later. The important thing to know is that code you put inside this <code>function</code> will run as soon as your browser has loaded your page.",
+        "This is important because without your <code>document ready function</code>, your code may run before your HTML is rendered, which would cause bugs."
+      ],
+      "challengeSeed": [
+        "",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/<\\/script\\s*>/g) && code.match(/<script(\\sasync|\\sdefer)*(\\s(charset|src|type)\\s*=\\s*[\"\\']+[^\"\\']*[\"\\']+)*(\\sasync|\\sdefer)*\\s*>/g) && code.match(/<\\/script\\s*>/g).length === code.match(/<script(\\sasync|\\sdefer)*(\\s(charset|src|type)\\s*=\\s*[\"\\']+[^\"\\']*[\"\\']+)*(\\sasync|\\sdefer)*\\s*>/g).length, 'message: Create a <code>script</code> element making sure it is valid and has a closing tag.');",
+        "assert(code.match(/\\$\\s*?\\(\\s*?document\\s*?\\)\\.ready\\s*?\\(\\s*?function\\s*?\\(\\s*?\\)\\s*?\\{/g), 'message: You should add <code>$&#40;document&#41;.ready<wbr>&#40;function&#40;&#41; {</code> to the beginning of your <code>script</code> element.');",
+        "assert(code.match(/\\n*?\\s*?\\}\\s*?\\);/g), 'message: Close your <code>$&#40;document&#41;.ready<wbr>&#40;function&#40;&#41; {</code> function with <code>}&#41;;</code>');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Lerne, wie Script Tags und Document Ready funktionieren",
+          "description": [
+            "Jetzt sind wir bereit jQuery zu lernen, das populärste JavaScript-Tool aller Zeiten. Mach dir über JavaScript keine Sorgen - über dieses werden wir bald sprechen.",
+            "Bevor wir jQuery nutzen können, müssen wir erst ein paar Dinge zu unserem HTML hinzufügen.",
+            "Füge als erstes ein <code>script</code> Element am Beginn deiner Seite ein. Vergewissere dich, dass du das Element in der nächsten Zeile geschlossen hast.",
+            "Dein Browser wird jegliches JavaScript, jQuery eingeschlossen, innerhalb eines <code>script</code> Elements ausführen.",
+            "Füge innerhalb deines <code>script</code> Elements folgenden Code hinzu: <code>$(document).ready(function() {</code>. Schließe ihn danach in der nächsten Zeile (noch immer innerhalb deines <code>script</code> Elements) mit: <code>});</code>",
+            "Wir werden später noch mehr über <code>Funktionen</code> lernen. Wichtig zu wissen ist, dass der Code innerhalb der <code>Funktion</code> ausgeführt wird, sobald der Browser die Seite geladen hat.",
+            "Das ist wichtig, denn ohne deine <code>Document Ready Funktion</code> könnte dein Code ausgeführt werden, bevor das HTML gerendert wurde - was zu Fehlern führen kann."
+          ]
+        },
+        "es": {
+          "title": "Aprende cómo funcionan las etiquetas de programa y la función de documento listo.",
+          "description": [
+            "Ahora estamos listos para aprender jQuery, la herramienta de JavaScript más popular de todos los tiempos. No te preocupes por JavaScript en si --lo cubriremos pronto.",
+            "Antes de que podamos comenzar a usar jQuery, tenemos que añadir algunas cosas a nuestro HTML.",
+            "En primer lugar, añade un elemento de programa <code>script</code> en la parte superior de la página. Asegúrate de cerrarlo en la línea siguiente. ",
+            "Tu navegador ejecutará todo JavaScript dentro de un elemento <code>script</code>, incluyendo jQuery.",
+            "Dentro de tu elemento <code>script</code>, agrega este código: <code>$(document).ready(function () {</code> A continuación, ciérralo en la línea siguiente (aún dentro de tu elemento <code>script</code>) con: <code>})</code>",
+            "Más adelante aprenderemos más acerca de funciones. Lo importante es saber que el código que pongas dentro de esta función (<code>function</code>) se ejecutará tan pronto como tu navegador haya cargado la página.",
+            "Esto es importante porque sin tu <code>función de documento listo</code>, tu código puede ejecutarse antes de que se haya presentado el HTML, lo que podría causar errores."
+          ]
+        },
+        "fr": {
+          "title": "Apprendre comment fonctionnent les balises Script et Document Ready",
+          "description": [
+            "Nous sommes maintenant prêt à apprendre jQuery, l'outil Javascript le plus populaire de tout les temps. Ne vous inquiétez pas à propos de JavaScript lui-même, nous y viendrons bientôt.",
+            "Avant de pouvoir utiliser jQuery, nous avons besoin d'ajouter certaines choses à notre HTML.",
+            "Premièrement, ajoutez un élément <code>script</code> en haut de votre page. Assurez-vous de le fermer à la ligne suivante.",
+            "Votre navigateur exécutera JavaScript à l'intérieur de l'élement <code>script</code>, y compris jQuery.",
+            "Á l'intérieur de votre élement <code>script</code>, ajoutez ce code : <code>$(document).ready(function() {</code> à votre <code>script</code>. Puis fermez-le à la ligne suivante (toujours à l'intérieur de votre élement <code>script</code> avec: <code>});</code>",
+            "Nous en apprendrons plus sur les <code>functions</code> plus tard. Le plus important à savoir est que le code à l'intérieur de cette <code>function</code> sera exécuté dès que le navigateur aura chargé votre page.",
+            "Ceci est important car sans votre <code>document ready function</code>, votre code pourrait être exécuté avant que votre HTML soit affiché, ce qui pourrait causer des problèmes."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9bedc08826",
+      "title": "Target HTML Elements with Selectors Using jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "Now we have a <code>document ready function</code>.",
+        "Now let's write our first jQuery statement. All jQuery functions start with a <code>$</code>, usually referred to as a <code>dollar sign operator</code>, or as <code>bling</code>.",
+        "jQuery often selects an HTML element with a <code>selector</code>, then does something to that element.",
+        "For example, let's make all of your <code>button</code> elements bounce. Just add this code inside your document ready function:",
+        "<code>$(\"button\").addClass(\"animated bounce\");</code>",
+        "Note that we've already included both the jQuery library and the Animate.css library in the background so that you can use them in the editor. So you are using jQuery to apply the Animate.css <code>bounce</code> class to your <code>button</code> elements.",
+        "Additionally make sure to use <code>$(\"button\").addClass(\"animated bounce\");</code> instead of <code>$('button').addClass(\"animated bounce\");</code> since single-quote selectors will not pass our tests."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"button\").hasClass(\"animated\") && $(\"button\").hasClass(\"bounce\"), 'message: Use the jQuery <code>addClass&#40&#41</code> function to give the classes <code>animated</code> and <code>bounce</code> to your <code>button</code> elements.');",
+        "assert(!code.match(/class.*animated/g), 'message: Only use jQuery to add these colors to the element.');",
+        "assert(/'/g.test(code) === false , 'message: Only use double quotes in your jQuery code, as is stated in the jQuery style guide.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "HTML-Elemente mit Selektoren durch jQuery auswählen",
+          "description": [
+            "Jetzt haben wir eine <code>Document Ready Funktion</code>.",
+            "Lass uns unser erstes jQuery Statement schreiben. Alle jQuery Funktionen starten mit einem <code>$</code>, für gewöhnlich als <code>Dollar-Zeichen Operator</code> bezeichnet.",
+            "jQuery wählt oft HTML-Elemente mit einem <code>Selektor</code> aus, um dann mit diesen Elementen etwas zu machen.",
+            "Zum Beispiel, lasse alle deine <code>Button</code> Elemente hüpfen. Dazu musst du nur folgenden Code in deine <code>Document Ready Funktion</code> hinzufügen:",
+            "<code>$(\"button\").addClass(\"animated bounce\");</code>",
+            "Beachte, dass wir bereits jQuery und Animate.css im Hintergrund hinzugefügt haben, damit du diese im Editor nutzen kannst. Du nutzt also jQuery um die <code>bounce</code> Klasse von Animate.css zu deinen <code>Button</code> Elementen hinzuzufügen."
+          ]
+        },
+        "es": {
+          "title": "Elige elementos HTML usando selectores y jQuery",
+          "description": [
+            "Ya tenemos una <code>función de documento listo</code>.",
+            "Ahora vamos a escribir nuestra primera instrucción jQuery. Todas las funciones de jQuery comienzan con un <code>$</code>, al que suele referirse como <code>operador dólar</code>, o simplemente como <code>bling</code>. ",
+            "jQuery a menudo selecciona un elemento HTML con un <code>selector</code>, y luego le hace algo a ese elemento.",
+            "Por ejemplo, hagamos que todos tus elementos <code>button</code> reboten. Sólo tienes que añadir este código dentro de la función de documento listo: ",
+            "<code>$(\"button\").addClass(\"animated bounce\")</code>",
+            "Ten en cuenta que ya hemos incluido tanto la biblioteca jQuery como la biblioteca Animate.css en segundo plano para que pueda utilizarlos en el editor. Así que estás usando jQuery para aplicar la clase <code>bounce</code> de Animate.css a tus elementos <code>button</code>."
+          ]
+        },
+        "fr": {
+          "title": "Cibler des élements HTML par sélecteurs avec jQuery",
+          "description": [
+            "Nous avons maintenant un <code>document ready function</code>.",
+            "Nous allons à présent écrire notre première expression jQuery. Chaque fonction jQuery commence avec un <code>$</code>, habituellement nommé <code>opérateur dollar</code>, ou <code>bling</code>.",
+            "jQuery sélectionne souvent un élément HTML à l'aide d'un <code>selector</code>, puis fait quelque chose à cet élement.",
+            "Par exemple, faisons en sorte que tous nos <code>button</code> rebondissent. Ajoutez juste ce code à l'intérieur de votre <code>$(document).ready(function(){</code>:",
+            "<code>$(\"button\").addClass(\"animated bounce\");</code>",
+            "Notez que nous avons déjà inclus à la fois la librairie jQuery et la librairie Animate.css en amont donc nous pouvons les utiliser dans l'éditeur. Donc, vous utilisez jQuery pour appliquer la classe <code>bounce</code> d'Animate.css à vos éléments <code>button</code>.",
+            "De plus, assurez-vous d'utiliser <code>$(\"button\").addClass(\"animated bounce\");</code> et non <code>$('button').addClass(\"animated bounce\");</code> car les apostrophes ne passeront pas nos tests."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aedc08826",
+      "title": "Target Elements by Class Using jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "You see how we made all of your <code>button</code> elements bounce? We selected them with <code>$(\"button\")</code>, then we added some CSS classes to them with <code>.addClass(\"animated bounce\");</code>.",
+        "You just used jQuery's <code>.addClass()</code> function, which allows you to add classes to elements.",
+        "First, let's target your <code>div</code> elements with the class <code>well</code> by using the <code>$(\".well\")</code> selector.",
+        "Note that, just like with CSS declarations, you type a <code>.</code> before the class's name.",
+        "Then use jQuery's <code>.addClass()</code> function to add the classes <code>animated</code> and <code>shake</code>.",
+        "For example, you could make all the elements with the class <code>text-primary</code> shake by adding the following to your <code>document ready function</code>:",
+        "<code>$(\".text-primary\").addClass(\"animated shake\");</code>"
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"button\").addClass(\"animated bounce\");",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".well\").hasClass(\"animated\") && $(\".well\").hasClass(\"shake\"), 'message: Use the jQuery <code>addClass&#40&#41</code> function to give the classes <code>animated</code> and <code>shake</code> to all your elements with the class <code>well</code>.');",
+        "assert(!code.match(/class\\.\\*animated/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Elemente anhand von Klassen mit jQuery auswählen",
+          "description": [
+            "Siehst du, wie wir alle deine <code>Button</code> Elemente hüpfen haben lassen? Wir haben sie mit <code>$(\"button\")</code> ausgewählt, dann CSS-Klassen mit <code>.addClass(\"animated bounce\");</code> hinzugefügt.",
+            "Du hast gerade jQuery's <code>.addClass()</code> Funktion genutzt, die dir erlaubt, Klassen zu Elemente hinzuzufügen.",
+            "Wähle als erstes deine <code>div</code> Elemente mit der Klasse <code>well</code>, indem du den <code>$(\".well\")</code> Selektor nutzt.",
+            "Bedenke, dass du - genauso wie bei CSS-Deklarationen - einen <code>.</code> vor den Namen der Klasse setzen musst.",
+            "Dann nutze die jQuery Funktion <code>.addClass()</code> um die Klassen <code>animated</code> und <code>shake</code> hinzuzufügen.",
+            "Zum Beispiel könntest du alle Elemente mit der Klasse <code>text-primary</code> schütteln lassen, indem du folgendes zu deiner <code>Document Ready Funktion</code> hinzufügst:",
+            "<code>$(\".text-primary\").addClass(\"animated shake\");</code>"
+          ]
+        },
+        "es": {
+          "title": "Elige elementos por su clase usando jQuery",
+          "description": [
+            "¿Viste como hicimos rebotar todos tus elementos <code>button</code>? Los seleccionamos con <code>$(\"button\")</code>, y luego les añadimos algunas clases CSS con <code>.addClass(\"animated bounce\");.</code> ",
+            "Acabas de usar la función <code>addClass()</code> de jQuery, que te permite añadir clases a los elementos.",
+            "En primer lugar, apuntemos a tus elementos <code>div</code> que tengan la clase <code>well</code> usando el selector <code>$(\".well\")</code>.",
+            "Ten en cuenta que, al igual que con las declaraciones CSS, escribes un <code>.</code> antes del nombre de la clase.",
+            "A continuación, utiliza la función <code>.addClass()</code> de jQuery para agregar las clases <code>animated</code> y <code>shake</code>.",
+            "Por ejemplo, podrías hacer que todos los elementos con la clase <code>text-primary</code> se sacudieran añadiendo lo siguiente a tu <code>función de documento listo</code>:",
+            "<code>$(\".text-primary\").addClass(\"animated shake\");</code>"
+          ]
+        },
+        "fr": {
+          "title": "Cibler les élements par Classe avec jQuery",
+          "description": [
+            "Voyez comment nous avons fait rebondir tous nos éléments <code>button</code>? Nous les avons sélectionné avec <code>$(\"button\")</code>, puis nous leur avons ajouté des classes CSS avec <code>.addClass(\"animated bounce\");</code>.",
+            "Vous venez d'utiliser la fonction jQuery <code>.addClass()</code>, ce qui nous permet d'ajouter des classes aux éléments.",
+            "Tout d'abord, ciblons nos éléments <code>div</code> qui ont la classe <code>well</code> en utilisant le sélecteur <code>$(\".well\")</code>.",
+            "Notez que, tout comme les expressions CSS, vous ajoutez un <code>.</code> avant le nom de la classe.",
+            "Puis, vous utilisez la fonction jQuery <code>.addClass()</code> pour ajouter les classes <code>animated</code> et <code>shake</code>.",
+            "Par exemple, vous pouvez faire en sorte que tous les éléments avec la classe <code>text-primary</code> s'agitent en ajoutant le code suivant à votre <code>document ready function</code>:",
+            "<code>$(\".text-primary\").addClass(\"animated shake\");</code>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aeda08826",
+      "title": "Target Elements by id Using jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "You can also target elements by their id attributes.",
+        "First target your <code>button</code> element with the id <code>target3</code> by using the <code>$(\"#target3\")</code> selector.",
+        "Note that, just like with CSS declarations, you type a <code>#</code> before the id's name.",
+        "Then use jQuery's <code>.addClass()</code> function to add the classes <code>animated</code> and <code>fadeOut</code>.",
+        "Here's how you'd make the <code>button</code> element with the id <code>target6</code> fade out:",
+        "<code>$(\"#target6\").addClass(\"animated fadeOut\")</code>."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"button\").addClass(\"animated bounce\");",
+        "    $(\".well\").addClass(\"animated shake\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#target3\").hasClass(\"animated\"), 'message: Select the <code>button</code> element with the <code>id</code> of <code>target3</code> and use the jQuery <code>addClass&#40&#41</code> function to give it the class of <code>animated</code>.');",
+        "assert(($(\"#target3\").hasClass(\"fadeOut\") || $(\"#target3\").hasClass(\"fadeout\"))  && code.match(/\\$\\(\\s*.#target3.\\s*\\)/g), 'message: Target the element with the id <code>target3</code> and use the jQuery <code>addClass&#40&#41</code> function to give it the class <code>fadeOut</code>.');",
+        "assert(!code.match(/class.*animated/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Elemente anhand der id mit jQuery auswählen",
+          "description": [
+            "Du kannst Elemente auch anhand deren ID-Attributs auswählen.",
+            "Wähle als erstes dein <code>Button</code> Element mit der ID <code>target3</code>, indem du den <code>$(\"#target3\")</code> Selektor nutzt.",
+            "Bedenke, dass du - genauso wie bei CSS-Deklarationen - eine <code>#</code> vor den Namen der Klasse setzen musst.",
+            "Dann nutze die jQuery Funktion <code>.addClass()</code> um die Klassen <code>animated</code> und <code>fadeOut</code> hinzuzufügen.",
+            "So könntest du das <code>Button</code> Element mit der ID <code>target6</code> ausblenden lassen:",
+            "<code>$(\"#target6\").addClass(\"animated fadeOut\")</code>."
+          ]
+        },
+        "es": {
+          "title": "Elige elementos por id usando jQuery",
+          "description": [
+            "También puedes elegir un elemento por su atributo id.",
+            "Primero selecciona tu elemento <code>button</code> con el id <code>target3</code> mediante el uso del selector <code>$(\"#target3\")</code>.",
+            "Ten en cuenta que, al igual que con las declaraciones CSS, debes escribir un <code>#</code> antes de la identificación.",
+            "A continuación, utiliza la función <code>.addClass()</code> de jQuery para agregar las clases <code>animated</code> y <code>fadeOut</code>.",
+            "He aquí cómo haces que desaparezca el elemento <code>button</code> con la identificación <code>target6</code>:",
+            "<code>$(\"#target6\").addClass(\"animated fadeOut\")</code>."
+          ]
+        },
+        "fr": {
+          "title": "Cibler les éléments par id avec jQuery",
+          "description": [
+            "Vous pouvez également cibler les éléments à l'aide de leurs attributs id.",
+            "Premièrement, cibler votre élément <code>button</code> avec l'id <code>target3</code> en utilisant le sélecteur <code>$(\"#target\")</code>.",
+            "Notez que, tout comme les expressions CSS, vous ajoutez un <code>#</code> avant le nom de l'id.",
+            "Puis, utilisez la fonction jQuery <code>.addClass()</code> afin d'ajouter les classes <code>animated</code> et <code>fadeOut</code>.",
+            "Voici comment vous pouvez faire en sorte que l'élément <code>button</code> avec l'id <code>target6</code> disparaisse en fondu:",
+            "<code>$(\"#target6\").addClass(\"animated fadeOut\")</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aeda08726",
+      "title": "Delete Your jQuery Functions",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "These animations were cool at first, but now they're getting kind of distracting.",
+        "Delete all three of these jQuery functions from your <code>document ready function</code>, but leave your <code>document ready function</code> itself intact."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"button\").addClass(\"animated bounce\");",
+        "    $(\".well\").addClass(\"animated shake\");",
+        "    $(\"#target3\").addClass(\"animated fadeOut\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/\\{\\s*\\}\\);/g), 'message: Delete all three of your jQuery functions from your <code>document ready function</code>.');",
+        "assert(code.match(/<script>/g), 'message: Leave your <code>script</code> element intact.');",
+        "assert(code.match(/\\$\\(document\\)\\.ready\\(function\\(\\)\\s?\\{/g), 'message: Leave your <code>$&#40document&#41.ready&#40function&#40&#41 {</code> to the beginning of your <code>script</code> element.');",
+        "assert(code.match(/.*\\s*\\}\\);/g), 'message: Leave your \"document ready function\" closing <code>&#125;&#41;</code> intact.');",
+        "assert(code.match(/<\\/script>/g) && code.match(/<script/g) && code.match(/<\\/script>/g).length === code.match(/<script/g).length, 'message: Leave your <code>script</code> element closing tag intact.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Lösche deine jQuery Funktionen",
+          "description": [
+            "Anfangs waren diese Animationen noch cool, jetzt sind sie aber ein wenig störend.",
+            "Lösche alle drei jQuery Funktionen deiner <code>Document Ready Funktion</code>, aber lasse die <code>Document Ready Funktion</code> selbst intakt."
+          ]
+        },
+        "es": {
+          "title": "Elimina tus funciones jQuery",
+          "description": [
+            "Estas animaciones eran divertidas al principio, pero ahora se están volviendo una distracción.",
+            "Elimina esas tres funciones jQuery de tu <code>función de documento listo</code>, pero deja intacta la declaración de la <code>función de documento listo</code>."
+          ]
+        },
+        "fr": {
+          "title": "Effacer vos fonctions jQuery",
+          "description": [
+            "Ces animations sont sympathiques à première vue, mais maintenant elles deviennent plutôt distrayantes.",
+            "Effacez les trois fonctions jQuery de votre <code>document ready function</code>, mais laissez votre <code>document ready function</code> lui-même intact."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed908626",
+      "title": "Target the Same Element with Multiple jQuery Selectors",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "Now you know three ways of targeting elements: by type: <code>$(\"button\")</code>, by class: <code>$(\".btn\")</code>, and by id <code>$(\"#target1\")</code>.",
+        "Although it is possible to add multiple classes in a single <code>.addClass()</code> call, let's add them to the same element in <em>three separate ways</em>.",
+        "Using <code>.addClass()</code>, add only one class at a time to the same element, three different ways:",
+        "Add the <code>animated</code> class to all elements with type <code>button</code>.",
+        "Add the <code>shake</code> class to all the buttons with class <code>.btn</code>.",
+        "Add the <code>btn-primary</code> class to the button with id <code>#target1</code>.",
+        "<strong>Note</strong><br>You should only be targeting one element and adding only one class at a time. Altogether, your three individual selectors will end up adding the three classes <code>shake</code>, <code>animated</code>, and <code>btn-primary</code> to <code>#target1</code>."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/\\$\\s*?\\(\\s*?(?:'|\")\\s*?button\\s*?(?:'|\")/gi), 'message: Use the <code>$&#40\"button\"&#41</code> selector.');",
+        "assert(code.match(/\\$\\s*?\\(\\s*?(?:'|\")\\s*?\\.btn\\s*?(?:'|\")/gi), 'message: Use the <code>$&#40\".btn\"&#41</code> selector.');",
+        "assert(code.match(/\\$\\s*?\\(\\s*?(?:'|\")\\s*?#target1\\s*?(?:'|\")/gi), 'message: Use the <code>$&#40\"#target1\"&#41</code> selector.');",
+        "assert(code.match(/addClass/g) && code.match(/addClass\\s*?\\(\\s*?('|\")\\s*?[\\w-]+\\s*?\\1\\s*?\\)/g).length > 2, 'message: Only add one class with each of your three selectors.');",
+        "assert($(\"#target1\").hasClass(\"animated\") && $(\"#target1\").hasClass(\"shake\") && $(\"#target1\").hasClass(\"btn-primary\"), 'message: Your <code>#target1</code> element should have the classes <code>animated</code>&#130; <code>shake</code> and <code>btn-primary</code>.');",
+        "assert(!code.match(/class.*animated/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Wähle das gleiche Element mit mehreren jQuery Selektoren aus",
+          "description": [
+            "Bis jetzt kennst du drei verschiedene Wege um Elemente auszuwählen: mit dem Element-Typ: <code>$(\"button\")</code>, mit der Element-Klasse: <code>$(\".btn\")</code>, und der Element-ID: <code>$(\"#target1\")</code>.",
+            "Auch wenn es möglich ist, mehrere Klassen in einem einzigen <code>.addClass()</code> Aufruf hinzuzufügen, lass uns jetzt die Klassen in drei verschiedenen Wegen dem Element hinzufügen.",
+            "Nutze jeden der oben erwähnten jQuery Selektoren und die <code>addClass()</code> Funktion:",
+            "Füge die Klasse <code>animated</code> zu allen Elementen des Typs <code>button</code> hinzu.",
+            "Füge die Klasse <code>shake</code> zu allen Buttons mit der Klasse <code>.btn</code> hinzu.",
+            "Füge die Klasse <code>btn-primary</code> zu dem Button mit der ID <code>#target1</code> hinzu."
+          ]
+        },
+        "es": {
+          "title": "Elige un mismo elemento con múltiples selectores jQuery",
+          "description": [
+            "Ahora ya sabes tres formas de seleccionar elementos: por tipo <code>$(\"button\")</code>, por clase <code>$(\".btn\")</code>, y por identificación <code>$(\"#target1\")</code>. ",
+            "Aunque es posible agregar varias clases en una sola llamada a <code>.addClass()</code>, vamos a añadirlas al mismo elemento de tres maneras diferentes.",
+            "Usa cada uno de los selectores jQuery vistos y la función <code>addClass()</code> para:",
+            "Agregar la clase <code>animated</code> a todos los elementos con tipo <code>button</code>.",
+            "Agregar la clase <code>shake</code> a todos los botones con clase <code>.btn</code>.",
+            "Agregar la clase <code>btn-primary</code> al botón con identificación <code>#target1</code>."
+          ]
+        },
+        "fr": {
+          "title": "Cibler le même élément avec plusieurs sélecteurs jQuery",
+          "description": [
+            "À présent, vous connaissez trois façons de cibler les éléments: par type: <code>$(\"button\")</code>, par classe: <code>$(\".btn\")</code>, et par id <code>$(\"#target1\")</code>.",
+            "En utilisant <code>.addClass()</code>, ajoutez uniquement une classe à la fois au même élément, de trois façons différentes:",
+            "Ajoutez la classe <code>animated</code> à tous les éléments de type <code>button</code>.",
+            "Ajoutez la classe <code>shake</code> à tous les boutons qui ont la classe <code>.btn</code>.",
+            "Ajoutez la classe <code>btn-primary</code> au bouton qui a l'id <code>#target1</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed918626",
+      "title": "Remove Classes from an Element with jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "In the same way you can add classes to an element with jQuery's <code>addClass()</code> function, you can remove them with jQuery's <code>removeClass()</code> function.",
+        "Here's how you would do this for a specific button:",
+        "<code>$(\"#target2\").removeClass(\"btn-default\");</code>",
+        "Let's remove the <code>btn-default</code> class from all of our <code>button</code> elements."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"button\").addClass(\"animated bounce\");",
+        "    $(\".well\").addClass(\"animated shake\");",
+        "    $(\"#target3\").addClass(\"animated fadeOut\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".btn-default\").length === 0, 'message: Remove the <code>btn-default</code> class from all of your <code>button</code> elements.');",
+        "assert(code.match(/btn btn-default/g), 'message: Only use jQuery to remove this class from the element.');",
+        "assert(code.match(/\\.[\\v\\s]*removeClass[\\s\\v]*\\([\\s\\v]*('|\")\\s*btn-default\\s*('|\")[\\s\\v]*\\)/gm), 'message: Only remove the <code>btn-default</code> class.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Entferne Klassen von einem Element mit jQuery",
+          "description": [
+            "Genauso wie du Klassen mit der jQuery Funktion <code>addClass()</code> hinzufügen kannst, kannst du mit der jQuery Funktion <code>removeClass()</code> Klassen entfernen.",
+            "So könntest du das bei einem spezifischen Button machen:",
+            "<code>$(\"#target2\").removeClass(\"btn-default\");</code>",
+            "Lass uns alle <code>btn-default</code> Klassen von unseren <code>Button</code> Elementen entfernen."
+          ]
+        },
+        "es": {
+          "title": "Elimina clases de un elemento con jQuery",
+          "description": [
+            "De la misma manera que puedes agregar clases a un elemento con la función <code>addClass()</code> de jQuery, puedes eliminarlas con la función <code>removeClass()</code>.",
+            "He aquí cómo puedes hacerlo para un botón específico:",
+            "<code>$(\"#target2\").removeClass(\"btn-default\");</code>",
+            "Vamos a quitar la clase <code>btn-default</code> de todos nuestros elementos <code>button</code>."
+          ]
+        },
+        "fr": {
+          "title": "Supprimer des classes d'un élément avec jQuery",
+          "description": [
+            "De la même façon que vous pouvez ajouter des classes à un élément avec la fonction jQuery <code>addClass()</code>, vous pouvez les supprimer avec la fonction jQuery <code>removeClass()</code>.",
+            "Voici comment procéder pour un bouton spécifique:",
+            "<code>$(\"#target2\").removeClass(\"btn-default\");",
+            "Supprimons la classe <code>btn-default</code> de tous nos éléments <code>button</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed908826",
+      "title": "Change the CSS of an Element Using jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "We can also change the CSS of an HTML element directly with jQuery.",
+        "jQuery has a function called <code>.css()</code> that allows you to change the CSS of an element.",
+        "Here's how we would change its color to blue:",
+        "<code>$(\"#target1\").css(\"color\", \"blue\");</code>",
+        "This is slightly different from a normal CSS declaration, because the CSS property and its value are in quotes, and separated with a comma instead of a colon.",
+        "Delete your jQuery selectors, leaving an empty <code>document ready function</code>.",
+        "Select <code>target1</code> and change its color to red."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"button\").addClass(\"animated bounce\");",
+        "    $(\".well\").addClass(\"animated shake\");",
+        "    $(\"#target3\").addClass(\"animated fadeOut\");",
+        "    $(\"button\").removeClass(\"btn-default\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#target1\").css(\"color\") === 'rgb(255, 0, 0)', 'message: Your <code>target1</code> element should have red text.');",
+        "assert(!code.match(/class.*animated/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Das CSS eines Elements mit jQuery ändern",
+          "description": [
+            "Wir können auch das CSS eines HTML-Elements mit jQuery verändern.",
+            "jQuery hat die Funktion <code>.css()</code>, welche dir erlaubt, das CSS eines Elements zu ändern.",
+            "So können wir die Farbe einer ID zu Blau ändern:",
+            "<code>$(\"#target1\").css(\"color\", \"blue\");</code>",
+            "Das ist ein wenig anders als eine normale CSS-Deklaration, weil die CSS-Eigenschaft und deren Wert in Anführungszeichen sind und durch ein Komma anstatt eines Doppelpunkts getrennt werden.",
+            "Lösche deine jQuery Selektoren, damit eine leere <code>Document Ready Funktion</code> übrig bleibt.",
+            "Wähle <code>target1</code> und ändere dessen Farbe zu Rot."
+          ]
+        },
+        "es": {
+          "title": "Cambia el CSS de un elemento usando jQuery",
+          "description": [
+            "También podemos cambiar el CSS de un elemento HTML directamente con jQuery.",
+            "jQuery tiene una función llamada <code>.css()</code> que te permite cambiar el CSS de un elemento.",
+            "Así es como cambiaríamos su color a azul:",
+            "<code>$(\"#target1\").css(\"color\", \"blue\");</code>",
+            "Esto es un poco diferente a una declaración normal CSS, porque la propiedad CSS y su valor están entre comillas y separadas por una coma en lugar de dos puntos.",
+            "Elimina tus selectores jQuery, dejando en blanco la <code>función de documento listo</code>.",
+            "Selecciona <code>target1</code> y cambia su color a rojo."
+          ]
+        },
+        "fr": {
+          "title": "Changer le CSS d'un élément en utilisant jQuery",
+          "description": [
+            "Nous pouvons aussi changer le CSS d'un élément HTML directement avec jQuery.",
+            "jQuery dispose d'une fonction appelée <code>.css()</code> qui vous permet de changer le CSS d'un élément.",
+            "Voici comment changer sa couleur en bleu:",
+            "<code>$(\"#target1\").css(\"color\", \"blue\");",
+            "Ceci est légèrement différent d'une expression CSS normale, car la propriété CSS et sa valeur sont entre guillemets, et separées par une virgule au lieu de deux points.",
+            "Effacez vos sélecteurs jQuery, laissant votre <code>document ready function</code> vide.",
+            "Sélectionnez <code>target1</code> et changez sa couleur en rouge."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed808826",
+      "title": "Disable an Element Using jQuery",
+      "description": [
+        "You can also change the non-CSS properties of HTML elements with jQuery. For example, you can disable buttons.",
+        "When you disable a button, it will become grayed-out and can no longer be clicked.",
+        "jQuery has a function called <code>.prop()</code> that allows you to adjust the properties of elements.",
+        "Here's how you would disable all buttons:",
+        "<code>$(\"button\").prop(\"disabled\", true);</code>",
+        "Disable only the <code>target1</code> button."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#target1\") && $(\"#target1\").prop(\"disabled\"), 'message: Disable your <code>target1</code> button.');",
+        "assert($(\"#target2\") && !$(\"#target2\").prop(\"disabled\"), 'message: Do not disable any other buttons.');",
+        "assert(!code.match(/disabled[^<]*>/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Elemente mit jQuery deaktivieren",
+          "description": [
+            "Du kannst auch die nicht-CSS Eigenschaften eines HTML-Elements mit jQuery ändern. Zum Beispiel kannst du <code>Buttons</code> deaktivieren.",
+            "Wenn du einen <code>Button</code> deaktivierst, wird er grau unterlegt und kann nicht mehr geklickt werden.",
+            "jQuery hat eine Funktion namens <code>.prop()</code>, die es dir erlaubt, die Eigenschaften von Elementen anzupassen.",
+            "So kannst du alle <code>Buttons</code> deaktivieren:",
+            "<code>$(\"button\").prop(\"disabled\", true);</code>",
+            "Deaktiviere nur den <code>target1</code> Button."
+          ]
+        },
+        "es": {
+          "title": "Desactiva un elemento usando jQuery",
+          "description": [
+            "También puedes cambiar propiedades que no son CSS de los elementos HTML con jQuery. Por ejemplo, puedes desactivar los botones. ",
+            "Al deshabilitar un botón, se volverá gris y no podrá pulsarse.",
+            "jQuery tiene una función llamada <code>.prop()</code> que te permite ajustar las propiedades de los elementos.",
+            "He aquí cómo puedes desactivar todos los botones:",
+            "<code>$(\"button\").prop(\"disabled\", true);</code>",
+            "Desactiva sólo el botón <code>target1</code>."
+          ]
+        },
+        "fr": {
+          "title": "Changer le texte à l'intérieur d'un élément en utilisant jQuery",
+          "description": [
+            "En utilisant jQuery, vous pouvez changer le texte entre les balises ouvrante et fermante d'un élément. Vous pouvez même changer les balises HTML.",
+            "jQuery dispose d'une fonction appelée <code>.html()</code> qui vous permet d'ajouter des balises HTML et du texte à l'intérieur d'un élément. Tout le contenu de l'élément sera alors remplacé par le contenu que vous indiquerez en utilisant la fonction.",
+            "Voici comment vous pourriez ré-écrire et mettre en italique le texte de notre titre:",
+            "<code>$(\"h3\").html(\"&#60em&#62jQuery Playground&#60/em&#62\");",
+            "jQuery dispose également d'une fonction similaire appelée <code>.text()</code> qui change uniquement le texte sans ajouter de balises. Autrement dit, cette fonction n'évaluera aucune balise HTML que vous lui donnez, mais les traitera comme du texte que vous désirez ajouter à votre élément.",
+            "Changez le bouton avec l'id <code>target4</code> en mettant en italique son texte."
+          ]
+        }
+      }
+    },
+    {
+      "id": "564944c91be2204b269d51e3",
+      "title": "Change Text Inside an Element Using jQuery",
+      "description": [
+        "Using jQuery, you can change the text between the start and end tags of an element. You can even change HTML markup.",
+        "jQuery has a function called <code>.html()</code> that lets you add HTML tags and text within an element. Any content previously within the element will be completely replaced with the content you provide using this function.",
+        "Here's how you would rewrite and emphasize the text of our heading:",
+        "<code>$(\"h3\").html(\"&#60;em&#62;jQuery Playground&#60;/em&#62;\");</code>",
+        "jQuery also has a similar function called <code>.text()</code> that only alters text without adding tags. In other words, this function will not evaluate any HTML tags passed to it, but will instead treat it as the text you want to replace the existing content with.",
+        "Change the button with id <code>target4</code> by emphasizing its text.",
+        "Check this <a href=\"https://developer.mozilla.org/en/docs/Web/HTML/Element/em\" target=\"_blank\">link</a> to know more on the difference between <code>&#60;i&#62;</code> and <code>&#60;em&#62;</code> and their uses.",
+        "Note that while the <code>&#60;i&#62;</code> tag has traditionally been used to emphasize text, it has since been coopted for use as a tag for icons. The <code>&#60;em&#62;</code> tag is now widely accepted as the tag for emphasis. Either will work for this challenge."
+      ],
+      "releasedOn": "November 18, 2015",
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    ",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert.isTrue((/<em>|<i>\\s*#target4\\s*<\\/em>|<\\/i>/gi).test($(\"#target4\").html()), 'message: Emphasize the text in your <code>target4</code> button by adding HTML tags.');",
+        "assert($(\"#target4\") && $(\"#target4\").text().trim() === '#target4', 'message: Make sure the text is otherwise unchanged.');",
+        "assert.isFalse((/<em>|<i>/gi).test($(\"h3\").html()), 'message: Do not alter any other text.');",
+        "assert(code.match(/\\.html\\(/g), 'message: Make sure you are using <code>.html()</code> and not <code>.text()</code>.');",
+        "assert(code.match(/\\$\\(\\s*?(\\\"|\\')#target4(\\\"|\\')\\s*?\\)\\.html\\(/), 'message: Make sure to select <code>button id=\"target4\"</code> with jQuery.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Ändere den Text innerhalb eines Elements mit jQuery",
+          "description": [
+            "Mit jQuery kannst du den Text zwischen dem Start- und dem End-Tag eines Elements ändern. Du kannst sogar das HTML-Markup ändern.",
+            "jQuery hat eine Funktion namens <code>.html()</code>, die dich HTML-Tags und Text innerhalb eines Elements hinzufügen lässt. Jeglicher Content der sich vorher innerhalb des Elements befand, wird mit jenem Content ersetzt, den du durch diese Funktion bereitstellst.",
+            "So kannst du den Text unserer Überschrift überschreiben und hervorheben:",
+            "<code>$(\"h3\").html(\"&#60;em&#62;jQuery Playground&#60;/em&#62;\");</code>",
+            "jQuery hat auch eine weitere ähnliche Funktion namens <code>.text()</code>, welche nur den Text ändert, ohne Tags hinzuzufügen. In anderen Worten: diese Funktion evaluiert keinerlei HTML-Tags, die an sie übergeben werden, sondern behandelt diese als Text, den du mit der Funktion ersetzen willst.",
+            "Ändere den Button mit der ID <code>target4</code> indem du seinen Text hervorhebst."
+          ]
+        },
+        "es": {
+          "title": "Cambia el texto de un elemento usando jQuery",
+          "description": [
+            "Con jQuery, puedes cambiar el texto que está entre las etiquetas de apertura y cierre de un elemento.  Incluso puedes cambiar marcado HTML.",
+            "jQuery tiene una función llamada <code>.html()</code> que te permite añadir etiquetas HTML y texto dentro de un elemento.  Cualquier contenido que estuviese previamente dentro del elemento será remplazado por completo con el contenido que proveas usando esta función.",
+            "He aquí como reescribes y pones en itálicas el texto de nuestro encabezado:",
+            "<code>$(\"h3\").html(\"&#60;i&#62;jQuery Playground&#60;/i&#62;\");</code>",
+            "jQuery también tiene una función similar llamada <code>.text()</code> que sólo altera el texto sin añadir etiquetas.",
+            "Cambia el botón con identificación <code>target4</code> de forma que su texto quede en itálicas."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed708826",
+      "title": "Remove an Element Using jQuery",
+      "description": [
+        "Now let's remove an HTML element from your page using jQuery.",
+        "jQuery has a function called <code>.remove()</code> that will remove an HTML element entirely",
+        "Remove element <code>target4</code> from the page by using the <code>.remove()</code> function."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#target4\").length === 0 && code.match(/\\$\\([\"']#target4[\"']\\).remove\\(\\)/g), 'message: Use jQuery to remove your <code>target4</code> element from your page.');",
+        "assert(code.match(/id=\"target4/g) && !code.match(/<!--.*id=\"target4\".*-->/g) && $(\"#right-well\").length > 0, 'message: Only use jQuery to remove this element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Entferne ein Element mit jQuery",
+          "description": [
+            "Lass uns jetzt ein HTML-Element mit jQuery von deiner Seite entfernen.",
+            "jQuery hat eine Funktion namens <code>.remove()</code>, die ein HTML-Element komplett entfernt.",
+            "Entferne das Element <code>target4</code> von der Seite, indem du die <code>.remove()</code> Funktion nutzt."
+          ]
+        },
+        "es": {
+          "title": "Elimina un elemento usando jQuery",
+          "description": [
+            "Ahora quitemos un elemento HTML de tu página usando jQuery.",
+            "jQuery tiene una función llamada <code>.remove()</code> que eliminará un elemento HTML por completo",
+            "Elimina el elemento con identificación <code>target4</code> de la página utilizando la función <code>.remove()</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed608826",
+      "title": "Use appendTo to Move Elements with jQuery",
+      "description": [
+        "Now let's try moving elements from one <code>div</code> to another.",
+        "jQuery has a function called <code>appendTo()</code> that allows you to select HTML elements and append them to another element.",
+        "For example, if we wanted to move <code>target4</code> from our right well to our left well, we would use:",
+        "<code>$(\"#target4\").appendTo(\"#left-well\");</code>",
+        "Move your <code>target2</code> element from your <code>left-well</code> to your <code>right-well</code>."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#left-well\").children(\"#target2\").length === 0, 'message: Your <code>target2</code> element should not be inside your <code>left-well</code>.');",
+        "assert($(\"#right-well\").children(\"#target2\").length > 0, 'message: Your <code>target2</code> element should be inside your <code>right-well</code>.');",
+        "assert(!code.match(/class.*animated/g), 'message: Only use jQuery to move these elements.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Verwende appendTo um Elemente mit jQuery zu verschieben.",
+          "description": [
+            "Lass uns jetzt versuchen, ein Element von einem <code>div</code> zum Nächsten zu verschieben.",
+            "jQuery hat eine Funktion namens <code>appendTo()</code>, die es dir erlaubt HTML-Elemente auszuwählen und diese zu einem anderen Element anzuhängen.",
+            "Wenn wir zum Beispiel <code>target4</code> von <code>right-well</code> zu <code>left-well</code> verschieben wollen, würden wir folgenden Code nutzen:",
+            "<code>$(\"#target4\").appendTo(\"#left-well\");</code>",
+            "Verschiebe dein <code>target2</code> Element von <code>left-well</code> zu <code>right-well</code>."
+          ]
+        },
+        "es": {
+          "title": "Usa appendTo para mover elementos con jQuery",
+          "description": [
+            "Ahora intentemos mover elementos de un <code>div</code> a otro.",
+            "jQuery tiene una función llamada <code>appendTo()</code> que te permite seleccionar elementos HTML y anexarlos a otro elemento.",
+            "Por ejemplo, si quisiéramos mover <code>target4</code> de nuestro pozo (<em>well</em>) derecho a nuestro pozo izquierdo, usaríamos:",
+            "<code>$(\"#target4\").appendTo(\"#left-well\");</code>",
+            "Mueve tu elemento <code>target2</code> de tu <code>left-well</code> a tu <code>right-well</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed508826",
+      "title": "Clone an Element Using jQuery",
+      "description": [
+        "In addition to moving elements, you can also copy them from one place to another.",
+        "jQuery has a function called <code>clone()</code> that makes a copy of an element.",
+        "For example, if we wanted to copy <code>target2</code> from our <code>left-well</code> to our <code>right-well</code>, we would use:",
+        "<code>$(\"#target2\").clone().appendTo(\"#right-well\");</code>",
+        "Did you notice this involves sticking two jQuery functions together? This is called <code>function chaining</code> and it's a convenient way to get things done with jQuery.",
+        "Clone your <code>target5</code> element and append it to your <code>left-well</code>."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "    $(\"#target2\").appendTo(\"#right-well\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#right-well\").children(\"#target5\").length > 0, 'message: Your <code>target5</code> element should be inside your <code>right-well</code>.');",
+        "assert($(\"#left-well\").children(\"#target5\").length > 0, 'message: A copy of your <code>target5</code> element should also be inside your <code>left-well</code>.');",
+        "assert(!code.match(/class.*animated/g), 'message: Only use jQuery to move these elements.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Ein Element kopieren mit jQuery",
+          "description": [
+            "Neben der Möglichkeit Elemente zu verschieben, können diese auch von einem Platz zum nächsten kopiert werden.",
+            "jQuery hat eine Funktion namens <code>clone()</code>, die eine Kopie eines Elements anfertigt.",
+            "Wenn wir zum Beispiel <code>target2</code> von <code>left-well</code> zu <code>right-well</code> kopieren wollen, würden wir folgenden Code nutzen:",
+            "<code>$(\"#target2\").clone().appendTo(\"#right-well\");</code>",
+            "Ist dir aufgefallen, dass wir dazu zwei jQuery Funktionen miteinander verknüpfen? Das nennt sich <code>function chaining</code> und ist eine praktische Art um mit jQuery zu Lösungen zu kommen.",
+            "Kopiere dein <code>target5</code> Element und verschiebe es zu <code>left-well</code>."
+          ]
+        },
+        "es": {
+          "title": "Clona un elemento usando jQuery",
+          "description": [
+            "Además de mover elementos, puedes copiarlos de un sitio a otro.",
+            "jQuery tiene una función llamada <code>clone()</code> que hace una copia de un elemento.",
+            "Por ejemplo, si quisiéramos copiar <code>target2</code> de nuestro <code>left-well</code> a nuestro <code>right-well</code>, usaríamos:",
+            "<code>$(\"#target2\").clone().appendTo(\"#right-well\");</code>",
+            "¿Te diste cuenta que esto implica pegar dos funciones jQuery? Esto se conoce como <code>encadenamiento</code> y es una manera conveniente de hacer las cosas con jQuery. ",
+            "Clona tu elemento <code>target5</code> y añadelo a tu <code>left-well</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed308826",
+      "title": "Target the Parent of an Element Using jQuery",
+      "description": [
+        "Every HTML element has a <code>parent</code> element from which it <code>inherits</code> properties.",
+        "For example, your <code>jQuery Playground</code> <code>h3</code> element has the parent element of <code>&#60;div class=\"container-fluid\"&#62</code>, which itself has the parent <code>body</code>.",
+        "jQuery has a function called <code>parent()</code> that allows you to access the parent of whichever element you've selected.",
+        "Here's an example of how you would use the <code>parent()</code> function if you wanted to give the parent element of the <code>left-well</code> element a background color of blue:",
+        "<code>$(\"#left-well\").parent().css(\"background-color\", \"blue\")</code>",
+        "Give the parent of the <code>#target1</code> element a background-color of red."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "    $(\"#target2\").appendTo(\"#right-well\");",
+        "    $(\"#target5\").clone().appendTo(\"#left-well\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<body>",
+        "  <div class=\"container-fluid\">",
+        "    <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "    <div class=\"row\">",
+        "      <div class=\"col-xs-6\">",
+        "        <h4>#left-well</h4>",
+        "        <div class=\"well\" id=\"left-well\">",
+        "          <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "          <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "          <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "        </div>",
+        "      </div>",
+        "      <div class=\"col-xs-6\">",
+        "        <h4>#right-well</h4>",
+        "        <div class=\"well\" id=\"right-well\">",
+        "          <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "          <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "          <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "        </div>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($(\"#left-well\").css(\"background-color\") === 'red' || $(\"#left-well\").css(\"background-color\") === 'rgb(255, 0, 0)' || $(\"#left-well\").css(\"background-color\").toLowerCase() === '#ff0000' || $(\"#left-well\").css(\"background-color\").toLowerCase() === '#f00', 'message: Your <code>left-well</code> element should have a red background.');",
+        "assert(code.match(/\\.parent\\s*\\(\\s*\\)\\s*\\.css/g), 'message: You should use the <code>&#46;parent&#40;&#41;</code> function to modify this element.');",
+        "assert(code.match(/\\$\\s*?\\(\\s*?(?:'|\")\\s*?#target1\\s*?(?:'|\")\\s*?\\)\\s*?\\.parent/gi), 'message: The <code>&#46;parent&#40;&#41;</code> method should be called on the <code>&#35;target1</code> element.');",
+        "assert(code.match(/<div class=\"well\" id=\"left-well\">/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Wähle das Eltern-Element mit jQuery aus",
+          "description": [
+            "Jedes HTML-Element hat ein <code>Eltern-Element</code>, von dem es Eigenschaften <code>erbt</code>.",
+            "Dein <code>jQuery Playground</code> <code>h3</code> Element hat zum Beispiel das Eltern-Element <code>&#60;div class=\"container-fluid\"&#62</code>, welches das <code>body</code> Element als Eltern-Element hat.",
+            "jQuery hat eine Funktion namens <code>parent()</code>, die es dir erlaubt auf die Eltern-Elemente eines von dir ausgewählten Elements zuzugreifen.",
+            "Hier ist ein Beispiel, wie du die <code>parent()</code> Funktion nutzen kannst, wenn du dem Eltern-Element des <code>left-well</code> Elements eine blaue Hintergrundfarbe geben willst:",
+            "<code>$(\"#left-well\").parent().css(\"background-color\", \"blue\")</code>",
+            "Gib dem Eltern-Element des <code>#target1</code> Elements eine rote Hintergrundfarbe."
+          ]
+        },
+        "es": {
+          "title": "Elige el padre de un elemento usando jQuery",
+          "description": [
+            "Cada elemento HTML tiene un elemento <code>padre</code> del cual <code>hereda</code> propiedades.",
+            "Por ejemplo, tu elemento <code>h3</code> <code>jQuery Playground</code> tiene el elemento padre <code>&#60;div class=\"container-fluid\"&#62</code>, que a su vez tiene el padre <code>body</code>. ",
+            "jQuery tiene una función llamada <code>parent()</code> que te permite acceder al padre de cualquier elemento que haya seleccionado.",
+            "He aquí un ejemplo de cómo se utiliza la función <code>parent()</code> si quisieras darle al elemento padre del elemento <code>left-well</code> un color de fondo azul:",
+            "<code>$(\"#left-well\").parent().css(\"background-color\", \"blue\")</code>",
+            "Dale al padre del elemento <code>#target1</code> un color de fondo (<code>background-color</code>) rojo."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed208826",
+      "title": "Target the Children of an Element Using jQuery",
+      "description": [
+        "When HTML elements are placed one level below another they are called <code>children</code> of that element. For example, the button elements in this challenge with the text \"#target1\", \"#target2\", and \"#target3\" are all <code>children</code> of the <code>&#60;div class=\"well\" id=\"left-well\"&#62;</code> element.",
+        "jQuery has a function called <code>children()</code> that allows you to access the children of whichever element you've selected.",
+        "Here's an example of how you would use the <code>children()</code> function to give the children of your <code>left-well</code> element the color <code>blue</code>:",
+        "<code>$(\"#left-well\").children().css(\"color\", \"blue\")</code>",
+        "<hr>",
+        "Give all the children of your <code>right-well</code> element the color orange."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "    $(\"#target2\").appendTo(\"#right-well\");",
+        "    $(\"#target5\").clone().appendTo(\"#left-well\");",
+        "    $(\"#target1\").parent().css(\"background-color\", \"red\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\"#right-well\").children().css(\"color\") === 'rgb(255, 165, 0)', 'message: All children of <code>#right-well</code> should have orange text.');",
+        "assert(code.match(/\\.children\\(\\)\\.css/g), 'message: You should use the <code>children&#40&#41</code> function to modify these elements.');",
+        "assert(code.match(/<div class=\"well\" id=\"right-well\">/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Wähle Kinder-Elemente mit jQuery aus",
+          "description": [
+            "Viele HTML-Elemente haben <code>Kinder-Elemente</code>, die ihre Eigenschaften von ihren Eltern-Elementen <code>erben</code>.",
+            "Zum Beispiel ist jedes HTML-Element ein Kind-Element des <code>body</code> Elements und dein <code>\"jQuery Playground\"</code> <code>h3</code> Element ist ein Kind-Element deines <code>&#60;div class=\"container-fluid\"&#62</code> Elements.",
+            "jQuery hat eine Funktion namens <code>children()</code>, die es dir erlaubt, auf die Kinder-Elemente des von dir ausgewählten Elements zuzugreifen.",
+            "Hier ist ein Beispiel, wie du die <code>children()</code> Funktion nutzen kannst, wenn du den Kinder-Elementen von <code>left-well</code> die Farbe Blau geben willst:",
+            "<code>$(\"#left-well\").children().css(\"color\", \"blue\")</code>",
+            "Gib allen Kinder-Elementen von <code>#right-well</code> die Farbe Orange."
+          ]
+        },
+        "es": {
+          "title": "Elige los hjos de un elemento usando jQuery",
+          "description": [
+            "Muchos elementos HTML tienen <code>hijos</code>, los cuales <code>heredan</code> sus propiedades de sus elementos padres",
+            "Por ejemplo, cada elemento HTML es un hijo de tu elemento <code>body</code>, y tu elemento <code>h3</code> \"jQuery Playground\" es un hijo de tu elemento <code>&#60;div class=\"container-fluid\"&#62</code>.",
+            "jQuery tiene una función llamada <code>children()</code> que te permite acceder a los hijos de cualquier elemento que hayas seleccionado.",
+            "He aquí un ejemplo de cómo se utiliza la función <code>children()</code> para darle a los hijos de tu elemento <code>left-well</code> el color azul:",
+            "<code>$(\"#left-well\").children().css(\"color\", \"blue\")</code>",
+            "Da a todos los hijos de tu elemento <code>right-well</code> el color naranja."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed108826",
+      "title": "Target a Specific Child of an Element Using jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "You've seen why id attributes are so convenient for targeting with jQuery selectors. But you won't always have such neat ids to work with.",
+        "Fortunately, jQuery has some other tricks for targeting the right elements.",
+        "jQuery uses CSS Selectors to target elements. The <code>target:nth-child(n)</code> CSS selector allows you to select all the nth elements with the target class or element type.",
+        "Here's how you would give the third element in each well the bounce class:",
+        "<code>$(\".target:nth-child(3)\").addClass(\"animated bounce\");</code>",
+        "Make the second child in each of your well elements bounce. You must select the elements' children with the <code>target</code> class."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "    $(\"#target2\").appendTo(\"#right-well\");",
+        "    $(\"#target5\").clone().appendTo(\"#left-well\");",
+        "    $(\"#target1\").parent().css(\"background-color\", \"red\");",
+        "    $(\"#right-well\").children().css(\"color\", \"orange\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($(\".target:nth-child(2)\").hasClass(\"animated\") && $(\".target:nth-child(2)\").hasClass(\"bounce\"), 'message: The second element in your <code>target</code> elements should bounce.');",
+        "assert($(\".animated.bounce\").length === 2, 'message: Only two elements should bounce.');",
+        "assert(code.match(/\\:nth-child\\(/g), 'message: You should use the <code>&#58;nth-child&#40&#41</code> selector to modify these elements.');",
+        "assert(code.match(/\\$\\(\".target:nth-child\\(2\\)\"\\)/g) || code.match(/\\$\\('.target:nth-child\\(2\\)'\\)/g) || code.match(/\\$\\(\".target\"\\).filter\\(\":nth-child\\(2\\)\"\\)/g) || code.match(/\\$\\('.target'\\).filter\\(':nth-child\\(2\\)'\\)/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Wähle ein spezifisches Kinder-Element mit jQuery aus",
+          "description": [
+            "Du hast gesehen, warum ID-Attribute so praktisch sind, um Elemente mit jQuery Selektoren auszuwählen. Leider hast du aber nicht immer so praktische IDs, mit denen du arbeiten kannst.",
+            "Zum Glück hat jQuery einige Tricks auf Lager, um die richtigen Elemente auszuwählen.",
+            "jQuery nutzt CSS-Selektoren um Elemente auszuwählen. Der <code>target:nth-child(n)</code> CSS-Selektor erlaubt dir das n-te Element aus einer Zielklasse oder Element-Typ zu wählen.",
+            "Hier siehst du, wie du dem dritten Kind-Element einer jeden Vertiefung eine <code>bounce</code> Klasse hinzufügen kannst.",
+            "<code>$(\".target:nth-child(3)\").addClass(\"animated bounce\");</code>",
+            "Lasse das zweite Kind-Element jeder Vertiefung hüpfen. Dazu musst das Kind-Element mit der <code>target</code> Klasse auswählen."
+          ]
+        },
+        "es": {
+          "title": "Elige un hijo específico de un elemento usando jQuery",
+          "description": [
+            "Seguramente habrás entendido porque los atributos id son tan convenientes para elegir con selectores jQuery. Pero no siempre contarás con estos agradables identificadores para trabajar. ",
+            "Afortunadamente, jQuery tiene algunos otros trucos para elegir los elementos adecuados.",
+            "jQuery usa selectores CSS para elegir elementos, El selector CSS <code>.clase:nth-child(i)</code> te permite seleccionar de los elementos con la clase dada, los que sean los i-ésimos hijos de su elemento padre. En lugar de una clase también puedes usar un elemento",
+            "He aquí cómo le asignarás la clase <code>bounce</code> al tercer elemento de cada pozo:",
+            "<code>$(\".target:nth-child(3)\").addClass(\"animated bounce\");</code>",
+            "Haz que rebote el segundo hijo de cada uno de los elementos de tus pozos. Debes elegir los hijos de elementos con clase <code>target</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aed008826",
+      "title": "Target Even Elements Using jQuery",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "You can also target elements based on their positions using <code>:odd</code> or <code>:even</code> selectors.",
+        "Note that jQuery is zero-indexed which means the first element in a selection has a position of 0. This can be a little confusing as, counter-intuitively, <code>:odd</code> selects the second element (position 1), fourth element (position 3), and so on.",
+        "Here's how you would target all the odd elements with class <code>target</code> and give them classes:",
+        "<code>$(\".target:odd\").addClass(\"animated shake\");</code>",
+        "Try selecting all the even <code>target</code> elements and giving them the classes of <code>animated</code> and <code>shake</code>. Remember that <strong>even</strong> refers to the position of elements with a zero-based system in mind."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "    $(\"#target2\").appendTo(\"#right-well\");",
+        "    $(\"#target5\").clone().appendTo(\"#left-well\");",
+        "    $(\"#target1\").parent().css(\"background-color\", \"red\");",
+        "    $(\"#right-well\").children().css(\"color\", \"orange\");",
+        "    $(\"#left-well\").children().css(\"color\", \"green\");",
+        "    $(\".target:nth-child(2)\").addClass(\"animated bounce\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('.target:even').hasClass('animated') && $('.target:even').hasClass('shake'), 'message: All of the <code>target</code> elements that jQuery considers to be even should shake.');",
+        "assert(code.match(/\\:even/g), 'message: You should use the <code>&#58;even</code> selector to modify these elements.');",
+        "assert(code.match(/\\$\\(\".target:even\"\\)/g) || code.match(/\\$\\('.target:even'\\)/g) || code.match(/\\$\\(\".target\"\\).filter\\(\":even\"\\)/g) || code.match(/\\$\\('.target'\\).filter\\(':even'\\)/g), 'message: Only use jQuery to add these classes to the element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Wähle gerade Zahlen mit jQuery aus",
+          "description": [
+            "Du kannst auch alle geradzahligen Elemente auswählen.",
+            "Hier siehst du, wie du ungeradzahlige Elemente mit der Klasse <code>target</code> auswählen und ihnen folgende Klassen geben kannst:",
+            "<code>$(\".target:odd\").addClass(\"animated shake\");</code>",
+            "Bedenke, dass jQuery null-indexiert ist; das bedeutet, dass - kontraintuitiverweise - <code>:odd</code> das zweite Element, das vierte Element und so weiter auswählt.",
+            "Versuche alle geradzahligen <code>target</code> Elemente auszuwählen und ihnen die Klassen <code>animated</code> und <code>shake</code> hinzuzufügen."
+          ]
+        },
+        "es": {
+          "title": "Elige elementos con numeración par usando jQuery",
+          "description": [
+            "También puedes elegir todos los elementos con numeración par.",
+            "He aquí cómo elegirías todos los elementos impares con clase <code>target</code> y como les agregarías unas clases:",
+            "<code>$(\".target:odd\").addClass(\"animated shake\");</code>",
+            "Intenta seleccionar todos los <code>target</code> elementos de número par y agrégales las clases <code>animated</code> y <code>shake</code>."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bad87fee1348bd9aecb08826",
+      "title": "Use jQuery to Modify the Entire Page",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/animate.css/3.2.0/animate.css"
+        }
+      ],
+      "description": [
+        "We're done playing with our jQuery playground. Let's tear it down!",
+        "jQuery can target the <code>body</code> element as well.",
+        "Here's how we would make the entire body fade out: <code> $(\"body\").addClass(\"animated fadeOut\");</code>",
+        "But let's do something more dramatic. Add the classes <code>animated</code> and <code>hinge</code> to your <code>body</code> element."
+      ],
+      "challengeSeed": [
+        "fccss",
+        "  $(document).ready(function() {",
+        "    $(\"#target1\").css(\"color\", \"red\");",
+        "    $(\"#target1\").prop(\"disabled\", true);",
+        "    $(\"#target4\").remove();",
+        "    $(\"#target2\").appendTo(\"#right-well\");",
+        "    $(\"#target5\").clone().appendTo(\"#left-well\");",
+        "    $(\"#target1\").parent().css(\"background-color\", \"red\");",
+        "    $(\"#right-well\").children().css(\"color\", \"orange\");",
+        "    $(\"#left-well\").children().css(\"color\", \"green\");",
+        "    $(\".target:nth-child(2)\").addClass(\"animated bounce\");",
+        "    $(\".target:even\").addClass(\"animated shake\");",
+        "",
+        "  });",
+        "fcces",
+        "",
+        "<!-- Only change code above this line. -->",
+        "",
+        "<div class=\"container-fluid\">",
+        "  <h3 class=\"text-primary text-center\">jQuery Playground</h3>",
+        "  <div class=\"row\">",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#left-well</h4>",
+        "      <div class=\"well\" id=\"left-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target1\">#target1</button>",
+        "        <button class=\"btn btn-default target\" id=\"target2\">#target2</button>",
+        "        <button class=\"btn btn-default target\" id=\"target3\">#target3</button>",
+        "      </div>",
+        "    </div>",
+        "    <div class=\"col-xs-6\">",
+        "      <h4>#right-well</h4>",
+        "      <div class=\"well\" id=\"right-well\">",
+        "        <button class=\"btn btn-default target\" id=\"target4\">#target4</button>",
+        "        <button class=\"btn btn-default target\" id=\"target5\">#target5</button>",
+        "        <button class=\"btn btn-default target\" id=\"target6\">#target6</button>",
+        "      </div>",
+        "    </div>",
+        "  </div>",
+        "</div>"
+      ],
+      "tests": [
+        "assert($('body').hasClass('animated') && $('body').hasClass('hinge'), 'message: Add the classes <code>animated</code> and <code>hinge</code> to your <code>body</code> element.');"
+      ],
+      "type": "waypoint",
+      "challengeType": 0,
+      "translations": {
+        "de": {
+          "title": "Mit jQuery die gesamte Seite modifizieren",
+          "description": [
+            "Genug mit unserem jQuery Spielplatz herumgespielt. Reißen wir ihn ein!",
+            "jQuery kann auch das <code>body</code> Element auswählen.",
+            "Hier siehst du, wie wir den gesamten <code>body</code> Bereich ausblenden können: <code> $(\"body\").addClass(\"animated fadeOut\");</code>",
+            "Aber lass uns noch etwas Dramatischeres machen. Füge die Klassen <code>animated</code> und <code>hinge</code> zu deinem <code>body</code> Element hinzu."
+          ]
+        },
+        "es": {
+          "title": "Usa jQuery para modificar la página entera",
+          "description": [
+            "Hemos terminado de jugar en nuestro patio de recreo jQuery. ¡Vamos a derribarlo!",
+            "jQuery también puede elegir el elemento <code>body</code>.",
+            "Así es como haríamos que el cuerpo entero desapareciera: <code>$(\"body\").addClass('animated fadeOut');</code>",
+            "Pero vamos a hacer algo más dramático. Añade las clases <code>animated</code> y <code>hinge</code> a tu elemento <code>body</code>."
+          ]
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/03-front-end-libraries/react-and-redux.json b/seed/math-challenges/03-front-end-libraries/react-and-redux.json
new file mode 100644
index 0000000000..86635fe32c
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/react-and-redux.json
@@ -0,0 +1,27 @@
+{
+  "name": "React and Redux",
+  "order": 7,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7dbc367417b2b2512bb0",
+      "title": "Introduction to the React and Redux Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "The React and Redux challenges have not been ported into freeCodeCamp yet. You can visit <a href=\"http://hysterical-amusement.surge.sh/\" target=\"_blank\">this link to work through the alpha version</a> of these challenges. If you have feedback, you can open an issue (or pull request) directly on <a href=\"https://github.com/bonham000/fcc-react-tests-module\" target=\"_blank\">this repository.</a>",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/03-front-end-libraries/react.json b/seed/math-challenges/03-front-end-libraries/react.json
new file mode 100644
index 0000000000..40d274aee7
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/react.json
@@ -0,0 +1,33 @@
+{
+  "name": "React",
+  "order": 5,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7dbc367417b2b2512bb1",
+      "title": "Introduction to the React Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "React is a JavaScript library designed to make it easier to build complex user interfaces. React does this in a few ways:<br><br><ol><li>React allows HTML to render from a JavaScript file.</li><li>React breaks a website's parts into Components that can then be combined to build pages.</li><li>React Components can pass data to each other as properties</li></ol><br><br>React uses a virtual Document Object Model. Instead of changing the DOM directly, React makes a simplified copy of the DOM (the virtual DOM) when the page loads. This allows React to make changes to elements on the page without re-rendering the entire page. This can improve the responsiveness and functionality of single-page applications.<br><br>While not part of the React library and not required, JSX is often paired with React. JSX is a preprocessor for JavaScript written in a syntax akin to XML that results in more readable code.<br><br><strong>Fun fact:</strong> freeCodeCamp is built using React.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "The React challenges have not been ported into freeCodeCamp yet. You can visit <a href=\"http://hysterical-amusement.surge.sh/\" target=\"_blank\">this link to work through the alpha version</a> of these challenges. If you have feedback, you can open an issue (or pull request) directly on <a href=\"https://github.com/bonham000/fcc-react-tests-module\" target=\"_blank\">this repository.</a>",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/03-front-end-libraries/redux.json b/seed/math-challenges/03-front-end-libraries/redux.json
new file mode 100644
index 0000000000..cfe180f845
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/redux.json
@@ -0,0 +1,33 @@
+{
+  "name": "Redux",
+  "order": 6,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7dbd367417b2b2512bb2",
+      "title": "Introduction to the Redux Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "Redux is self-described as a \"predictable state container for JavaScript apps.\" State (as introduced in the React challenges) is a way to manage what is displayed to a user based on that user's inputs or interactions with the application. While it's not necessary to use Redux with React, or vice-versa, the two are often used in conjunction as the features of Redux support applications built with React. Some of these features include:<br><br><ol><li>An immutable single state store or \"single state of truth\" through which the application makes UI updates</li><li>Logical structure of `actions` carrying data to `reducer` functions that return a new application state</li><li>A trackable history of changes to state</li></ol><br><br>Redux is often added to a project when the complexity of managing the application's state becomes tedious. It helps minimize some of the headaches that can be caused by data mutability or passing state back-and-forth between many React components. Redux also supports debugging with tools like <a href=\"https://github.com/gaearon/redux-devtools\" target=\"_blank\">Redux DevTools</a>. Let's jump in to learning how Redux can simplify your React apps.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "The Redux challenges have not been ported into freeCodeCamp yet. You can visit <a href=\"http://hysterical-amusement.surge.sh/\" target=\"_blank\">this link to work through the alpha version</a> of these challenges. If you have feedback, you can open an issue (or pull request) directly on <a href=\"https://github.com/bonham000/fcc-react-tests-module\" target=\"_blank\">this repository.</a>",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/03-front-end-libraries/sass.json b/seed/math-challenges/03-front-end-libraries/sass.json
new file mode 100644
index 0000000000..41c4a0beab
--- /dev/null
+++ b/seed/math-challenges/03-front-end-libraries/sass.json
@@ -0,0 +1,481 @@
+{
+  "name": "Sass",
+  "order": 4,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7dbd367417b2b2512bb3",
+      "title": "Introduction to the Sass Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "Sass, or \"Syntactically Awesome StyleSheets\", is a language extension of CSS. It adds features that aren't available using basic CSS syntax. Sass makes it easier for developers to simplify and maintain the style sheets for their projects.<br><br>Sass can extend the CSS language because it is a preprocessor. It takes code written using Sass syntax, and converts it into basic CSS. This allows you to create variables, nest CSS rules into others, and import other Sass files, among other things. The result is more compact, easier to read code.<br><br>This section introduces the basic features of Sass.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbd367417b2b2512bb4",
+      "title": "Store Data with Sass Variables",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "One feature of Sass that's different than CSS is it uses variables. They are declared and set to store data, similar to JavaScript.",
+        "In Javascript, variables are defined using the <code>let</code> and <code>const</code> keywords. In Sass, variables start with a <code>$</code> followed by the variable name.",
+        "Here are a couple examples:",
+        "<blockquote>$main-fonts: Arial, sans-serif;<br>$headings-color: green;<br><br>//To use variables:<br>h1 {<br>&nbsp;&nbsp;font-family: $main-fonts;<br>&nbsp;&nbsp;color: $headings-color;<br>}</blockquote>",
+        "One example where variables are useful is when a number of elements need to be the same color. If that color is changed, the only place to edit the code is the variable value.",
+        "<hr>",
+        "Create a variable <code>$text-color</code> and set it to red. Then change the value of the <code>color</code> property for the <code>.blog-post</code> and <code>h2</code> to the <code>$text-color</code> variable."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  .header{",
+        "    text-align: center;",
+        "  }",
+        "  .blog-post h2 {",
+        "    color: red;",
+        "  }",
+        "</style>",
+        "",
+        "<h1 class=\"header\">Learn Sass</h1>",
+        "<div class=\"blog-post\">",
+        "  <h2>Some random title</h2>",
+        "  <p>This is a paragraph with some random text in it</p>",
+        "</div>",
+        "<div class=\"blog-post\">",
+        "  <h2>Header #2</h2>",
+        "  <p>Here is some more random text.</p>",
+        "</div>",
+        "<div class=\"blog-post\">",
+        "  <h2>Here is another header</h2>",
+        "  <p>Even more random text within a paragraph</p>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/\\$text-color:\\s*?red;/g), 'message: Your code should have a Sass variable declared for <code>$text-color</code> with a value of red.');",
+        "assert(code.match(/color:\\s*?\\$text-color;/g), 'message: Your code should use the <code>$text-color</code> variable to change the <code>color</code> for the <code>.blog-post</code> and <code>h2</code> items.');",
+        "assert($('.blog-post').css('color') == 'rgb(255, 0, 0)', 'message: Your <code>.blog-post</code> element should have a </code>color</code> of red.');",
+        "assert($('h2').css('color') == 'rgb(255, 0, 0)', 'message: Your <code>h2</code> elements should have a </code>color</code> of red.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbd367417b2b2512bb5",
+      "title": "Nest CSS with Sass",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "Sass allows <code>nesting</code> of CSS rules, which is a useful way of organizing a style sheet.",
+        "Normally, each element is targeted on a different line to style it, like so:",
+        "<blockquote>nav {<br>&nbsp;&nbsp;background-color: red;<br>}<br><br>nav ul {<br>&nbsp;&nbsp;list-style: none;<br>}<br><br>nav ul li {<br>&nbsp;&nbsp;display: inline-block;<br>}</blockquote>",
+        "For a large project, the CSS file will have many lines and rules. This is where <code>nesting</code> can help organize your code by placing child style rules within the respective parent elements:",
+        "<blockquote>nav {<br>&nbsp;&nbsp;background-color: red;<br><br>&nbsp;&nbsp;ul {<br>&nbsp;&nbsp;&nbsp;&nbsp;list-style: none;<br><br>&nbsp;&nbsp;&nbsp;&nbsp;li {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;display: inline-block;<br>&nbsp;&nbsp;&nbsp;&nbsp;}<br>&nbsp;&nbsp;}<br>}<br></blockquote>",
+        "<hr>",
+        "Use the <code>nesting</code> technique shown above to re-organize the CSS rules for both children of <code>.blog-post</code> element. For testing purposes, the <code>h1</code> should come before the <code>p</code> element."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .blog-post {",
+        "    ",
+        "  }",
+        "  h1 {",
+        "    text-align: center;",
+        "    color: blue;",
+        "  }",
+        "  p {",
+        "    font-size: 20px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"blog-post\">",
+        "  <h1>Blog Title</h1>",
+        "  <p>This is a paragraph</p>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/\\.blog-post\\s*?{\\s*?h1\\s*?{\\s*?text-align:\\s*?center;\\s*?color:\\s*?blue;\\s*?}\\s*?p\\s*?{\\s*?font-size:\\s*?20px;\\s*?}\\s*?}/gi), 'message: Your code should re-organize the CSS rules so the <code>h1</code> and <code>p</code> are nested in the <code>.blog-post</code> parent element.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbd367417b2b2512bb6",
+      "title": "Create Reusable CSS with Mixins",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "In Sass, a <code>mixin</code> is a group of CSS declarations that can be reused throughout the style sheet.",
+        "Newer CSS features take time before they are fully adopted and ready to use in all browsers. As features are added to browsers, CSS rules using them may need vendor prefixes. Consider \"box-shadow\":",
+        "<blockquote>div {<br>&nbsp;&nbsp;-webkit-box-shadow: 0px 0px 4px #fff;<br>&nbsp;&nbsp;-moz-box-shadow: 0px 0px 4px #fff;<br>&nbsp;&nbsp;-ms-box-shadow: 0px 0px 4px #fff;<br>&nbsp;&nbsp;box-shadow: 0px 0px 4px #fff;<br>}</blockquote>",
+        "It's a lot of typing to re-write this rule for all the elements that have a <code>box-shadow</code>, or to change each value to test different effects.",
+        "<code>Mixins</code> are like functions for CSS. Here is how to write one:",
+        "<blockquote>@mixin box-shadow($x, $y, $blur, $c){ <br>&nbsp;&nbsp;-webkit-box-shadow: $x, $y, $blur, $c;<br>&nbsp;&nbsp;-moz-box-shadow: $x, $y, $blur, $c;<br>&nbsp;&nbsp;-ms-box-shadow: $x, $y, $blur, $c;<br>&nbsp;&nbsp;box-shadow: $x, $y, $blur, $c;<br>}</blockquote>",
+        "The definition starts with <code>@mixin</code> followed by a custom name. The parameters (the <code>$x</code>, <code>$y</code>, <code>$blur</code>, and <code>$c</code> in the example above) are optional.",
+        "Now any time a <code>box-shadow</code> rule is needed, only a single line calling the <code>mixin</code> replaces having to type all the vendor prefixes. A <code>mixin</code> is called with the <code>@include</code> directive:",
+        "<blockquote>div {<br>&nbsp;&nbsp;@include box-shadow(0px, 0px, 4px, #fff);<br>}</blockquote>",
+        "<hr>",
+        "Write a <code>mixin</code> for <code>border-radius</code> and give it a <code>$radius</code> parameter. It should use all the vendor prefixes from the example. Then use the <code>border-radius</code> <code>mixin</code> to give the <code>#awesome</code> element a border radius of 15px."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  ",
+        "  #awesome {",
+        "    width: 150px;",
+        "    height: 150px;",
+        "    background-color: green;",
+        "    ",
+        "  }",
+        "</style>",
+        "",
+        "<div id=\"awesome\"></div>",
+        "  "
+      ],
+      "tests": [
+        "assert(code.match(/@mixin\\s+?border-radius\\(\\s*?\\$radius\\s*?\\)\\s*?{/gi), 'message: Your code should declare a <code>mixin</code> named <code>border-radius</code> which has a parameter named <code>$radius</code>.');",
+        "assert(code.match(/-webkit-border-radius:\\s*?\\$radius;/gi), 'message: Your code should include the <code>-webkit-border-radius</code> vender prefix that uses the <code>$radius</code> parameter.');",
+        "assert(code.match(/-moz-border-radius:\\s*?\\$radius;/gi), 'message: Your code should include the <code>-moz-border-radius</code> vender prefix that uses the <code>$radius</code> parameter.');",
+        "assert(code.match(/-ms-border-radius:\\s*?\\$radius;/gi), 'message: Your code should include the <code>-ms-border-radius</code> vender prefix that uses the <code>$radius</code> parameter.');",
+        "assert(code.match(/border-radius:\\s*?\\$radius;/gi).length == 4, 'message: Your code should include the general <code>border-radius</code> rule that uses the <code>$radius</code> parameter.');",
+        "assert(code.match(/@include\\s+?border-radius\\(\\s*?15px\\s*?\\);/gi), 'message: Your code should call the <code>border-radius mixin</code> using the <code>@include</code> keyword, setting it to 15px.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbe367417b2b2512bb8",
+      "title": "Use @if and @else to Add Logic To Your Styles",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "The <code>@if</code> directive in Sass is useful to test for a specific case - it works just like the <code>if</code> statement in JavaScript</code>.",
+        "<blockquote>@mixin make-bold($bool) {<br>&nbsp;&nbsp;@if $bool == bold { font-weight: bold; }<br>}</blockquote>",
+        "And just like in JavaScript, <code>@else if</code> and <code>@else</code> test for more conditions:",
+        "<blockquote>@mixin text-effect($val) {<br>&nbsp;&nbsp;@if $val == danger {color: red;}<br>&nbsp;&nbsp;@else if $val == alert {color: yellow;}<br>&nbsp;&nbsp;@else if $val == success {color: green;}<br>&nbsp;&nbsp;@else {color: black;}<br>}</blockquote>",
+        "<hr>",
+        "Create a <code>mixin</code> called <code>border-stroke</code> that takes a parameter <code>$val</code>. The <code>mixin</code> should check for the following conditions using <code>@if</code>, <code>@else if</code>, and <code>@else</code>:",
+        "<blockquote>light - 1px solid black<br>medium - 3px solid black<br>heavy - 6px solid black<br>none - no border</blockquote>"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  ",
+        "  #box {",
+        "    width: 150px;",
+        "    height: 150px;",
+        "    background-color: red;",
+        "    @include border-stroke(medium);",
+        "  }  ",
+        "</style>",
+        "",
+        "<div id=\"box\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/@mixin\\s+?border-stroke\\s*?\\(\\s*?\\$val\\s*?\\)\\s*?{/gi), 'message: Your code should declare a <code>mixin</code> named <code>border-stroke</code> which has a parameter named <code>$val</code>.');",
+        "assert(code.match(/@if\\s+?\\$val\\s*?===?\\s*?light\\s*?{\\s*?border\\s*?:\\s*?1px\\s+?solid\\s+?black\\s*?;\\s*?}/gi), 'message: Your <code>mixin</code> should have an <code>@if</code> statement to check if <code>$val</code> is light, and to set the <code>border</code> to 1px solid black.');",
+        "assert(code.match(/@else\\s+?if\\s+?\\$val\\s*?===?\\s*?medium\\s*?{\\s*?border\\s*?:\\s*?3px\\s+?solid\\s+?black\\s*?;\\s*?}/gi), 'message: Your <code>mixin</code> should have an <code>@else if</code> statement to check if <code>$val</code> is medium, and to set the <code>border</code> to 3px solid black.');",
+        "assert(code.match(/@else\\s+?if\\s+?\\$val\\s*?===?\\s*?heavy\\s*?{\\s*?border\\s*?:\\s*?6px\\s+?solid\\s+?black\\s*?;\\s*?}/gi), 'message: Your <code>mixin</code> should have an <code>@else if</code> statement to check if <code>$val</code> is heavy, and to set the <code>border</code> to 6px solid black.');",
+        "assert(code.match(/@else\\s*?{\\s*?border\\s*?:\\s*?none\\s*?;\\s*?}/gi), 'message: Your <code>mixin</code> should have an <code>@else</code> statement to set the <code>border</code> to none.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbe367417b2b2512bb9",
+      "title": "Use @for to Create a Sass Loop",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "The <code>@for</code> directive adds styles in a loop, very similar to a <code>for</code> loop in JavaScript.",
+        "<code>@for</code> is used in two ways: \"start through end\" or \"start to end\". The main difference is that \"start to end\" <em>excludes</em> the end number, and \"start through end\" <em>includes</em> the end number.",
+        "Here's a start <b>through</b> end example:",
+        "<blockquote>@for $i from 1 through 12 {<br>&nbsp;&nbsp;.col-#{$i} { width: 100%/12 * $i; }<br>}</blockquote>",
+        "The <code>#{$i}</code> part is the syntax to combine a variable (<code>i</code>) with text to make a string. When the Sass file is converted to CSS, it looks like this:",
+        "<blockquote>.col-1 {<br>&nbsp;&nbsp;width: 8.33333%;<br>}<br><br>.col-2 {<br>&nbsp;&nbsp;width: 16.66667%;<br>}<br><br>...<br><br>.col-12 {<br>&nbsp;&nbsp;width: 100%;<br>}</blockquote>",
+        "This is a powerful way to create a grid layout. Now you have twelve options for column widths available as CSS classes.",
+        "<hr>",
+        "Write a <code>@for</code> directive that takes a variable <code>$j</code> that goes from 1 <b>to</b> 6.",
+        "It should create 5 classes called <code>.text-1</code> to <code>.text-5</code> where each has a <code>font-size</code> set to 10px multiplied by the index."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "",
+        "<p class=\"text-1\">Hello</p>",
+        "<p class=\"text-2\">Hello</p>",
+        "<p class=\"text-3\">Hello</p>",
+        "<p class=\"text-4\">Hello</p>",
+        "<p class=\"text-5\">Hello</p>"
+      ],
+      "tests": [
+        "assert(code.match(/@for /g), 'message: Your code should use the <code>@for</code> directive.');",
+        "assert($('.text-1').css('font-size') == '10px', 'message: Your <code>.text-1</code> class should have a <code>font-size</code> of 10px.');",
+        "assert($('.text-2').css('font-size') == '20px', 'message: Your <code>.text-2</code> class should have a <code>font-size</code> of 20px.');",
+        "assert($('.text-3').css('font-size') == '30px', 'message: Your <code>.text-3</code> class should have a <code>font-size</code> of 30px.');",
+        "assert($('.text-4').css('font-size') == '40px', 'message: Your <code>.text-4</code> class should have a <code>font-size</code> of 40px.');",
+        "assert($('.text-5').css('font-size') == '50px', 'message: Your <code>.text-5</code> class should have a <code>font-size</code> of 50px.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbf367417b2b2512bba",
+      "title": "Use @each to Map Over Items in a List",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "The last challenge showed how the <code>@for</code> directive uses a starting and ending value to loop a certain number of times. Sass also offers the <code>@each</code> directive which loops over each item in a list or map.",
+        "On each iteration, the variable gets assigned to the current value from the list or map.",
+        "<blockquote>@each $color in blue, red, green {<br>&nbsp;&nbsp;.#{$color}-text {color: $color;}<br>}</blockquote>",
+        "A map has slightly different syntax. Here's an example:",
+        "<blockquote>$colors: (color1: blue, color2: red, color3: green);<br><br>@each $key, $color in $colors {<br>&nbsp;&nbsp;.#{$color}-text {color: $color;}<br>}</blockquote>",
+        "Note that the <code>$key</code> variable is needed to reference the keys in the map. Otherwise, the compiled CSS would have <code>color1</code>, <code>color2</code>... in it.",
+        "Both of the above code examples are converted into the following CSS:",
+        "<blockquote>.blue-text {<br>&nbsp;&nbsp;color: blue;<br>}<br><br>.red-text {<br>&nbsp;&nbsp;color: red;<br>}<br><br>.green-text {<br>&nbsp;&nbsp;color: green;<br>}</blockquote>",
+        "<hr>",
+        "Write an <code>@each</code> directive that goes through a list: <code>blue, black, red</code> and assigns each variable to a <code>.color-bg</code> class, where the \"color\" part changes for each item.",
+        "Each class should set the <code>background-color</code> the respective color."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  ",
+        "  div {",
+        "    height: 200px;",
+        "    width: 200px;",
+        "  }",
+        "</style>",
+        "",
+        "<div class=\"blue-bg\"></div>",
+        "<div class=\"black-bg\"></div>",
+        "<div class=\"red-bg\"></div>"
+      ],
+      "tests": [
+        "assert(code.match(/@each /g), 'message: Your code should use the <code>@each</code> directive.');",
+        "assert($('blue-bg').css('background-color') == 'rgb(0, 0, 255)', 'message: Your <code>.blue-bg</code> class should have a <code>background-color</code> of blue.');",
+        "assert($('black-bg').css('background-color') == 'rgb(0, 0, 0)', 'message: Your <code>.black-bg</code> class should have a <code>background-color</code> of black.');",
+        "assert($('red-bg').css('background-color') == 'rgb(255, 0, 0)', 'message: Your <code>.red-bg</code> class should have a <code>background-color</code> of red.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbf367417b2b2512bbb",
+      "title": "Apply a Style Until a Condition is Met with @while",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "The <code>@while</code> directive is an option with similar functionality to the JavaScript <code>while</code> loop. It creates CSS rules until a condition is met.",
+        "The <code>@for</code> challenge gave an example to create a simple grid system. This can also work with <code>@while</code>.",
+        "<blockquote>$x: 1;<br>@while $x < 13 {<br>&nbsp;&nbsp;.col-#{$x} { width: 100%/12 * $x;}<br>&nbsp;&nbsp;$x: $x + 1;<br>}</blockquote>",
+        "First, define a variable <code>$x</code> and set it to 1. Next, use the <code>@while</code> directive to create the grid system <i>while</i> <code>$x</code> is less than 13.",
+        "After setting the CSS rule for <code>width</code>, <code>$x</code> is incremented by 1 to avoid an infinite loop.",
+        "<hr>",
+        "Use <code>@while</code> to create a series of classes with different <code>font-sizes</code>.",
+        "There should be 10 different classes from <code>text-1</code> to <code>text-10</code>. Then set <code>font-size</code> to 5px multiplied by the current index number. Make sure to avoid an infinite loop!"
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "",
+        "<p class=\"text-1\">Hello</p>",
+        "<p class=\"text-2\">Hello</p>",
+        "<p class=\"text-3\">Hello</p>",
+        "<p class=\"text-4\">Hello</p>",
+        "<p class=\"text-5\">Hello</p>",
+        "<p class=\"text-6\">Hello</p>",
+        "<p class=\"text-7\">Hello</p>",
+        "<p class=\"text-8\">Hello</p>",
+        "<p class=\"text-9\">Hello</p>",
+        "<p class=\"text-10\">Hello</p>"
+      ],
+      "tests": [
+        "assert(code.match(/@while /g), 'message: Your code should use the <code>@while</code> directive.');",
+        "assert(code.match(/\\$.*:\\s*?1;/gi), 'message: Your code should set an index variable to 1 to start.');",
+        "assert(code.match(/\\$(.*):\\s*?\\$\\1\\s*?\\+\\s*?1;/gi), 'message: Your code should increment the counter variable.');",
+        "assert($('.text-1').css('font-size') == '5px', 'message: Your <code>.text-1</code> class should have a <code>font-size</code> of 5px.');",
+        "assert($('.text-2').css('font-size') == '10px', 'message: Your <code>.text-2</code> class should have a <code>font-size</code> of 10px.');",
+        "assert($('.text-3').css('font-size') == '15px', 'message: Your <code>.text-3</code> class should have a <code>font-size</code> of 15px.');",
+        "assert($('.text-4').css('font-size') == '20px', 'message: Your <code>.text-4</code> class should have a <code>font-size</code> of 20px.');",
+        "assert($('.text-5').css('font-size') == '25px', 'message: Your <code>.text-5</code> class should have a <code>font-size</code> of 25px.');",
+        "assert($('.text-6').css('font-size') == '30px', 'message: Your <code>.text-6</code> class should have a <code>font-size</code> of 30px.');",
+        "assert($('.text-7').css('font-size') == '35px', 'message: Your <code>.text-7</code> class should have a <code>font-size</code> of 35px.');",
+        "assert($('.text-8').css('font-size') == '40px', 'message: Your <code>.text-8</code> class should have a <code>font-size</code> of 40px.');",
+        "assert($('.text-9').css('font-size') == '45px', 'message: Your <code>.text-9</code> class should have a <code>font-size</code> of 45px.');",
+        "assert($('.text-10').css('font-size') == '50px', 'message: Your <code>.text-10</code> class should have a <code>font-size</code> of 50px.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7dbf367417b2b2512bbc",
+      "title": "Split Your Styles into Smaller Chunks with Partials",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "<code>Partials</code> in Sass are separate files that hold segments of CSS code. These are imported and used in other Sass files. This is a great way to group similar code into a module to keep it organized.",
+        "Names for <code>partials</code> start with the underscore (<code>_</code>) character, which tells Sass it is a small segment of CSS and not to convert it into a CSS file. Also, Sass files end with the <code>.scss</code> file extension. To bring the code in the <code>partial</code> into another Sass file, use the <code>@import</code> directive.",
+        "For example, if all your <code>mixins</code> are saved in a <code>partial</code> named \"_mixins.scss\", and they are needed in the \"main.scss\" file, this is how to use them in the main file:",
+        "<blockquote>// In the main.scss file<br><br>@import 'mixins'</blockquote>",
+        "Note that the underscore is not needed in the <code>import</code> statement - Sass understands it is a <code>partial</code>. Once a <code>partial</code> is imported into a file, all variables, <code>mixins</code>, and other code are available to use.",
+        "<hr>",
+        "Write an <code>@import</code> statement to import a <code>partial</code> named <code>_variables.scss</code> into the main.scss file."
+      ],
+      "challengeSeed": [
+        "// The main.scss file",
+        "",
+        "",
+        "",
+        ""
+      ],
+      "tests": [
+        "assert(code.match(/@import\\s+?('|\")variables\\1/gi), 'message: Your code should use the <code>@import</code> directive, and should not include the underscore in the file name.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa5367417b2b2512bbd",
+      "title": "Extend One Set of CSS Styles to Another Element",
+      "required": [
+        {
+          "link": "https://cdnjs.cloudflare.com/ajax/libs/sass.js/0.9.13/sass.min.js",
+          "raw": true
+        }
+      ],
+      "description": [
+        "Sass has a feature called <code>extend</code> that makes it easy to borrow the CSS rules from one element and build upon them in another.",
+        "For example, the below block of CSS rules style a <code>.panel</code> class. It has a <code>background-color</code>, <code>height</code> and <code>border</code>.",
+        "<blockquote>.panel{<br>&nbsp;&nbsp;background-color: red;<br>&nbsp;&nbsp;height: 70px;<br>&nbsp;&nbsp;border: 2px solid green;<br>}</blockquote>",
+        "Now you want another panel called <code>.big-panel</code>. It has the same base properties as <code>.panel</code>, but also needs a <code>width</code> and <code>font-size</code>.",
+        "It's possible to copy and paste the initial CSS rules from <code>.panel</code>, but the code becomes repetitive as you add more types of panels.",
+        "The <code>extend</code> directive is a simple way to reuse the rules written for one element, then add more for another:",
+        "<blockquote>.big-panel{<br>&nbsp;&nbsp;@extend .panel;<br>&nbsp;&nbsp;width: 150px;<br>&nbsp;&nbsp;font-size: 2em;<br>}</blockquote>",
+        "The <code>.big-panel</code> will have the same properties as <code>.panel</code> in addition to the new styles.",
+        "<hr>",
+        "Make a class <code>.info-important</code> that extends <code>.info</code> and also has a <code>background-color</code> set to magenta."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  h3{",
+        "    text-align: center;",
+        "  }",
+        "  .info{",
+        "    width: 200px;",
+        "    border: 1px solid black;",
+        "    margin: 0 auto;",
+        "  }",
+        "  ",
+        "  ",
+        "  ",
+        "  ",
+        "</style>",
+        "<h3>Posts</h3>",
+        "<div class=\"info-important\">",
+        "  <p>This is an important post. It should extend the class \".info\" and have its own CSS styles.</p>",
+        "</div>",
+        "",
+        "<div class=\"info\">",
+        "  <p>This is a simple post. It has basic styling and can be extended for other uses.</p>",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/@extend\\s+?\\.info/g), 'message: Your code should use the <code>@extend</code> directive to extend the <code>info</code> class.');",
+        "assert($('.info-important').css('background-color') == 'rgb(255, 0, 255)', 'message: Your <code>info-important</code> class should have a <code>background-color</code> set to magenta.');",
+        "assert($('.info-important').css('width') == '200px', 'message: Your <code>info-important</code> class should inherit the styling from the <code>info</code> class.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/04-data-visualization/claim-your-data-visualization-certificate.json b/seed/math-challenges/04-data-visualization/claim-your-data-visualization-certificate.json
new file mode 100644
index 0000000000..c123358ce2
--- /dev/null
+++ b/seed/math-challenges/04-data-visualization/claim-your-data-visualization-certificate.json
@@ -0,0 +1,108 @@
+{
+  "name": "Claim Your Data Visualization Certificate",
+  "order": 13,
+  "time": "5 minutes",
+  "challenges": [
+    {
+      "id": "587d7fa5367417b2b2512bbe",
+      "title": "Claim Your Data Visualization Certificate",
+      "description": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "An image of our Data Visualization Certificate",
+          "This challenge will give you your verified Data Visualization Certificate. Before we issue your certificate, we must verify that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. You must also accept our Academic Honesty Pledge. Click the button below to start this process.",
+          ""
+        ],
+        [
+          "//i.imgur.com/uLPsUko.jpg",
+          "The definition of plagiarism: Plagiarism (noun) - copying someone else’s work and presenting it as your own without crediting them",
+          "By clicking below, you pledge that all of your submitted code A) is code you or your pair personally wrote, or B) comes from open source libraries like jQuery, or C) has been clearly attributed to its original authors. You also give us permission to audit your challenge solutions and revoke your certificate if we discover evidence of plagiarism.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/UedoV2G.jpg",
+          "An image of the text \"Front End Development Certificate requirements\"",
+          "Let's confirm that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. Click the button below to verify this.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/Q5Za9U6.jpg",
+          "An image of the word \"Congratulations\"",
+          "Congratulations! We've added your Data Visualization Certificate to your portfolio page. Unless you choose to hide your solutions, this certificate will remain publicly visible and verifiable.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        {
+          "properties": [
+            "isHonest",
+            "isFrontEndCert"
+          ],
+          "apis": [
+            "/certificate/honest",
+            "/certificate/verify/front-end"
+          ],
+          "stepIndex": [
+            1,
+            2
+          ]
+        }
+      ],
+      "tests": [
+        {
+          "id": "587d7fa6367417b2b2512bc0",
+          "title": "Visualize Data with a Treemap Diagram"
+        },
+        {
+          "id": "587d7fa6367417b2b2512bbf",
+          "title": "Visualize Data with a Choropleth Map"
+        },
+        {
+          "id": "bd7188d8c242eddfaeb5bd13",
+          "title": "Visualize Data with a Heat Map"
+        },
+        {
+          "id": "bd7178d8c242eddfaeb5bd13",
+          "title": "Visualize Data with a Scatterplot Graph"
+        },
+        {
+          "id": "bd7168d8c242eddfaeb5bd13",
+          "title": "Visualize Data with a Bar Chart"
+        }
+      ],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "es": {
+          "title": "Reclama tu certificado de Desarrollo de interfaces",
+          "description": [
+            [
+              "//i.imgur.com/k8btNUB.jpg",
+              "Una imagen que muestra nuestro certificado de Desarrollo de interfaces",
+              "Este desafío te otorga tu certificado autenticado de Desarrollo de interfaces. Antes de que podamos emitir tu certificado, debemos verificar que has completado todos los desafíos básicos e intermedios de diseño de algoritmos, y todos los proyectos básicos e intermedios de desarrollo de interfaces. También debes aceptar nuestro Juramento de honestidad académica. Pulsa el botón siguiente para iniciar este proceso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/HArFfMN.jpg",
+              "Plagio (nombre): acción y efecto de plagiar. Plagiar (verbo) - copiar en lo sustancial obras ajenas, dándolas como propias.",
+              "Al pulsar el botón siguiente, juras que todo el código en tus soluciones a los desafíos A) es código que tú o tu compañero escribieron personalmente, o B) proviene de librerías de código abierto como jQuery, o C) ha sido claramente atribuido a sus autores originales. También nos otorgas el permiso para auditar tus soluciones a los desafíos y revocar tu certificado si encontramos evidencia de plagio.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/14F2Van.jpg",
+              "Una imagen del texto \"Front End Development Certificate requirements\"",
+              "Confirmemos que has completado todos nuestros desafíos básicos e intermedios de diseño de algoritmos, y todos nuestros proyectos básicos e intermedios de desarrollo de interfaces. Pulsa el botón siguiente para hacer la verificación.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/16SIhHO.jpg",
+              "Una imagen de la palabra \"Congratulations\"",
+              "¡Felicitaciones! Hemos agregado tu certificado de Desarrollo de interfaces a tu portafolio. A menos que elijas no mostrar tus soluciones, este certificado será públicamente visible y verificable.",
+              ""
+            ]
+          ]
+        }
+      }
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/04-data-visualization/data-visualization-projects.json b/seed/math-challenges/04-data-visualization/data-visualization-projects.json
new file mode 100644
index 0000000000..4ab0de7a43
--- /dev/null
+++ b/seed/math-challenges/04-data-visualization/data-visualization-projects.json
@@ -0,0 +1,128 @@
+{
+  "name": "Data Visualization Projects",
+  "order": 3,
+  "time": "150 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "bd7168d8c242eddfaeb5bd13",
+      "title": "Visualize Data with a Bar Chart",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='https://codepen.io/freeCodeCamp/full/GrZVaM' target='_blank'>working example</a>. Try not to look at its code.",
+        "Here is the dataset you will need to complete this project: <code>https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/GDP-data.json</code>",
+        "You can build your project by forking <a href='https://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>.",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "challengeSeed": [
+        "G6iPE6W"
+      ],
+      "tests": [],
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Visualiza datos utilizando un gráfico de barras",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7178d8c242eddfaeb5bd13",
+      "title": "Visualize Data with a Scatterplot Graph",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='https://codepen.io/freeCodeCamp/full/bgpXyK' target='_blank'>working example</a>. Try not to look at its code.",
+        "Here is the dataset you will need to complete this project: <code>https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/cyclist-data.json</code>",
+        "You can build your project by forking <a href='https://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "challengeSeed": [
+        "opubu3f"
+      ],
+      "tests": [],
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Visualiza datos utilizando un gráfico de dispersión",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7188d8c242eddfaeb5bd13",
+      "title": "Visualize Data with a Heat Map",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='https://codepen.io/freeCodeCamp/full/JEXgeY' target='_blank'>working example</a>. Try not to look at its code.",
+        "Here is the dataset you will need to complete this project: <code>https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/global-temperature.json</code>",
+        "You can build your project by forking <a href='https://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "challengeSeed": [
+        "s4XtjKa"
+      ],
+      "tests": [],
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Visualiza datos utilizando un mapa de calor",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "587d7fa6367417b2b2512bbf",
+      "title": "Visualize Data with a Choropleth Map",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='https://codepen.io/freeCodeCamp/full/EZKqza' target='_blank'>working example</a>. Try not to look at its code.",
+        "Here are the datasets you will need to complete this project:<br><ul><li><strong>US Education Data: </strong><code>https://raw.githubusercontent.com/no-stack-dub-sack/testable-projects-fcc/master/src/data/choropleth_map/for_user_education.json</code></li><li><strong>US County Data: </strong><code>https://raw.githubusercontent.com/no-stack-dub-sack/testable-projects-fcc/master/src/data/choropleth_map/counties.json</code></li></ul>",
+        "You can build your project by forking <a href='https://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "challengeSeed": [
+        "K3qqL7U"
+      ],
+      "tests": [],
+      "isRequired": true,
+      "releasedOn": "February 17, 2017",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa6367417b2b2512bc0",
+      "title": "Visualize Data with a Treemap Diagram",
+      "description": [
+        "Fulfill the user stories by getting all of the tests to pass. Use whichever libraries you need. Give it your own personal style.",
+        "Here's a <a href='https://codepen.io/freeCodeCamp/full/KaNGNR' target='_blank'>working example</a>. Try not to look at its code.",
+        "For this project you can use any of the following datasets:<br><ul><li><strong>Kickstarter Pledges:</strong> <code>https://cdn.rawgit.com/freeCodeCamp/testable-projects-fcc/a80ce8f9/src/data/tree_map/kickstarter-funding-data.json</code></li><li><strong>Movie Sales:</strong> <code>https://cdn.rawgit.com/freeCodeCamp/testable-projects-fcc/a80ce8f9/src/data/tree_map/movie-data.json</code></li><li><strong>Video Game Sales:</strong> <code>https://cdn.rawgit.com/freeCodeCamp/testable-projects-fcc/a80ce8f9/src/data/tree_map/video-game-sales-data.json</code></li></ul>",
+        "You can build your project by forking <a href='https://codepen.io/freeCodeCamp/pen/MJjpwO' target='_blank'>this CodePen pen</a>. Or you can use this CDN link to run the tests in any environment you like: <code>https://gitcdn.link/repo/freeCodeCamp/testable-projects-fcc/master/build/bundle.js</code>",
+        "Once you're done, submit the URL to your working project with all its tests passing.",
+        "Remember to use the <a href='https://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> method if you get stuck."
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [],
+      "isRequired": true,
+      "releasedOn": "February 17, 2017",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {}
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/04-data-visualization/data-visualization-with-d3.json b/seed/math-challenges/04-data-visualization/data-visualization-with-d3.json
new file mode 100644
index 0000000000..ae49cd25d5
--- /dev/null
+++ b/seed/math-challenges/04-data-visualization/data-visualization-with-d3.json
@@ -0,0 +1,1804 @@
+{
+  "name": "Data Visualization with D3",
+  "order": 1,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7fa6367417b2b2512bc1",
+      "title": "Introduction to the Data Visualization with D3 Challenges",
+      "description": [
+        [
+          "http://imgs.xkcd.com/comics/movie_narrative_charts.png",
+          "XKCD web comic showing very detailed charts of movie character interactions for Lord of the Rings, Star Wars (original trilogy), Jurassic Park, 12 Angry Men, and Primer. The charts show grouped lines, representing when characters appear together, over time.",
+          "D3.js, or D3, stands for Data Driven Documents. D3 is a JavaScript library to create dynamic and interactive data visualizations in the browser. It's built to work with common web standards, namely HTML, CSS, and Scalable Vector Graphics (SVG).<br><br>D3 takes input data and maps it into a visual representation of that data. It supports many different data formats. D3 lets you bind (or attach) the data to the Document Object Model (DOM). You use HTML or SVG elements with D3's built-in methods to transform the data into a visualization.<br><br>D3 gives you a lot of control over the presentation of data. This section covers the basic functionality and how to create visualizations with the D3 library.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa6367417b2b2512bc2",
+      "title": "Add Document Elements with D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "D3 has several methods that let you add and change elements in your document.",
+        "The <code>select()</code> method selects one element from the document. It takes an argument for the name of the element you want and returns an HTML node for the first element in the document that matches the name. Here's an example:",
+        "<code>const anchor = d3.select(\"a\");</code>",
+        "The above example finds the first anchor tag on the page and saves an HTML node for it in the variable <code>anchor</code>. You can use the selection with other methods. The \"d3\" part of the example is a reference to the D3 object, which is how you access D3 methods.",
+        "Two other useful methods are <code>append()</code> and <code>text()</code>.",
+        "The <code>append()</code> method takes an argument for the element you want to add to the document. It appends an HTML node to a selected item, and returns a handle to that node.",
+        "The <code>text()</code> method either sets the text of the selected node, or gets the current text. To set the value, you pass a string as an argument inside the parentheses of the method.",
+        "Here's an example that selects an unordered list, appends a list item, and adds text:",
+        "<blockquote>d3.select(\"ul\")<br>    .append(\"li\")<br>    .text(\"Very important item\");</blockquote>",
+        "D3 allows you to chain several methods together with periods to perform a number of actions in a row.",
+        "<hr>",
+        "Use the <code>select</code> method to select the <code>body</code> tag in the document. Then <code>append</code> an <code>h1</code> tag to it, and add the text \"Learning D3\" into the <code>h1</code> element."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    // Add your code below this line",
+        "    ",
+        "    ",
+        "    ",
+        "    // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('body').children('h1').length == 1, 'message: The <code>body</code> should have one <code>h1</code> element.');",
+        "assert($('h1').text() == \"Learning D3\", 'message: The <code>h1</code> element should have the text \"Learning D3\" in it.');",
+        "assert(code.match(/d3/g), 'message: Your code should access the <code>d3</code> object.');",
+        "assert(code.match(/\\.select/g), 'message: Your code should use the <code>select</code> method.');",
+        "assert(code.match(/\\.append/g), 'message: Your code should use the <code>append</code> method.');",
+        "assert(code.match(/\\.text/g), 'message: Your code should use the <code>text</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa6367417b2b2512bc3",
+      "title": "Select a Group of Elements with D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "D3 also has the <code>selectAll()</code> method to select a group of elements. It returns an array of HTML nodes for all the items in the document that match the input string. Here's an example to select all the anchor tags in a document:",
+        "<code>const anchors = d3.selectAll(\"a\");</code>",
+        "Like the <code>select()</code> method, <code>selectAll()</code> supports method chaining, and you can use it with other methods.",
+        "<hr>",
+        "Select all of the <code>li</code> tags in the document, and change their text to \"list item\"."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <ul>",
+        "    <li>Example</li>",
+        "    <li>Example</li>",
+        "    <li>Example</li>",
+        "  </ul>",
+        "  <script>",
+        "    // Add your code below this line",
+        "    ",
+        "    ",
+        "    ",
+        "    // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('li').text().match(/list item/g).length == 3, 'message: There should be 3 <code>li</code> elements on the page, and the text in each one should say \"list item\". Capitalization and spacing should match exactly.');",
+        "assert(code.match(/d3/g), 'message: Your code should access the <code>d3</code> object.');",
+        "assert(code.match(/\\.selectAll/g), 'message: Your code should use the <code>selectAll</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa7367417b2b2512bc4",
+      "title": "Work with Data in D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The D3 library focuses on a data-driven approach. When you have a set of data, you can apply D3 methods to display it on the page. Data comes in many formats, but this challenge uses a simple array of numbers.",
+        "The first step is to make D3 aware of the data. The <code>data()</code> method is used on a selection of DOM elements to attach the data to those elements. The data set is passed as an argument to the method.",
+        "A common workflow pattern is to create a new element in the document for each piece of data in the set. D3 has the <code>enter()</code> method for this purpose.",
+        "When <code>enter()</code> is combined with the <code>data()</code> method, it looks at the selected elements from the page and compares them to the number of data items in the set. If there are fewer elements than data items, it creates the missing elements.",
+        "Here is an example that selects a <code>ul</code> element and creates a new list item based on the number of entries in the array:",
+        "<blockquote>&lt;body&gt;<br>  &lt;ul&gt;&lt;/ul&gt;<br>  &lt;script&gt;<br>    const dataset = [\"a\", \"b\", \"c\"];<br>    d3.select(\"ul\").selectAll(\"li\")<br>      .data(dataset)<br>      .enter()<br>      .append(\"li\")<br>      .text(\"New item\");<br>  &lt;/script&gt;<br>&lt;/body&gt;</blockquote>",
+        "It may seem confusing to select elements that don't exist yet. This code is telling D3 to first select the <code>ul</code> on the page. Next, select all list items, which returns an empty selection. Then the <code>data()</code> method reviews the dataset and runs the following code three times, once for each item in the array. The <code>enter()</code> method sees there are no <code>li</code> elements on the page, but it needs 3 (one for each piece of data in <code>dataset</code>). New <code>li</code> elements are appended to the <code>ul</code> and have the text \"New item\".",
+        "<hr>",
+        "Select the <code>body</code> node, then select all <code>h2</code> elements. Have D3 create and append an <code>h2</code> tag for each item in the <code>dataset</code> array. The text in the <code>h2</code> should say \"New Title\". Your code should use the <code>data()</code> and <code>enter()</code> methods."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    // Add your code below this line",
+        "    ",
+        "    ",
+        "    ",
+        "    // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').length == 9, 'message: Your document should have 9 <code>h2</code> elements.');",
+        "assert($('h2').text().match(/New Title/g).length == 9, 'message: The text in the <code>h2</code> elements should say \"New Title\". The capitalization and spacing should match exactly.');",
+        "assert(code.match(/\\.data/g), 'message: Your code should use the <code>data()</code> method.');",
+        "assert(code.match(/\\.enter/g), 'message: Your code should use the <code>enter()</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa7367417b2b2512bc5",
+      "title": "Work with Dynamic Data in D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The last couple challenges covered the tools used to display dynamic data. They introduced the <code>data()</code> and <code>enter()</code> methods. These functions take a data set, then for each item in the set, create a new element with that piece of data attached to it.",
+        "The last challenge created a new <code>h2</code> for each item in the data array, but it displayed the same text (\"New Title\") for each heading. Fortunately, there is a way to access and display the actual data with callback functions.",
+        "The <code>text()</code> method can take a string or a callback function as an argument. Since the data from the <code>dataset</code> array is attached to each element, the callback function has access to it. The parameter used in the callback function (<code>d</code> in the example below) is for the individual data-point itself. This callback function would set the text in the selection to the data value:",
+        "<code>selection.text((d) => d)</code>",
+        "<hr>",
+        "Change the <code>text()</code> method so it does not place \"New Title\" in each heading. Instead, it displays the data from the array with a space and \"USD\". For example, the first heading should say \"12 USD\"."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    d3.select(\"body\").selectAll(\"h2\")",
+        "      .data(dataset)",
+        "      .enter()",
+        "      .append(\"h2\")",
+        "      // Add your code below this line",
+        "      ",
+        "      .text(\"New Title\");",
+        "      ",
+        "      // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').eq(0).text() == \"12 USD\", 'message: The first <code>h2</code> should have the text \"12 USD\".');",
+        "assert($('h2').eq(1).text() == \"31 USD\", 'message: The second <code>h2</code> should have the text \"31 USD\".');",
+        "assert($('h2').eq(2).text() == \"22 USD\", 'message: The third <code>h2</code> should have the text \"22 USD\".');",
+        "assert($('h2').eq(3).text() == \"17 USD\", 'message: The fourth <code>h2</code> should have the text \"17 USD\".');",
+        "assert($('h2').eq(4).text() == \"25 USD\", 'message: The fifth <code>h2</code> should have the text \"25 USD\".');",
+        "assert($('h2').eq(5).text() == \"18 USD\", 'message: The sixth <code>h2</code> should have the text \"18 USD\".');",
+        "assert($('h2').eq(6).text() == \"29 USD\", 'message: The seventh <code>h2</code> should have the text \"29 USD\".');",
+        "assert($('h2').eq(7).text() == \"14 USD\", 'message: The eighth <code>h2</code> should have the text \"14 USD\".');",
+        "assert($('h2').eq(8).text() == \"9 USD\", 'message: The ninth <code>h2</code> should have the text \"9 USD\".');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa7367417b2b2512bc6",
+      "title": "Add Inline Styling to Elements",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "D3 lets you add inline CSS styles on dynamic elements with the <code>style()</code> method.",
+        "The <code>style()</code> method takes a comma-separated key-value pair as an argument. Here's an example to set the selection's text color to blue:",
+        "<code>selection.style(\"color\",\"blue\");</code>",
+        "<hr>",
+        "Add the <code>style()</code> method to the code in the editor to make all the displayed text have a <code>font-family</code> of <code>verdana</code>."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    d3.select(\"body\").selectAll(\"h2\")",
+        "      .data(dataset)",
+        "      .enter()",
+        "      .append(\"h2\")",
+        "      .text((d) => (d + \" USD\"))",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').css('font-family') == 'verdana', 'message: Your <code>h2</code> elements should have a <code>font-family</code> of verdana.');",
+        "assert(code.match(/\\.style/g), 'message: Your code should use the <code>style()</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa7367417b2b2512bc7",
+      "title": "Change Styles Based on Data",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "D3 is about visualization and presentation of data. It's likely you'll want to change the styling of elements based on the data. You can use a callback function in the <code>style()</code> method to change the styling for different elements.",
+        "For example, you may want to color a data point blue if has a value less than 20, and red otherwise. You can use a callback function in the <code>style()</code> method and include the conditional logic. The callback function uses the <code>d</code> parameter to represent the data point:",
+        "<blockquote>selection.style(\"color\", (d) => {<br>  /* Logic that returns the color based on a condition */<br>});</blockquote>",
+        "The <code>style()</code> method is not limited to setting the <code>color</code> - it can be used with other CSS properties as well.",
+        "<hr>",
+        "Add the <code>style()</code> method to the code in the editor to set the <code>color</code> of the <code>h2</code> elements conditionally. Write the callback function so if the data value is less than 20, it returns \"red\", otherwise it returns \"green\".",
+        "<strong>Note</strong><br>You can use if-else logic, or the ternary operator."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    d3.select(\"body\").selectAll(\"h2\")",
+        "      .data(dataset)",
+        "      .enter()",
+        "      .append(\"h2\")",
+        "      .text((d) => (d + \" USD\"))",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').eq(0).css('color') == \"rgb(255, 0, 0)\", 'message: The first <code>h2</code> should have a <code>color</code> of red.');",
+        "assert($('h2').eq(1).css('color') == \"rgb(0, 128, 0)\", 'message: The second <code>h2</code> should have a <code>color</code> of green.');",
+        "assert($('h2').eq(2).css('color') == \"rgb(0, 128, 0)\", 'message: The third <code>h2</code> should have a <code>color</code> of green.');",
+        "assert($('h2').eq(3).css('color') == \"rgb(255, 0, 0)\", 'message: The fourth <code>h2</code> should have a <code>color</code> of red.');",
+        "assert($('h2').eq(4).css('color') == \"rgb(0, 128, 0)\", 'message: The fifth <code>h2</code> should have a <code>color</code> of green.');",
+        "assert($('h2').eq(5).css('color') == \"rgb(255, 0, 0)\", 'message: The sixth <code>h2</code> should have a <code>color</code> of red.');",
+        "assert($('h2').eq(6).css('color') == \"rgb(0, 128, 0)\", 'message: The seventh <code>h2</code> should have a <code>color</code> of green.');",
+        "assert($('h2').eq(7).css('color') == \"rgb(255, 0, 0)\", 'message: The eighth <code>h2</code> should have a <code>color</code> of red.');",
+        "assert($('h2').eq(8).css('color') == \"rgb(255, 0, 0)\", 'message: The ninth <code>h2</code> should have a <code>color</code> of red.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa7367417b2b2512bc8",
+      "title": "Add Classes with D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "Using a lot of inline styles on HTML elements gets hard to manage, even for smaller apps. It's easier to add a class to elements and style that class one time using CSS rules. D3 has the <code>attr()</code> method to add any HTML attribute to an element, including a class name.",
+        "The <code>attr()</code> method works the same way that <code>style()</code> does. It takes comma-separated values, and can use a callback function. Here's an example to add a class of \"container\" to a selection:",
+        "<code>selection.attr(\"class\", \"container\");</code>",
+        "<hr>",
+        "Add the <code>attr()</code> method to the code in the editor and put a class of <code>bar</code> on the <code>div</code> elements."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .bar {",
+        "    width: 25px;",
+        "    height: 100px;",
+        "    display: inline-block;",
+        "    background-color: blue;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    d3.select(\"body\").selectAll(\"div\")",
+        "      .data(dataset)",
+        "      .enter()",
+        "      .append(\"div\")",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('div').attr('class') == \"bar\", 'message: Your <code>div</code> elements should have a class of <code>bar</code>.');",
+        "assert(code.match(/\\.attr/g), 'message: Your code should use the <code>attr()</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa8367417b2b2512bc9",
+      "title": "Update the Height of an Element Dynamically",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The previous challenges covered how to display data from an array and how to add CSS classes. You can combine these lessons to create a simple bar chart. There are two steps to this:",
+        "1) Create a <code>div</code> for each data point in the array",
+        "2) Give each <code>div</code> a dynamic height, using a callback function in the <code>style()</code> method that sets height equal to the data value",
+        "Recall the format to set a style using a callback function:",
+        "<code>selection.style(\"cssProperty\", (d) => d)</code>",
+        "<hr>",
+        "Add the <code>style()</code> method to the code in the editor to set the <code>height</code> property for each element. Use a callback function to return the value of the data point with the string \"px\" added to it."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .bar {",
+        "    width: 25px;",
+        "    height: 100px;",
+        "    display: inline-block;",
+        "    background-color: blue;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    d3.select(\"body\").selectAll(\"div\")",
+        "      .data(dataset)",
+        "      .enter()",
+        "      .append(\"div\")",
+        "      .attr(\"class\", \"bar\")",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('div').eq(0).css('height') == '12px', 'message: The first <code>div</code> should have a <code>height</code> of 12 pixels.');",
+        "assert($('div').eq(1).css('height') == '31px', 'message: The second <code>div</code> should have a <code>height</code> of 31 pixels.');",
+        "assert($('div').eq(2).css('height') == '22px', 'message: The third <code>div</code> should have a <code>height</code> of 22 pixels.');",
+        "assert($('div').eq(3).css('height') == '17px', 'message: The fourth <code>div</code> should have a <code>height</code> of 17 pixels.');",
+        "assert($('div').eq(4).css('height') == '25px', 'message: The fifth <code>div</code> should have a <code>height</code> of 25 pixels.');",
+        "assert($('div').eq(5).css('height') == '18px', 'message: The sixth <code>div</code> should have a <code>height</code> of 18 pixels.');",
+        "assert($('div').eq(6).css('height') == '29px', 'message: The seventh <code>div</code> should have a <code>height</code> of 29 pixels.');",
+        "assert($('div').eq(7).css('height') == '14px', 'message: The eighth <code>div</code> should have a <code>height</code> of 14 pixels.');",
+        "assert($('div').eq(8).css('height') == '9px', 'message: The ninth <code>div</code> should have a <code>height</code> of 9 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa8367417b2b2512bca",
+      "title": "Change the Presentation of a Bar Chart",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The last challenge created a bar chart, but there are a couple of formatting changes that could improve it:",
+        "1) Add space between each bar to visually separate them, which is done by adding a margin to the CSS for the <code>bar</code> class",
+        "2) Increase the height of the bars to better show the difference in values, which is done by multiplying the value by a number to scale the height",
+        "<hr>",
+        "First, add a <code>margin</code> of 2px to the <code>bar</code> class in the <code>style</code> tag. Next, change the callback function in the <code>style()</code> method so it returns a value 10 times the original data value (plus the \"px\").",
+        "<strong>Note</strong><br>Multiplying each data point by the <em>same</em> constant only alters the scale. It's like zooming in, and it doesn't change the meaning of the underlying data."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .bar {",
+        "    width: 25px;",
+        "    height: 100px;",
+        "    /* Add your code below this line */",
+        "    ",
+        "    /* Add your code above this line */",
+        "    display: inline-block;",
+        "    background-color: blue;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    d3.select(\"body\").selectAll(\"div\")",
+        "      .data(dataset)",
+        "      .enter()",
+        "      .append(\"div\")",
+        "      .attr(\"class\", \"bar\")",
+        "      // Add your code below this line",
+        "      .style(\"height\", (d) => (d + \"px\"))",
+        "      ",
+        "      // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('div').eq(0).css('height') == '120px' && $('div').eq(0).css('margin-right') == '2px', 'message: The first <code>div</code> should have a <code>height</code> of 120 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(1).css('height') == '310px' && $('div').eq(1).css('margin-right') == '2px', 'message: The second <code>div</code> should have a <code>height</code> of 310 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(2).css('height') == '220px' && $('div').eq(2).css('margin-right') == '2px', 'message: The third <code>div</code> should have a <code>height</code> of 220 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(3).css('height') == '170px' && $('div').eq(3).css('margin-right') == '2px', 'message: The fourth <code>div</code> should have a <code>height</code> of 170 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(4).css('height') == '250px' && $('div').eq(4).css('margin-right') == '2px', 'message: The fifth <code>div</code> should have a <code>height</code> of 250 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(5).css('height') == '180px' && $('div').eq(5).css('margin-right') == '2px', 'message: The sixth <code>div</code> should have a <code>height</code> of 180 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(6).css('height') == '290px' && $('div').eq(6).css('margin-right') == '2px', 'message: The seventh <code>div</code> should have a <code>height</code> of 290 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(7).css('height') == '140px' && $('div').eq(7).css('margin-right') == '2px', 'message: The eighth <code>div</code> should have a <code>height</code> of 140 pixels and a <code>margin</code> of 2 pixels.');",
+        "assert($('div').eq(8).css('height') == '90px' && $('div').eq(8).css('margin-right') == '2px', 'message: The ninth <code>div</code> should have a <code>height</code> of 90 pixels and a <code>margin</code> of 2 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa8367417b2b2512bcb",
+      "title": "Learn About SVG in D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "SVG stands for <code>Scalable Vector Graphics</code>.",
+        "Here \"scalable\" means that, if you zoom in or out on an object, it would not appear pixelated. It scales with the display system, whether it's on a small mobile screen or a large TV monitor.",
+        "SVG is used to make common geometric shapes. Since D3 maps data into a visual representation, it uses SVG to create the shapes for the visualization. SVG shapes for a web page must go within an HTML <code>svg</code> tag.",
+        "CSS can be scalable when styles use relative units (such as <code>vh</code>, <code>vw</code>, or percentages), but using SVG is more flexible to build data visualizations.",
+        "<hr>",
+        "Add an <code>svg</code> node to the <code>body</code> using <code>append()</code>. Give it a <code>width</code> attribute set to the provided <code>w</code> constant and a <code>height</code> attribute set to the provided <code>h</code> constant using the <code>attr()</code> method for each. You'll see it in the output because there's a <code>background-color</code> of pink applied to it in the <code>style</code> tag.",
+        "<strong>Note</strong><br>Width and height attributes do not have units. This is the building block of scaling - the element will always have a 5:1 width to height ratio, no matter what the zoom level is."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  svg {",
+        "    background-color: pink;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  // Add your code below this line",
+        "                  ",
+        "                  ",
+        "                  ",
+        "                  // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('svg').length == 1, 'message: Your document should have 1 <code>svg</code> element.');",
+        "assert($('svg').attr('width') == '500', 'message: The <code>svg</code> element should have a <code>width</code> attribute set to 500.');",
+        "assert($('svg').attr('height') == '100', 'message: The <code>svg</code> element should have a <code>height</code> attribute set to 100.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa8367417b2b2512bcc",
+      "title": "Display Shapes with SVG",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The last challenge created an <code>svg</code> element with a given width and height, which was visible because it had a <code>background-color</code> applied to it in the <code>style</code> tag. The code made space for the given width and height.",
+        "The next step is to create a shape to put in the <code>svg</code> area. There are a number of supported shapes in SVG, such as rectangles and circles. They are used to display data. For example, a rectangle (<code>&lt;rect&gt;</code>) SVG shape could create a bar in a bar chart.",
+        "When you place a shape into the <code>svg</code> area, you can specify where it goes with <code>x</code> and <code>y</code> coordinates. The origin point of (0, 0) is in the upper-left corner. Positive vales for <code>x</code> push the shape to the right, and positive values for <code>y</code> push the shape down from the origin point.",
+        "To place a shape in the middle of the 500 (width) x 100 (height) <code>svg</code> from last challenge, the <code>x</code> coordinate would be 250 and the <code>y</code> coordinate would be 50.",
+        "An SVG <code>rect</code> has four attributes. There are the <code>x</code> and <code>y</code> coordinates for where it is placed in the <code>svg</code> area. It also has a <code>height</code> and <code>width</code> to specify the size.",
+        "<hr>",
+        "Add a <code>rect</code> shape to the <code>svg</code> using <code>append()</code>, and give it a <code>width</code> attribute of 25 and <code>height</code> attribute of 100. Also, give the <code>rect</code> <code>x</code> and <code>y</code> attributes each set to 0."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h)",
+        "                  // Add your code below this line",
+        "                  ",
+        "                  ",
+        "                  ",
+        "                  // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').length == 1, 'message: Your document should have 1 <code>rect</code> element.');",
+        "assert($('rect').attr('width') == '25', 'message: The <code>rect</code> element should have a <code>width</code> attribute set to 25.');",
+        "assert($('rect').attr('height') == '100', 'message: The <code>rect</code> element should have a <code>height</code> attribute set to 100.');",
+        "assert($('rect').attr('x') == '0', 'message: The <code>rect</code> element should have an <code>x</code> attribute set to 0.');",
+        "assert($('rect').attr('y') == '0', 'message: The <code>rect</code> element should have a <code>y</code> attribute set to 0.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa8367417b2b2512bcd",
+      "title": "Create a Bar for Each Data Point in the Set",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The last challenge added only one rectangle to the <code>svg</code> element to represent a bar. Here, you'll combine what you've learned so far about <code>data()</code>, <code>enter()</code>, and SVG shapes to create and append a rectangle for each data point in <code>dataset</code>.",
+        "A previous challenge showed the format for how to create and append a <code>div</code> for each item in <code>dataset</code>:",
+        "<blockquote>d3.select(\"body\").selectAll(\"div\")<br>  .data(dataset)<br>  .enter()<br>  .append(\"div\")</blockquote>",
+        "There are a few differences working with <code>rect</code> elements instead of <code>divs</code>. The <code>rects</code> must be appended to an <code>svg</code> element, not directly to the <code>body</code>. Also, you need to tell D3 where to place each <code>rect</code> within the <code>svg</code> area. The bar placement will be covered in the next challenge.",
+        "<hr>",
+        "Use the <code>data()</code>, <code>enter()</code>, and <code>append()</code> methods to create and append a <code>rect</code> for each item in <code>dataset</code>. The bars should display all on top of each other, this will be fixed in the next challenge."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "       .attr(\"x\", 0)",
+        "       .attr(\"y\", 0)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", 100);",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').length == 9, 'message: Your document should have 9 <code>rect</code> elements.');",
+        "assert(code.match(/\\.data/g), 'message: Your code should use the <code>data()</code> method.');",
+        "assert(code.match(/\\.enter/g), 'message: Your code should use the <code>enter()</code> method.');",
+        "assert(code.match(/\\.append/g), 'message: Your code should use the <code>append()</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa9367417b2b2512bce",
+      "title": "Dynamically Set the Coordinates for Each Bar",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The last challenge created and appended a rectangle to the <code>svg</code> element for each point in <code>dataset</code> to represent a bar. Unfortunately, they were all stacked on top of each other.",
+        "The placement of a rectangle is handled by the <code>x</code> and <code>y</code> attributes. They tell D3 where to start drawing the shape in the <code>svg</code> area. The last challenge set them each to 0, so every bar was placed in the upper-left corner.",
+        "For a bar chart, all of the bars should sit on the same vertical level, which means the <code>y</code> value stays the same (at 0) for all bars. The <code>x</code> value, however, needs to change as you add new bars. Remember that larger <code>x</code> values push items farther to the right. As you go through the array elements in <code>dataset</code>, the x value should increase.",
+        "The <code>attr()</code> method in D3 accepts a callback function to dynamically set that attribute. The callback function takes two arguments, one for the data point itself (usually <code>d</code>) and one for the index of the data point in the array. The second argument for the index is optional. Here's the format:",
+        "<blockquote>selection.attr(\"property\", (d, i) => {<br>  /* <br>  * d is the data point value<br>  * i is the index of the data point in the array<br>  */<br>})</blockquote>",
+        "It's important to note that you do NOT need to write a <code>for</code> loop or use <code>forEach()</code> to iterate over the items in the data set. Recall that the <code>data()</code> method parses the data set, and any method that's chained after <code>data()</code> is run once for each item in the data set.",
+        "<hr>",
+        "Change the <code>x</code> attribute callback function so it returns the index times 30.",
+        "<strong>Note</strong><br>Each bar has a width of 25, so increasing each <code>x</code> value by 30 adds some space between the bars. Any value greater than 25 would work in this example."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => {",
+        "         // Add your code below this line",
+        "         ",
+        "         ",
+        "         ",
+        "         // Add your code above this line",
+        "       })",
+        "       .attr(\"y\", 0)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", 100);",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').eq(0).attr('x') == '0', 'message: The first <code>rect</code> should have an <code>x</code> value of 0.');",
+        "assert($('rect').eq(1).attr('x') == '30', 'message: The second <code>rect</code> should have an <code>x</code> value of 30.');",
+        "assert($('rect').eq(2).attr('x') == '60', 'message: The third <code>rect</code> should have an <code>x</code> value of 60.');",
+        "assert($('rect').eq(3).attr('x') == '90', 'message: The fourth <code>rect</code> should have an <code>x</code> value of 90.');",
+        "assert($('rect').eq(4).attr('x') == '120', 'message: The fifth <code>rect</code> should have an <code>x</code> value of 120.');",
+        "assert($('rect').eq(5).attr('x') == '150', 'message: The sixth <code>rect</code> should have an <code>x</code> value of 150.');",
+        "assert($('rect').eq(6).attr('x') == '180', 'message: The seventh <code>rect</code> should have an <code>x</code> value of 180.');",
+        "assert($('rect').eq(7).attr('x') == '210', 'message: The eighth <code>rect</code> should have an <code>x</code> value of 210.');",
+        "assert($('rect').eq(8).attr('x') == '240', 'message: The ninth <code>rect</code> should have an <code>x</code> value of 240.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa9367417b2b2512bcf",
+      "title": "Dynamically Change the Height of Each Bar",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The height of each bar can be set to the value of the data point in the array, similar to how the <code>x</code> value was set dynamically.",
+        "<blockquote>selection.attr(\"property\", (d, i) => {<br>  /* <br>  * d is the data point value<br>  * i is the index of the data point in the array<br>  */<br>})</blockquote>",
+        "<hr>",
+        "Change the callback function for the <code>height</code> attribute to return the data value times 3.",
+        "<strong>Note</strong><br>Remember that multiplying all data points by the same constant scales the data (like zooming in). It helps to see the differences between bar values in this example."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", 0)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => {",
+        "         // Add your code below this line",
+        "         ",
+        "         ",
+        "         ",
+        "         // Add your code above this line",
+        "       });",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').eq(0).attr('height') == '36', 'message: The first <code>rect</code> should have a <code>height</code> of 36.');",
+        "assert($('rect').eq(1).attr('height') == '93', 'message: The second <code>rect</code> should have a <code>height</code> of 93.');",
+        "assert($('rect').eq(2).attr('height') == '66', 'message: The third <code>rect</code> should have a <code>height</code> of 66.');",
+        "assert($('rect').eq(3).attr('height') == '51', 'message: The fourth <code>rect</code> should have a <code>height</code> of 51.');",
+        "assert($('rect').eq(4).attr('height') == '75', 'message: The fifth <code>rect</code> should have a <code>height</code> of 75.');",
+        "assert($('rect').eq(5).attr('height') == '54', 'message: The sixth <code>rect</code> should have a <code>height</code> of 54.');",
+        "assert($('rect').eq(6).attr('height') == '87', 'message: The seventh <code>rect</code> should have a <code>height</code> of 87.');",
+        "assert($('rect').eq(7).attr('height') == '42', 'message: The eighth <code>rect</code> should have a <code>height</code> of 42.');",
+        "assert($('rect').eq(8).attr('height') == '27', 'message: The ninth <code>rect</code> should have a <code>height</code> of 27.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa9367417b2b2512bd0",
+      "title": "Invert SVG Elements",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "You may have noticed the bar chart looked like it's upside-down, or inverted. This is because of how SVG uses (x, y) coordinates.",
+        "In SVG, the origin point for the coordinates is in the upper-left corner. An <code>x</code> coordinate of 0 places a shape on the left edge of the SVG area. A <code>y</code> coordinate of 0 places a shape on the top edge of the SVG area. Higher <code>x</code> values push the rectangle to the right. Higher <code>y</code> values push the rectangle down.",
+        "To make the bars right-side-up, you need to change the way the <code>y</code> coordinate is calculated. It needs to account for both the height of the bar and the total height of the SVG area.",
+        "The height of the SVG area is 100. If you have a data point of 0 in the set, you would want the bar to start at the bottom of the SVG area (not the top). To do this, the <code>y</code> coordinate needs a value of 100. If the data point value were 1, you would start with a <code>y</code> coordinate of 100 to set the bar at the bottom. Then you need to account for the height of the bar of 1, so the final <code>y</code> coordinate would be 99.",
+        "The <code>y</code> coordinate that is <code>y = heightOfSVG - heightOfBar</code> would place the bars right-side-up.",
+        "<hr>",
+        "Change the callback function for the <code>y</code> attribute to set the bars right-side-up. Remember that the <code>height</code> of the bar is 3 times the data value <code>d</code>.",
+        "<strong>Note</strong><br>In general, the relationship is <code>y = h - m * d</code>, where <code>m</code> is the constant that scales the data points."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => {",
+        "         // Add your code below this line",
+        "         ",
+        "         ",
+        "         ",
+        "         // Add your code above this line",
+        "       })",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => 3 * d);",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').eq(0).attr('y') == h - (dataset[0] * 3), 'message: The first <code>rect</code> should have a <code>y</code> value of 64.');",
+        "assert($('rect').eq(1).attr('y') == h - (dataset[1] * 3), 'message: The second <code>rect</code> should have a <code>y</code> value of 7.');",
+        "assert($('rect').eq(2).attr('y') == h - (dataset[2] * 3), 'message: The third <code>rect</code> should have a <code>y</code> value of 34.');",
+        "assert($('rect').eq(3).attr('y') == h - (dataset[3] * 3), 'message: The fourth <code>rect</code> should have a <code>y</code> value of 49.');",
+        "assert($('rect').eq(4).attr('y') == h - (dataset[4] * 3), 'message: The fifth <code>rect</code> should have a <code>y</code> value of 25.');",
+        "assert($('rect').eq(5).attr('y') == h - (dataset[5] * 3), 'message: The sixth <code>rect</code> should have a <code>y</code> value of 46.');",
+        "assert($('rect').eq(6).attr('y') == h - (dataset[6] * 3), 'message: The seventh <code>rect</code> should have a <code>y</code> value of 13.');",
+        "assert($('rect').eq(7).attr('y') == h - (dataset[7] * 3), 'message: The eighth <code>rect</code> should have a <code>y</code> value of 58.');",
+        "assert($('rect').eq(8).attr('y') == h - (dataset[8] * 3), 'message: The ninth <code>rect</code> should have a <code>y</code> value of 73.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fa9367417b2b2512bd1",
+      "title": "Change the Color of an SVG Element",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The bars are in the right position, but they are all the same black color. SVG has a way to change the color of the bars.",
+        "In SVG, a <code>rect</code> shape is colored with the <code>fill</code> attribute. It supports hex codes, color names, and rgb values, as well as more complex options like gradients and transparency.",
+        "<hr>",
+        "Add an <code>attr()</code> method to set the \"fill\" of all the bars to the color \"navy\"."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - 3 * d)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => 3 * d)",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').css('fill') == \"rgb(0, 0, 128)\", 'message: The bars should all have a <code>fill</code> color of navy.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7faa367417b2b2512bd2",
+      "title": "Add Labels to D3 Elements",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "D3 lets you label a graph element, such as a bar, using the SVG <code>text</code> element.",
+        "Like the <code>rect</code> element, a <code>text</code> element needs to have <code>x</code> and <code>y</code> attributes, to place it on the SVG canvas. It also needs to access the data to display those values.",
+        "D3 gives you a high level of control over how you label your bars.",
+        "<hr>",
+        "The code in the editor already binds the data to each new <code>text</code> element. First, append <code>text</code> nodes to the <code>svg</code>. Next, add attributes for the <code>x</code> and <code>y</code> coordinates. They should be calculated the same way as the <code>rect</code> ones, except the <code>y</code> value for the <code>text</code> should make the label sit 3 units higher than the bar. Finally, use the D3 <code>text()</code> method to set the label equal to the data point value.",
+        "<strong>Note</strong><br>For the label to sit higher than the bar, decide if the <code>y</code> value for the <code>text</code> should be 3 greater or 3 less than the <code>y</code> value for the bar."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - 3 * d)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => 3 * d)",
+        "       .attr(\"fill\", \"navy\");",
+        "    ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  </script>",
+        "<body>"
+      ],
+      "tests": [
+        "assert($('text').eq(0).text() == '12' && $('text').eq(0).attr('y') == '61', 'message: The first <code>text</code> element should have a label of 12 and a <code>y</code> value of 61.');",
+        "assert($('text').eq(1).text() == '31' && $('text').eq(1).attr('y') == '4', 'message: The second <code>text</code> element should have a label of 31 and a <code>y</code> value of 4.');",
+        "assert($('text').eq(2).text() == '22' && $('text').eq(2).attr('y') == '31', 'message: The third <code>text</code> element should have a label of 22 and a <code>y</code> value of 31.');",
+        "assert($('text').eq(3).text() == '17' && $('text').eq(3).attr('y') == '46', 'message: The fourth <code>text</code> element should have a label of 17 and a <code>y</code> value of 46.');",
+        "assert($('text').eq(4).text() == '25' && $('text').eq(4).attr('y') == '22', 'message: The fifth <code>text</code> element should have a label of 25 and a <code>y</code> value of 22.');",
+        "assert($('text').eq(5).text() == '18' && $('text').eq(5).attr('y') == '43', 'message: The sixth <code>text</code> element should have a label of 18 and a <code>y</code> value of 43.');",
+        "assert($('text').eq(6).text() == '29' && $('text').eq(6).attr('y') == '10', 'message: The seventh <code>text</code> element should have a label of 29 and a <code>y</code> value of 10.');",
+        "assert($('text').eq(7).text() == '14' && $('text').eq(7).attr('y') == '55', 'message: The eighth <code>text</code> element should have a label of 14 and a <code>y</code> value of 55.');",
+        "assert($('text').eq(8).text() == '9' && $('text').eq(8).attr('y') == '70', 'message: The ninth <code>text</code> element should have a label of 9 and a <code>y</code> value of 70.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7faa367417b2b2512bd3",
+      "title": "Style D3 Labels",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "D3 methods can add styles to the bar labels. The <code>fill</code> attribute sets the color of the text for a <code>text</code> node. The <code>style()</code> method sets CSS rules for other styles, such as \"font-family\" or \"font-size\".",
+        "<hr>",
+        "Set the <code>font-size</code> of the <code>text</code> elements to 25px, and the color of the text to red."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - 3 * d)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => d * 3)",
+        "       .attr(\"fill\", \"navy\");",
+        "    ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"text\")",
+        "       .text((d) => d)",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - (3 * d) - 3)",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('text').css('fill') == 'rgb(255, 0, 0)', 'message: The labels should all have a <code>fill</code> color of red.');",
+        "assert($('text').css('font-size') == '25px', 'message: The labels should all have a <code>font-size</code> of 25 pixels.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7faa367417b2b2512bd4",
+      "title": "Add a Hover Effect to a D3 Element",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "It's possible to add effects that highlight a bar when the user hovers over it with the mouse. So far, the styling for the rectangles is applied with the built-in D3 and SVG methods, but you can use CSS as well.",
+        "You set the CSS class on the SVG elements with the <code>attr()</code> method. Then the <code>:hover</code> pseudo-class for your new class holds the style rules for any hover effects.",
+        "<hr>",
+        "Use the <code>attr()</code> method to add a class of <code>bar</code> to all the <code>rect</code> elements. This changes the <code>fill</code> color of the bar to brown when you mouse over it."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .bar:hover {",
+        "    fill: brown;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - 3 * d)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => 3 * d)",
+        "       .attr(\"fill\", \"navy\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "    ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"text\")",
+        "       .text((d) => d)",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - (3 * d) - 3);",
+        "       ",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('rect').attr('class') == \"bar\", 'message: Your <code>rect</code> elements should have a class of <code>bar</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7faa367417b2b2512bd6",
+      "title": "Add a Tooltip to a D3 Element",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "A tooltip shows more information about an item on a page when the user hovers over that item. There are several ways to add a tooltip to a visualization, this challenge uses the SVG <code>title</code> element.",
+        "<code>title</code> pairs with the <code>text()</code> method to dynamically add data to the bars.",
+        "<hr>",
+        "Append a <code>title</code> element under each <code>rect</code> node. Then call the <code>text()</code> method with a callback function so the text displays the data value."
+      ],
+      "challengeSeed": [
+        "<style>",
+        "  .bar:hover {",
+        "    fill: brown;",
+        "  }",
+        "</style>",
+        "<body>",
+        "  <script>",
+        "    const dataset = [12, 31, 22, 17, 25, 18, 29, 14, 9];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 100;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"rect\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"rect\")",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - 3 * d)",
+        "       .attr(\"width\", 25)",
+        "       .attr(\"height\", (d, i) => d * 3)",
+        "       .attr(\"fill\", \"navy\")",
+        "       .attr(\"class\", \"bar\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "    ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"text\")",
+        "       .text((d) => d)",
+        "       .attr(\"x\", (d, i) => i * 30)",
+        "       .attr(\"y\", (d, i) => h - (d * 3 + 3))   ",
+        "    ",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('title').length == 9, 'message: Your code should have 9 <code>title</code> elements.');",
+        "assert($('title').eq(0).text() == '12', 'message: The first <code>title</code> element should have tooltip text of 12.');",
+        "assert($('title').eq(1).text() == '31', 'message: The second <code>title</code> element should have tooltip text of 31.');",
+        "assert($('title').eq(2).text() == '22', 'message: The third <code>title</code> element should have tooltip text of 22.');",
+        "assert($('title').eq(3).text() == '17', 'message: The fourth <code>title</code> element should have tooltip text of 17.');",
+        "assert($('title').eq(4).text() == '25', 'message: The fifth <code>title</code> element should have tooltip text of 25.');",
+        "assert($('title').eq(5).text() == '18', 'message: The sixth <code>title</code> element should have tooltip text of 18.');",
+        "assert($('title').eq(6).text() == '29', 'message: The seventh <code>title</code> element should have tooltip text of 29.');",
+        "assert($('title').eq(7).text() == '14', 'message: The eighth <code>title</code> element should have tooltip text of 14.');",
+        "assert($('title').eq(8).text() == '9', 'message: The ninth <code>title</code> element should have tooltip text of 9.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fab367417b2b2512bd7",
+      "title": "Create a Scatterplot with SVG Circles",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "A scatter plot is another type of visualization. It usually uses circles to map data points, which have two values each. These values tie to the <code>x</code> and <code>y</code> axes, and are used to position the circle in the visualization.",
+        "SVG has a <code>circle</code> tag to create the circle shape. It works a lot like the <code>rect</code> elements you used for the bar chart.",
+        "<hr>",
+        "Use the <code>data()</code>, <code>enter()</code>, and <code>append()</code> methods to bind <code>dataset</code> to new <code>circle</code> elements that are appended to the SVG canvas."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [",
+        "                  [ 34,    78 ],",
+        "                  [ 109,   280 ],",
+        "                  [ 310,   120 ],",
+        "                  [ 79,    411 ],",
+        "                  [ 420,   220 ],",
+        "                  [ 233,   145 ],",
+        "                  [ 333,   96 ],",
+        "                  [ 222,   333 ],",
+        "                  [ 78,    320 ],",
+        "                  [ 21,    123 ]",
+        "                ];",
+        "    ",
+        "    ",
+        "    const w = 500;",
+        "    const h = 500;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"circle\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  ",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('circle').length == 10, 'message: Your code should have 10 <code>circle</code> elements.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fab367417b2b2512bd8",
+      "title": "Add Attributes to the Circle Elements",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The last challenge created the <code>circle</code> elements for each point in the <code>dataset</code>, and appended them to the SVG canvas. But D3 needs more information about the position and size of each <code>circle</code> to display them correctly.",
+        "A <code>circle</code> in SVG has three main attributes. The <code>cx</code> and <code>cy</code> attributes are the coordinates. They tell D3 where to position the <em>center</em> of the shape on the SVG canvas. The radius (<code>r</code> attribute) gives the size of the <code>circle</code>.",
+        "Just like the <code>rect</code> <code>y</code> coordinate, the <code>cy</code> attribute for a <code>circle</code> is measured from the top of the SVG canvas, not from the bottom.",
+        "All three attributes can use a callback function to set their values dynamically. Remember that all methods chained after <code>data(dataset)</code> run once per item in <code>dataset</code>. The <code>d</code> parameter in the callback function refers to the current item in <code>dataset</code>, which is an array for each point. You use bracket notation, like <code>d[0]</code>, to access the values in that array.",
+        "<hr>",
+        "Add <code>cx</code>, <code>cy</code>, and <code>r</code> attributes to the <code>circle</code> elements. The <code>cx</code> value should be the first number in the array for each item in <code>dataset</code>. The <code>cy</code> value should be based off the second number in the array, but make sure to show the chart right-side-up and not inverted. The <code>r</code> value should be 5 for all circles."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [",
+        "                  [ 34,    78 ],",
+        "                  [ 109,   280 ],",
+        "                  [ 310,   120 ],",
+        "                  [ 79,    411 ],",
+        "                  [ 420,   220 ],",
+        "                  [ 233,   145 ],",
+        "                  [ 333,   96 ],",
+        "                  [ 222,   333 ],",
+        "                  [ 78,    320 ],",
+        "                  [ 21,    123 ]",
+        "                ];",
+        "    ",
+        "    ",
+        "    const w = 500;",
+        "    const h = 500;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"circle\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"circle\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  ",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('circle').length == 10, 'message: Your code should have 10 <code>circle</code> elements.');",
+        "assert($('circle').eq(0).attr('cx') == '34' && $('circle').eq(0).attr('cy') == '422' && $('circle').eq(0).attr('r') == '5', 'message: The first <code>circle</code> element should have a <code>cx</code> value of 34, a <code>cy</code> value of 422, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(1).attr('cx') == '109' && $('circle').eq(1).attr('cy') == '220' && $('circle').eq(1).attr('r') == '5', 'message: The second <code>circle</code> element should have a <code>cx</code> value of 109, a <code>cy</code> value of 220, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(2).attr('cx') == '310' && $('circle').eq(2).attr('cy') == '380' && $('circle').eq(2).attr('r') == '5', 'message: The third <code>circle</code> element should have a <code>cx</code> value of 310, a <code>cy</code> value of 380, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(3).attr('cx') == '79' && $('circle').eq(3).attr('cy') == '89' && $('circle').eq(3).attr('r') == '5', 'message: The fourth <code>circle</code> element should have a <code>cx</code> value of 79, a <code>cy</code> value of 89, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(4).attr('cx') == '420' && $('circle').eq(4).attr('cy') == '280' && $('circle').eq(4).attr('r') == '5', 'message: The fifth <code>circle</code> element should have a <code>cx</code> value of 420, a <code>cy</code> value of 280, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(5).attr('cx') == '233' && $('circle').eq(5).attr('cy') == '355' && $('circle').eq(5).attr('r') == '5', 'message: The sixth <code>circle</code> element should have a <code>cx</code> value of 233, a <code>cy</code> value of 355, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(6).attr('cx') == '333' && $('circle').eq(6).attr('cy') == '404' && $('circle').eq(6).attr('r') == '5', 'message: The seventh <code>circle</code> element should have a <code>cx</code> value of 333, a <code>cy</code> value of 404, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(7).attr('cx') == '222' && $('circle').eq(7).attr('cy') == '167' && $('circle').eq(7).attr('r') == '5', 'message: The eighth <code>circle</code> element should have a <code>cx</code> value of 222, a <code>cy</code> value of 167, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(8).attr('cx') == '78' && $('circle').eq(8).attr('cy') == '180' && $('circle').eq(8).attr('r') == '5', 'message: The ninth <code>circle</code> element should have a <code>cx</code> value of 78, a <code>cy</code> value of 180, and an <code>r</code> value of 5.');",
+        "assert($('circle').eq(9).attr('cx') == '21' && $('circle').eq(9).attr('cy') == '377' && $('circle').eq(9).attr('r') == '5', 'message: The tenth <code>circle</code> element should have a <code>cx</code> value of 21, a <code>cy</code> value of 377, and an <code>r</code> value of 5.');"
+      ],
+      "solutions": [],
+      "hints": [
+        "The cy attribute should be the second number of the data point array subtracted from the height of the SVG."
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fab367417b2b2512bd9",
+      "title": "Add Labels to Scatter Plot Circles",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "You can add text to create labels for the points in a scatter plot.",
+        "The goal is to display the comma-separated values for the first (<code>x</code>) and second (<code>y</code>) fields of each item in <code>dataset</code>.",
+        "The <code>text</code> nodes need <code>x</code> and <code>y</code> attributes to position it on the SVG canvas. In this challenge, the <code>y</code> value (which determines height) can use the same value that the <code>circle</code> uses for its <code>cy</code> attribute. The <code>x</code> value can be slightly larger than the <code>cx</code> value of the <code>circle</code>, so the label is visible. This will push the label to the right of the plotted point.",
+        "<hr>",
+        "Label each point on the scatter plot using the <code>text</code> elements. The text of the label should be the two values separated by a comma and a space. For example, the label for the first point is \"34, 78\". Set the <code>x</code> attribute so it's 5 units more than the value you used for the <code>cx</code> attribute on the <code>circle</code>. Set the <code>y</code> attribute the same way that's used for the <code>cy</code> value on the <code>circle</code>."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [",
+        "                  [ 34,    78 ],",
+        "                  [ 109,   280 ],",
+        "                  [ 310,   120 ],",
+        "                  [ 79,    411 ],",
+        "                  [ 420,   220 ],",
+        "                  [ 233,   145 ],",
+        "                  [ 333,   96 ],",
+        "                  [ 222,   333 ],",
+        "                  [ 78,    320 ],",
+        "                  [ 21,    123 ]",
+        "                ];",
+        "    ",
+        "    ",
+        "    const w = 500;",
+        "    const h = 500;",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"circle\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"circle\")",
+        "       .attr(\"cx\", (d, i) => d[0])",
+        "       .attr(\"cy\", (d, i) => h - d[1])",
+        "       .attr(\"r\", 5);",
+        "    ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"text\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('text').length == 10, 'message: Your code should have 10 <code>text</code> elements.');",
+        "assert($('text').eq(0).text() == '34, 78' && $('text').eq(0).attr('x') == '39' && $('text').eq(0).attr('y') == '422', 'message: The first label should have text of \"34, 78\", an <code>x</code> value of 39, and a <code>y</code> value of 422.');",
+        "assert($('text').eq(1).text() == '109, 280' && $('text').eq(1).attr('x') == '114' && $('text').eq(1).attr('y') == '220', 'message: The second label should have text of \"109, 280\", an <code>x</code> value of 114, and a <code>y</code> value of 220.');",
+        "assert($('text').eq(2).text() == '310, 120' && $('text').eq(2).attr('x') == '315' && $('text').eq(2).attr('y') == '380', 'message: The third label should have text of \"310, 120\", an <code>x</code> value of 315, and a <code>y</code> value of 380.');",
+        "assert($('text').eq(3).text() == '79, 411' && $('text').eq(3).attr('x') == '84' && $('text').eq(3).attr('y') == '89', 'message: The fourth label should have text of \"79, 411\", an <code>x</code> value of 84, and a <code>y</code> value of 89.');",
+        "assert($('text').eq(4).text() == '420, 220' && $('text').eq(4).attr('x') == '425' && $('text').eq(4).attr('y') == '280', 'message: The fifth label should have text of \"420, 220\", an <code>x</code> value of 425, and a <code>y</code> value of 280.');",
+        "assert($('text').eq(5).text() == '233, 145' && $('text').eq(5).attr('x') == '238' && $('text').eq(5).attr('y') == '355', 'message: The sixth label should have text of \"233, 145\", an <code>x</code> value of 238, and a <code>y</code> value of 355.');",
+        "assert($('text').eq(6).text() == '333, 96' && $('text').eq(6).attr('x') == '338' && $('text').eq(6).attr('y') == '404', 'message: The seventh label should have text of \"333, 96\", an <code>x</code> value of 338, and a <code>y</code> value of 404.');",
+        "assert($('text').eq(7).text() == '222, 333' && $('text').eq(7).attr('x') == '227' && $('text').eq(7).attr('y') == '167', 'message: The eighth label should have text of \"222, 333\", an <code>x</code> value of 227, and a <code>y</code> value of 167.');",
+        "assert($('text').eq(8).text() == '78, 320' && $('text').eq(8).attr('x') == '83' && $('text').eq(8).attr('y') == '180', 'message: The ninth label should have text of \"78, 320\", an <code>x</code> value of 83, and a <code>y</code> value of 180.');",
+        "assert($('text').eq(9).text() == '21, 123' && $('text').eq(9).attr('x') == '26' && $('text').eq(9).attr('y') == '377', 'message: The tenth label should have text of \"21, 123\", an <code>x</code> value of 26, and a <code>y</code> value of 377.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fab367417b2b2512bda",
+      "title": "Create a Linear Scale with D3",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The bar and scatter plot charts both plotted data directly onto the SVG canvas. However, if the height of a bar or one of the data points were larger than the SVG height or width values, it would go outside the SVG area.",
+        "In D3, there are scales to help plot data. <code>Scales</code> are functions that tell the program how to map a set of raw data points onto the pixels of the SVG canvas.",
+        "For example, say you have a 100x500-sized SVG canvas and you want to plot Gross Domestic Product (GDP) for a number of countries. The set of numbers would be in the billion or trillion-dollar range. You provide D3 a type of scale to tell it how to place the large GDP values into that 100x500-sized area.",
+        "It's unlikely you would plot raw data as-is. Before plotting it, you set the scale for your entire data set, so that the <code>x</code> and <code>y</code> values fit your canvas width and height.",
+        "D3 has several scale types. For a linear scale (usually used with quantitative data), there is the D3 method <code>scaleLinear()</code>:",
+        "<code> const scale = d3.scaleLinear()</code>",
+        "By default, a scale uses the identity relationship. The value of the input is the same as the value of the output. A separate challenge covers how to change this.",
+        "<hr>",
+        "Change the <code>scale</code> variable to create a linear scale. Then set the <code>output</code> variable to the scale called with an input argument of 50."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    // Add your code below this line",
+        "    ",
+        "    const scale = undefined; // Create the scale here",
+        "    const output = scale(); // Call the scale with an argument here",
+        "    ",
+        "    // Add your code above this line",
+        "    ",
+        "    d3.select(\"body\")",
+        "      .append(\"h2\")",
+        "      .text(output);",
+        "  ",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('h2').text() == '50', 'message: The text in the <code>h2</code> should be 50.');",
+        "assert(code.match(/\\.scaleLinear/g), 'message: Your code should use the <code>scaleLinear()</code> method.');",
+        "assert(output == 50 && code.match(/scale\\(\\s*?50\\s*?\\)/g), 'message: The <code>output</code> variable should call <code>scale</code> with an argument of 50.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fac367417b2b2512bdb",
+      "title": "Set a Domain and a Range on a Scale",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "By default, scales use the identity relationship - the input value maps to the output value. But scales can be much more flexible and interesting.",
+        "Say a data set has values ranging from 50 to 480. This is the input information for a scale, and is also known as the domain.",
+        "You want to map those points along the <code>x</code> axis on the SVG canvas, between 10 units and 500 units. This is the output information, which is also known as the range.",
+        "The <code>domain()</code> and <code>range()</code> methods set these values for the scale. Both methods take an array of at least two elements as an argument. Here's an example:",
+        "<blockquote>// Set a domain<br>// The domain covers the set of input values<br>scale.domain([50, 480]);<br>// Set a range<br>// The range covers the set of output values<br>scale.range([10, 500]);<br>scale(50) // Returns 10<br>scale(480) // Returns 500<br>scale(325) // Returns 323.37<br>scale(750) // Returns 807.67<br>d3.scaleLinear()</blockquote>",
+        "Notice that the scale uses the linear relationship between the domain and range values to figure out what the output should be for a given number. The minimum value in the domain (50) maps to the minimum value (10) in the range.",
+        "<hr>",
+        "Create a scale and set its domain to <code>[250, 500]</code> and range to <code>[10, 150]</code>.",
+        "<strong>Note</strong><br>You can chain the <code>domain()</code> and <code>range()</code> methods onto the <code>scale</code> variable."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    // Add your code below this line",
+        "    const scale = d3.scaleLinear();",
+        "    ",
+        "    ",
+        "    ",
+        "    // Add your code above this line",
+        "    const output = scale(50);",
+        "    d3.select(\"body\")",
+        "      .append(\"h2\")",
+        "      .text(output);",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert(code.match(/\\.domain/g), 'message: Your code should use the <code>domain()</code> method.');",
+        "assert(JSON.stringify(scale.domain()) == JSON.stringify([250, 500]), 'message: The <code>domain()</code> of the scale should be set to <code>[250, 500]</code>.');",
+        "assert(code.match(/\\.range/g), 'message: Your code should use the <code>range()</code> method.');",
+        "assert(JSON.stringify(scale.range()) == JSON.stringify([10, 150]), 'message: The <code>range()</code> of the scale should be set to <code>[10, 150]</code>.');",
+        "assert($('h2').text() == '-102', 'message: The text in the <code>h2</code> should be -102.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fac367417b2b2512bdc",
+      "title": "Use the d3.max and d3.min Functions to Find Minimum and Maximum Values in a Dataset",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The D3 methods <code>domain()</code> and <code>range()</code> set that information for your scale based on the data. There are a couple methods to make that easier.",
+        "Often when you set the domain, you'll want to use the minimum and maximum values within the data set. Trying to find these values manually, especially in a large data set, may cause errors.",
+        "D3 has two methods - <code>min()</code> and <code>max()</code> to return this information. Here's an example:",
+        "<blockquote>const exampleData = [34, 234, 73, 90, 6, 52];<br>d3.min(exampleData) // Returns 6<br>d3.max(exampleData) // Returns 234</blockquote>",
+        "A dataset may have nested arrays, like the [x, y] coordinate pairs that were in the scatter plot example. In that case, you need to tell D3 how to calculate the maximum and minimum.",
+        "Fortunately, both the <code>min()</code> and <code>max()</code> methods take a callback function.",
+        "In this example, the callback function's argument <code>d</code> is for the current inner array. The callback needs to return the element from the inner array (the x or y value) over which you want to compute the maximum or minimum. Here's an example for how to find the min and max values with an array of arrays:",
+        "<blockquote>const locationData = [[1, 7],[6, 3],[8, 3]];<br>// Returns the smallest number out of the first elements<br>const minX = d3.min(locationData, (d) => d[0]);<br>// minX compared 1, 6, and 8 and is set to 1</blockquote>",
+        "<hr>",
+        "The <code>positionData</code> variable holds a 3-dimensional (3D) array. Use a D3 method to find the maximum value of the z coordinate (the third value) from the arrays and save it in the <code>output</code> variable.",
+        "<strong>Note</strong><br>Fun fact - D3 can plot 3D arrays."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const positionData = [[1, 7, -4],[6, 3, 8],[2, 8, 3]]",
+        "    // Add your code below this line",
+        "    ",
+        "    const output = undefined; // Change this line",
+        "    ",
+        "    // Add your code above this line",
+        "    ",
+        "    d3.select(\"body\")",
+        "      .append(\"h2\")",
+        "      .text(output)",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert(output == 8 && $('h2').text() == '8', 'message: The text in the <code>h2</code> should be 8.');",
+        "assert(code.match(/\\.max/g), 'message: Your code should use the <code>max()</code> method.')"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fac367417b2b2512bdd",
+      "title": "Use Dynamic Scales",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "The D3 <code>min()</code> and <code>max()</code> methods are useful to help set the scale.",
+        "Given a complex data set, one priority is to set the scale so the visualization fits the SVG container's width and height. You want all the data plotted inside the SVG canvas so it's visible on the web page.",
+        "The example below sets the x-axis scale for scatter plot data. The <code>domain()</code> method passes information to the scale about the raw data values for the plot. The <code>range()</code> method gives it information about the actual space on the web page for the visualization.",
+        "In the example, the domain goes from 0 to the maximum in the set. It uses the <code>max()</code> method with a callback function based on the x values in the arrays. The range uses the SVG canvas' width (<code>w</code>), but it includes some padding, too. This puts space between the scatter plot dots and the edge of the SVG canvas.",
+        "<blockquote>const dataset = [<br>                  [ 34,    78 ],<br>                  [ 109,   280 ],<br>                  [ 310,   120 ],<br>                  [ 79,    411 ],<br>                  [ 420,   220 ],<br>                  [ 233,   145 ],<br>                  [ 333,   96 ],<br>                  [ 222,   333 ],<br>                  [ 78,    320 ],<br>                  [ 21,    123 ]<br>                ];<br>const w = 500;<br>const h = 500;<br><br>// Padding between the SVG canvas boundary and the plot<br>const padding = 30;<br>const xScale = d3.scaleLinear()<br>                 .domain([0, d3.max(dataset, (d) => d[0])])<br>                 .range([padding, w - padding]);</blockquote>",
+        "The padding may be confusing at first. Picture the x-axis as a horizontal line from 0 to 500 (the width value for the SVG canvas). Including the padding in the <code>range()</code> method forces the plot to start at 30 along that line (instead of 0), and end at 470 (instead of 500).",
+        "<hr>",
+        "Use the <code>yScale</code> variable to create a linear y-axis scale. The domain should start at zero and go to the maximum y value in the set. The range should use the SVG height (<code>h</code>) and include padding.",
+        "<strong>Note</strong><br>Remember to keep the plot right-side-up. When you set the range for the y coordinates, the higher value (height minus padding) is the first argument, and the lower value is the second argument."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [",
+        "                  [ 34,    78 ],",
+        "                  [ 109,   280 ],",
+        "                  [ 310,   120 ],",
+        "                  [ 79,    411 ],",
+        "                  [ 420,   220 ],",
+        "                  [ 233,   145 ],",
+        "                  [ 333,   96 ],",
+        "                  [ 222,   333 ],",
+        "                  [ 78,    320 ],",
+        "                  [ 21,    123 ]",
+        "                ];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 500;",
+        "    ",
+        "    // Padding between the SVG canvas boundary and the plot",
+        "    const padding = 30;",
+        "    ",
+        "    // Create an x and y scale",
+        "    ",
+        "    const xScale = d3.scaleLinear()",
+        "                    .domain([0, d3.max(dataset, (d) => d[0])])",
+        "                    .range([padding, w - padding]);",
+        "    ",
+        "    // Add your code below this line",
+        "    ",
+        "    const yScale = undefined;",
+        "                     ",
+        "                     ",
+        "    // Add your code above this line",
+        "    ",
+        "    const output = yScale(411); // Returns 30",
+        "    d3.select(\"body\")",
+        "      .append(\"h2\")",
+        "      .text(output)",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert(output == 30 && $('h2').text() == '30', 'message: The text in the <code>h2</code> should be 30.');",
+        "assert(JSON.stringify(yScale.domain()) == JSON.stringify([0, 411]), 'message: The <code>domain()</code> of yScale should be equivalent to <code>[0, 411]</code>.');",
+        "assert(JSON.stringify(yScale.range()) == JSON.stringify([470, 30]), 'message: The <code>range()</code> of yScale should be equivalent to <code>[470, 30]</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fac367417b2b2512bde",
+      "title": "Use a Pre-Defined Scale to Place Elements",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "With the scales set up, it's time to map the scatter plot again. The scales are like processing functions that turn the x and y raw data into values that fit and render correctly on the SVG canvas. They keep the data within the screen's plotting area.",
+        "You set the coordinate attribute values for an SVG shape with the scaling function. This includes <code>x</code> and <code>y</code> attributes for <code>rect</code> or <code>text</code> elements, or <code>cx</code> and <code>cy</code> for <code>circles</code>. Here's an example:",
+        "<blockquote>shape<br>  .attr(\"x\", (d) => xScale(d[0]))</blockquote>",
+        "Scales set shape coordinate attributes to place the data points onto the SVG canvas. You don't need to apply scales when you display the actual data value, for example, in the <code>text()</code> method for a tooltip or label.",
+        "<hr>",
+        "Use <code>xScale</code> and <code>yScale</code> to position both the <code>circle</code> and <code>text</code> shapes onto the SVG canvas. For the <code>circles</code>, apply the scales to set the <code>cx</code> and <code>cy</code> attributes. Give them a radius of 5 units, too.",
+        "For the <code>text</code> elements, apply the scales to set the <code>x</code> and <code>y</code> attributes. The labels should be offset to the right of the dots. To do this, add 10 units to the x data value before passing it to the <code>xScale</code>."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [",
+        "                  [ 34,     78 ],",
+        "                  [ 109,   280 ],",
+        "                  [ 310,   120 ],",
+        "                  [ 79,   411 ],",
+        "                  [ 420,   220 ],",
+        "                  [ 233,   145 ],",
+        "                  [ 333,   96 ],",
+        "                  [ 222,    333 ],",
+        "                  [ 78,    320 ],",
+        "                  [ 21,   123 ]",
+        "                ];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 500;",
+        "    const padding = 60;",
+        "    ",
+        "    const xScale = d3.scaleLinear()",
+        "                     .domain([0, d3.max(dataset, (d) => d[0])])",
+        "                     .range([padding, w - padding]);",
+        "    ",
+        "    const yScale = d3.scaleLinear()",
+        "                     .domain([0, d3.max(dataset, (d) => d[1])])",
+        "                     .range([h - padding, padding]);",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"circle\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"circle\")",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "       ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"text\")",
+        "       .text((d) =>  (d[0] + \", \"",
+        " + d[1]))",
+        "       // Add your code below this line",
+        "       ",
+        "       ",
+        "       ",
+        "       // Add your code above this line",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert($('circle').length == 10, 'message: Your code should have 10 <code>circle</code> elements.');",
+        "assert(Math.round($('circle').eq(0).attr('cx')) == '91' && Math.round($('circle').eq(0).attr('cy')) == '368' && $('circle').eq(0).attr('r') == '5', 'message: The first <code>circle</code> element should have a <code>cx</code> value of approximately 91 and a <code>cy</code> value of approximately 368 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(1).attr('cx')) == '159' && Math.round($('circle').eq(1).attr('cy')) == '181' && $('circle').eq(1).attr('r') == '5', 'message: The second <code>circle</code> element should have a <code>cx</code> value of approximately 159 and a <code>cy</code> value of approximately 181 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(2).attr('cx')) == '340' && Math.round($('circle').eq(2).attr('cy')) == '329' && $('circle').eq(2).attr('r') == '5', 'message: The third <code>circle</code> element should have a <code>cx</code> value of approximately 340 and a <code>cy</code> value of approximately 329 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(3).attr('cx')) == '131' && Math.round($('circle').eq(3).attr('cy')) == '60' && $('circle').eq(3).attr('r') == '5', 'message: The fourth <code>circle</code> element should have a <code>cx</code> value of approximately 131 and a <code>cy</code> value of approximately 60 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(4).attr('cx')) == '440' && Math.round($('circle').eq(4).attr('cy')) == '237' && $('circle').eq(4).attr('r') == '5', 'message: The fifth <code>circle</code> element should have a <code>cx</code> value of approximately 440 and a <code>cy</code> value of approximately 237 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(5).attr('cx')) == '271' && Math.round($('circle').eq(5).attr('cy')) == '306' && $('circle').eq(5).attr('r') == '5', 'message: The sixth <code>circle</code> element should have a <code>cx</code> value of approximately 271 and a <code>cy</code> value of approximately 306 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(6).attr('cx')) == '361' && Math.round($('circle').eq(6).attr('cy')) == '351' && $('circle').eq(6).attr('r') == '5', 'message: The seventh <code>circle</code> element should have a <code>cx</code> value of approximately 361 and a <code>cy</code> value of approximately 351 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(7).attr('cx')) == '261' && Math.round($('circle').eq(7).attr('cy')) == '132' && $('circle').eq(7).attr('r') == '5', 'message: The eighth <code>circle</code> element should have a <code>cx</code> value of approximately 261 and a <code>cy</code> value of approximately 132 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(8).attr('cx')) == '131' && Math.round($('circle').eq(8).attr('cy')) == '144' && $('circle').eq(8).attr('r') == '5', 'message: The ninth <code>circle</code> element should have a <code>cx</code> value of approximately 131 and a <code>cy</code> value of approximately 144 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert(Math.round($('circle').eq(9).attr('cx')) == '79' && Math.round($('circle').eq(9).attr('cy')) == '326' && $('circle').eq(9).attr('r') == '5', 'message: The tenth <code>circle</code> element should have a <code>cx</code> value of approximately 79 and a <code>cy</code> value of approximately 326 after applying the scales. It should also have an <code>r</code> value of 5.');",
+        "assert($('text').length == 10, 'message: Your code should have 10 <code>text</code> elements.');",
+        "assert(Math.round($('text').eq(0).attr('x')) == '100' && Math.round($('text').eq(0).attr('y')) == '368', 'message: The first label should have an <code>x</code> value of approximately 100 and a <code>y</code> value of approximately 368 after applying the scales.');",
+        "assert(Math.round($('text').eq(1).attr('x')) == '168' && Math.round($('text').eq(1).attr('y')) == '181', 'message: The second label should have an <code>x</code> value of approximately 168 and a <code>y</code> value of approximately 181 after applying the scales.');",
+        "assert(Math.round($('text').eq(2).attr('x')) == '350' && Math.round($('text').eq(2).attr('y')) == '329', 'message: The third label should have an <code>x</code> value of approximately 350 and a <code>y</code> value of approximately 329 after applying the scales.');",
+        "assert(Math.round($('text').eq(3).attr('x')) == '141' && Math.round($('text').eq(3).attr('y')) == '60', 'message: The fourth label should have an <code>x</code> value of approximately 141 and a <code>y</code> value of approximately 60 after applying the scales.');",
+        "assert(Math.round($('text').eq(4).attr('x')) == '449' && Math.round($('text').eq(4).attr('y')) == '237', 'message: The fifth label should have an <code>x</code> value of approximately 449 and a <code>y</code> value of approximately 237 after applying the scales.');",
+        "assert(Math.round($('text').eq(5).attr('x')) == '280' && Math.round($('text').eq(5).attr('y')) == '306', 'message: The sixth label should have an <code>x</code> value of approximately 280 and a <code>y</code> value of approximately 306 after applying the scales.');",
+        "assert(Math.round($('text').eq(6).attr('x')) == '370' && Math.round($('text').eq(6).attr('y')) == '351', 'message: The seventh label should have an <code>x</code> value of approximately 370 and a <code>y</code> value of approximately 351 after applying the scales.');",
+        "assert(Math.round($('text').eq(7).attr('x')) == '270' && Math.round($('text').eq(7).attr('y')) == '132', 'message: The eighth label should have an <code>x</code> value of approximately 270 and a <code>y</code> value of approximately 132 after applying the scales.');",
+        "assert(Math.round($('text').eq(8).attr('x')) == '140' && Math.round($('text').eq(8).attr('y')) == '144', 'message: The ninth label should have an <code>x</code> value of approximately 140 and a <code>y</code> value of approximately 144 after applying the scales.');",
+        "assert(Math.round($('text').eq(9).attr('x')) == '88' && Math.round($('text').eq(9).attr('y')) == '326', 'message: The tenth label should have an <code>x</code> value of approximately 88 and a <code>y</code> value of approximately 326 after applying the scales.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fad367417b2b2512bdf",
+      "title": "Add Axes to a Visualization",
+      "required": [
+        {
+          "src": "https://cdnjs.cloudflare.com/ajax/libs/d3/4.3.0/d3.min.js"
+        }
+      ],
+      "description": [
+        "Another way to improve the scatter plot is to add an x-axis and a y-axis.",
+        "D3 has two methods <code>axisLeft()</code> and <code>axisBottom()</code> to render the y and x axes, respectively. (Axes is the plural form of axis). Here's an example to create the x-axis based on the <code>xScale</code> in the previous challenges:",
+        "<code>const xAxis = d3.axisBottom(xScale);</code>",
+        "The next step is to render the axis on the SVG canvas. To do so, you can use a general SVG component, the <code>g</code> element. The <code>g</code> stands for group.",
+        "Unlike <code>rect</code>, <code>circle</code>, and <code>text</code>, an axis is just a straight line when it's rendered. Because it is a simple shape, using <code>g</code> works.",
+        "The last step is to apply a <code>transform</code> attribute to position the axis on the SVG canvas in the right place. Otherwise, the line would render along the border of SVG canvas and wouldn't be visible.",
+        "SVG supports different types of <code>transforms</code>, but positioning an axis needs <code>translate</code>. When it's applied to the <code>g</code> element, it moves the whole group over and down by the given amounts. Here's an example:",
+        "<blockquote>const xAxis = d3.axisBottom(xScale);<br><br>svg.append(\"g\")<br>   .attr(\"transform\", \"translate(0, \" + (h - padding) + \")\")<br>   .call(xAxis);</blockquote>",
+        "The above code places the x-axis at the bottom of the SVG canvas. Then it's passed as an argument to the <code>call()</code> method.",
+        "The y-axis works is the same way, except the <code>translate</code> argument is in the form (x, 0). Because <code>translate</code> is a string in the <code>attr()</code> method above, you can use concatenation to include variable values for its arguments.",
+        "<hr>",
+        "The scatter plot now has an x-axis. Create a y-axis in a variable named <code>yAxis</code> using the <code>axisLeft()</code> method. Then render the axis using a <code>g</code> element. Make sure to use a <code>transform</code> attribute to translate the axis by the amount of padding units right, and 0 units down. Remember to <code>call()</code> the axis."
+      ],
+      "challengeSeed": [
+        "<body>",
+        "  <script>",
+        "    const dataset = [",
+        "                  [ 34,     78 ],",
+        "                  [ 109,   280 ],",
+        "                  [ 310,   120 ],",
+        "                  [ 79,   411 ],",
+        "                  [ 420,   220 ],",
+        "                  [ 233,   145 ],",
+        "                  [ 333,   96 ],",
+        "                  [ 222,    333 ],",
+        "                  [ 78,    320 ],",
+        "                  [ 21,   123 ]",
+        "                ];",
+        "    ",
+        "    const w = 500;",
+        "    const h = 500;",
+        "    const padding = 60;",
+        "    ",
+        "    const xScale = d3.scaleLinear()",
+        "                     .domain([0, d3.max(dataset, (d) => d[0])])",
+        "                     .range([padding, w - padding]);",
+        "    ",
+        "    const yScale = d3.scaleLinear()",
+        "                     .domain([0, d3.max(dataset, (d) => d[1])])",
+        "                     .range([h - padding, padding]);",
+        "    ",
+        "    const svg = d3.select(\"body\")",
+        "                  .append(\"svg\")",
+        "                  .attr(\"width\", w)",
+        "                  .attr(\"height\", h);",
+        "    ",
+        "    svg.selectAll(\"circle\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"circle\")",
+        "       .attr(\"cx\", (d) => xScale(d[0]))",
+        "       .attr(\"cy\",(d) => yScale(d[1]))",
+        "       .attr(\"r\", (d) => 5);",
+        "    ",
+        "    svg.selectAll(\"text\")",
+        "       .data(dataset)",
+        "       .enter()",
+        "       .append(\"text\")",
+        "       .text((d) =>  (d[0] + \",\" + d[1]))",
+        "       .attr(\"x\", (d) => xScale(d[0] + 10))",
+        "       .attr(\"y\", (d) => yScale(d[1]))",
+        "    ",
+        "    const xAxis = d3.axisBottom(xScale);",
+        "    ",
+        "    svg.append(\"g\")",
+        "       .attr(\"transform\", \"translate(0,\" + (h - padding) + \")\")",
+        "       .call(xAxis);",
+        "    ",
+        "    // Add your code below this line",
+        "    ",
+        "    ",
+        "    ",
+        "    // Add your code above this line",
+        "  ",
+        "  </script>",
+        "</body>"
+      ],
+      "tests": [
+        "assert(code.match(/\\.axisLeft\\(yScale\\)/g), 'message: Your code should use the <code>axisLeft()</code> method with <code>yScale</code> passed as the argument.');",
+        "assert($('g').eq(1).attr('transform').match(/translate\\(60\\s*?,\\s*?0\\)/g), 'message: The y-axis <code>g</code> element should have a <code>transform</code> attribute to translate the axis by (60, 0).');",
+        "assert(code.match(/\\.call\\(yAxis\\)/g), 'message: Your code should call the <code>yAxis</code>.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/04-data-visualization/json-apis-and-ajax.json b/seed/math-challenges/04-data-visualization/json-apis-and-ajax.json
new file mode 100644
index 0000000000..aa17268d0c
--- /dev/null
+++ b/seed/math-challenges/04-data-visualization/json-apis-and-ajax.json
@@ -0,0 +1,692 @@
+{
+  "name": "JSON APIs and AJAX",
+  "order": 2,
+  "time": "2 hours",
+  "helpRoom": "Help",
+  "required": [
+    {
+      "link": "https://cdnjs.cloudflare.com/ajax/libs/twitter-bootstrap/3.3.7/css/bootstrap.css"
+    }
+  ],
+  "challenges": [
+    {
+      "id": "587d7fad367417b2b2512be0",
+      "title": "Introduction to the JSON APIs and AJAX Challenges",
+      "description": [
+        [
+          "http://imgs.xkcd.com/comics/api.png",
+          "XKCD web comic with a user sitting at a computer reading the instructions for an API Guide for a site. The text below notes \"If you do things right, it can take people awhile to realize that your 'API documentation' is just instructions for how to look at your website.\"",
+          "Similar to how User Interfaces help people use programs, Application Programming Interfaces (APIs) help programs interact with other programs. APIs are tools that computers use to communicate with one another, in part to send and receive data. You can use API functionality in your page once you understand how to make requests and process data from it. Programmers often use AJAX technologies when working with APIs.<br><br>The term AJAX originated as an acronym for Asynchronous JavaScript And XML. It refers to a group of technologies that make asynchronous requests to a server to transfer data, then load any returned data into the page. An asynchronous process has a couple key properties. The browser does not stop loading a page to wait for the server's response. Also, the browser inserts updated data into part of the page without having to refresh the entire page.<br><br>User experience benefits from asynchronous processes in several ways. Pages load faster since the browser isn't waiting for the server to respond in the middle of a page render. Requests and transfers happen in the background, without interrupting what the user is doing. When the browser receives new data, only the necessary area of the page refreshes. These qualities especially enhance the user experience for single page applications.<br><br>The data transferred between the browser and server is often in a format called JavaScript Object Notation (JSON). JSON resembles JavaScript object literal syntax, except that it's transferred as a string. Once received, it can be converted into an object and used in a script.<br><br>This section covers how to transfer and use data using AJAX technologies with a freeCodeCamp API.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7fad367417b2b2512be1",
+      "title": "Handle Click Events with JavaScript using the onclick property",
+      "description": [
+        "You want your code to execute only once your page has finished loading. For that purpose, you can attach a JavaScript event to the document called <code>DOMContentLoaded</code>. Here's the code that does this:",
+        "<blockquote>document.addEventListener('DOMContentLoaded',function() {<br><br>});</blockquote>",
+        "You can implement event handlers that go inside of the <code>DOMContentLoaded</code> function. You can implement an <code>onclick</code> event handler which triggers when the user clicks on the element with id <code>getMessage</code>, by adding the following code:",
+        "<blockquote>document.getElementById('getMessage').onclick=function(){};</blockquote>",
+        "<hr>",
+        "Add a click event handler inside of the <code>DOMContentLoaded</code> function for the element with id of <code>getMessage</code>."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    // Add your code below this line",
+        "    ",
+        "    ",
+        "    // Add your code above this line",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/document\\.getElementById\\(\\s*?('|\")getMessage\\1\\s*?\\)/g), 'message: Your code should use the <code>document.getElementById</code> method to select the <code>getMessage</code> element.');",
+        "assert(typeof document.getElementById('getMessage').onclick === 'function', 'message: Your code should add an <code>onclick</code> event handler.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fad367417b2b2512be2",
+      "title": "Change Text with click Events",
+      "description": [
+        "When the click event happens, you can use JavaScript to update an HTML element.",
+        "For example, when a user clicks the \"Get Message\" button, it changes the text of the element with the class <code>message</code> to say \"Here is the message\".",
+        "This works by adding the following code within the click event:",
+        "<code>document.getElementsByClassName('message')[0].innerHTML=\"Here is the message\";</code>",
+        "<hr>",
+        "Add code inside the <code>onclick</code> event handler to change the text inside the <code>message</code> element to say \"Here is the message\"."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('getMessage').onclick=function(){",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "    }",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/document\\.getElementsByClassName\\(\\s*?('|\")message\\1\\s*?\\)\\[0\\]\\.innerHTML\\s*?=\\s*?('|\")Here is the message\\2/g), 'message: Your code should use the <code>document.getElementsByClassName</code> method to select the element with class <code>message</code> and set its <code>innerHTML</code> to the given string.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fae367417b2b2512be3",
+      "title": "Get JSON with the JavaScript XMLHttpRequest Method",
+      "description": [
+        "You can also request data from an external source. This is where APIs come into play.",
+        "Remember that APIs - or Application Programming Interfaces - are tools that computers use to communicate with one another. You'll learn how to update HTML with the data we get from APIs using a technology called AJAX.",
+        "Most web APIs transfer data in a format called JSON. JSON stands for JavaScript Object Notation.",
+        "JSON syntax looks very similar to JavaScript object literal notation. JSON has object properties and their current values, sandwiched between a <code>{</code> and a <code>}</code>.",
+        "These properties and their values are often referred to as \"key-value pairs\".",
+        "However, JSON transmitted by APIs are sent as <code>bytes</code>, and your application receives it as a <code>string</code>. These can be converted into JavaScript objects, but they are not JavaScript objects by default. The <code>JSON.parse</code> method parses the string and constructs the JavaScript object described by it.",
+        "You can request the JSON from freeCodeCamp's Cat Photo API. Here's the code you can put in your click event to do this:",
+        "<blockquote>req=new XMLHttpRequest();<br>req.open(\"GET\",'/json/cats.json',true);<br>req.send();<br>req.onload=function(){<br>  json=JSON.parse(req.responseText);<br>  document.getElementsByClassName('message')[0].innerHTML=JSON.stringify(json);<br>};</blockquote>",
+        "Here's a review of what each piece is doing. The JavaScript <code>XMLHttpRequest</code> object has a number of properties and methods that are used to transfer data. First, an instance of the <code>XMLHttpRequest</code> object is created and saved in the <code>req</code> variable.",
+        "Next, the <code>open</code> method initializes a request - this example is requesting data from an API, therefore is a \"GET\" request. The second argument for <code>open</code> is the URL of the API you are requesting data from. The third argument is a Boolean value where <code>true</code> makes it an asynchronous request.",
+        "The <code>send</code> method sends the request. Finally, the <code>onload</code> event handler parses the returned data and applies the <code>JSON.stringify</code> method to convert the JavaScript object into a string. This string is then inserted as the message text.",
+        "<hr>",
+        "Update the code to create and send a \"GET\" request to the freeCodeCamp Cat Photo API. Then click the \"Get Message\" button. Your AJAX function will replace the \"The message will go here\" text with the raw JSON output from the API."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('getMessage').onclick=function(){",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "    };",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/new\\s+?XMLHttpRequest\\(\\s*?\\)/g), 'message: Your code should create a new <code>XMLHttpRequest</code>.');",
+        "assert(code.match(/\\.open\\(\\s*?('|\")GET\\1\\s*?,\\s*?('|\")\\/json\\/cats\\.json\\2\\s*?,\\s*?true\\s*?\\)/g), 'message: Your code should use the <code>open</code> method to initialize a \"GET\" request to the freeCodeCamp Cat Photo API.');",
+        "assert(code.match(/\\.send\\(\\s*\\)/g), 'message: Your code should use the <code>send</code> method to send the request.');",
+        "assert(code.match(/\\.onload=function\\(\\s*?\\)\\s*?{/g), 'message: Your code should have an <code>onload</code> event handler set to a function.');",
+        "assert(code.match(/JSON\\.parse\\(.*\\.responseText\\)/g), 'message: Your code should use the <code>JSON.parse</code> method to parse the <code>responseText</code>.');",
+        "assert(code.match(/document\\.getElementsByClassName\\(\\s*?('|\")message\\1\\s*?\\)\\[0\\]\\.innerHTML\\s*?=\\s*?JSON\\.stringify\\(.+?\\)/g), 'message: Your code should get the element with class <code>message</code> and change its inner HTML to the string of JSON data.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fae367417b2b2512be4",
+      "title": "Access the JSON Data from an API",
+      "description": [
+        "In the previous challenge, you saw how to get JSON data from the freeCodeCamp Cat Photo API.",
+        "Now you'll take a closer look at the returned data to better understand the JSON format. Recall some notation in JavaScript:",
+        "<blockquote>[ ] -> Square brackets represent an array<br>{ } -> Curly brackets represent an object<br>\" \" -> Double quotes represent a string. They are also used for key names in JSON</blockquote>",
+        "Understanding the structure of the data that an API returns is important because it influences how you retrieve the values you need.",
+        "On the right, click the \"Get Message\" button to load the freeCodeCamp Cat Photo API JSON into the HTML.",
+        "The first and last character you see in the JSON data are square brackets <code>[ ]</code>. This means that the returned data is an array. The second character in the JSON data is a curly <code>{</code> bracket, which starts an object. Looking closely, you can see that there are three separate objects. The JSON data is an array of three objects, where each object contains information about a cat photo.",
+        "You learned earlier that objects contain \"key-value pairs\" that are separated by commas. In the Cat Photo example, the first object has <code>\"id\":0</code> where \"id\" is a key and 0 is its corresponding value. Similarly, there are keys for \"imageLink\", \"altText\", and \"codeNames\". Each cat photo object has these same keys, but with different values.",
+        "Another interesting \"key-value pair\" in the first object is <code>\"codeNames\":[\"Juggernaut\",\"Mrs. Wallace\",\"ButterCup\"]</code>. Here \"codeNames\" is the key and its value is an array of three strings. It's possible to have arrays of objects as well as a key with an array as a value.",
+        "Remember how to access data in arrays and objects. Arrays use bracket notation to access a specific index of an item. Objects use either bracket or dot notation to access the value of a given property. Here's an example that prints the \"altText\" of the first cat photo - note that the parsed JSON data in the editor is saved in a variable called <code>json</code>:",
+        "<blockquote>console.log(json[0].altText);<br>// Prints \"A white cat wearing a green helmet shaped melon on its head.\"</blockquote>",
+        "<hr>",
+        "For the cat with the \"id\" of 2, print to the console the second value in the <code>codeNames</code> array. You should use bracket and dot notation on the object (which is saved in the variable <code>json</code>) to access the value."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('getMessage').onclick=function(){",
+        "      req=new XMLHttpRequest();",
+        "      req.open(\"GET\",'/json/cats.json',true);",
+        "      req.send();",
+        "      req.onload=function(){",
+        "        json=JSON.parse(req.responseText);",
+        "        document.getElementsByClassName('message')[0].innerHTML=JSON.stringify(json);",
+        "        // Add your code below this line",
+        "        ",
+        "        ",
+        "        // Add your code above this line",
+        "      };",
+        "    };",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/(?:json\\[2\\]\\.codeNames\\[1\\]|json\\[2\\]\\[('|\")codeNames\\1\\]\\[1\\])/g), 'message: Your code should use bracket and dot notation to access the proper code name, and print \"Loki\" to the console.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fae367417b2b2512be5",
+      "title": "Convert JSON Data to HTML",
+      "description": [
+        "Now that you're getting data from a JSON API, you can display it in the HTML.",
+        "You can use a <code>forEach</code> method to loop through the data since the cat photo objects are held in an array. As you get to each item, you can modify the HTML elements.",
+        "First, declare an html variable with <code>var html = \"\";</code>.",
+        "Then, loop through the JSON, adding HTML to the variable that wraps the key names in <code>strong</code> tags, followed by the value. When the loop is finished, you render it.",
+        "Here's the code that does this:",
+        "<blockquote>json.forEach(function(val) {</br>  var keys = Object.keys(val);</br>  html += \"&lt;div class = 'cat'&gt;\";</br>  keys.forEach(function(key) {</br>    html += \"&lt;strong&gt;\" + key + \"&lt;/strong&gt;: \" + val[key] + \"&lt;br&gt;\";</br>  });</br>  html += \"&lt;/div&gt;&lt;br&gt;\";</br>});</blockquote>",
+        "<hr>",
+        "Add a <code>forEach</code> method to loop over the JSON data and create the HTML elements to display it.",
+        "Here is some example JSON",
+        "<blockquote>[</br>  {</br>    \"id\":0,</br>    \"imageLink\":\"https://s3.amazonaws.com/freecodecamp/funny-cat.jpg\",</br>    \"altText\":\"A white cat wearing a green helmet shaped melon on its head. \",</br>    \"codeNames\":[</br>      \"Juggernaut\",</br>      \"Mrs. Wallace\",</br>      \"Buttercup\"</br>    ]</br>  }</br>]</blockquote>"
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('getMessage').onclick=function(){",
+        "      req=new XMLHttpRequest();",
+        "      req.open(\"GET\",'/json/cats.json',true);",
+        "      req.send();",
+        "      req.onload=function(){",
+        "        json=JSON.parse(req.responseText);",
+        "        var html = \"\";",
+        "        // Add your code below this line",
+        "        ",
+        "        ",
+        "        ",
+        "        // Add your code above this line",
+        "        document.getElementsByClassName('message')[0].innerHTML=html;",
+        "      };",
+        "    };",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/json\\.forEach/g), 'message: Your code should use a <code>forEach</code> method to loop over the JSON data from the API.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fae367417b2b2512be6",
+      "title": "Render Images from Data Sources",
+      "description": [
+        "The last few challenges showed that each object in the JSON array contains an <code>imageLink</code> key with a value that is the URL of a cat's image.",
+        "When you're looping through these objects, you can use this <code>imageLink</code> property to display this image in an <code>img</code> element.",
+        "Here's the code that does this:",
+        "<code>html += \"&lt;img src = '\" + val.imageLink + \"' \" + \"alt='\" + val.altText + \"'&gt;\";</code>",
+        "<hr>",
+        "Add code to use the <code>imageLink</code> and <code>altText</code> properties in an <code>img</code> tag."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('getMessage').onclick=function(){",
+        "      req=new XMLHttpRequest();",
+        "      req.open(\"GET\",'/json/cats.json',true);",
+        "      req.send();",
+        "      req.onload=function(){",
+        "        json=JSON.parse(req.responseText);",
+        "        var html = \"\";",
+        "        json.forEach(function(val) {",
+        "          html += \"<div class = 'cat'>\";",
+        "          // Add your code below this line",
+        "          ",
+        "          ",
+        "          // Add your code above this line",
+        "          html += \"</div><br>\";",
+        "        });",
+        "        document.getElementsByClassName('message')[0].innerHTML=html;",
+        "      };",
+        "     };",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/val\\.imageLink/g), 'message: You should use the <code>imageLink</code> property to display the images.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7fae367417b2b2512be7",
+      "title": "Pre-filter JSON to Get the Data You Need",
+      "description": [
+        "If you don't want to render every cat photo you get from the freeCodeCamp Cat Photo API, you can pre-filter the JSON before looping through it.",
+        "Given that the JSON data is stored in an array, you can use the <code>filter</code> method to filter out the cat whose \"id\" key has a value of 1.",
+        "Here's the code to do this:",
+        "<blockquote>json = json.filter(function(val) {<br>  return (val.id !== 1);<br>});</blockquote>",
+        "<hr>",
+        "Add code to <code>filter</code> the json data to remove the cat with the \"id\" value of 1."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('getMessage').onclick=function(){",
+        "      req=new XMLHttpRequest();",
+        "      req.open(\"GET\",'/json/cats.json',true);",
+        "      req.send();",
+        "      req.onload=function(){",
+        "        json=JSON.parse(req.responseText);",
+        "        var html = \"\";",
+        "        // Add your code below this line",
+        "        ",
+        "        ",
+        "        // Add your code above this line",
+        "         json.forEach(function(val) {",
+        "           html += \"<div class = 'cat'>\"",
+        "           ",
+        "           html += \"<img src = '\" + val.imageLink + \"' \" + \"alt='\" + val.altText + \"'>\"",
+        "           ",
+        "           html += \"</div>\"",
+        "         });",
+        "         document.getElementsByClassName('message')[0].innerHTML=html;",
+        "       };",
+        "     }; ",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Photo Finder</h1> ",
+        "<p class=\"message box\">",
+        "  The message will go here",
+        "</p>",
+        "<p>",
+        "  <button id=\"getMessage\">",
+        "    Get Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/json\\.filter/g), 'message: Your code should use the <code>filter</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7faf367417b2b2512be8",
+      "title": "Get Geolocation Data to Find A User's GPS Coordinates",
+      "description": [
+        "Another cool thing you can do is access your user's current location. Every browser has a built in navigator that can give you this information.",
+        "The navigator will get the user's current longitude and latitude.",
+        "You will see a prompt to allow or block this site from knowing your current location. The challenge can be completed either way, as long as the code is correct.",
+        "By selecting allow, you will see the text on the output phone change to your latitude and longitude.",
+        "Here's code that does this:",
+        "<blockquote>if (navigator.geolocation){<br>  navigator.geolocation.getCurrentPosition(function(position) {<br>    document.getElementById('data').innerHTML=\"latitude: \"+ position.coords.latitude +  \"&lt;br&gt;longitude: \" +  position.coords.longitude;<br>  });<br>}</blockquote>",
+        "First, it checks if the <code>navigator.geolocation</code> object exists. If it does, the <code>getCurrentPosition</code> method on that object is called, which initiates an asynchronous request for the user's position. If the request is successful, the callback function in the method runs. This function accesses the <code>position</code> object's values for latitude and longitude using dot notation and updates the HTML.",
+        "<hr>",
+        "Add the example code inside the <code>script</code> tags to check a user's current location and insert it into the HTML."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  // Add your code below this line",
+        "  ",
+        "  ",
+        "  // Add your code above this line",
+        "</script>",
+        "<h4>You are here:</h4>",
+        "<div id=\"data\">",
+        "",
+        "</div>"
+      ],
+      "tests": [
+        "assert(code.match(/navigator\\.geolocation\\.getCurrentPosition/g), 'message: Your code should use <code>navigator.geolocation</code> to access the user&#39;s current location.');",
+        "assert(code.match(/position\\.coords\\.latitude/g), 'message: Your code should use <code>position.coords.latitude</code> to display the user&#39;s latitudinal location.');",
+        "assert(code.match(/position\\.coords\\.longitude/g), 'message: Your code should use <code>position.coords.longitude</code> to display the user&#39;s longitudinal location.');",
+        "assert(code.match(/document\\.getElementById\\(\\s*?('|\")data\\1\\s*?\\)\\.innerHTML/g), 'message: You should display the user&#39;s position within the <code>data</code> div element.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d7faf367417b2b2512be9",
+      "title": "Post Data with the JavaScript XMLHttpRequest Method",
+      "description": [
+        "In the previous examples, you received data from an external resource. You can also send data to an external resource, as long as that resource supports AJAX requests and you know the URL.",
+        "JavaScript's <code>XMLHttpRequest</code> method is also used to post data to a server. Here's an example:",
+        "<blockquote>req=new XMLHttpRequest();<br>req.open(\"POST\",url,true);<br>req.setRequestHeader('Content-Type','text/plain');<br>req.onreadystatechange=function(){<br>  if(req.readyState==4 && req.status==200){<br>    document.getElementsByClassName('message')[0].innerHTML=req.responseText;<br>  }<br>};<br>req.send(userName);</blockquote>",
+        "You've seen several of these methods before. Here the <code>open</code> method initializes the request as a \"POST\" to the given URL of the external resource, and uses the <code>true</code> Boolean to make it asynchronous.",
+        "The <code>setRequestHeader</code> method sets the value of an HTTP request header, which contains information about the sender and the request. It must be called after the <code>open</code> method, but before the <code>send</code> method. The two parameters are the name of the header and the value to set as the body of that header.",
+        "Next, the <code>onreadystatechange</code> event listener handles a change in the state of the request. A <code>readyState</code> of 4 means the operation is complete, and a <code>status</code> of 200 means it was a successful request. The document's HTML can be updated.",
+        "Finally, the <code>send</code> method sends the request with the <code>userName</code> value, which was given by the user in the <code>input</code> field.",
+        "<hr>",
+        "Update the code to create and send a \"POST\" request. Then enter your name in input box and click \"Send Message\". Your AJAX function will replace \"Reply from Server will be here.\" with the reply of the server. In this case, it is your name appended with \" loves cats\"."
+      ],
+      "challengeSeed": [
+        "<script>",
+        "  document.addEventListener('DOMContentLoaded',function(){",
+        "    document.getElementById('sendMessage').onclick=function(){",
+        "    ",
+        "      var userName=document.getElementById('name').value;",
+        "      // Add your code below this line",
+        "      ",
+        "      ",
+        "      // Add your code above this line",
+        "    };",
+        "  });",
+        "</script>",
+        "<style>",
+        "  body {",
+        "    text-align: center;",
+        "    font-family: \"Helvetica\", sans-serif;",
+        "  }",
+        "  h1 {",
+        "    font-size: 2em;",
+        "    font-weight: bold;",
+        "  }",
+        "  .box {",
+        "    border-radius: 5px;",
+        "    background-color: #eee;",
+        "    padding: 20px 5px;",
+        "  }",
+        "  button {",
+        "    color: white;",
+        "    background-color: #4791d0;",
+        "    border-radius: 5px;",
+        "    border: 1px solid #4791d0;",
+        "    padding: 5px 10px 8px 10px;",
+        "  }",
+        "  button:hover {",
+        "    background-color: #0F5897;",
+        "    border: 1px solid #0F5897;",
+        "  }",
+        "</style>",
+        "<h1>Cat Friends</h1> ",
+        "<p class=\"message box\">",
+        "  Reply from Server will be here",
+        "</p>",
+        "<p>",
+        "  <label for=\"name\">Your name:",
+        "    <input type=\"text\" id=\"name\"/>",
+        "  </label>",
+        "  <button id=\"sendMessage\">",
+        "    Send Message",
+        "  </button>",
+        "</p>"
+      ],
+      "tests": [
+        "assert(code.match(/new\\s+?XMLHttpRequest\\(\\s*?\\)/g), 'message: Your code should create a new <code>XMLHttpRequest</code>.');",
+        "assert(code.match(/\\.open\\(\\s*?('|\")POST\\1\\s*?,\\s*?url\\s*?,\\s*?true\\s*?\\)/g), 'message: Your code should use the <code>open</code> method to initialize a \"POST\" request to the server.');",
+        "assert(code.match(/\\.setRequestHeader\\(\\s*?('|\")Content-Type\\1\\s*?,\\s*?('|\")text\\/plain\\2\\s*?\\)/g), 'message: Your code should use the <code>setRequestHeader</code> method.');",
+        "assert(code.match(/\\.onreadystatechange\\s*?=/g), 'message: Your code should have an <code>onreadystatechange</code> event handler set to a function.');",
+        "assert(code.match(/document\\.getElementsByClassName\\(\\s*?('|\")message\\1\\s*?\\)\\[0\\]\\.innerHTML\\s*?=\\s*?.+?\\.responseText/g), 'message: Your code should get the element with class <code>message</code> and change its inner HTML to the <code>responseText</code>.');",
+        "assert(code.match(/\\.send\\(\\s*?userName\\s*?\\)/g), 'message: Your code should use the <code>send</code> method.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/05-apis-and-microservices/api-and-microservice-projects.json b/seed/math-challenges/05-apis-and-microservices/api-and-microservice-projects.json
new file mode 100644
index 0000000000..a3013c9589
--- /dev/null
+++ b/seed/math-challenges/05-apis-and-microservices/api-and-microservice-projects.json
@@ -0,0 +1,207 @@
+{
+  "name": "API and Microservice Projects",
+  "order": 4,
+  "time": "150 hours",
+  "helpRoom": "HelpBackend",
+  "challenges": [
+    {
+      "id": "57ed709d334ad35e8fe79acb",
+      "title": "New Backend Format",
+      "isBeta": "true",
+      "meta": "This is just a test",
+      "description": [
+        "This is just a test of the new backend challenge test framework"
+      ],
+      "tests": [
+        {
+          "text": "website should return 200",
+          "testString": "getUserInput => $.ajax({ url: getUserInput('url'), method: 'HEAD' }).then(null, (err) => assert.fail(err));"
+        },
+        {
+          "text": "package.json should have a valid \"keywords\" key",
+          "testString": "getUserInput => ($.get(getUserInput('url') + '/_api/package.json').then(function(data){ var packJson = JSON.parse(data); assert(packJson.keywords); }, err => { throw new Error('Err: ' + err.statusText);}))"
+        },
+        {
+          "text": "\"keywords\" field should be an Array",
+          "testString": "getUserInput => ($.get(getUserInput('url') + '/_api/package.json').then(function(data){ var packJson = JSON.parse(data); assert.isArray(packJson.keywords); }, err => { throw new Error('Err: ' + err.statusText);}))"
+        },
+        {
+          "text": "\"keywords\" should include \"freecodecamp\"",
+          "testString": "getUserInput => ($.get(getUserInput('url') + '/_api/package.json').then(function(data){ var packJson = JSON.parse(data); assert.include(packJson.keywords, 'freecodecamp'); }, err => { throw new Error('Err: ' + err.statusText); }))"
+        }
+      ],
+      "type": "backend"
+    },
+    {
+      "id": "bd7158d8c443edefaeb5bdef",
+      "title": "Timestamp Microservice",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://curse-arrow.glitch.me/' target='_blank'>https://curse-arrow.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-timestamp/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-timestamp/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "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).",
+          "testString": ""
+        },
+        {
+          "text": "If it does, it returns both the Unix timestamp and the natural language form of that date.",
+          "testString": ""
+        },
+        {
+          "text": "If it does not contain a date or Unix timestamp, it returns null for those properties.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "translations": {
+        "es": {
+          "title": "Microservicio de Marca Temporal",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c443edefaeb5bdff",
+      "title": "Request Header Parser Microservice",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://dandelion-roar.glitch.me/' target='_blank'>https://dandelion-roar.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-headerparser/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-headerparser/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "I can get the IP address, language and operating system for my browser.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "translations": {
+        "es": {
+          "title": "Microservicio para analizar el encabezado de una petición",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c443edefaeb5bd0e",
+      "title": "URL Shortener Microservice",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://thread-paper.glitch.me/' target='_blank'>https://thread-paper.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-urlshortener/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-urlshortener/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "I can pass a URL as a parameter and I will receive a shortened URL in the JSON response.",
+          "testString": ""
+        },
+        {
+          "text": "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.",
+          "testString": ""
+        },
+        {
+          "text": "When I visit that shortened URL, it will redirect me to my original link.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "translations": {
+        "es": {
+          "title": "Microservicio para acortar URLs",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c443edefaeb5bdee",
+      "title": "Exercise Tracker",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://fuschia-custard.glitch.me/' target='_blank'>https://fuschia-custard.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-exercisetracker/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-exercisetracker/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "I can create a user by posting form data username to /api/exercise/new-user and returned will be an object with username and <code>_id</code>.",
+          "testString": ""
+        },
+        {
+          "text": "I can get an array of all users by getting api/exercise/users with the same info as when creating a user.",
+          "testString": ""
+        },
+        {
+          "text": "I can add an exercise to any user by posting form data userId(_id), description, duration, and optionally date to /api/exercise/add. If no date supplied it will use current date. Returned will the the user object with also with the exercise fields added.",
+          "testString": ""
+        },
+        {
+          "text": "I can retrieve a full exercise log of any user by getting /api/exercise/log with a parameter of userId(_id). Return will be the user object with added array log and count (total exercise count).",
+          "testString": ""
+        },
+        {
+          "text": "I can retrieve part of the log of any user by also passing along optional parameters of from & to or limit. (Date format yyyy-mm-dd, limit = int)",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "February 17, 2017",
+      "translations": {
+        "es": {
+          "title": "Capa de abstracción para buscar imágenes",
+          "description": []
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c443edefaeb5bd0f",
+      "title": "File Metadata Microservice",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://purple-paladin.glitch.me/' target='_blank'>https://purple-paladin.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-filemetadata/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-filemetadata/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "I can submit a FormData object that includes a file upload.",
+          "testString": ""
+        },
+        {
+          "text": "When I submit something, I will receive the file size in bytes within the JSON response.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 1, 2016",
+      "translations": {
+        "es": {
+          "title": "Microservicio de metadatos de archivos",
+          "description": []
+        }
+      }
+    }
+  ]
+}
diff --git a/seed/math-challenges/05-apis-and-microservices/basic-node-and-express.json b/seed/math-challenges/05-apis-and-microservices/basic-node-and-express.json
new file mode 100644
index 0000000000..dcc12523db
--- /dev/null
+++ b/seed/math-challenges/05-apis-and-microservices/basic-node-and-express.json
@@ -0,0 +1,312 @@
+{
+  "name": "Basic Node and Express",
+  "order": 2,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7fb0367417b2b2512bec",
+      "title": "Introduction to the Basic Node and Express Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "Node.js is a JavaScript tool that allows developers to write backend (server-side) programs in JavaScript. Node.js comes with a handful of built-in modules&mdash;small, independent programs&mdash;that help facilitate this purpose. Some of the core modules include:<br><br><ul><li>HTTP: a module that acts as a server</li><li>File System: a module that reads and modifies files</li><li>Path: a module for working with directory and file paths</li><li>Assertion Testing: a module that checks code against prescribed constraints</li></ul><br>Express, while not included with Node.js, is another module often used with it. Express runs between the server created by Node.js and the frontend pages of a web application. Express also handles an application's routing. Routing directs users to the correct page based on their interaction with the application.<br><br>While there are alternatives to using Express, its simplicity makes it a good place to begin when learning the interaction between a backend powered by Node.js and the frontend.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Working on these challenges will involve you writing your code on Glitch on our starter project. After completing each challenge you can copy your public Glitch url (to the homepage of your app) into the challenge screen to test it! Optionally you may choose to write your project on another platform but it must be publicly visible for our testing.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-express/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-express/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7fb0367417b2b2512bed",
+      "title": "Meet the Node console",
+      "description": [
+        "During the development process, it is important to be able to check what’s going on in your code. Node is just a JavaScript environment. Like client side JavaScript, you can use the console to display useful debug information. On your local machine, you would see the console output in a terminal. On Glitch you can open the logs in the lower part of the screen. You can toggle the log panel with the button ‘Logs’ (top-left, under the app name).",
+        "To get started, just print the classic \"Hello World\" in the console. We recommend to keep the log panel open while working at these challenges. Reading the logs you can be aware of the nature of the errors that may occur."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "<code>\"Hello World\"</code> should be in the console",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/hello-console').then(data => { assert.isTrue(data.passed, '\"Hello World\" is not in the server console'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb0367417b2b2512bee",
+      "title": "Start a Working Express Server",
+      "description": [
+        "In the first two lines of the file myApp.js you can see how it’s easy to create an Express app object. This object has several methods, and we will learn many of them in these challenges. One fundamental method is <code>app.listen(port)</code>. It tells your server to listen on a given port, putting it in running state. You can see it at the bottom of the file. It is inside comments because for testing reasons we need the app to be running in background. All the code that you may want to add goes between these two fundamental parts. Glitch stores the port number in the environemet variable <code>process.env.PORT</code>. Its value is <code>3000</code>.",
+        "Let’s serve our first string! In Express, routes takes the following structure: <code>app.METHOD(PATH, HANDLER)</code>. METHOD is an http method in lowercase. PATH is a relative path on the server (it can be a string, or even a regular expression). HANDLER is a function that Express calls when the route is matched.",
+        "Handlers take the form <code>function(req, res) {...}</code>, where req is the request object, and res is the response object. For example, the handler",
+        "<blockquote>function(req, res) {<br> res.send('Response String');<br>}</blockquote>",
+        "will serve the string 'Response String'.",
+        "Use the <code>app.get()</code> method to serve the string Hello Express, to GET requests matching the / root path. Be sure that your code works by looking at the logs, then see the results in your browser, clicking the button ‘Show Live’ in the Glitch UI."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Your app should serve the string 'Hello Express'",
+          "testString": "getUserInput => $.get(getUserInput('url')).then(data => { assert.equal(data, 'Hello Express', 'Your app does not serve the text \"Hello Express\"'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb0367417b2b2512bef",
+      "title": "Serve an HTML File",
+      "description": [
+        "We can respond with a file using the method <code>res.sendFile(path)</code>.",
+        "You can put it inside the <code>app.get('/', ...)</code> route handler. Behind the scenes this method will set the appropriate headers to instruct your browser on how to handle the file you want to send, according to its type. Then it will read and send the file. This method needs an absolute file path. We recommend you to use the Node global variable <code>__dirname</code> to calculate the path.",
+        "e.g. <code>absolutePath = __dirname + relativePath/file.ext</code>.",
+        "The file to send is <code>/views/index.html</code>. Try to ‘Show Live’ your app, you should see a big HTML heading (and a form that we will use later…), with no style applied.",
+        "Note: You can edit the solution of the previous challenge, or create a new one. If you create a new solution, keep in mind that Express evaluates the routes from top to bottom. It executes the handler for the first match. You have to comment out the preceding solution, or the server will keep responding with a string."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Your app should serve the file views/index.html",
+          "testString": "getUserInput => $.get(getUserInput('url')).then(data => { assert.match(data, /<h1>.*<\\/h1>/, 'Your app does not serve the expected HTML'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb0367417b2b2512bf0",
+      "title": "Serve Static Assets",
+      "description": [
+        "An HTML server usually has one or more directories that are accessible by the user. You can place there the static assets needed by your application (stylesheets, scripts, images). In Express you can put in place this functionality using the middleware <code>express.static(path)</code>, where the parameter is the absolute path of the folder containing the assets. If don’t know what a middleware is, don’t worry. We’ll discuss about it later in details. Basically middlewares are functions that intercept route handlers, adding some kind of information. A middleware needs to be mounted using the method <code>app.use(path, middlewareFunction)</code>. The first path argument is optional. If you don’t pass it, the middleware will be executed for all the requests.",
+        "Mount the <code>express.static()</code> middleware for all the requests with <code>app.use()</code>. The absolute path to the assets folder is <code>__dirname + /public</code>.",
+        "Now your app should be able to serve a CSS stylesheet. From outside the public folder will appear mounted to the root directory. Your front-page should look a little better now!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Your app should serve asset files from the <code>/public</code> directory",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/style.css').then(data => { assert.match(data, /body\\s*\\{[^\\}]*\\}/, 'Your app does not serve static assets'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb1367417b2b2512bf1",
+      "title": "Serve JSON on a Specific Route",
+      "description": [
+        "While an HTML server serves (you guessed it!) HTML, an API serves data. A <dfn>REST</dfn> (REpresentational State Transfer) API allows data exchange in a simple way, without the need for clients to know any detail about the server. The client only needs to know where the resource is (the URL), and the action it wants to perform on it (the verb). The GET verb is used when you are fetching some information, without modifying anything. These days, the preferred data format for moving information around the web is JSON. Simply put, JSON is a convenient way to represent a JavaScript object as a string, so it can be easily transmitted.",
+        "Let's create a simple API by creating a route that responds with JSON at the path <code>/json</code>. You can do it as usual, with the <code>app.get()</code> method. Inside the route handler use the method <code>res.json()</code>, passing in an object as an argument. This method closes the request-response loop, returning the data. Behind the scenes it converts a valid JavaScript object into a string, then sets the appropriate headers to tell your browser that you are serving JSON, and sends the data back. A valid object has the usual structure <code>{key: data}</code>. Data can ba a number, a string, a nested object or an array. Data can also be a variable or the result of a function call; in which case it will be evaluated before being converted into a string.",
+        "Serve the object <code>{\"message\": \"Hello json\"}</code> as a response in JSON format, to the GET requests to the route <code>/json</code>. Then point your browser to your-app-url/json, you should see the message on the screen."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "The endpoint <code>/json</code> should serve the json object <code>{\"message\": \"Hello json\"}</code>",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/json').then(data => { assert.equal(data.message, 'Hello json', 'The \\'/json\\' endpoint does not serve the right data'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb1367417b2b2512bf2",
+      "title": "Use the .env File",
+      "description": [
+        "The <code>.env</code> file is a hidden file that is used to pass environment variables to your application. This file is secret, no one but you can access it, and it can be used to store data that you want to keep private or hidden. For example, you can store API keys from external services or your database URI. You can also use it to store configuration options. By setting configuration options, you can change the behavior of your application, without the need to rewrite some code.",
+        "The environment variables are accessible from the app as <code>process.env.VAR_NAME</code>. The <code>process.env</code> object is a global Node object, and variables are passed as strings. By convention, the variable names are all uppercase, with words separated by an underscore. The <code>.env</code> is a shell file, so you don’t need to wrap names or values in quotes. It is also important to note that there cannot be space around the equals sign when you are assigning values to your variables, e.g. <code>VAR_NAME=value</code>. Usually, you will put each variable definition on a separate line.",
+        "Let's add an environment variable as a configuration option. Store the variable <code>MESSAGE_STYLE=uppercase</code> in the <code>.env</code> file. Then tell the GET <code>/json</code> route handler that you created in the last challenge to transform the response object’s message to uppercase if <code>process.env.MESSAGE_STYLE</code> equals <code>uppercase</code>. The response object should become <code>{\"message\": \"HELLO JSON\"}</code>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "The response of the endpoint <code>/json</code> should change according to the environment variable <code>MESSAGE_STYLE</code>",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/use-env-vars').then(data => { assert.isTrue(data.passed, 'The response of \"/json\" does not change according to MESSAGE_STYLE'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb1367417b2b2512bf3",
+      "title": "Implement a Root-Level Request Logger Middleware",
+      "description": [
+        "Before we introduced the <code>express.static()</code> middleware function. Now it’s time to see what middleware is, in more detail. Middleware functions are functions that take 3 arguments: the request object, the response object, and the next function in the application’s request-response cycle. These functions execute some code that can have side effects on the app, and usually add informations to the request or response objects. They can also end the cycle sending the response, when some condition is met. If they don’t send the response, when they are done they start the execution of the next function in the stack. This is triggered calling the 3rd argument <code>next()</code>. More information in the <a href='http://expressjs.com/en/guide/using-middleware.html' target='_blank'>express documentation</a>.",
+        "Look at the following example :",
+        "<blockquote>function(req, res, next) {<br>  console.log(\"I'm a middleware...\");<br>  next();<br>}</blockquote>",
+        "Let’s suppose we mounted this function on a route. When a request matches the route, it displays the string “I’m a middleware…”. Then it executes the next function in the stack.",
+        "In this exercise we are going to build a root-level middleware. As we have seen in challenge 4, to mount a middleware function at root level we can use the method <code>app.use(&lt;mware-function&gt;)</code>. In this case the function will be executed for all the requests, but you can also set more specific conditions. For example, if you want a function to be executed only for POST requests, you could use <code>app.post(&lt;mware-function&gt;)</code>. Analogous methods exist for all the http verbs (GET, DELETE, PUT, …).",
+        "Build a simple logger. For every request, it should log in the console a string taking the following format: <code>method path - ip</code>. An example would look like: <code>GET /json - ::ffff:127.0.0.1</code>. Note that there is a space between <code>method</code> and <code>path</code> and that the dash separating <code>path</code> and <code>ip</code> is surrounded by a space on either side. You can get the request method (http verb), the relative route path, and the caller’s ip from the request object, using <code>req.method</code>, <code>req.path</code> and <code>req.ip</code>. Remember to call <code>next()</code> when you are done, or your server will be stuck forever. Be sure to have the ‘Logs’ opened, and see what happens when some request arrives…",
+        "Hint: Express evaluates functions in the order they appear in the code. This is true for middleware too. If you want it to work for all the routes, it should be mounted before them."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Root level logger middleware should be active",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/root-middleware-logger').then(data => { assert.isTrue(data.passed, 'root-level logger is not working as expected'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb1367417b2b2512bf4",
+      "title": "Chain Middleware to Create a Time Server",
+      "description": [
+        "Middleware can be mounted at a specific route using <code>app.METHOD(path, middlewareFunction)</code>. Middleware can also be chained inside route definition.",
+        "Look at the following example:",
+        "<blockquote>app.get('/user', function(req, res, next) {<br>  req.user = getTheUserSync();  // Hypotetical synchronous operation<br>  next();<br>}, function(req, res) {<br>  res.send(req.user);<br>})</blockquote>",
+        "This approach is useful to split the server operations into smaller units. That leads a to a better app structure, and the possibility to reuse code in different places. This approach can also be used to perform some validation on the data. At each point of the middleware stack you can block the execution of the current chain and pass control to functions specifically designed to handle errors. Or you can pass control to the next matching route, to handle special cases. We will see how in the advanced Express section.",
+        "In the route <code>app.get('/now', ...)</code> chain a middleware function and the final handler. In the middleware function you should add the current time to the request object in the <code>req.time</code> key. You can use <code>new Date().toString()</code>. In the handler, respond with a JSON object, taking the structure <code>{time: req.time}</code>.",
+        "Hint: The test will not pass if you don’t chain the middleware. If you mount the function somewhere else, the test will fail, even if the output result is correct."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "The /now endpoint should have mounted middleware",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/chain-middleware-time').then(data => { assert.equal(data.stackLength, 2, '\"/now\" route has no mounted middleware'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "The /now endpoint should return a time that is +/- 20 secs from now",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/chain-middleware-time').then(data => { var now = new Date(); assert.isAtMost(Math.abs(new Date(data.time) - now), 20000, 'the returned time is not between +- 20 secs from now'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb2367417b2b2512bf5",
+      "title": "Get Route Parameter Input from the Client",
+      "description": [
+        "When building an API, we have to allow users to comunicate us what they want to get from our service. For example, if the client is requesting information about a user stored in the database, they need a way to let us know which user they're interested in. One possible way to achieve this result is using route parameters. Route parameters are named segments of the URL, delimited by slashes (/). Each segment captures the value of the part of the URL which matches its position. The captured values can be found in the <code>req.params</code> object.",
+        "<blockquote>route_path: '/user/:userId/book/:bookId'<br>actual_request_URL: '/user/546/book/6754' <br>req.params: {userId: '546', bookId: '6754'}</blockquote>",
+        "Build an echo server, mounted at the route <code>GET /:word/echo</code>. Respond with a JSON object, taking the structure <code>{echo: word}</code>. You can find the word to be repeated at <code>req.params.word</code>. You can test your route from your browser's address bar, visiting some matching routes, e.g. your-app-rootpath/freecodecamp/echo"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Test 1 : Your echo server should repeat words correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/eChOtEsT/echo').then(data => { assert.equal(data.echo, 'eChOtEsT', 'Test 1: the echo server is not working as expected') }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Test 2 : Your echo server should repeat words correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/ech0-t3st/echo').then(data => { assert.equal(data.echo, 'ech0-t3st', 'Test 2: the echo server is not working as expected') }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb2367417b2b2512bf6",
+      "title": "Get Query Parameter Input from the Client",
+      "description": [
+        "Another common way to get input from the client is by encoding the data after the route path, using a query string. The query string is delimited by a question mark (?), and includes field=value couples. Each couple is separated by an ampersand (&). Express can parse the data from the query string, and populate the object <code>req.query</code>. Some characters cannot be in URLs, they have to be encoded in a <a href='https://en.wikipedia.org/wiki/Percent-encoding' target='_blank'>different format</a> before you can send them. If you use the API from JavaScript, you can use specific methods to encode/decode these characters.",
+        "<blockquote>route_path: '/library'<br>actual_request_URL: '/library?userId=546&bookId=6754' <br>req.query: {userId: '546', bookId: '6754'}</blockquote>",
+        "Build an API endpoint, mounted at <code>GET /name</code>. Respond with a JSON document, taking the structure <code>{ name: 'firstname lastname'}</code>. The first and last name parameters should be encoded in a query string e.g. <code>?first=firstname&last=lastname</code>.",
+        "TIP: In the following exercise we are going to receive data from a POST request, at the same <code>/name</code> route path. If you want you can use the method <code>app.route(path).get(handler).post(handler)</code>. This syntax allows you to chain different verb handlers on the same path route. You can save a bit of typing, and have cleaner code."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Test 1 : Your API endpoint should respond with the correct name",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/name?first=Mick&last=Jagger').then(data => { assert.equal(data.name, 'Mick Jagger', 'Test 1: \"GET /name\" route does not behave as expected') }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Test 2 : Your APi endpoint should respond with the correct name",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/name?last=Richards&first=Keith').then(data => { assert.equal(data.name, 'Keith Richards', 'Test 2: \"GET /name\" route does not behave as expected') }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb2367417b2b2512bf7",
+      "title": "Use body-parser to Parse POST Requests",
+      "description": [
+        "Besides GET there is another common http verb, it is POST. POST is the default method used to send client data with HTML forms. In the REST convention POST is used to send data to create new items in the database (a new user, or a new blog post). We don’t have a database in this project, but we are going to learn how to handle POST requests anyway.",
+        "In these kind of requests the data doesn’t appear in the URL, it is hidden in the request body. This is a part of the HTML request, also called payload. Since HTML is text based, even if you don’t see the data, it doesn’t mean that they are secret. The raw content of an HTTP POST request is shown below:",
+        "<blockquote>POST /path/subpath HTTP/1.0<br>From: john@example.com<br>User-Agent: someBrowser/1.0<br>Content-Type: application/x-www-form-urlencoded<br>Content-Length: 20<br>name=John+Doe&age=25</blockquote>",
+        "As you can see the body is encoded like the query string. This is the default format used by HTML forms. With Ajax we can also use JSON to be able to handle data having a more complex structure. There is also another type of encoding: multipart/form-data. This one is used to upload binary files.",
+        "In this exercise we will use an urlencoded body.",
+        "To parse the data coming from POST requests, you have to install a package: the body-parser. This package allows you to use a series of middleware, which can decode data in different formats. See the docs <a href=\"https://github.com/expressjs/body-parser\" target=\"_blank\" >here</a>.",
+        "Install the body-parser module in your package.json. Then require it at the top of the file. Store it in a variable named bodyParser.",
+        "The middleware to handle url encoded data is returned by <code>bodyParser.urlencoded({extended: false})</code>. <code>extended=false</code> is a configuration option that tells the parser to use the classic encoding. When using it, values can be only strings or arrays. The extended version allows more data flexibility, but it is outmatched by JSON. Pass to <code>app.use()</code> the function returned by the previous method call. As usual, the middleware must be mounted before all the routes which need it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "The 'body-parser' middleware should be mounted",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/add-body-parser').then(data => { assert.isAbove(data.mountedAt, 0, '\"body-parser\" is not mounted correctly') }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb2367417b2b2512bf8",
+      "title": "Get Data from POST Requests",
+      "description": [
+        "Mount a POST handler at the path <code>/name</code>. It’s the same path as before. We have prepared a form in the html frontpage. It will submit the same data of exercise 10 (Query string). If the body-parser is configured correctly, you should find the parameters in the object <code>req.body</code>. Have a look at the usual library example:",
+        "<blockquote>route: POST '/library'<br>urlencoded_body: userId=546&bookId=6754 <br>req.body: {userId: '546', bookId: '6754'}</blockquote>",
+        "Respond with the same JSON object as before: <code>{name: 'firstname lastname'}</code>. Test if your endpoint works using the html form we provided in the app frontpage.",
+        "Tip: There are several other http methods other than GET and POST. And by convention there is a corrispondence between the http verb, and the operation you are going to execute on the server. The conventional mapping is:",
+        "POST (sometimes PUT) - Create a new resource using the information sent with the request,",
+        "GET - Read an existing resource without modifying it,",
+        "PUT or PATCH (sometimes POST) - Update a resource using the data sent,",
+        "DELETE => Delete a resource.",
+        "There are also a couple of other methods which are used to negotiate a connection with the server. Except from GET, all the other methods listed above can have a payload (i.e. the data into the request body). The body-parser middleware works with these methods as well."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Test 1 : Your API endpoint should respond with the correct name",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/name', {first: 'Mick', last: 'Jagger'}).then(data => { assert.equal(data.name, 'Mick Jagger', 'Test 1: \"POST /name\" route does not behave as expected') }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Test 2 : Your API endpoint should respond with the correct name",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/name', {first: 'Keith', last: 'Richards'}).then(data => { assert.equal(data.name, 'Keith Richards', 'Test 2: \"POST /name\" route does not behave as expected') }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/05-apis-and-microservices/claim-your-apis-and-microservices-certificate.json b/seed/math-challenges/05-apis-and-microservices/claim-your-apis-and-microservices-certificate.json
new file mode 100644
index 0000000000..e1874d27ea
--- /dev/null
+++ b/seed/math-challenges/05-apis-and-microservices/claim-your-apis-and-microservices-certificate.json
@@ -0,0 +1,108 @@
+{
+  "name": "Claim Your APIs and Microservices Certificate",
+  "order": 13,
+  "time": "5 minutes",
+  "challenges": [
+    {
+      "id": "587d7fb3367417b2b2512bf9",
+      "title": "Claim Your APIs and Microservices Certificate",
+      "description": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "An image of our APIs and Microservices Certificate",
+          "This challenge will give you your verified APIs and Microservices Certificate. Before we issue your certificate, we must verify that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. You must also accept our Academic Honesty Pledge. Click the button below to start this process.",
+          ""
+        ],
+        [
+          "//i.imgur.com/uLPsUko.jpg",
+          "The definition of plagiarism: Plagiarism (noun) - copying someone else’s work and presenting it as your own without crediting them",
+          "By clicking below, you pledge that all of your submitted code A) is code you or your pair personally wrote, or B) comes from open source libraries like jQuery, or C) has been clearly attributed to its original authors. You also give us permission to audit your challenge solutions and revoke your certificate if we discover evidence of plagiarism.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/UedoV2G.jpg",
+          "An image of the text \"Front End Development Certificate requirements\"",
+          "Let's confirm that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. Click the button below to verify this.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/Q5Za9U6.jpg",
+          "An image of the word \"Congratulations\"",
+          "Congratulations! We've added your APIs and Microservices Certificate to your portfolio page. Unless you choose to hide your solutions, this certificate will remain publicly visible and verifiable.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        {
+          "properties": [
+            "isHonest",
+            "isFrontEndCert"
+          ],
+          "apis": [
+            "/certificate/honest",
+            "/certificate/verify/front-end"
+          ],
+          "stepIndex": [
+            1,
+            2
+          ]
+        }
+      ],
+      "tests": [
+        {
+          "id": "bd7158d8c443edefaeb5bdef",
+          "title": "Timestamp Microservice"
+        },
+        {
+          "id": "bd7158d8c443edefaeb5bdff",
+          "title": "Request Header Parser Microservice"
+        },
+        {
+          "id": "bd7158d8c443edefaeb5bd0e",
+          "title": "URL Shortener Microservice"
+        },
+        {
+          "id": "bd7158d8c443edefaeb5bd0f",
+          "title": "File Metadata Microservice"
+        },
+        {
+          "id": "bd7158d8c443edefaeb5bdee",
+          "title": "Exercise Tracker"
+        }
+      ],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "es": {
+          "title": "Reclama tu certificado de Desarrollo de interfaces",
+          "description": [
+            [
+              "//i.imgur.com/k8btNUB.jpg",
+              "Una imagen que muestra nuestro certificado de Desarrollo de interfaces",
+              "Este desafío te otorga tu certificado autenticado de Desarrollo de interfaces. Antes de que podamos emitir tu certificado, debemos verificar que has completado todos los desafíos básicos e intermedios de diseño de algoritmos, y todos los proyectos básicos e intermedios de desarrollo de interfaces. También debes aceptar nuestro Juramento de honestidad académica. Pulsa el botón siguiente para iniciar este proceso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/HArFfMN.jpg",
+              "Plagio (nombre): acción y efecto de plagiar. Plagiar (verbo) - copiar en lo sustancial obras ajenas, dándolas como propias.",
+              "Al pulsar el botón siguiente, juras que todo el código en tus soluciones a los desafíos A) es código que tú o tu compañero escribieron personalmente, o B) proviene de librerías de código abierto como jQuery, o C) ha sido claramente atribuido a sus autores originales. También nos otorgas el permiso para auditar tus soluciones a los desafíos y revocar tu certificado si encontramos evidencia de plagio.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/14F2Van.jpg",
+              "Una imagen del texto \"Front End Development Certificate requirements\"",
+              "Confirmemos que has completado todos nuestros desafíos básicos e intermedios de diseño de algoritmos, y todos nuestros proyectos básicos e intermedios de desarrollo de interfaces. Pulsa el botón siguiente para hacer la verificación.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/16SIhHO.jpg",
+              "Una imagen de la palabra \"Congratulations\"",
+              "¡Felicitaciones! Hemos agregado tu certificado de Desarrollo de interfaces a tu portafolio. A menos que elijas no mostrar tus soluciones, este certificado será públicamente visible y verificable.",
+              ""
+            ]
+          ]
+        }
+      }
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/05-apis-and-microservices/managing-packages-with-npm.json b/seed/math-challenges/05-apis-and-microservices/managing-packages-with-npm.json
new file mode 100644
index 0000000000..96c62d028c
--- /dev/null
+++ b/seed/math-challenges/05-apis-and-microservices/managing-packages-with-npm.json
@@ -0,0 +1,307 @@
+{
+  "name": "Managing Packages with npm",
+  "order": 1,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7fb3367417b2b2512bfa",
+      "title": "Introduction to the Managing Packages with npm Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "The Node Package Manager (npm) is a command-line tool used by developers to share and control modules (or packages) of JavaScript code written for use with Node.js.<br><br>When starting a new project, npm generates a <code>package.json</code> file. This file lists the package dependencies for your project. Since npm packages are regularly updated, the <code>package.json</code> file allows you to set specific version numbers for each dependency. This ensures that updates to a package don't break your project.<br><br>npm saves packages in a folder named <code>node_modules</code>. These packages can be installed in two ways:<br><br><ol><li>globally in a root <code>node_modules</code> folder, accessible by all projects.</li><li>locally within a project's own <code>node_modules</code> folder, accessible only to that project.</li></ol><br>Most developers prefer to install packages local to each project to create a separation between the dependencies of different projects.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Working on these challenges will involve you writing your code on Glitch on our starter project. After completing each challenge you can copy your public Glitch url (to the homepage of your app) into the challenge screen to test it! Optionally you may choose to write your project on another platform but it must be publicly visible for our testing.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-npm'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-npm/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7fb3367417b2b2512bfb",
+      "title": "How to Use package.json, the Core of Any Node.js Project or npm Package",
+      "description": [
+        "The file package.json is the center of any Node.js project or npm package. It stores information about your project just like the <head>-section in a HTML document describes the content of a webpage. The package.json consists of a single JSON-object where information is stored in \"key\": value-pairs. There are only two required fields in a minimal package.json - name and version - but it’s a good practice to provide additional information about your project that could be useful to future users or maintainers.",
+        "The author-field",
+        "If you go to the Glitch project that you set up previously and look at on the left side of your screen, you’ll find the file tree where you can see an overview of the various files in your project. Under the file tree’s back-end section, you’ll find package.json - the file that we’ll be improving in the next couple of challenges.",
+        "One of the most common pieces of information in this file is the author-field that specifies who’s the creator of a project. It can either be a string or an object with contact details. The object is recommended for bigger projects but in our case, a simple string like the following example will do.",
+        "<code>\"author\": \"Jane Doe\",</code>",
+        "Instructions",
+        "Add your name to the author-field in the package.json of your Glitch project.",
+        "Remember that you’re writing JSON.",
+        "All field-names must use double-quotes (\"), e.g. \"author\"",
+        "All fields must be separated with a comma (,)"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "package.json should have a valid \"author\" key",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert(packJson.author, '\"author\" is missing'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb3367417b2b2512bfc",
+      "title": "Add a Description to Your package.json",
+      "description": [
+        "The next part of a good package.json is the description-field, where a short but informative description about your project belongs.",
+        "If you some day plan to publishing a package to npm, remember that this is the string that should sell your idea to the user when they decide whether to install your package or not. However, that’s not the only use case for the description: Since it’s a great way to summarize what a project does, it’s just as important for your normal Node.js-projects to help other developers, future maintainers or even your future self understand the project quickly.",
+        "Regardless of what you plan for your project, a description is definitely recommended. Let’s add something similar to this:",
+        "<code>\"description\": \"A project that does something awesome\",</code>",
+        "Instructions",
+        "Add a description to the package.json in your Glitch project.",
+        "Remember to use double-quotes for field-names (\") and commas (,) to separate fields."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "package.json should have a valid \"description\" key",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert(packJson.description, '\"description\" is missing'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb4367417b2b2512bfd",
+      "title": "Add Keywords to Your package.json",
+      "description": [
+        "The keywords-field is where you can describe your project using related keywords.",
+        "Example",
+        "<code>\"keywords\": [ \"descriptive\", \"related\", \"words\" ],</code>",
+        "As you can see, this field is structured as an array of double-quoted strings.",
+        "Instructions",
+        "Add an array of suitable strings to the keywords-field in the package.json of your Glitch project.",
+        "One of the keywords should be freecodecamp."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "package.json should have a valid \"keywords\" key",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert(packJson.keywords, '\"keywords\" is missing'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"keywords\" field should be an Array",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.isArray(packJson.keywords, '\"keywords\" is not an array'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"keywords\" should include \"freecodecamp\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data);     assert.include(packJson.keywords, 'freecodecamp', '\"keywords\" does not include \"freecodecamp\"'); },  xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb4367417b2b2512bfe",
+      "title": "Add a License to Your package.json",
+      "description": [
+        "TODO: This challenge could be used to inspire more people to develop OSS - we should really improve this description.",
+        "The license-field is where you inform users of your project what they are allowed to do with it.",
+        "Some common licenses for open source projects include MIT and BSD. http://choosealicense.com is a great resource if you want to learn more about what license could fit your project.",
+        "License information is not required. Copyright laws in most countries will give you ownership of what you create by default. However, it’s always a good practice to explicitly state what users can and can’t do.",
+        "Example",
+        "<code>\"license\": \"MIT\",</code>",
+        "Instructions",
+        "Fill the license-field in the package.json of your Glitch project as you find suitable."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "package.json should have a valid \"license\" key",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert(packJson.license, '\"license\" is missing'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb4367417b2b2512bff",
+      "title": "Add a Version to Your package.json",
+      "description": [
+        "The version is together with name one of the required fields in a package.json. This field describes the current version of your project.",
+        "Example",
+        "<code>\"version\": \"1.2\",</code>",
+        "Instructions",
+        "Add a version to the package.json in your Glitch project."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "package.json should have a valid \"version\" key",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert(packJson.version, '\"version\" is missing'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb4367417b2b2512c00",
+      "title": "Expand Your Project with External Packages from npm",
+      "description": [
+        "One of the biggest reasons to use a package manager is their powerful dependency management. Instead of manually having to make sure that you get all dependencies whenever you set up a project on a new computer, npm automatically installs everything for you. But how can npm know exactly what your project needs? Meet the dependencies-section of your package.json.",
+        "In the dependencies-section, packages your project require are stored using the following format:",
+        "<code>\"dependencies\": {</code>",
+        "<code>  \"package-name\": \"version\",</code>",
+        "<code>  \"express\": \"4.14.0\"</code>",
+        "<code>}</code>",
+        "Instructions",
+        "Add version 2.14.0 of the package moment to the dependencies-field of your package.json",
+        "Moment is a handy library for working with time and dates."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"dependencies\" should include \"moment\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data);  assert.property(packJson.dependencies, 'moment', '\"dependencies\" does not include \"moment\"'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"moment\" version should be \"2.14.0\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data);  assert.match(packJson.dependencies.moment, /^[\\^\\~]?2\\.14\\.0/, 'Wrong version of \"moment\" installed. It should be 2.14.0'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb5367417b2b2512c01",
+      "title": "Manage npm Dependencies By Understanding Semantic Versioning",
+      "description": [
+        "Versions of the npm packages in the dependencies-section of your package.json follow what’s called Semantic Versioning (SemVer), an industry standard for software versioning aiming to make it easier to manage dependencies. Libraries, frameworks or other tools published on npm should use SemVer in order to clearly communicate what kind of changes that projects who depend on the package can expect if they update.",
+        "SemVer doesn’t make sense in projects without public APIs - so unless your project is similar to the examples above, use another versioning format.",
+        "So why do you need to understand SemVer?",
+        "Knowing SemVer can be useful when you develop software that use external dependencies (which you almost always do). One day, your understanding of these numbers will save you from accidentally introducing breaking changes to your project without understanding why things “that worked yesterday” suddenly doesn’t.",
+        "This is how Semantic Versioning works according to the official website:",
+        "Given a version number MAJOR.MINOR.PATCH, increment the:",
+        "MAJOR version when you make incompatible API changes,",
+        "MINOR version when you add functionality in a backwards-compatible manner, and",
+        "PATCH version when you make backwards-compatible bug fixes.",
+        "This means that PATCHes are bug fixes and MINORs add new features but neither of them break what worked before. Finally, MAJORs add changes that won’t work with earlier versions.",
+        "Example",
+        "A semantic version number: 1.3.8",
+        "Instructions",
+        "In the dependencies-section of your package.json, change the version of moment to match MAJOR version 2, MINOR version 10 and PATCH version 2"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"dependencies\" should include \"moment\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'moment', '\"dependencies\" does not include \"moment\"'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"moment\" version should be \"2.10.2\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.match(packJson.dependencies.moment, /^[\\^\\~]?2\\.10\\.2/, 'Wrong version of \"moment\". It should be 2.10.2'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb5367417b2b2512c02",
+      "title": "Use the Tilde-Character to Always Use the Latest Patch Version of a Dependency",
+      "description": [
+        "In the last challenge, we told npm to only include a specific version of a package. That’s a useful way to freeze your dependencies if you need to make sure that different parts of your project stay compatible with each other. But in most use cases you don’t want to miss bug fixes, since they often include important security patches and (hopefully) don’t break things in doing so.",
+        "To allow a npm dependency to get updated to the latest PATCH-version, you can prefix the dependency’s version with the tilde-character (~). In package.json, our current rule for how npm may upgrade moment is to use a specific version only (2.10.2), but we want to allow the latest 2.10.x-version.",
+        "Example",
+        "<code>\"some-package-name\": \"~1.3.8\" allows updates to any 1.3.x version.</code>",
+        "Instructions",
+        "Use the tilde-character (~) to prefix the version of moment in your dependencies and allow npm to update it to any new PATCH release.",
+        "Note that the version numbers themselves not should be changed."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"dependencies\" should include \"moment\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'moment', '\"dependencies\" does not include \"moment\"'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"moment\" version should match \"~2.10.2\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.match(packJson.dependencies.moment, /^\\~2\\.10\\.2/, 'Wrong version of \"moment\". It should be ~2.10.2'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb5367417b2b2512c03",
+      "title": "Use the Caret-Character to Use the Latest Minor Version of a Dependency",
+      "description": [
+        "Similar to how the tilde (~) we learned about in the last challenge allow npm to install the latest PATCH for a dependency, the caret (^) allows npm to install future updates as well. The difference is that the caret will allow both MINOR updates and PATCHes.",
+        "At the moment, your current version of moment should be ~2.10.2 which allows npm to install to the latest 2.10.x-version. If we instead were to use the caret (^) as our version prefix, npm would instead be allowed to update to any 2.x.x-version.",
+        "Example",
+        "<code>\"some-package-name\": \"^1.3.8\" allows updates to any 1.x.x version.</code>",
+        "Instructions",
+        "Use the caret-character (^) to prefix the version of moment in your dependencies and allow npm to update it to any new MINOR release.",
+        "Note that the version numbers themselves not should be changed."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"dependencies\" should include \"moment\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'moment', '\"dependencies\" does not include \"moment\"'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"moment\" version should match \"^2.x.x\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.match(packJson.dependencies.moment, /^\\^2\\./, 'Wrong version of \"moment\". It should be ^2.10.2'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb5367417b2b2512c04",
+      "title": "Remove a Package from Your Dependencies",
+      "description": [
+        "Now you’ve tested a few ways you can manage dependencies of your project by using the package.json's dependencies-section. You’ve included external packages by adding them to the file and even told npm what types of versions you want by using special characters as the tilde (~) or the caret (^).",
+        "But what if you want to remove an external package that you no longer need? You might already have guessed it - Just remove the corresponding \"key\": value-pair for that from your dependencies.",
+        "This same method applies to removing other fields in your package.json as well",
+        "Instructions",
+        "Remove the package moment from your dependencies.",
+        "Make sure you have the right amount of commas after removing it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"dependencies\" should not include \"moment\"",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.notProperty(packJson.dependencies, 'moment', '\"dependencies\" still includes \"moment\"'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/05-apis-and-microservices/mongodb-and-mongoose.json b/seed/math-challenges/05-apis-and-microservices/mongodb-and-mongoose.json
new file mode 100644
index 0000000000..1d9e76f51f
--- /dev/null
+++ b/seed/math-challenges/05-apis-and-microservices/mongodb-and-mongoose.json
@@ -0,0 +1,285 @@
+{
+  "name": "MongoDB and Mongoose",
+  "order": 3,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "587d7fb5367417b2b2512c05",
+      "title": "Introduction to the MongoDB and Mongoose Challenges",
+      "description": [
+        [
+          "",
+          "",
+          "MongoDB is a database that stores data records (documents) for use by an application. Mongo is a non-relational, \"NoSQL\" database. This means Mongo stores all data associated within one record, instead of storing it across many preset tables as in a SQL database. Some benefits of this storage model are:<br><br><ul><li>Scalability: by default, non-relational databases are split (or \"sharded\") across many systems instead of only one. This makes it easier to improve performance at a lower cost.</li><li>Flexibility: new datasets and properties can be added to a document without the need to make a new table for that data.</li><li>Replication: copies of the database run in parallel so if one goes down, one of the copies becomes the new primary data source.</li></ul><br>While there are many non-relational databases, Mongo's use of JSON as its document storage structure makes it a logical choice when learning backend JavaScript. Accessing documents and their properties is like accessing objects in JavaScript.<br><br>Mongoose.js is an npm module for Node.js that allows you to write objects for Mongo as you would in JavaScript. This can make is easier to construct documents for storage in Mongo.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "Working on these challenges will involve you writing your code on Glitch on our starter project. After completing each challenge you can copy your public glitch url (to the homepage of your app) into the challenge screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mongomongoose/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-mongomongoose/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d7fb6367417b2b2512c06",
+      "title": "Install and Set Up Mongoose",
+      "description": [
+        "Add mongodb and mongoose to the project’s package.json. Then require mongoose. Store your mLab database URI in the private .env file as MONGO_URI. Connect to the database using mongoose.connect(<Your URI>)"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"mongodb\" dependency should be in package.json",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/file/package.json').then(data => { var packJson = JSON.parse(data);     assert.property(packJson.dependencies, 'mongodb'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "\"mongoose\" dependency should be in package.json",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/file/package.json').then(data => { var packJson = JSON.parse(data);     assert.property(packJson.dependencies, 'mongooose'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb6367417b2b2512c07",
+      "title": "Create a Model",
+      "description": [
+        "First of all we need a Schema. Each schema maps to a MongoDB collection. It defines the shape of the documents within that collection.",
+        "Schemas are building block for Models. They can be nested to create complex models, but in this case we’ll keep things simple.",
+        "A model allows you to create instances of your objects, called documents.",
+        "Create a person having this prototype :",
+        "<code>- Person Prototype -</code>",
+        "<code>--------------------</code>",
+        "<code>name : string [required]</code>",
+        "<code>age :  number</code>",
+        "<code>favoriteFoods : array of strings (*) </code>",
+        "Use the mongoose basic schema types. If you want you can also add",
+        "more fields, use simple validators like required or unique,",
+        "and set default values. See the <a href='http://mongoosejs.com/docs/guide.html'>mongoose docs</a>.",
+        "[C]RUD Part I - CREATE",
+        "Note: Glitch is a real server, and in real servers the interactions with the db happen in handler functions. These function are executed when some event happens (e.g. someone hits an endpoint on your API). We’ll follow the same approach in these exercises. The done() function is a callback that tells us that we can proceed after completing an asynchronous operation such as inserting, searching, updating or deleting. It’s following the Node convention and should be called as done(null, data) on success, or done(err) on error.",
+        "Warning - When interacting with remote services, errors may occur !",
+        "<code>/* Example */</code>",
+        "<code>var someFunc = function(done) {</code>",
+        "<code>  //... do something (risky) ...</code>",
+        "<code>  if(error) return done(error);</code>",
+        "<code>  done(null, result);</code>",
+        "<code>};</code>"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Creating an instance from a mongoose schema should succeed",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/_api/mongoose-model', {name: 'Mike', age: 28, favoriteFoods: ['pizza', 'cheese']}).then(data => { assert.equal(data.name, 'Mike', '\"model.name\" is not what expected'); assert.equal(data.age, '28', '\"model.age\" is not what expected'); assert.isArray(data.favoriteFoods, '\"model.favoriteFoods\" is not an Array'); assert.include(data.favoriteFoods, 'pizza', '\"model.favoriteFoods\" does not include the expected items'); assert.include(data.favoriteFoods, 'cheese', '\"model.favoriteFoods\" does not include the expected items'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb6367417b2b2512c09",
+      "title": "Create and Save a Record of a Model",
+      "description": [
+        "Create a document instance using the Person constructor you build before. Pass to the constructor an object having the fields name, age, and favoriteFoods. Their types must be conformant to the ones in the Person Schema. Then call the method document.save() on the returned document instance. Pass to it a callback using the Node convention. This is a common pattern, all the following CRUD methods take a callback function like this as the last argument.",
+        "<code>/* Example */</code>",
+        "<code>// ...</code>",
+        "<code>person.save(function(err, data) {</code>",
+        "<code>//   ...do your stuff here...</code>",
+        "<code>});</code>"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Creating and saving a db item should succeed",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/create-and-save-person').then(data => { assert.isString(data.name, '\"item.name\" should be a String'); assert.isNumber(data.age, '28', '\"item.age\" should be a Number'); assert.isArray(data.favoriteFoods, '\"item.favoriteFoods\" should be an Array'); assert.equal(data.__v, 0, 'The db item should be not previously edited'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb7367417b2b2512c0a",
+      "title": "Create Many Records with model.create()",
+      "description": [
+        "Sometimes you need to create many instances of your models, e.g. when seeding a database with initial data. Model.create() takes an array of objects like [{name: 'John', ...}, {...}, ...] as the first argument, and saves them all in the db. Create many people with Model.create(), using the function argument arrayOfPeople."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Creating many db items at once should succeed",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url') + '/_api/create-many-people', type: 'POST', contentType:'application/json', data: JSON.stringify([{name: 'John', age: 24, favoriteFoods: ['pizza', 'salad']}, {name: 'Mary', age: 21, favoriteFoods: ['onions', 'chicken']}])}).then(data => { assert.isArray(data, 'the response should be an array'); assert.equal(data.length, 2, 'the response does not contain the expected number of items'); assert.equal(data[0].name, 'John', 'The first item is not correct'); assert.equal(data[0].__v, 0, 'The first item should be not previously edited'); assert.equal(data[1].name, 'Mary', 'The second item is not correct'); assert.equal(data[1].__v, 0, 'The second item should be not previously edited'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb7367417b2b2512c0b",
+      "title": "Use model.find() to Search Your Database",
+      "description": [
+        "Find all the people having a given name, using Model.find() -> [Person]",
+        "In its simplest usage, Model.find() accepts a query document (a JSON object ) as the first argument, then a callback. It returns an array of matches. It supports an extremely wide range of search options. Check it in the docs. Use the function argument personName as search key."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Find all items corresponding to a criteria should succeed",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/_api/find-all-by-name', {name: 'r@nd0mN4m3', age: 24, favoriteFoods: ['pizza']}).then(data => { assert.isArray(data, 'the response should be an Array');  assert.equal(data[0].name, 'r@nd0mN4m3', 'item.name is not what expected'); assert.equal(data[0].__v, 0, 'The item should be not previously edited'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb7367417b2b2512c0c",
+      "title": "Use model.findOne() to Return a Single Matching Document from Your Database",
+      "description": [
+        "Model.findOne() behaves like .find(), but it returns only one document (not an array), even if there are items. It is especially useful when searching by properties that you have declared as unique. Find just one person which has a certain food in her favorites, using Model.findOne() -> Person. Use the function argument food as search key."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Find one item should succeed",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/_api/find-one-by-food', {name: 'Gary', age: 46, favoriteFoods: ['chicken salad']}).then(data => { assert.equal(data.name, 'Gary', 'item.name is not what expected'); assert.deepEqual(data.favoriteFoods, ['chicken salad'], 'item.favoriteFoods is not what expected'); assert.equal(data.__v, 0, 'The item should be not previously edited'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb7367417b2b2512c0d",
+      "title": "Use model.findById() to Search Your Database By _id",
+      "description": [
+        "When saving a document, mongodb automatically adds the field _id, and set it to a unique alphanumeric key. Searching by _id is an extremely frequent operation, so moongose provides a dedicated method for it. Find the (only!!) person having a given _id, using Model.findById() -> Person. Use the function argument personId as search key."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Find an item by Id should succeed",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/find-by-id').then(data => { assert.equal(data.name, 'test', 'item.name is not what expected'); assert.equal(data.age, 0, 'item.age is not what expected'); assert.deepEqual(data.favoriteFoods, ['none'], 'item.favoriteFoods is not what expected'); assert.equal(data.__v, 0, 'The item should be not previously edited'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb8367417b2b2512c0e",
+      "title": "Perform Classic Updates by Running Find, Edit, then Save",
+      "description": [
+        "In the good old days this was what you needed to do if you wanted to edit a document and be able to use it somehow e.g. sending it back in a server response. Mongoose has a dedicated updating method : Model.update(). It is binded to the low-level mongo driver. It can bulk edit many documents matching certain criteria, but it doesn’t send back the updated document, only a ‘status’ message. Furthermore it makes model validations difficult, because it just directly calls the mongo driver.",
+        "Find a person by _id ( use any of the above methods ) with the parameter personId as search key. Add “hamburger” to the list of her favoriteFoods (you can use Array.push()). Then - inside the find callback - save() the updated Person.",
+        "[*] Hint: This may be tricky if in your Schema you declared favoriteFoods as an Array, without specifying the type (i.e. [String]). In that casefavoriteFoods defaults to Mixed type, and you have to manually mark it as edited using document.markModified('edited-field'). (http://mongoosejs.com/docs/schematypes.html - #Mixed )"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Find-edit-update an item should succeed",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/_api/find-edit-save', {name:'Poldo', age: 40, favoriteFoods:['spaghetti']}).then(data => { assert.equal(data.name, 'Poldo', 'item.name is not what expected'); assert.equal(data.age, 40, 'item.age is not what expected'); assert.deepEqual(data.favoriteFoods, ['spaghetti', 'hamburger'], 'item.favoriteFoods is not what expected'); assert.equal(data.__v, 1, 'The item should be previously edited'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb8367417b2b2512c0f",
+      "title": "Perform New Updates on a Document Using model.findOneAndUpdate()",
+      "description": [
+        "Recent versions of mongoose have methods to simplify documents updating. Some more advanced features (i.e. pre/post hooks, validation) behave differently with this approach, so the Classic method is still useful in many situations. findByIdAndUpdate() can be used when searching by Id.",
+        "Find a person by Name and set her age to 20. Use the function parameter personName as search key.",
+        "Hint: We want you to return the updated document. o do that you need to pass the options document { new: true } as the 3rd argument to findOneAndUpdate(). By default these methods return the unmodified object."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "findOneAndUpdate an item should succeed",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/_api/find-one-update', {name:'Dorian Gray', age: 35, favoriteFoods:['unknown']}).then(data => { assert.equal(data.name, 'Dorian Gray', 'item.name is not what expected'); assert.equal(data.age, 20, 'item.age is not what expected'); assert.deepEqual(data.favoriteFoods, ['unknown'], 'item.favoriteFoods is not what expected'); assert.equal(data.__v, 0, 'findOneAndUpdate does not increment version by design !!!'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb8367417b2b2512c10",
+      "title": "Delete One Document Using model.findByIdAndRemove",
+      "description": [
+        "Delete one person by her _id. You should use one of the methods findByIdAndRemove() or findOneAndRemove(). They are like the previous update methods. They pass the removed document to the cb. As usual, use the function argument personId as search key."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Deleting an item should succeed",
+          "testString": "getUserInput => $.post(getUserInput('url') + '/_api/remove-one-person', {name:'Jason Bourne', age: 36, favoriteFoods:['apples']}).then(data => { assert.equal(data.name, 'Jason Bourne', 'item.name is not what expected'); assert.equal(data.age, 36, 'item.age is not what expected'); assert.deepEqual(data.favoriteFoods, ['apples'], 'item.favoriteFoods is not what expected'); assert.equal(data.__v, 0); assert.equal(data.count, 0, 'the db items count is not what expected'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb8367417b2b2512c11",
+      "title": "Delete Many Documents with model.remove()",
+      "description": [
+        "Model.remove() is useful to delete all the documents matching given criteria. Delete all the people whose name is “Mary”, using Model.remove(). Pass to it a query ducument with the “name” field set, and of course a callback.",
+        "Note: Model.remove() doesn’t return the deleted document, but a JSON object containing the outcome of the operation, and the number of items affected. Don’t forget to pass it to the done() callback, since we use it in tests."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Deleting many items at once should succeed",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url') + '/_api/remove-many-people', type: 'POST', contentType:'application/json', data: JSON.stringify([{name: 'Mary', age: 16, favoriteFoods: ['lollipop']}, {name: 'Mary', age: 21, favoriteFoods: ['steak']}])}).then(data => { assert.isTrue(!!data.ok, 'The mongo stats are not what expected'); assert.equal(data.n, 2, 'The number of items affected is not what expected'); assert.equal(data.count, 0, 'the db items count is not what expected'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    },
+    {
+      "id": "587d7fb9367417b2b2512c12",
+      "title": "Chain Search Query Helpers to Narrow Search Results",
+      "description": [
+        "If you don’t pass the callback as the last argument to Model.find() (or to the other search methods), the query is not executed. You can store the query in a variable for later use. This kind of object enables you to build up a query using chaining syntax. The actual db search is executed when you finally chain the method .exec(). Pass your callback to this last method. There are many query helpers, here we’ll use the most ‘famous’ ones.",
+        "Find people who like \"burrito\". Sort them by name, limit the results to two documents, and hide their age. Chain .find(), .sort(), .limit(), .select(), and then .exec(). Pass the done(err, data) callback to exec()."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Chaining query helpers should succeed",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url') + '/_api/query-tools', type: 'POST', contentType:'application/json', data: JSON.stringify([{name: 'Pablo', age: 26, favoriteFoods: ['burrito', 'hot-dog']}, {name: 'Ashley', age: 32, favoriteFoods: ['steak', 'burrito']}, {name: 'Mario', age: 51, favoriteFoods: ['burrito', 'prosciutto']} ]) }).then(data => { assert.isArray(data, 'the response should be an Array'); assert.equal(data.length, 2, 'the data array length is not what expected'); assert.notProperty(data[0], 'age', 'The returned first item has too many properties'); assert.equal(data[0].name, 'Ashley', 'The returned first item name is not what expected'); assert.notProperty(data[1], 'age', 'The returned second item has too many properties'); assert.equal(data[1].name, 'Mario', 'The returned second item name is not what expected');}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/06-information-security-and-quality-assurance/advanced-express-tools.json b/seed/math-challenges/06-information-security-and-quality-assurance/advanced-express-tools.json
new file mode 100644
index 0000000000..8b87163b16
--- /dev/null
+++ b/seed/math-challenges/06-information-security-and-quality-assurance/advanced-express-tools.json
@@ -0,0 +1,787 @@
+{
+  "name": "Advanced Node and Express",
+  "order": 3,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "5895f6fff9fc0f352b528e62",
+      "title": "Advanced Node/Express Introduction",
+      "description": [
+        [
+          "",
+          "",
+          "<em>Authentication</em> is the process or action of verifying the identity of a user or process. Up to this point you have not been able to create an app utilizing this key concept.<br>The most common and easiest to use authentication middleware for Node.js is <a href='http://passportjs.org/'>Passport</a>. It is easy to learn, light-weight, and extremely flexible allowing for many <em>strategies</em>, which we will talk about in later challenges. In addition to authentication we will also look at template engines which allow for use of <em>Pug</em> and web sockets which allow for real time communication between all your clients and your server. Working on these challenges will involve you writing your code on Glitch on our starter project. After completing each challenge you can copy your public glitch url (to the homepage of your app) into the challenge screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "5895f700f9fc0f352b528e63",
+      "title": "Set up a Template Engine",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "A template engine enables you to use static template files (such as those written in <em>Pug</em>) in your app. At runtime, the template engine replaces variables in a template file with actual values which can be supplied by your server, and transforms the template into a static HTML file that is then sent to the client. This approach makes it easier to design an HTML page and allows for displaying of variables on the page without needing to make an API call from the client.",
+        "To set up <em>Pug</em> for use in your project, you will need to add it as a dependency first in your package.json. <code>\"pug\": \"^0.1.0\"</code>",
+        "Now to tell Node/Express to use the templating engine you will have to tell your express <b>app</b> to <b>set</b> 'pug' as the 'view-engine'. <code>app.set('view engine', 'pug')</code>",
+        "Lastly, you should change your response to the request for the index route to <code>res.render</code> with the path to the view <em>views/pug/index.pug</em>.",
+        "If all went as planned, you should refresh your apps home page and see a small message saying you're successfully rending the Pug from our Pug file! Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Pug is a dependency",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'pug', 'Your project should list \"pug\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "View engine is Pug",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /('|\")view engine('|\"),( |)('|\")pug('|\")/gi, 'Your project should set Pug as a view engine'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Pug is working",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/') .then(data => { assert.match(data, /pug-success-message/gi, 'Your projects home page should now be rendered by pug with the projects .pug file unaltered'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70bf9fc0f352b528e64",
+      "title": "Use a Template Engine's Powers",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "One of the greatest features of using a template engine is being able to pass variables from the server to the template file before rendering it to HTML.",
+        "In your Pug file, you're about to use a variable by referencing the variable name as <code>#{variable_name}</code> inline with other text on an element or by using an equal side on the element without a space such as <code>p= variable_name</code> which sets that p elements text to equal the variable.",
+        "We strongly recommend looking at the syntax and structure of Pug <a href='https://github.com/pugjs/pug'>here</a> on their Githubs README. Pug is all about using whitespace and tabs to show nested elements and cutting down on the amount of code needed to make a beautiful site.",
+        "Looking at our pug file 'index.pug' included in your project, we used the variables <em>title</em> and <em>message</em>",
+        "To pass those alone from our server, you will need to add an object as a second argument to your <em>res.render</em> with the variables and their value. For example, pass this object along setting the variables for your index view: <code>{title: 'Hello', message: 'Please login'</code>",
+        "It should look like: <code>res.render(process.cwd() + '/views/pug/index', {title: 'Hello', message: 'Please login'});</code>",
+        "Now refresh your page and you should see those values rendered in your view in the correct spot as layed out in your index.pug file! Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Pug render variables correct",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/') .then(data => { assert.match(data, /pug-variable(\"|')>Please login/gi, 'Your projects home page should now be rendered by pug with the projects .pug file unaltered'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70cf9fc0f352b528e65",
+      "title": "Set up Passport",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "It's time to set up <em>Passport</em> so we can finally start allowing a user to register or login to an account! In addition to Passport, we will use Express-session to handle sessions. Using this middleware saves the session id as a cookie in the client and allows us to access the session data using that id on the server. This way we keep personal account information out of the cookie used by the client to verify to our server they are authenticated and just keep the <em>key</em> to access the data stored on the server.",
+        "To set up Passport for use in your project, you will need to add it as a dependency first in your package.json. <code>\"passport\": \"^0.3.2\"</code>",
+        "In addition, add Express-session as a dependency now as well. Express-session has a ton of advanced features you can use but for now we're just going to use the basics! <code>\"express-session\": \"^1.15.0\"</code>",
+        "You will need to set up the session settings now and initialize Passport. Be sure to first create the variables 'session' and 'passport' to require 'express-session' and 'passport' respectively.",
+        "To set up your express app to use use the session we'll define just a few basic options. Be sure to add 'SESSION_SECRET' to your .env file and give it a random value. This is used to compute the hash used to encrypt your cookie!",
+        "<pre>app.use(session({\n  secret: process.env.SESSION_SECRET,\n  resave: true,\n  saveUninitialized: true,\n}));</pre>",
+        "As well you can go ahead and tell your express app to <b>use</b> 'passport.initialize()' and 'passport.session()'. (For example, <code>app.use(passport.initialize());</code>)",
+        "Submit your page when you think you've got it right. If you're running into errors, you can check out the project completed up to this point <a href='https://gist.github.com/JosephLivengood/338a9c5a326923c3826a666d430e65c3'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Passort and Express-session are dependencies",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'passport', 'Your project should list \"passport\" as a dependency'); assert.property(packJson.dependencies, 'express-session', 'Your project should list \"express-session\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Dependencies correctly required",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /require.*(\"|')passport(\"|')/gi, 'You should have required passport'); assert.match(data, /require.*(\"|')express-session(\"|')/gi, 'You should have required express-session'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Express app uses new dependencies",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /passport.initialize/gi, 'Your express app should use \"passport.initialize()\"'); assert.match(data, /passport.session/gi, 'Your express app should use \"passport.session()\"'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Session and session secret correctly set up",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /secret:( |)process.env.SESSION_SECRET/gi, 'Your express app should have express-session set up with your secret as process.env.SESSION_SECRET'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70cf9fc0f352b528e66",
+      "title": "Serialization of a User Object",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Serialization and deserialization are important concepts in regards to authentication. To serialize an object means to convert its contents into a small <em>key</em> essentially that can then be deserialized into the original object. This is what allows us to know whos communicated with the server without having to send the authentication data like username and password at each request for a new page.",
+        "To set this up properly, we need to have a serialize function and a deserialize function. In passport we create these with <code>passport.serializeUser( OURFUNCTION )</code> and <code>passport.deserializeUser( OURFUNCTION )</code>",
+        "The serializeUser is called with 2 arguments, the full user object and a callback used by passport. Returned in the callback should be a unique key to identify that user- the easiest one to use being the users _id in the object as it should be unique as it generated by MongoDb. Similarly deserializeUser is called with that key and a callback function for passport as well, but this time we have to take that key and return the users full object to the callback. To make a query search for a Mongo _id you will have to create <code>const ObjectID = require('mongodb').ObjectID;</code>, and then to use it you call <code>new ObjectID(THE_ID)</code>. Be sure to add MongoDB as a dependency. You can see this in the examples below:",
+        "<pre>passport.serializeUser((user, done) => {\n   done(null, user._id);\n });</pre><br><pre>passport.deserializeUser((id, done) => {\n        db.collection('users').findOne(\n            {_id: new ObjectID(id)},\n            (err, doc) => {\n                done(null, doc);\n            }\n        );\n    });</pre>",
+        "NOTE: This deserializeUser will throw an error until we set up the DB in the next step so comment out the whole block and just call <code>done(null, null)</code> in the function deserializeUser.",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Serialize user function correct",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /passport.serializeUser/gi, 'You should have created your passport.serializeUser function'); assert.match(data, /null, user._id/gi, 'There should be a callback in your serializeUser with (null, user._id)'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Deserialize user function correct",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /passport.deserializeUser/gi, 'You should have created your passport.deserializeUser function'); assert.match(data, /null,( |)null/gi, 'There should be a callback in your deserializeUser with (null, null) for now'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "MongoDB is a dependency",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'mongodb', 'Your project should list \"mongodb\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Mongodb properly required including the ObjectId",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /require.*(\"|')mongodb(\"|')/gi, 'You should have required mongodb'); assert.match(data, /new ObjectID.*id/gi, 'Even though the block is commented out, you should use new ObjectID(id) for when we add the database'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70cf9fc0f352b528e67",
+      "title": "Implement the Serialization of a Passport User",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Right now we're not loading an actually users object since we haven't set up our database. This can be done many different ways, but for our project we will connect to the database once when we start the server and keep a persistent connection for the full life-cycle of the app.",
+        "To do this, add MongoDB as a dependency and require it in your server. (<code>const mongo = require('mongodb').MongoClient;</code>)",
+        "Now we want to the connect to our database then start listening for requests. The purpose of this is to not allow requests before our database is connected or if there is a database error. To accomplish you will want to encompass your serialization and your app listener in the following:",
+        "<pre>mongo.connect(process.env.DATABASE, (err, db) => {\n    if(err) {\n        console.log('Database error: ' + err);\n    } else {\n        console.log('Successful database connection');\n\n        //serialization and app.listen\n\n}});</pre>",
+        "You can now uncomment the block in deserializeUser and remove your <code>done(null, null)</code>. Be sure to set <em>DATABASE</em> in your .env file to your database's connection string (for example: <code>DATABASE=mongodb://admin:pass@mlab.com:12345/my-project</code>). You can set up a free database on <a href='https://mlab.com/welcome/'>mLab</a>. Congratulations- you've finished setting up serialization!",
+        "Submit your page when you think you've got it right. If you're running into errors, you can check out the project completed up to this point <a href='https://gist.github.com/JosephLivengood/e192e809a1d27cb80dc2c6d3467b7477'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Database connection is present",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /mongo.connect/gi, 'You should have created a connection to your database'); assert.match(data, /mongo.connect[^]*app.listen[^]*}[^]*}/gi, 'You should have your app.listen nested at within your database connection at the bottom'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Deserialization is now correctly using the DB and <code>done(null, null)</code> is erased",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.notMatch(data, /null,( |)null/gi, 'The callback in deserializeUser of (null, null) should be completely removed for the db block uncommented out'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70df9fc0f352b528e68",
+      "title": "Authentication Strategies",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "A strategy is a way of authenticating a user. You can use a strategy for allowing users to authenticate based on locally saved information (if you have them register first) or from a variety of providers such as Google or Github. For this project we will set up a local strategy. To see a list of the 100's of strategies, visit Passports site <a href='http://passportjs.org/'>here</a>.",
+        "Add <em>passport-local</em> as a dependency and add it to your server as follows: <code>const LocalStrategy = require('passport-local');</code>",
+        "Now you will have to tell passport to <b>use</b> an instantiated LocalStartegy object with a few settings defined. Make sure this as well as everything from this point on is encapsulated in the database connection since it relies on it! <pre>passport.use(new LocalStrategy(\n  function(username, password, done) {\n    db.collection('users').findOne({ username: username }, function (err, user) {\n      console.log('User '+ username +' attempted to log in.');\n      if (err) { return done(err); }\n      if (!user) { return done(null, false); }\n      if (password !== user.password) { return done(null, false); }\n      return done(null, user);\n    });\n  }\n));</pre> This is defining the process to take when we try to authenticate someone locally. First it tries to find a user in our database with the username entered, then it checks for the password to match, then finally if no errors have popped up that we checked for, like an incorrect password, the users object is returned and they are authenticated.",
+        "Many strategies are set up using different settings, general it is easy to set it up based on the README in that strategies repository though. A good example of this is the Github strategy where we don't need to worry about a username or password because the user will be sent to Github's auth page to authenticate and as long as they are logged in and agree then Github returns their profile for us to use.",
+        "In the next step we will set up how to actually call the authentication strategy to validate a user based on form data! Submit your page when you think you've got it right up to this point."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Passport-local is a dependency",
+          "testString": " getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'passport-local', 'Your project should list \"passport-local \" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Passport-local correctly required and setup",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /require.*(\"|')passport-local(\"|')/gi, 'You should have required passport-local'); assert.match(data, /new LocalStrategy/gi, 'You should have told passport to use a new strategy'); assert.match(data, /findOne/gi, 'Your new local strategy should use the findOne query to find a username based on the inputs'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70df9fc0f352b528e69",
+      "title": "How to Use Passport Strategies",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "In the index.pug file supplied there is actually a login form. It has previously been hidden because of the inline javascript <code>if showLogin</code> with the form indented after it. Before showLogin as a variable was never defined, it never rendered the code block containing the form. Go ahead and on the res.render for that page add a new variable to the object <code>showLogin: true</code>. When you refresh your page, you should then see the form! This form is set up to <b>POST</b> on <em>/login</em> so this is where we should set up to accept the POST and authenticate the user.",
+        "For this challenge you should add the route /login to accept a POST request. To authenticate on this route you need to add a middleware to do so before then sending a response. This is done by just passing another argument with the middleware before your <code>function(req,res)</code> with your response! The middleware to use is <code>passport.authenticate('local')</code>.",
+        "<em>passport.authenticate</em> can also take some options as an argument such as: <code>{ failureRedirect: '/' }</code> which is incredibly useful so be sure to add that in as well. As a response after using the middleware (which will only be called if the authentication middleware passes) should be to redirect the user to <em>/profile</em> and that route should render the view 'profile.pug'.",
+        "If the authentication was successful, the user object will be saved in <em>req.user</em>.",
+        "Now at this point if you enter a username and password in the form, it should redirect to the home page <em>/</em> and in the console of your server should be 'User {USERNAME} attempted to log in.' since we currently cannot login a user who isn't registered.",
+        "Submit your page when you think you've got it right. If you're running into errors, you can check out the project completed up to this point <a href='https://gist.github.com/JosephLivengood/8a335d1a68ed9170da02bb9d8f5b71d5'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All steps correctly implemented in the server.js",
+          "testString": " getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /showLogin:( |)true/gi, 'You should be passing the variable \"showLogin\" as true to your render function for the homepage'); assert.match(data, /failureRedirect:( |)('|\")\\/('|\")/gi, 'Your code should include a failureRedirect to the \"/\" route'); assert.match(data, /login[^]*post[^]*local/gi, 'You should have a route for login which accepts a POST and passport.authenticates local'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "A POST request to /login correctly redirects to /",
+          "testString": "getUserInput => $.post(getUserInput('url')+ '/login') .then(data => { assert.match(data, /Home page/gi, 'A login attempt at this point should redirect to the homepage since we do not have any registered users'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70df9fc0f352b528e6a",
+      "title": "Create New Middleware",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "As in, any user can just go to /profile whether they authenticated or not by typing in the url. We want to prevent this by checking if the user is authenticated first before rendering the profile page. This is the perfect example of when to create a middleware.",
+        "The challenge here is creating the middleware function <code>ensureAuthenticated(req, res, next)</code>, which will check if a user is authenticated by calling passports isAuthenticated on the <em>request</em> which in turn checks for <em>req.user</em> is to be defined. If it is then <em>next()</em> should be called, otherwise we can just respond to the request with a redirect to our homepage to login. An implementation of this middleware is:",
+        "<pre>function ensureAuthenticated(req, res, next) {\n  if (req.isAuthenticated()) {\n      return next();\n  }\n  res.redirect('/');\n};</pre>",
+        "Now add <em>ensureAuthenticated</em> as a middleware to the request for the profile page before the argument to the get request containing the function that renders the page.",
+        "<pre>app.route('/profile')\n  .get(ensureAuthenticated, (req,res) => {\n       res.render(process.cwd() + '/views/pug/profile');\n  });</pre>",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Middleware ensureAuthenticated should be implemented and on our /profile route",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /ensureAuthenticated[^]*req.isAuthenticated/gi, 'Your ensureAuthenticated middleware should be defined and utilize the req.isAuthenticated function'); assert.match(data, /profile[^]*get[^]*ensureAuthenticated/gi, 'Your ensureAuthenticated middleware should be attached to the /profile route'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "A Get request to /profile correctly redirects to / since we are not authenticated",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/profile') .then(data => { assert.match(data, /Home page/gi, 'An attempt to go to the profile at this point should redirect to the homepage since we are not logged in'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "5895f70ef9fc0f352b528e6b",
+      "title": "How to Put a Profile Together",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Now that we can ensure the user accessing the <em>/profile</em> is authenticated, we can use the information contained in 'req.user' on our page!",
+        "Go ahead and pass the object containing the variable <em>username</em> equaling 'req.user.username' into the render method of the profile view. Then go to your 'profile.pug' view and add the line <code>h2.center#welcome Welcome, #{username}!</code> creating the h2 element with the class 'center' and id 'welcome' containing the text 'Welcome, ' and the username!",
+        "Also in the profile, add a link to <em>/logout</em>. That route will host the logic to unauthenticate a user. <code>a(href='/logout') Logout</code>",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Correctly added a Pug render variable to /profile",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /\\/views\\/pug\\/profile[^]*username:( |)req.user.username/gi, 'You should be passing the variable username with req.user.username into the render function of the profile page'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58965611f9fc0f352b528e6c",
+      "title": "Logging a User Out",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Creating the logout logic is easy. The route should just unauthenticate the user and redirect to the home page instead of rendering any view.",
+        "In passport, unauthenticating a user is as easy as just calling <code>req.logout();</code> before redirecting.",
+        "<pre>app.route('/logout')\n  .get((req, res) => {\n      req.logout();\n      res.redirect('/');\n  });</pre>",
+        "You may have noticed we also we're not handling missing pages (404), the common way to handle this in Node is with the following middleware. Go ahead and add this in after all your other routes:",
+        "<pre>app.use((req, res, next) => {\n  res.status(404)\n    .type('text')\n    .send('Not Found');\n});</pre>",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Logout route",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /req.logout/gi, 'You should be call req.logout() in youre /logout route'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Logout should redirect to the home page /",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/logout') .then(data => { assert.match(data, /Home page/gi, 'When a user logs out they should be redirected to the homepage'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58966a17f9fc0f352b528e6d",
+      "title": "Registration of New Users",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Now we need to allow a new user on our site to register an account. On the res.render for the home page add a new variable to the object passed along- <code>showRegistration: true</code>. When you refresh your page, you should then see the registration form that was already created in your index.pug file! This form is set up to <b>POST</b> on <em>/register</em> so this is where we should set up to accept the POST and create the user object in the database.",
+        "The logic of the registration route should be as follows: Register the new user > Authenticate the new user > Redirect to /profile",
+        "The logic of step 1, registering the new user, should be as follows: Query database with a findOne command > if user is returned then it exists and redirect back to home <em>OR</em> if user is undefined and no error occurs then 'insertOne' into the database with the username and password and as long as no errors occur then call <em>next</em> to go to step 2, authenticating the new user, which we've already written the logic for in our POST /login route.",
+        "<pre>app.route('/register')\n  .post((req, res, next) => {\n      db.collection('users').findOne({ username: req.body.username }, function (err, user) {\n          if(err) {\n              next(err);\n          } else if (user) {\n              res.redirect('/');\n          } else {\n              db.collection('users').insertOne(\n                {username: req.body.username,\n                 password: req.body.password},\n                (err, doc) => {\n                    if(err) {\n                        res.redirect('/');\n                    } else {\n                        next(null, user);\n                    }\n                }\n              )\n          }\n      })},\n    passport.authenticate('local', { failureRedirect: '/' }),\n    (req, res, next) => {\n        res.redirect('/profile');\n    }\n);</pre>",
+        "Submit your page when you think you've got it right. If you're running into errors, you can check out the project completed up to this point <a href='https://gist.github.com/JosephLivengood/6c47bee7df34df9f11820803608071ed'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Register route and display on home",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /showRegistration:( |)true/gi, 'You should be passing the variable \"showRegistration\" as true to your render function for the homepage'); assert.match(data, /register[^]*post[^]*findOne[^]*username:( |)req.body.username/gi, 'You should have a route accepted a post request on register that querys the db with findone and the query being \"username: req.body.username\"'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Registering should work",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url')+ '/register',data: {username: 'freeCodeCampTester', password: 'freeCodeCampTester'},crossDomain: true, type: 'POST', xhrFields: { withCredentials: true }}) .then(data => { assert.match(data, /Profile/gi, 'I should be able to register and it direct me to my profile. CLEAR YOUR DATABASE if this test fails (each time until its right!)'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Login should work",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url')+ '/login',data: {username: 'freeCodeCampTester', password: 'freeCodeCampTester'}, type: 'POST', xhrFields: { withCredentials: true }}) .then(data => { assert.match(data, /Profile/gi, 'Login should work if previous test was done successfully and redirect successfully to the profile. Check your work and clear your DB'); assert.match(data, /freeCodeCampTester/gi, 'The profile should properly display the welcome to the user logged in'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Logout should work",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url')+ '/logout', type: 'GET', xhrFields: { withCredentials: true }}) .then(data => { assert.match(data, /Home/gi, 'Logout should redirect to home'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Profile should no longer work after logout",
+          "testString": "getUserInput => $.ajax({url: getUserInput('url')+ '/profile', type: 'GET', crossDomain: true, xhrFields: { withCredentials: true }}) .then(data => { assert.match(data, /Home/gi, 'Profile should redirect to home when we are logged out now again'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58a25c98f9fc0f352b528e7f",
+      "title": "Hashing Your Passwords",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Going back to the information security section you may remember that storing plaintext passwords is <em>never</em> okay. Now it is time to implement BCrypt to solve this issue.",
+        "<hr>Add BCrypt as a dependency and require it in your server. You will need to handle hashing in 2 key areas: where you handle registering/saving a new account and when you check to see that a password is correct on login.",
+        "Currently on our registeration route, you insert a user's password into the database like the following: <code>password: req.body.password</code>. An easy way to implement saving a hash instead is to add the following before your database logic <code>var hash = bcrypt.hashSync(req.body.password, 8);</code> and replacing the <code>req.body.password</code> in the database saving with just <code>password: hash</code>. (In our small scale app, it is fine to use sync hashing especially with a low cost of 8 as it wont block the thread very much at all)",
+        "Finally on our authentication strategy we check for the following in our code before completing the process: <code>if (password !== user.password) { return done(null, false); }</code>. After making the previous changes, now <code>user.password</code> is a hash. Before making a change to the existing code, notice how the statement is checking if the password is NOT equal then return non-authenticated. With this in mind your code could look as follows to properly check the password entered against the hash: <code>if (!bcrypt.compareSync(password, user.password)) { return done(null, false); }</code>",
+        "That is all it takes to implement one of the most important security features when you have to store passwords! Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "BCrypt is a dependency",
+          "testString": " getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'bcrypt', 'Your project should list \"bcrypt\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "BCrypt correctly required and implemented",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /require.*(\"|')bcrypt(\"|')/gi, 'You should have required bcrypt'); assert.match(data, /bcrypt.hash/gi, 'You should use hash the password in the registration'); assert.match(data, /bcrypt.compare/gi, 'You should compare the password to the hash in your strategy'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589690e6f9fc0f352b528e6e",
+      "title": "Clean Up Your Project with Modules",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-advancednode/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-advancednode/'>GitHub</a>.",
+        "Right now everything you have is in your server.js file. This can lead to hard to manage code that isn't very expandable.",
+        "Create 2 new files: Routes.js and Auth.js",
+        "Both should start with the following code: <pre>module.exports = function (app, db) {\n\n\n}</pre>",
+        "Now in the top of your server file, require these files like such: <code>const routes = require('./routes.js');</code>",
+        "Right after you establish a successful connect with the database instantiate each of them like such: <code>routes(app, db)</code>",
+        "Finally, take all of the routes in your server and paste them into your new files and remove them from your server file. Also take the ensureAuthenticated since we created that middleware function for routing specifically. You will have to now correctly add the dependencies in that are used, such as <code>const passport = require('passport');</code>, at the very top above the export line in your routes.js file.",
+        "Keep adding them until no more errors exist, and your server file no longer has any routing!",
+        "Now do the same thing in your auth.js file with all of the things related to authentication such as the serialization and the setting up of the local strategy and erase them from your server file. Be sure to add the dependencies in and call <code>auth(app,db)</code> in the server in the same spot. Be sure to have <code>auth(app, db)</code> before <code>routes(app, db)</code> since our registration route depends on passport being initiated!",
+        "Congratulations- you're at the end of this section of Advanced Node and Express and have some beautiful code to show for it! Submit your page when you think you've got it right. If you're running into errors, you can check out an example of the completed project <a href='https://glitch.com/#!/project/delicious-herring'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Modules present",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /require.*(\"|').\\/routes.js(\"|')/gi, 'You should have required your new files'); assert.match(data, /mongo.connect[^]*routes/gi, 'Your new modules should be called after your connection to the database'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589a69f5f9fc0f352b528e6f",
+      "title": "Social Authentication with OAuth",
+      "description": [
+        [
+          "",
+          "",
+          "OAuth 2.0 is the industry-standard authorization and is used across the internet for social login such as letting you login to freeCodeCamp with your Github account.<br>Implementing social login with passport using OAuth is extremely easy to do because of the <a href='http://passportjs.org/'>300+ modules</a> already on npm for adding new strategies to your app. In addition to the ease of installation, it is also easier to use because you do not have to deal with a separate <em>registration</em> or any user input.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socialauth/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-socialauth/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe. Be sure to enter your database in the .env file- it can be the same one from last project since you'll be using a new collection!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "589a69f5f9fc0f352b528e70",
+      "title": "Implementation of Social Authentication",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socialauth/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socialauth/'>GitHub</a>.",
+        "The basic path this kind of authentication will follow in your app is: <ol><li>User clicks a button or link sending them to our route to authenticate using a specific strategy (EG. Github)</li><li>Your route calls <code>passport.authenticate('github')</code> which redirects them to Github.</li><li>The page the user lands on, on Github, allows them to login if they aren't already then asks them to approve access to their profile from our app.</li><li>The user is then returned to our app at a specific callback url with their profile if they approved.</li><li>They are now authenticated and your app should check if it is a returning profile, or save it in your database if it is not.</li></ol>",
+        "Strategies with OAuth require you to have at least a <em>Client ID</em> and a <em>Client Secret</em> which is a way for them to verify who the authentication request is coming from and if it is valid. These are obtained from the site you are trying to implement authentication with, such as Github, and are unique to your app- <b>THEY ARE NOT TO BE SHARED</b> and should never be uploaded to a public repository or written directly in your code. A common practice is to put them in your <em>.env</em> file and reference them like: <code>process.env.GITHUB_CLIENT_ID</code>. For this challenge we're going to use the Github strategy.",
+        "Obtaining your <em>Client ID and Secret<em> from Github is done in your account profile settings under 'developer settings', then '<a href='https://github.com/settings/developers'>OAuth applications</a>'. Click 'Register a new application', name your app, paste in the url to your glitch homepage (<b>Not the project code's url</b>), and lastly for the callback url, paste in the same url as the homepage but with '/auth/github/callback' added on. This is where users will be redirected to for us to handle after authenticating on Github. Save the returned information as 'GITHUB_CLIENT_ID' and 'GITHUB_CLIENT_SECRET' in your .env file.",
+        "On your remixed project, create 2 routes accepting GET requests: /auth/github and /auth/github/callback. The first should only call passport to authenticate 'github' and the second should call passport to authenticate 'github' with a failure redirect to '/' and then if that is successful redirect to '/profile' (similar to our last project).",
+        "An example of how '/auth/github/callback' should look is similar to how we handled a normal login in our last project: <pre>app.route('/login')\n  .post(passport.authenticate('local', { failureRedirect: '/' }), (req,res) => { \n    res.redirect('/profile'); \n  });</pre>",
+        "Submit your page when you think you've got it right. If you're running into errors, you can check out the project up to this point <a href='https://gist.github.com/JosephLivengood/28ea2cae7e1dc6a53d7f0c42d987313b'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Route /auth/github correct",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /('|\")\\/auth\\/github('|\")[^]*get.*passport.authenticate.*github/gi, 'Route auth/github should only call passport.authenticate with github'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Route /auth/github/callback correct",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /('|\")\\/auth\\/github\\/callback('|\")[^]*get.*passport.authenticate.*github.*failureRedirect:( |)(\"|')\\/(\"|')/gi, 'Route auth/github/callback should accept a get request and call passport.authenticate for github with a failure redirect to home'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589a69f5f9fc0f352b528e71",
+      "title": "Implementation of Social Authentication II",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socialauth/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socialauth/'>GitHub</a>.",
+        "The last part of setting up your Github authentication is to create the strategy itself. For this, you will need to add the dependency of 'passport-github' to your project and require it as GithubStrategy like <code>const GitHubStrategy = require('passport-github').Strategy;</code>.",
+        "To set up the Github strategy, you have to tell <b>passport</b> to <b>use</b> an instantiated <b>GithubStrategy</b>, which accepts 2 arguments: An object (containing <em>clientID</em>, <em>clientSecret</em>, and <em>callbackURL</em>) and a function to be called when a user is successfully authenticated which we will determine if the user is new and what fields to save initially in the user's database object. This is common across many strategies but some may require more information as outlined in that specific strategy's github README; for example, Google requires a <em>scope</em> as well which determines what kind of information your request is asking returned and asks the user to approve such access. The current strategy we are implementing has its usage outlined <a>here</a>, but we're going through it all right here on freeCodeCamp!",
+        "Here's how your new strategy should look at this point: <pre>passport.use(new GitHubStrategy({\n    clientID: process.env.GITHUB_CLIENT_ID,\n    clientSecret: process.env.GITHUB_CLIENT_SECRET,\n    callbackURL: /*INSERT CALLBACK URL ENTERED INTO GITHUB HERE*/\n  },\n  function(accessToken, refreshToken, profile, cb) {\n      console.log(profile);\n      //Database logic here with callback containing our user object\n  }\n));</pre>",
+        "Your authentication won't be successful yet, and actually throw an error, without the database logic and callback, but it should log to your console your Github profile if you try it!",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Dependency added",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'passport-github', 'Your project should list \"passport-github\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Dependency required",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /require.*(\"|')passport-github(\"|')/gi, 'You should have required passport-github'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Github strategy setup correctly thus far",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /passport.use.*new GitHubStrategy/gi, 'Passport should use a new GitHubStrategy'); assert.match(data, /callbackURL:( |)(\"|').*(\"|')/gi, 'You should have a callbackURL'); assert.match(data, /process.env.GITHUB_CLIENT_SECRET/g, 'You should use process.env.GITHUB_CLIENT_SECRET'); assert.match(data, /process.env.GITHUB_CLIENT_ID/g, 'You should use process.env.GITHUB_CLIENT_ID'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589a8eb3f9fc0f352b528e72",
+      "title": "Implementation of Social Authentication III",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socialauth/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socialauth/'>GitHub</a>.",
+        "The final part of the strategy is handling the profile returned from Github. We need to load the users database object if it exists or create one if it doesn't and populate the fields from the profile, then return the user's object. Github supplies us a unique <em>id</em> within each profile which we can use to search with to serialize the user with (already implemented). Below is an example implementation you can use in your project- it goes within the function that is the second argument for the new strategy, right below the <code>console.log(profile);</code> currently is:",
+        "<pre>db.collection('socialusers').findAndModify(\n    {id: profile.id},\n    {},\n    {$setOnInsert:{\n        id: profile.id,\n        name: profile.displayName || 'John Doe',\n        photo: profile.photos[0].value || '',\n        email: profile.emails[0].value || 'No public email',\n        created_on: new Date(),\n        provider: profile.provider || ''\n    },$set:{\n        last_login: new Date()\n    },$inc:{\n        login_count: 1\n    }},\n    {upsert:true, new: true},\n    (err, doc) => {\n        return cb(null, doc.value);\n    }\n);</pre>",
+        "With a findAndModify, it allows you to search for an object and update it, as well as upsert the object if it doesn't exist and receive the new object back each time in our callback function. In this example, we always set the last_login as now, we always increment the login_count by 1, and only when we insert a new object(new user) do we populate the majority of the fields. Something to notice also is the use of default values. Sometimes a profile returned won't have all the information filled out or it will have been chosen by the user to remain private; so in this case we have to handle it to prevent an error.",
+        "You should be able to login to your app now- try it! Submit your page when you think you've got it right. If you're running into errors, you can check out an example of this mini-project's finished code <a href='https://glitch.com/#!/project/guttural-birch'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Github strategy setup complete",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /GitHubStrategy[^]*db.collection/gi, 'Strategy should use now use the database to search for the user'); assert.match(data, /GitHubStrategy[^]*socialusers/gi, 'Strategy should use \"socialusers\" as db collection'); assert.match(data, /GitHubStrategy[^]*return cb/gi, 'Strategy should return the callback function \"cb\"'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589fc820f9fc0f352b528e73",
+      "title": "Socket.IO Introduction",
+      "description": [
+        [
+          "",
+          "",
+          "<dfn>Socket.IO</dfn> enables real-time, reliable, speedy communication between your server and clients from all devices and browsers. It listens for connects on your server that come from the client which connects with a single javascript statement. The whole library is based on emitting, broadcasting, and recieving events that contain an event name and some data which can include things like strings, objects, arrays, and even blobs like files or video. This is used for all sorts of purposes including instant messaging online, real-time analytics, streaming, and document collaboration.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe.",
+          ""
+        ],
+        [
+          "",
+          "",
+          "To set up this project to get started now in the .env file:<ol><li>Create a random session secret</li><li>Fill in the database (it may be the same as the last few projects since this will use a new collection)</li><li>Obtain another set of Github OAuth credentials with the callback once again pointed at '/auth/github/callback' and add it in</li></ol>",
+          ""
+        ],
+        [
+          "",
+          "",
+          "A few changes have been made to this starter.<br>Instead of <code>app.listen</code>, you now have <pre>const http = require('http').Server(app);\n\nhttp.listen(process.env.PORT || 3000);</pre> This is required because for the initial handshake between the server and client, http is used. Setting up our server like this allows us to have both processes use a single port.<br>Also, we have declared <code>const sessionStore = new session.MemoryStore();</code> and used <code>sessionStore</code> as the store in our express session. In our previous apps we have not done this because by default it is done automattically. It is not this way so we can reference/use the <code>sessionStore</code> in other parts of our code now. In addition, we've given our session a key to reference it easier.",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "titleEs": "",
+      "descriptionEs": [
+        []
+      ],
+      "titleFr": "",
+      "descriptionFr": [
+        []
+      ],
+      "titleDe": "",
+      "descriptionDe": [
+        []
+      ]
+    },
+    {
+      "id": "589fc830f9fc0f352b528e74",
+      "title": "Set up the Enviroment",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>GitHub</a>.",
+        "Add Socket.IO as a dependency and require/instanciate it in your server defined as 'io' with the http server as an argument. <code>const io = require('socket.io')(http);</code>",
+        "The first thing needing to be handled is listening for a new connection from the client. The <dfn>on</dfn> keyword does just that- listen for a specific event. It requires 2 arguments: a string containing the title of the event thats emitted, and a function with which the data is passed though. In the case of our connection listener, we use <em>socket</em> to define the data in the second argument. A socket is an individual client who is connected.",
+        "For listening for connections on our server, add the following between the comments in your project:<pre>io.on('connection', socket => {\n  console.log('A user has connected');\n});</pre>",
+        "Now for the client to connect, you just need to add the following to your client.js which is loaded by the page after you've authenticated: <pre>/*global io*/\nvar socket = io();</pre>The comment supresses the error you would normally see since 'io' is not defined in the file. We've already added a reliable CDN to the Socket.IO library on the page in chat.pug.",
+        "Now try loading up your app and authenticate and you should see in your server console 'A user has connected'!",
+        "<strong>Note</strong><br><code>io()</code> works only when connecting to a socket hosted on the same url/server. For connecting to an external socket hosted elsewhere, you would use <code>io.connect('URL');</code>.",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Socket.IO is a dependency",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'socket.io', 'Your project should list \"socket.io\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Socket.IO has been properly required and instanciated",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js').then(data => {assert.match(data, /io.*=.*require.*('|\")socket.io('|\").*http/gi, 'You should correctly require and instanciate socket.io as io.');}, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Socket.IO should be listening for connections",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /io.on.*('|\")connection('|\").*socket/gi, 'io should listen for \"connection\" and socket should be the 2nd arguments variable'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Your client should connect to your server",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/public/client.js') .then(data => { assert.match(data, /socket.*=.*io/gi, 'Your client should be connection to server with the connection defined as socket'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589fc831f9fc0f352b528e75",
+      "title": "Communicate by Emitting",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>GitHub</a>.",
+        "<dfn>Emit</dfn> is the most common way of communicating you will use. When you emit something from the server to 'io', you send an event's name and data to all the connected sockets. A good example of this concept would be emiting the current count of connected users each time a new user connects!",
+        "<hr>Start by adding a variable to keep track of the users just before where you are currently listening for connections. <code>var currentUsers = 0;</code>",
+        "Now when someone connects you should increment the count before emiting the count so you will want to add the incrementer within the connection listener. <code>++currentUsers;</code>",
+        "Finally after incrementing the count, you should emit the event(still within the connection listener). The event should be named 'user count' and the data should just be the 'currentUsers'. <code>io.emit('user count', currentUsers);</code>",
+        "<hr>Now you can implement a way for your client to listen for this event! Similarly to listening for a connection on the server you will use the <em>on</em> keyword. <pre>socket.on('user count', function(data){\n  console.log(data);\n});</pre>",
+        "Now try loading up your app and authenticate and you should see in your client console '1' representing the current user count! Try loading more clients up and authenticating to see the number go up.",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "currentUsers is defined",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js').then(data => {assert.match(data, /currentUsers/gi, 'You should have variable currentUsers defined');}, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Server emits the current user count at each new connection",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /io.emit.*('|\")user count('|\").*currentUsers/gi, 'You should emit \"user count\" with data currentUsers'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Your client is listening for 'user count' event",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/public/client.js') .then(data => { assert.match(data, /socket.on.*('|\")user count('|\")/gi, 'Your client should be connection to server with the connection defined as socket'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589fc831f9fc0f352b528e76",
+      "title": "Handle a Disconnect",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>GitHub</a>.",
+        "You may notice that up to now you have only been increasing the user count. Handling a user disconnecting is just as easy as handling the initial connect except the difference is you have to listen for it on each socket versus on the whole server.",
+        "<hr>To do this, add in to your existing connect listener a listener that listens for 'disconnect' on the socket with no data passed through. You can test this functionality by just logging to the console a user has disconnected. <code>socket.on('disconnect', () => { /*anything you want to do on disconnect*/ });</code>",
+        "To make sure clients continuously have the updated count of current users, you should decrease the currentUsers by 1 when the disconnect happens then emit the 'user count' event with the updated count!",
+        "<strong>Note</strong><br>Just like 'disconnect', all other events that a socket can emit to the server should be handled within the connecting listener where we have 'socket' defined.",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Server handles the event disconnect from a socket",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /socket.on.*('|\")disconnect('|\")/gi, ''); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Your client is listening for 'user count' event",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/public/client.js') .then(data => { assert.match(data, /socket.on.*('|\")user count('|\")/gi, 'Your client should be connection to server with the connection defined as socket'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589fc831f9fc0f352b528e77",
+      "title": "Authentication with Socket.IO",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>GitHub</a>.",
+        "Currently, you cannot determine who is connected to your web socket. While 'req.user' containers the user object, thats only when your user interacts with the web server and with web sockets you have no req (request) and therefor no user data. One way to solve the problem of knowing who is connected to your web socket is by parsing and decoding the cookie that contains the passport session then deserializing it to obtain the user object. Luckily, there is a package on NPM just for this that turns a once complex task into something simple!",
+        "<hr>Add 'passport.socketio' as a dependency and require it as 'passportSocketIo'.",
+        "Now we just have to tell Socket.IO to use it and set the options. Be sure this is added before the existing socket code and not in the existing connection listener. For your server it should look as follows:<pre>io.use(passportSocketIo.authorize({\n  cookieParser: cookieParser,\n  key:          'express.sid',\n  secret:       process.env.SESSION_SECRET,\n  store:        sessionStore\n}));</pre>You can also optionally pass 'success' and 'fail' with a function that will be called after the authentication process completes when a client trys to connect.",
+        "The user object is now accessable on your socket object as <code>socket.request.user</code>. For example, now you can add the following: <code>console.log('user ' + socket.request.user.name + ' connected');</code> and it will log to the server console who has connected!",
+        "Submit your page when you think you've got it right. If you're running into errors, you can check out the project up to this point <a href='https://gist.github.com/JosephLivengood/a9e69ff91337500d5171e29324e1ff35'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "passportSocketIo is a dependency",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'passportSocketIo', 'Your project should list \"passportSocketIo\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "passportSocketIo is properly required",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js').then(data => {assert.match(data, /passportSockerIo.*=.*require.*('|\")passportSocketIo('|\")/gi, 'You should correctly require and instanciate socket.io as io.');}, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "passportSocketIo is properly setup",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /io.use.*passportSocketIo.authorize/gi, 'You should have told io to use passportSockIo.authorize with the correct options'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589fc832f9fc0f352b528e78",
+      "title": "Announce New Users",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>GitHub</a>.",
+        "Many chat rooms are able to annouce when a user connects or disconnects and then display that to all of the connected users in the chat. Seeing as though you already are emitting an event on connect and disconnect, you will just have to modify this event to support such feature. The most logical way of doing so is sending 3 pieces of data with the event: name of the user connected/disconnected, the current user count, and if that name connected or disconnected.",
+        "<hr>Change the event name to 'user' and as the data pass an object along containing fields 'name', 'currentUsers', and boolean 'connected' (to be true if connection, or false for disconnection of the user sent). Be sure to make the change to both points we had the 'user count' event and set the disconnect one to sent false for field 'connected' instead of true like the event emitted on connect. <code>io.emit('user', {name: socket.request.user.name, currentUsers, connected: true});</code>",
+        "Now your client will have all the nesesary information to correctly display the current user count and annouce when a user connects or disconnects! To handle this event on the client side we should listen for 'user' and then update the current user count by using jQuery to change the text of <code>#num-users</code> to '{NUMBER} users online', as well as append a <code>&#60;li&#62;</code> to the unordered list with id 'messages' with '{NAME} has {joined/left} the chat.'.",
+        "An implementation of this could look like the following:<pre>socket.on('user', function(data){\n  $('#num-users').text(data.currentUsers+' users online');\n  var message = data.name;\n  if(data.connected) {\n    message += ' has joined the chat.';\n  } else {\n    message += ' has left the chat.';\n  }\n  $('#messages').append($('&#60;li&#62;').html('&#60;b&#62;'+ message +'&#60;\\/b&#62;'));\n});</pre>",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Event 'user' is emitted with name, currentUsers, and connected",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /io.emit.*('|\")user('|\").*name.*currentUsers.*connected/gi, 'You should have an event emitted named user sending name, currentUsers, and connected'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Client properly handling and displaying the new data from event 'user'",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/public/client.js') .then(data => { assert.match(data, /socket.on.*('|\")user('|\")[^]*num-users/gi, 'You should change the text of #num-users within on your client within the \"user\" even listener to show the current users connected'); assert.match(data, /socket.on.*('|\")user('|\")[^]*messages.*li/gi, 'You should append a list item to #messages on your client within the \"user\" event listener to annouce a user came or went'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "589fc832f9fc0f352b528e79",
+      "title": "Send and Display Chat Messages",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-socketio/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-socketio/'>GitHub</a>.",
+        "It's time you start allowing clients to send a chat message to the server to emit to all the clients! Already in your client.js file you should see there is already a block of code handling when the messgae form is submitted! (<code>$('form').submit(function(){ /*logic*/ });</code>)",
+        "<hr>Within the code you're handling the form submit you should emit an event after you define 'messageToSend' but before you clear the text box <code>#m</code>. The event should be named 'chat message' and the data should just be 'messageToSend'. <code>socket.emit('chat message', messageToSend);</code>",
+        "Now on your server you should be listening to the socket for the event 'chat message' with the data being named 'message'. Once the event is recieved it should then emit the event 'chat message' to all sockets <code>io.emit</code> with the data being an object containing 'name' and 'message'.",
+        "On your client now again, you should now listen for event 'chat message' and when recieved, append a list item to <code>#messages</code> with the name a colon and the message!",
+        "At this point the chat should be fully functional and sending messages across all clients! Submit your page when you think you've got it right. If you're running into errors, you can check out the project up to this point <a href='https://gist.github.com/JosephLivengood/3e4b7750f6cd42feaa2768458d682136'>here for the server</a> and <a href='https://gist.github.com/JosephLivengood/41ba76348df3013b7870dc64861de744'>here for the client</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Server listens for 'chat message' then emits it properly",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /socket.on.*('|\")chat message('|\")[^]*io.emit.*('|\")chat message('|\").*name.*message/gi, 'Your server should listen to the socket for \"chat message\" then emit to all users \"chat message\" with name and message in the data object'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "Client properly handling and displaying the new data from event 'chat message'",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/public/client.js') .then(data => { assert.match(data, /socket.on.*('|\")chat message('|\")[^]*messages.*li/gi, 'You should append a list item to #messages on your client within the \"chat message\" event listener to display the new message'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58a0b2caf9fc0f352b528e7a",
+      "title": "Continuing Your Live Chat",
+      "description": [
+        [
+          "",
+          "",
+          "From this point, you could choose to implement a plethora of features with just the knowledge you have learned up to this point! Some ideas you could choose to continue this project on with include, but aren't limited to the following:<ul><li>Displaying the users profile picture next to the messages</li><li>Displaying a time stamp on messages</li><li>Saving the most recent messages so when a new user connects they can see the most recent messages sent before they connected</li><li>Add a sidebar showing active users</li><li>Create a {user} is typing feature</li><li>Turn the client into a React component you can add to any of your previous projects</li></ul>",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "titleEs": "",
+      "descriptionEs": [
+        []
+      ],
+      "titleFr": "",
+      "descriptionFr": [
+        []
+      ],
+      "titleDe": "",
+      "descriptionDe": [
+        []
+      ]
+    }
+  ]
+}
diff --git a/seed/math-challenges/06-information-security-and-quality-assurance/claim-your-information-security-and-quality-assurance-certificate.json b/seed/math-challenges/06-information-security-and-quality-assurance/claim-your-information-security-and-quality-assurance-certificate.json
new file mode 100644
index 0000000000..71d6c94d22
--- /dev/null
+++ b/seed/math-challenges/06-information-security-and-quality-assurance/claim-your-information-security-and-quality-assurance-certificate.json
@@ -0,0 +1,108 @@
+{
+  "name": "Claim Your Information Security and Quality Assurance Certificate",
+  "order": 13,
+  "time": "5 minutes",
+  "challenges": [
+    {
+      "id": "587d8247367417b2b2512c35",
+      "title": "Claim Your Information Security and Quality Assurance Certificate",
+      "description": [
+        [
+          "//i.imgur.com/k8btNUB.jpg",
+          "An image of our Information Security and Quality Assurance Certificate",
+          "This challenge will give you your verified Information Security and Quality Assurance Certificate. Before we issue your certificate, we must verify that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. You must also accept our Academic Honesty Pledge. Click the button below to start this process.",
+          ""
+        ],
+        [
+          "//i.imgur.com/uLPsUko.jpg",
+          "The definition of plagiarism: Plagiarism (noun) - copying someone else’s work and presenting it as your own without crediting them",
+          "By clicking below, you pledge that all of your submitted code A) is code you or your pair personally wrote, or B) comes from open source libraries like jQuery, or C) has been clearly attributed to its original authors. You also give us permission to audit your challenge solutions and revoke your certificate if we discover evidence of plagiarism.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/UedoV2G.jpg",
+          "An image of the text \"Front End Development Certificate requirements\"",
+          "Let's confirm that you have completed all of our basic and intermediate algorithm scripting challenges, and all our basic, intermediate, and advanced front end development projects. Click the button below to verify this.",
+          "#"
+        ],
+        [
+          "//i.imgur.com/Q5Za9U6.jpg",
+          "An image of the word \"Congratulations\"",
+          "Congratulations! We've added your Information Security and Quality Assurance Certificate to your portfolio page. Unless you choose to hide your solutions, this certificate will remain publicly visible and verifiable.",
+          ""
+        ]
+      ],
+      "challengeSeed": [
+        {
+          "properties": [
+            "isHonest",
+            "isFrontEndCert"
+          ],
+          "apis": [
+            "/certificate/honest",
+            "/certificate/verify/front-end"
+          ],
+          "stepIndex": [
+            1,
+            2
+          ]
+        }
+      ],
+      "tests": [
+        {
+          "id": "587d8249367417b2b2512c42",
+          "title": "Issue Tracker"
+        },
+        {
+          "id": "587d8249367417b2b2512c41",
+          "title": "Metric-Imperial Converter"
+        },
+        {
+          "id": "587d824a367417b2b2512c43",
+          "title": "Personal Library"
+        },
+        {
+          "id": "587d824a367417b2b2512c44",
+          "title": "Stock Price Checker"
+        },
+        {
+          "id": "587d824a367417b2b2512c45",
+          "title": "Anonymous Message Board"
+        }
+      ],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "translations": {
+        "es": {
+          "title": "Reclama tu certificado de Desarrollo de interfaces",
+          "description": [
+            [
+              "//i.imgur.com/k8btNUB.jpg",
+              "Una imagen que muestra nuestro certificado de Desarrollo de interfaces",
+              "Este desafío te otorga tu certificado autenticado de Desarrollo de interfaces. Antes de que podamos emitir tu certificado, debemos verificar que has completado todos los desafíos básicos e intermedios de diseño de algoritmos, y todos los proyectos básicos e intermedios de desarrollo de interfaces. También debes aceptar nuestro Juramento de honestidad académica. Pulsa el botón siguiente para iniciar este proceso.",
+              ""
+            ],
+            [
+              "//i.imgur.com/HArFfMN.jpg",
+              "Plagio (nombre): acción y efecto de plagiar. Plagiar (verbo) - copiar en lo sustancial obras ajenas, dándolas como propias.",
+              "Al pulsar el botón siguiente, juras que todo el código en tus soluciones a los desafíos A) es código que tú o tu compañero escribieron personalmente, o B) proviene de librerías de código abierto como jQuery, o C) ha sido claramente atribuido a sus autores originales. También nos otorgas el permiso para auditar tus soluciones a los desafíos y revocar tu certificado si encontramos evidencia de plagio.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/14F2Van.jpg",
+              "Una imagen del texto \"Front End Development Certificate requirements\"",
+              "Confirmemos que has completado todos nuestros desafíos básicos e intermedios de diseño de algoritmos, y todos nuestros proyectos básicos e intermedios de desarrollo de interfaces. Pulsa el botón siguiente para hacer la verificación.",
+              "#"
+            ],
+            [
+              "//i.imgur.com/16SIhHO.jpg",
+              "Una imagen de la palabra \"Congratulations\"",
+              "¡Felicitaciones! Hemos agregado tu certificado de Desarrollo de interfaces a tu portafolio. A menos que elijas no mostrar tus soluciones, este certificado será públicamente visible y verificable.",
+              ""
+            ]
+          ]
+        }
+      }
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/06-information-security-and-quality-assurance/information-security-with-helmetjs.json b/seed/math-challenges/06-information-security-and-quality-assurance/information-security-with-helmetjs.json
new file mode 100644
index 0000000000..fababfbc56
--- /dev/null
+++ b/seed/math-challenges/06-information-security-and-quality-assurance/information-security-with-helmetjs.json
@@ -0,0 +1,400 @@
+{
+  "name": "Information Security with HelmetJS",
+  "order": 1,
+  "time": "5 hours",
+  "helpRoom": "HelpBackend",
+  "challenges": [
+    {
+      "id": "58af07504bbe015e85a91dbd",
+      "title": "Information Security Introduction",
+      "description": [
+        [
+          "",
+          "",
+          "Working on these challenges will involve you writing your code on Glitch on our starter project. After completing each challenge you can copy your public glitch url (to the homepage of your app) into the challenge screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d8247367417b2b2512c36",
+      "title": "Install and Require Helmet",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "Helmet helps you secure your Express apps by setting various HTTP headers. Install the package, then require it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "\"helmet\" dependency should be in package.json",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/package.json').then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'helmet'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8247367417b2b2512c37",
+      "title": "Hide Potentially Dangerous Information Using helmet.hidePoweredBy()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "Hackers can exploit known vulnerabilities in Express/Node if they see that your site is powered by Express. X-Powered-By: Express is sent in every request coming from Express by default. The helmet.hidePoweredBy() middleware will remove the X-Powered-By header. You can also explicitly set the header to something else, to throw people off. e.g. app.use(helmet.hidePoweredBy({ setTo: 'PHP 4.2.0' }))"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.hidePoweredBy() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'hidePoweredBy'); assert.notEqual(data.headers['x-powered-by'], 'Express')}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8247367417b2b2512c38",
+      "title": "Mitigate the Risk of Clickjacking with helmet.frameguard()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "Your page could be put in a <frame> or <iframe> without your consent. This can result in clickjacking attacks, among other things. Clickjacking is a technique of tricking a user into interacting with a page different from what the user thinks it is. This can be obtained executing your page in a malicious context, by mean of iframing. In that context a hacker can put a hidden layer over your page. Hidden buttons can be used to run bad scripts. This middleware sets the X-Frame-Options header. It restricts who can put your site in a frame. It has three modes: DENY, SAMEORIGIN, and ALLOW-FROM.",
+        "We don’t need our app to be framed. You should use helmet.frameguard() passing with the configuration object {action: 'deny'}."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.frameguard() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'frameguard', 'helmet.frameguard() middleware is not mounted correctly'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "helmet.frameguard() 'action' should be set to 'DENY'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.property(data.headers, 'x-frame-options'); assert.equal(data.headers['x-frame-options'], 'DENY');}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8247367417b2b2512c39",
+      "title": "Mitigate the Risk of Cross Site Scripting (XSS) Attacks with helmet.xssFilter()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "Cross-site scripting (XSS) is a frequent type of attack where malicious scripts are injected into vulnerable pages, with the purpose of stealing sensitive data like session cookies, or passwords.",
+        "The basic rule to lower the risk of an XSS attack is simple: “Never trust user’s input”. As a developer you should always sanitize all the input coming from the outside. This includes data coming from forms, GET query urls, and even from POST bodies. Sanitizing means that you should find and encode the characters that may be dangerous e.g. <, >.",
+        "Modern browsers can help mitigating the risk by adopting better software strategies. Often these are configurable via http headers.",
+        "The X-XSS-Protection HTTP header is a basic protection. The browser detects a potential injected script using a heuristic filter. If the header is enabled, the browser changes the script code, neutralizing it.",
+        "It still has limited support."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.xssFilter() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'xXssProtection'); assert.property(data.headers, 'x-xss-protection'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8248367417b2b2512c3a",
+      "title": "Avoid Inferring the Response MIME Type with helmet.noSniff()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "Browsers can use content or MIME sniffing to adapt to different datatypes coming from a response. They override the Content-Type headers to guess and process the data. While this can be convenient in some scenarios, it can also lead to some dangerous attacks. This middleware sets the X-Content-Type-Options header to nosniff. This instructs the browser to not bypass the provided Content-Type."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.noSniff() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'nosniff'); assert.equal(data.headers['x-content-type-options'], 'nosniff'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8248367417b2b2512c3b",
+      "title": "Prevent IE from Opening Untrusted HTML with helmet.ieNoOpen()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "Some web applications will serve untrusted HTML for download. Some versions of Internet Explorer by default open those HTML files in the context of your site. This means that an untrusted HTML page could start doing bad things in the context of your pages. This middleware sets the X-Download-Options header to noopen. This will prevent IE users from executing downloads in the trusted site’s context."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.ieNoOpen() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'ienoopen'); assert.equal(data.headers['x-download-options'], 'noopen'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8248367417b2b2512c3c",
+      "title": "Ask Browsers to Access Your Site via HTTPS Only with helmet.hsts()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "HTTP Strict Transport Security (HSTS) is a web security policy which helps to protect websites against protocol downgrade attacks and cookie hijacking. If your website can be accessed via HTTPS you can ask user’s browsers to avoid using insecure HTTP. By setting the header Strict-Transport-Security, you tell the browsers to use HTTPS for the future requests in a specified amount of time. This will work for the requests coming after the initial request.",
+        "Configure helmet.hsts() to use HTTPS for the next 90 days. Pass the config object {maxAge: timeInMilliseconds, force: true}. Glitch already has hsts enabled. To override its settings you need to set the field \"force\" to true in the config object. We will intercept and restore the Glitch header, after inspecting it for testing.",
+        "Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TSL Certificate."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.hsts() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'hsts'); assert.property(data.headers, 'strict-transport-security'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "maxAge should be equal to 7776000 ms (90 days)",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.match(data.headers['strict-transport-security'], /^max-age=777600000;?/); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8248367417b2b2512c3d",
+      "title": "Disable DNS Prefetching with helmet.dnsPrefetchControl()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "To improve performance, most browsers prefetch DNS records for the links in a page. In that way the destination ip is already known when the user clicks on a link. This may lead to over-use of the DNS service (if you own a big website, visited by millions people…), privacy issues (one eavesdropper could infer that you are on a certain page), or page statistics alteration (some links may appear visited even if they are not). If you have high security needs you can disable DNS prefetching, at the cost of a performance penalty."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.dnsPrefetchControl() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'dnsPrefetchControl'); assert.equal(data.headers['x-dns-prefetch-control'], 'off'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8249367417b2b2512c3e",
+      "title": "Disable Client-Side Caching with helmet.noCache()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "If you are releasing an update for your website, and you want the users to always download the newer version, you can (try to) disable caching on client’s browser. It can be useful in development too. Caching has performance benefits, which you will lose, so only use this option when there is a real need."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.noCache() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'nocache'); assert.equal(data.headers['cache-control'], 'no-store, no-cache, must-revalidate, proxy-revalidate'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8249367417b2b2512c3f",
+      "title": "Set a Content Security Policy with helmet.contentSecurityPolicy()",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "This challenge highlights one promising new defense that can significantly reduce the risk and impact of many type of attacks in modern browsers. By setting and configuring a Content Security Policy you can prevent the injection of anything unintended into your page. This will protect your app from XSS vulnerabilities, undesired tracking, malicious frames, and much more. CSP works by defining a whitelist of content sources which are trusted. You can configure them for each kind of resource a web page may need (scripts, stylesheets, fonts, frames, media, and so on…). There are multiple directives available, so a website owner can have a granular control. See HTML 5 Rocks, KeyCDN for more details. Unfortunately CSP in unsupported by older browser.",
+        "By default, directives are wide open, so it’s important to set the defaultSrc directive as a fallback. Helmet supports both defaultSrc and default-src naming styles. The fallback applies for most of the unspecified directives. In this exercise, use helmet.contentSecurityPolicy(), and configure it setting the defaultSrc directive to [\"self\"] (the list of allowed sources must be in an array), in order to trust only your website address by default. Set also the scriptSrc directive so that you will allow scripts to be downloaded from your website, and from the domain 'trusted-cdn.com'.",
+        "Hint: in the \"'self'\" keyword, the single quotes are part of the keyword itself, so it needs to be enclosed in double quotes to be working."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "helmet.csp() middleware should be mounted correctly",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { assert.include(data.appStack, 'csp'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Your csp config is not correct. defaultSrc should be [\"'self'\"] and scriptSrc should be [\"'self'\", 'trusted-cdn.com']",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/app-info').then(data => { var cspHeader = Object.keys(data.headers).filter(function(k){ return k === 'content-security-policy' || k === 'x-webkit-csp' || k === 'x-content-security-policy' })[0]; assert.equal(data.headers[cspHeader], \"default-src 'self'; script-src 'self' trusted-cdn.com\"); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8249367417b2b2512c40",
+      "title": "Configure Helmet Using the ‘parent’ helmet() Middleware",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-infosec/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-infosec/'>GitHub</a>.",
+        "app.use(helmet()) will automatically include all the middleware introduced above, except noCache(), and contentSecurityPolicy(), but these can be enabled if necessary. You can also disable or configure any other middleware individually, using a configuration object.",
+        "// Example",
+        "<code>app.use(helmet({</code>",
+        "<code>  frameguard: {         // configure</code>",
+        "<code>    action: 'deny'</code>",
+        "<code>  },</code>",
+        "<code>  contentSecurityPolicy: {    // enable and configure</code>",
+        "<code>   directives: {</code>",
+        "<code>     defaultSrc: [\"self\"],</code>",
+        "<code>     styleSrc: ['style.com'],</code>",
+        "<code>   }</code>",
+        "<code>  },</code>",
+        "<code> dnsPrefetchControl: false     // disable</code>",
+        "<code>}))</code>",
+        "We introduced each middleware separately for teaching purpose, and for ease of testing. Using the ‘parent’ helmet() middleware is easiest, and cleaner, for a real project."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "no tests - it's a descriptive challenge",
+          "testString": "assert(true)"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58a25bcef9fc0f352b528e7b",
+      "title": "Protect Your Data with BCrypt",
+      "description": [
+        [
+          "",
+          "",
+          "The safest way to protect a password is to never even store it- even encrypted. The solution to this security problem is hashing. Unlike encryptions, hashes cannot be transformed back into the original data. So how do you use a hash? A hash is used to verify data like a password again at a later point in time without actually knowing what it is in the future by hashing the entered password in the same manner as the original and comparing the results; if they match then you can be sure it is the same data. A widely used library for this is <em>BCrypt</em>. With how easy BCrypt is to implement into your web applications, you should never have any excuse to store a plain text password in your databases.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-bcrypt/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-bcrypt/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe.",
+          ""
+        ]
+      ],
+      "releasedOn": "",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "Waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "titleEs": "",
+      "descriptionEs": [
+        []
+      ],
+      "titleFr": "",
+      "descriptionFr": [
+        []
+      ],
+      "titleDe": "",
+      "descriptionDe": [
+        []
+      ]
+    },
+    {
+      "id": "58a25bcef9fc0f352b528e7c",
+      "title": "Understand BCrypt Hashes",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-bcrypt/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-bcrypt/'>GitHub</a>.",
+        "BCrypt hashes are very secure. A hash is basically a fingerprint of the original data- always unique. This is accomplished by feeding the original data into a algorithm and having returned a fixed length result. To further complicate this process and make it more secure, you can also <em>salt</em> your hash. Salting your hash involves adding random data to the original data before the hashing process which makes it even harder to crack the hash.",
+        "BCrypt hashes will always looks like <code>$2a$13$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm</code> which does have a structure. The first small bit of data <code>$2a</code> is defining what kind of hash algorithm was used. The next portion <code>$13</code> defines the <em>cost</em>. Cost is about how much power it takes to compute the hash. It is on a logarithmic scale of 2^cost and determines how many times the data is put through the hashing algorithm. For example, at a cost of 10 you are able to hash 10 passwords a second on an average computer, however at a cost of 15 it takes 3 seconds per hash... and to take it further, at a cost of 31 it would takes multiple days to complete a hash. A cost of 12 is considered very secure at this time. The last portion of your hash <code>$ZyprE5MRw2Q3WpNOGZWGbeG7ADUre1Q8QO.uUUtcbqloU0yvzavOm</code>, looks like 1 large string of numbers, periods, and letters but it is actually 2 separate pieces of information. The first 22 characters is the salt in plain text, and the rest is the hashed password!",
+        "<hr>To begin using BCrypt, add it as a dependency in your project and require it as 'bcrypt' in your server.",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "BCyrpt is a dependency",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/package.json') .then(data => { var packJson = JSON.parse(data); assert.property(packJson.dependencies, 'bcrypt', 'Your project should list \"bcrypt\" as a dependency'); }, xhr => { throw new Error(xhr.statusText); })"
+        },
+        {
+          "text": "BCrypt has been properly required",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js').then(data => {assert.match(data, /bcrypt.*=.*require.*('|\")bcrypt('|\")/gi, 'You should correctly require and instanciate socket.io as io.');}, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58a25bcff9fc0f352b528e7d",
+      "title": "Hash and Compare Passwords Asynchronously",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-bcrypt/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-bcrypt/'>GitHub</a>.",
+        "As hashing is designed to be computationally intensive, it is recommended to do so asyncronously on your server as to avoid blocking incoming connections while you hash. All you have to do to hash a password asynchronous is call <code>bcrypt.hash(myPlaintextPassword, saltRounds, (err, hash) => { /*Store hash in your db*/ });</code>",
+        "<hr>Add this hashing function to your server(we've already defined the variables used in the function for you to use) and log it to the console for you to see! At this point you would normally save the hash to your database.",
+        "Now when you need to figure out if a new input is the same data as the hash you would just use the compare function <code>bcrypt.compare(myPlaintextPassword, hash, (err, res) => { /*res == true or false*/ });</code>. Add this into your existing hash function(since you need to wait for the hash to complete before calling the compare function) after you log the completed hash and log 'res' to the console within the compare. You should see in the console a hash then 'true' is printed! If you change 'myPlaintextPassword' in the compare function to 'someOtherPlaintextPassword' then it should say false.",
+        "<pre>bcrypt.hash('passw0rd!', 13, (err, hash) => {\n  console.log(hash); //$2a$12$Y.PHPE15wR25qrrtgGkiYe2sXo98cjuMCG1YwSI5rJW1DSJp0gEYS\n  bcrypt.compare('passw0rd!', hash, (err, res) => {\n      console.log(res); //true\n  });\n});</pre>",
+        "Submit your page when you think you've got it right."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Async hash generated and correctly compared",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /START_ASYNC[^]*bcrypt.hash.*myPlaintextPassword( |),( |)saltRounds( |),( |).*err( |),( |)hash[^]*END_ASYNC/gi, 'You should call bcrypt.hash on myPlaintextPassword and saltRounds and handle err and hash as a result in the callback'); assert.match(data, /START_ASYNC[^]*bcrypt.hash[^]*bcrypt.compare.*myPlaintextPassword( |),( |)hash( |),( |).*err( |),( |)res[^]*}[^]*}[^]*END_ASYNC/gi, 'Nested within the hash function should be the compare function comparing myPlaintextPassword to hash'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "58a25bcff9fc0f352b528e7e",
+      "title": "Hash and Compare Passwords Synchronously",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-bcrypt/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-bcrypt/'>GitHub</a>.",
+        "Hashing synchronously is just as easy to do but can cause lag if using it server side with a high cost or with hashing done very often. Hashing with this method is as easy as calling <code>var hash = bcrypt.hashSync(myPlaintextPassword, saltRounds);</code>",
+        "<hr>Add this method of hashing to your code and then log the result to the console. Again, the variables used are already defined in the server so you wont need to adjust them. You may notice even though you are hashing the same password as in the async function, the result in the console is different- this is due to the salt being randomly generated each time as seen by the first 22 characters in the third string of the hash.",
+        "Now to compare a password input with the new sync hash, you would use the compareSync method: <code>var result = bcrypt.compareSync(myPlaintextPassword, hash);</code> with the result being a boolean true or false. Add this function in and log to the console the result to see it working.",
+        "Submit your page when you think you've got it right. If you ran into errors during these challenges you can take a look at the example completed code <a href='https://gist.github.com/JosephLivengood/9a2698fb63e42d9d8b4b84235c08b4c4'>here</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Sync hash generated and correctly compared",
+          "testString": "getUserInput => $.get(getUserInput('url')+ '/_api/server.js') .then(data => { assert.match(data, /START_SYNC[^]*hash.*=.*bcrypt.hashSync.*myPlaintextPassword( |),( |)saltRounds[^]*END_SYNC/gi, 'You should call bcrypt.hashSync on myPlaintextPassword with saltRounds'); assert.match(data, /START_SYNC[^]*result.*=.*bcrypt.compareSync.*myPlaintextPassword( |),( |)hash[^]*END_SYNC/gi, 'You should call bcrypt.compareSync on myPlaintextPassword with the hash generated in the last line'); }, xhr => { throw new Error(xhr.statusText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/06-information-security-and-quality-assurance/quality-assurance-and-information-security-projects.json b/seed/math-challenges/06-information-security-and-quality-assurance/quality-assurance-and-information-security-projects.json
new file mode 100644
index 0000000000..48cb25a54b
--- /dev/null
+++ b/seed/math-challenges/06-information-security-and-quality-assurance/quality-assurance-and-information-security-projects.json
@@ -0,0 +1,298 @@
+{
+  "name": "Information Security and Quality Assurance Projects",
+  "order": 4,
+  "time": "150 hours",
+  "helpRoom": "HelpBackend",
+  "challenges": [
+    {
+      "id": "587d8249367417b2b2512c41",
+      "title": "Metric-Imperial Converter",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://hard-twilight.glitch.me/' target='_blank'>https://hard-twilight.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-metricimpconverter/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-metricimpconverter/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "I will prevent the client from trying to guess(sniff) the MIME type.",
+          "testString": ""
+        },
+        {
+          "text": "I will prevent cross-site scripting (XSS) attacks.",
+          "testString": ""
+        },
+        {
+          "text": "I can GET /api/convert with a single parameter containing an accepted number and unit and have it converted. (Hint: Split the input by looking for the index of the first character which will mark the start of the unit)",
+          "testString": ""
+        },
+        {
+          "text": "I can convert 'gal' to 'L' and vice versa. (1 gal to 3.78541 L)",
+          "testString": ""
+        },
+        {
+          "text": "I can convert 'lbs' to 'kg' and vice versa. (1 lbs to 0.453592 kg)",
+          "testString": ""
+        },
+        {
+          "text": "I can convert 'mi' to 'km' and vice versa. (1 mi to 1.60934 km)",
+          "testString": ""
+        },
+        {
+          "text": "If my unit of measurement is invalid, returned will be 'invalid unit'.",
+          "testString": ""
+        },
+        {
+          "text": "If my number is invalid, returned with will 'invalid number'.",
+          "testString": ""
+        },
+        {
+          "text": "If both are invalid, return will be 'invalid number and unit'.",
+          "testString": ""
+        },
+        {
+          "text": "I can use fractions, decimals or both in my parameter(ie. 5, 1/2, 2.5/6), but if nothing is provided it will default to 1.",
+          "testString": ""
+        },
+        {
+          "text": "My return will consist of the initNum, initUnit, returnNum, returnUnit, and string spelling out units in format '{initNum} {initial_Units} converts to {returnNum} {return_Units}' with the result rounded to 5 decimals in the string.",
+          "testString": ""
+        },
+        {
+          "text": "All 16 unit tests are complete and passing.",
+          "testString": ""
+        },
+        {
+          "text": "All 5 functional tests are complete and passing.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 15, 2017",
+      "translations": {}
+    },
+    {
+      "id": "587d8249367417b2b2512c42",
+      "title": "Issue Tracker",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://protective-garage.glitch.me/' target='_blank'>https://protective-garage.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-issuetracker/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-issuetracker/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Prevent cross site scripting (XSS) attacks.",
+          "testString": ""
+        },
+        {
+          "text": "I can POST /api/issues/{projectname} with form data containing required issue_title, issue_text, created_by, and optional assigned_to and status_text.",
+          "testString": ""
+        },
+        {
+          "text": "The object saved (and returned) will include all of those fields (blank for optional no input) and also include created_on(date/time), updated_on(date/time), open(boolean, true for open, false for closed), and _id.",
+          "testString": ""
+        },
+        {
+          "text": "I can PUT /api/issues/{projectname} with a id and any fields in the object with a value to object said object. Returned will be 'successfully updated' or 'could not update '+id. This should always update updated_on. If no fields are sent return 'no updated field sent'.",
+          "testString": ""
+        },
+        {
+          "text": "I can DELETE /api/issues/{projectname} with a id to completely delete an issue. If no _id is sent return 'id error', success: 'deleted '+id, failed: 'could not delete '+id.",
+          "testString": ""
+        },
+        {
+          "text": "I can GET /api/issues/{projectname} for an array of all issues on that specific project with all the information for each issue as was returned when posted.",
+          "testString": ""
+        },
+        {
+          "text": "I can filter my get request by also passing along any field and value in the query(ie. /api/issues/{project}?open=false). I can pass along as many fields/values as I want.",
+          "testString": ""
+        },
+        {
+          "text": "All 11 functional tests are complete and passing.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 15, 2017",
+      "translations": {}
+    },
+    {
+      "id": "587d824a367417b2b2512c43",
+      "title": "Personal Library",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://spark-cathedral.glitch.me/' target='_blank'>https://spark-cathedral.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-library/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-library/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Nothing from my website will be cached in my client.",
+          "testString": ""
+        },
+        {
+          "text": "The headers will say that the site is powered by 'PHP 4.2.0' even though it isn't (as a security measure).",
+          "testString": ""
+        },
+        {
+          "text": "I can post a title to /api/books to add a book and returned will be the object with the title and a unique _id.",
+          "testString": ""
+        },
+        {
+          "text": "I can get /api/books to retrieve an array of all books containing title, _id, and commentcount.",
+          "testString": ""
+        },
+        {
+          "text": "I can get /api/books/{id} to retrieve a single object of a book containing _title, _id, & an array of comments (empty array if no comments present).",
+          "testString": ""
+        },
+        {
+          "text": "I can post a comment to /api/books/{id} to add a comment to a book and returned will be the books object similar to get /api/books/{id} including the new comment.",
+          "testString": ""
+        },
+        {
+          "text": "I can delete /api/books/{_id} to delete a book from the collection. Returned will be 'delete successful' if successful.",
+          "testString": ""
+        },
+        {
+          "text": "If I try to request a book that doesn't exist I will be returned 'no book exists'.",
+          "testString": ""
+        },
+        {
+          "text": "I can send a delete request to /api/books to delete all books in the database. Returned will be 'complete delete successful' if successful.",
+          "testString": ""
+        },
+        {
+          "text": "All 6 functional tests required are complete and passing.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 15, 2017",
+      "translations": {}
+    },
+    {
+      "id": "587d824a367417b2b2512c44",
+      "title": "Stock Price Checker",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://giant-chronometer.glitch.me/' target='_blank'>https://giant-chronometer.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-stockchecker/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-stockchecker/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Set the content security policies to only allow loading of scripts and css from your server.",
+          "testString": ""
+        },
+        {
+          "text": "I can GET /api/stock-prices with form data containing a Nasdaq stock ticker and recieve back an object stockData.",
+          "testString": ""
+        },
+        {
+          "text": "In stockData, I can see the stock(string, the ticker), price(decimal in string format), and likes(int).",
+          "testString": ""
+        },
+        {
+          "text": "I can also pass along field like as true(boolean) to have my like added to the stock(s). Only 1 like per ip should be accepted.",
+          "testString": ""
+        },
+        {
+          "text": "If I pass along 2 stocks, the return object will be an array with both stock's info. Instead of likes, it will display rel_likes(the difference between the likes on both stocks) on both.",
+          "testString": ""
+        },
+        {
+          "text": "A good way to receive current price is the following external API(replacing 'GOOG' with your stock): https://finance.google.com/finance/info?q=NASDAQ%3aGOOG",
+          "testString": ""
+        },
+        {
+          "text": "All 5 functional tests are complete and passing.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 15, 2017",
+      "translations": {}
+    },
+    {
+      "id": "587d824a367417b2b2512c45",
+      "title": "Anonymous Message Board",
+      "description": [
+        "Build a full stack JavaScript app that is functionally similar to this: <a href='https://horn-celery.glitch.me/' target='_blank'>https://horn-celery.glitch.me/</a>.",
+        "Working on this project will involve you writing your code on Glitch on our starter project. After completing this project you can copy your public glitch url (to the homepage of your app) into this screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.",
+        "Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-project-messageboard/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-project-messageboard/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "Only allow your site to be loading in an iFrame on your own pages.",
+          "testString": ""
+        },
+        {
+          "text": "Do not allow DNS prefetching.",
+          "testString": ""
+        },
+        {
+          "text": "Only allow your site to send the referrer for your own pages.",
+          "testString": ""
+        },
+        {
+          "text": "I can POST a thread to a specific message board by passing form data text and deletepassword_ to /api/threads/{board}.(Recommend res.redirect to board page /b/{board}) Saved will be at least _id, text, createdon_(date&time), bumpedon_(date&time, starts same as created_on), reported(boolean), deletepassword_, & replies(array).",
+          "testString": ""
+        },
+        {
+          "text": "I can POST a reply to a thread on a specific board by passing form data text, deletepassword_, & threadid_ to /api/replies/{board} and it will also update the bumped_on date to the comments date.(Recommend res.redirect to thread page /b/{board}/{thread_id}) In the thread's replies array will be saved _id, text, createdon_, deletepassword_, & reported.",
+          "testString": ""
+        },
+        {
+          "text": "I can GET an array of the most recent 10 bumped threads on the board with only the most recent 3 replies each from /api/threads/{board}. The reported and deletepasswords_ fields will not be sent to the client.",
+          "testString": ""
+        },
+        {
+          "text": "I can GET an entire thread with all its replies from /api/replies/{board}?thread_id={thread_id}. Also hiding the same fields the client should be see.",
+          "testString": ""
+        },
+        {
+          "text": "I can delete a thread completely if I send a DELETE request to /api/threads/{board} and pass along the threadid_ & deletepassword_. (Text response will be 'incorrect password' or 'success')",
+          "testString": ""
+        },
+        {
+          "text": "I can delete a post(just changing the text to '[deleted]' instead of removing completely like a thread) if I send a DELETE request to /api/replies/{board} and pass along the threadid_, replyid_, & deletepassword_. (Text response will be 'incorrect password' or 'success')",
+          "testString": ""
+        },
+        {
+          "text": "I can report a thread and change its reported value to true by sending a PUT request to /api/threads/{board} and pass along the threadid_. (Text response will be 'success')",
+          "testString": ""
+        },
+        {
+          "text": "I can report a reply and change its reported value to true by sending a PUT request to /api/replies/{board} and pass along the threadid_ & replyid_. (Text response will be 'success')",
+          "testString": ""
+        },
+        {
+          "text": "Complete functional tests that wholly test routes and pass.",
+          "testString": ""
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "isRequired": true,
+      "releasedOn": "January 15, 2017",
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/06-information-security-and-quality-assurance/quality-assurance-and-testing-with-chai.json b/seed/math-challenges/06-information-security-and-quality-assurance/quality-assurance-and-testing-with-chai.json
new file mode 100644
index 0000000000..5a379232bb
--- /dev/null
+++ b/seed/math-challenges/06-information-security-and-quality-assurance/quality-assurance-and-testing-with-chai.json
@@ -0,0 +1,858 @@
+{
+  "name": "Quality Assurance and Testing with Chai",
+  "order": 2,
+  "time": "5 hours",
+  "helpRoom": "Help",
+  "challenges": [
+    {
+      "id": "58af0b4b4bbe015e85a91dbe",
+      "title": "Quality Assurance Introduction",
+      "description": [
+        [
+          "",
+          "",
+          "Working on these challenges will involve you writing your code on Glitch on our starter project. After completing each challenge you can copy your public glitch url (to the homepage of your app) into the challenge screen to test it! Optionally you may choose to write your project on another platform but it must be publicaly visible for our testing.<br>Start this project on Glitch using <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>this link</a> or clone <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>this repository</a> on GitHub! If you use Glitch, remember to save the link to your project somewhere safe!",
+          ""
+        ]
+      ],
+      "releasedOn": "Feb 17, 2017",
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "challengeType": 7,
+      "isRequired": false,
+      "translations": {}
+    },
+    {
+      "id": "587d824a367417b2b2512c46",
+      "title": "Learn How JavaScript Assertions Work",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "Use assert.isNull() or assert.isNotNull() to make the tests pass."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=0').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isNull vs. isNotNull",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=0').then(data => {  assert.equal(data.assertions[0].method, 'isNull', 'Null is null'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isNull vs. isNotNull",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=0').then(data => {  assert.equal(data.assertions[1].method, 'isNotNull', '1 is not null'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824b367417b2b2512c47",
+      "title": "Test if a Variable or Function is Defined",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "Use assert.isDefined() or assert.isUndefined() to make the tests pass"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=1').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isDefined vs. isUndefined",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=1').then(data => {  assert.equal(data.assertions[0].method, 'isDefined', 'Null is not undefined'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isDefined vs. isUndefined",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=1').then(data => {  assert.equal(data.assertions[1].method, 'isUndefined', 'Undefined is undefined'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isDefined vs. isUndefined",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=1').then(data => {  assert.equal(data.assertions[2].method, 'isDefined', 'A string is not undefined'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824b367417b2b2512c48",
+      "title": "Use Assert.isOK and Assert.isNotOK",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "Use assert.isOk() or assert.isNotOk() to make the tests pass.",
+        ".isOk(truthy) and .isNotOk(falsey) will pass."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isOk vs. isNotOk",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(data => {  assert.equal(data.assertions[0].method, 'isNotOk', 'Null is falsey'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isOk vs. isNotOk",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(data => {  assert.equal(data.assertions[1].method, 'isOk','A string is truthy'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isOk vs. isNotOk",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=2').then(data => {  assert.equal(data.assertions[2].method, 'isOk', 'true is truthy'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824b367417b2b2512c49",
+      "title": "Test for Truthiness",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "Use assert.isTrue() or assert.isNotTrue() to make the tests pass.",
+        ".isTrue(true) and .isNotTrue(everything else) will pass.",
+        ".isFalse() and .isNotFalse() also exist."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=3').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isTrue vs. isNotTrue",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=3').then(data => {  assert.equal(data.assertions[0].method, 'isTrue', 'True is true'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isTrue vs. isNotTrue",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=3').then(data => {  assert.equal(data.assertions[1].method, 'isTrue', 'Double negation of a truthy value is true'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isTrue vs. isNotTrue",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=3').then(data => {  assert.equal(data.assertions[2].method, 'isNotTrue', 'A truthy object is not true - neither is a false one'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824b367417b2b2512c4a",
+      "title": "Use the Double Equals to Assert Equality",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        ".equal(), .notEqual()",
+        ".equal() compares objects using '=='"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - equal vs. notEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(data => {  assert.equal(data.assertions[0].method, 'equal', 'Numbers are coerced into strings with == '); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - equal vs. notEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(data => {  assert.equal(data.assertions[1].method, 'notEqual', ' == compares object references'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - equal vs. notEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(data => {  assert.equal(data.assertions[2].method, 'equal', '6 * \\'2\\' is 12 ! It should be equal to \\'12\\''); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - equal vs. notEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=4').then(data => {  assert.equal(data.assertions[3].method, 'notEqual', '6 + \\'2\\' is \\'62\\'...'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824b367417b2b2512c4b",
+      "title": "Use the Triple Equals to Assert Strict Equality",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        ".strictEqual(), .notStrictEqual()",
+        ".strictEqual() compares objects using '==='"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - strictEqual vs. notStrictEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(data => {  assert.equal(data.assertions[0].method, 'notStrictEqual', 'with strictEqual the type must match'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - strictEqual vs. notStrictEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(data => {  assert.equal(data.assertions[1].method, 'strictEqual', '3*2 = 6...'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - strictEqual vs. notStrictEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(data => {  assert.equal(data.assertions[2].method, 'strictEqual', '6 * \\'2\\' is 12. Types match !'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - strictEqual vs. notStrictEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=5').then(data => {  assert.equal(data.assertions[3].method, 'notStrictEqual', 'Even if they have the same elements, the Arrays are notStrictEqual'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824c367417b2b2512c4c",
+      "title": "Assert Deep Equality with .deepEqual and .notDeepEqual",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        ".deepEqual(), .notDeepEqual()",
+        ".deepEqual() asserts that two object are deep equal"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=6').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - deepEqual vs. notDeepEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=6').then(data => {  assert.equal(data.assertions[0].method, 'deepEqual', 'The order of the keys does not matter'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - deepEqual vs. notDeepEqual",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=6').then(data => {  assert.equal(data.assertions[1].method, 'notDeepEqual', 'The position of elements within an array does matter'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824c367417b2b2512c4d",
+      "title": "Compare the Properties of Two Elements",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        ".isAbove() => a > b , .isAtMost() => a <= b"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isAbove vs. isAtMost",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(data => {  assert.equal(data.assertions[0].method, 'isAtMost', '5 is at most (<=) 5'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isAbove vs. isAtMost",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(data => {  assert.equal(data.assertions[1].method, 'isAbove', '1 is greater than 0'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isAbove vs. isAtMost",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(data => {  assert.equal(data.assertions[2].method, 'isAbove', 'Math.PI = 3.14159265 is greater than 3'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isAbove vs. isAtMost",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=7').then(data => {  assert.equal(data.assertions[3].method, 'isAtMost', '1 - Math.random() is > 0 and <= 1. It is atMost 1 !'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824c367417b2b2512c4e",
+      "title": "Test if One Value is Below or At Least as Large as Another",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        ".isBelow() => a < b , .isAtLeast =>  a >= b"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isBelow vs. isAtLeast",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(data => {  assert.equal(data.assertions[0].method, 'isAtLeast', '5 is at least (>=) 5'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isBelow vs. isAtLeast",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(data => {  assert.equal(data.assertions[0].method, 'isAtLeast', '2 * Math.random() is at least 0'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isBelow vs. isAtLeast",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(data => {  assert.equal(data.assertions[0].method, 'isBelow', '1 is smaller than 2'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isBelow vs. isAtLeast",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=8').then(data => {  assert.equal(data.assertions[0].method, 'isBelow', '2/3 (0.6666) is smaller than 1'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824c367417b2b2512c4f",
+      "title": "Test if a Value Falls within a Specific Range",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        ".approximately",
+        ".approximately(actual, expected, range, [message])",
+        "actual = expected +/- range",
+        "Choose the minimum range (3rd parameter) to make the test always pass",
+        "it should be less than 1"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Use approximately(actual, expected, range) - Chose the correct range",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(data => {  assert.equal(data.assertions[0].method, 'isApproximately', 'weirdNumbers(0.5) is in the range (0.5, 1.5]. It\\'s within 1 +/- 0.5');  assert.equal(data.assertions[0].args[2], 0.5); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Use approximately(actual, expected, range) - Chose the correct range",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(data => {  assert.equal(data.assertions[1].method, 'isApproximately');  assert.equal(data.assertions[1].args[2], 0.8, 'weirdNumbers(0.2) is in the range (0.2, 1.2] It\\'s within 1 +/- 0.8'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824d367417b2b2512c50",
+      "title": "Test if a Value is an Array",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(data => {assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isArray vs. isNotArray",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(data => {  assert.equal(data.assertions[0].method, 'isArray', 'String.prototype.split() returns an Array'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isArray vs. isNotArray",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=10').then(data => {  assert.equal(data.assertions[1].method, 'isNotArray', 'Array.prototype.indexOf() returns a number'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824d367417b2b2512c51",
+      "title": "Test if an Array Contains an Item",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=11').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - include vs. notInclude",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=11').then(data => {  assert.equal(data.assertions[0].method, 'notInclude', 'It\\'s summer in july...'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - include vs. notInclude",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=11').then(data => {  assert.equal(data.assertions[1].method, 'include', 'JavaScript is a backend language !!'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824d367417b2b2512c52",
+      "title": "Test if a Value is a String",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "#isString asserts that the actual value is a string."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=12').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isString vs. isNotString",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=12').then(data => {  assert.equal(data.assertions[0].method, 'isNotString', 'A float number is not a string'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isString vs. isNotString",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=12').then(data => {  assert.equal(data.assertions[1].method, 'isString', 'environment vars are strings (or undefined)'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - isString vs. isNotString",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=12').then(data => {  assert.equal(data.assertions[2].method, 'isString', 'A JSON is a string'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824d367417b2b2512c53",
+      "title": "Test if a String Contains a Substring",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "#include (on #notInclude ) works for strings too !!",
+        "It asserts that the actual string contains the expected substring"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=13').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - include vs. notInclude",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=13').then(data => {  assert.equal(data.assertions[0].method, 'include', '\\'Arrow\\' contains \\'row\\'...'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - include vs. notInclude",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=13').then(data => {  assert.equal(data.assertions[1].method, 'notInclude', '... a \\'dart\\' doesn\\'t contain a \\'queue\\''); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824d367417b2b2512c54",
+      "title": "Use Regular Expressions to Test a String",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "#match Asserts that the actual value",
+        "matches the second argument regular expression."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=14').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - match vs. notMatch",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=14').then(data => {  assert.equal(data.assertions[0].method, 'match', '\\'# name: John Doe, age: 35\\' matches the regex'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - match vs. notMatch",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=14').then(data => {  assert.equal(data.assertions[1].method, 'notMatch', '\\'# name: Paul Smith III, age: twenty-four\\' does not match the regex (the age must be numeric)'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824e367417b2b2512c55",
+      "title": "Test if an Object has a Property",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "#property asserts that the actual object has a given property.",
+        "Use #property or #notProperty where appropriate"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=15').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - property vs. notProperty",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=15').then(data => { assert.equal(data.assertions[0].method, 'notProperty', 'A car has not wings'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - property vs. notProperty",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=15').then(data => { assert.equal(data.assertions[1].method, 'property', 'planes have engines'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - property vs. notProperty",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=15').then(data => { assert.equal(data.assertions[2].method, 'property', 'Cars have wheels'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824e367417b2b2512c56",
+      "title": "Test if a Value is of a Specific Data Structure Type",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "#typeOf asserts that value’s type is the given string, as determined by Object.prototype.toString.",
+        "Use #typeOf or #notTypeOf where appropriate"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - typeOf vs. notTypeOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(data => { assert.equal(data.assertions[0].method, 'typeOf', 'myCar is typeOf Object'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - typeOf vs. notTypeOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(data => { assert.equal(data.assertions[1].method, 'typeOf', 'Car.model is a String'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - typeOf vs. notTypeOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(data => { assert.equal(data.assertions[1].method, 'notTypeOf', 'Plane.wings is a Number (not a String)'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - typeOf vs. notTypeOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(data => { assert.equal(data.assertions[3].method, 'typeOf', 'Plane.engines is an Array'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - typeOf vs. notTypeOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=16').then(data => { assert.equal(data.assertions[4].method, 'typeOf', 'Car.wheels is a Number'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824e367417b2b2512c57",
+      "title": "Test if an Object is an Instance of a Constructor",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "#instanceOf asserts that an object is an instance of a constructor.",
+        "Use #instanceOf or #notInstanceOf where appropriate"
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - instanceOf vs. notInstanceOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(data => { assert.equal(data.assertions[0].method, 'notInstanceOf', 'myCar is not an instance of Plane'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - instanceOf vs. notInstanceOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(data => { assert.equal(data.assertions[1].method, 'instanceOf', 'airlinePlane is an instance of Plane'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - instanceOf vs. notInstanceOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(data => { assert.equal(data.assertions[2].method, 'instanceOf', 'everything is an Object in JavaScript...'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "Choose the right assertion - instanceOf vs. notInstanceOf",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=unit&n=17').then(data => { assert.equal(data.assertions[3].method, 'notInstanceOf', 'myCar.wheels is not an instance of String'); }, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824e367417b2b2512c58",
+      "title": "Run Functional Tests on API Endpoints using Chai-HTTP",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "Replace assert.fail(). Test the status and the text.response. Make the test pass.",
+        "Don't send a name in the query, the endpoint with responds with 'hello Guest'."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=0').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.status' == 200",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=0').then(data => { assert.equal(data.assertions[0].method, 'equal'); assert.equal(data.assertions[0].args[0], 'res.status'); assert.equal(data.assertions[0].args[1], '200');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.text' == 'hello Guest'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=0').then(data => { assert.equal(data.assertions[1].method, 'equal'); assert.equal(data.assertions[1].args[0], 'res.text'); assert.equal(data.assertions[1].args[1], '\\'hello Guest\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824f367417b2b2512c59",
+      "title": "Run Functional Tests on API Endpoints using Chai-HTTP II",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "Replace assert.fail(). Test the status and the text.response. Make the test pass.",
+        "Send you name in the query appending ?name=<your_name>, the endpoint with responds with 'hello <your_name>'."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=1').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.status' == 200",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=1').then(data => { assert.equal(data.assertions[0].method, 'equal'); assert.equal(data.assertions[0].args[0], 'res.status'); assert.equal(data.assertions[0].args[1], '200');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.text' == 'hello Guest'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=1').then(data => { assert.equal(data.assertions[1].method, 'equal'); assert.equal(data.assertions[1].args[0], 'res.text'); assert.match(data.assertions[1].args[1], /hello [\\w\\d_-]/);}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824f367417b2b2512c5a",
+      "title": "Run Functional Tests on an API Response using Chai-HTTP III - PUT method",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "In the next example we'll see how to send data in a request payload (body).",
+        "We are going to test a PUT request. The '/travellers' endpoint accepts",
+        "a JSON object taking the structure :",
+        " {surname: [last name of a traveller of the past]} ,",
+        "The route responds with :",
+        " {name: [first name], surname:[last name], dates: [birth - death years]}",
+        "see the server code for more details.",
+        "Send {surname: 'Colombo'}. Replace assert.fail() and make the test pass.",
+        "Check for 1) status, 2) type, 3) body.name, 4) body.surname",
+        "Follow the assertion order above, We rely on it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.status' to be 200",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(data => { assert.equal(data.assertions[0].method, 'equal'); assert.equal(data.assertions[0].args[0], 'res.status'); assert.equal(data.assertions[0].args[1], '200');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.type' to be 'application/json'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(data => { assert.equal(data.assertions[1].method, 'equal'); assert.equal(data.assertions[1].args[0], 'res.type'); assert.equal(data.assertions[1].args[1], '\\'application/json\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.body.name' to be 'Cristoforo'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(data => { assert.equal(data.assertions[2].method, 'equal'); assert.equal(data.assertions[2].args[0], 'res.body.name'); assert.equal(data.assertions[2].args[1], '\\'Cristoforo\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.body.surname' to be 'Colombo'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=2').then(data => { assert.equal(data.assertions[3].method, 'equal'); assert.equal(data.assertions[3].args[0], 'res.body.surname'); assert.equal(data.assertions[3].args[1], '\\'Colombo\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824f367417b2b2512c5b",
+      "title": "Run Functional Tests on an API Response using Chai-HTTP IV - PUT method redux",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "This exercise is similar to the preceding. Look at it for the details.",
+        "Send {surname: 'da Verrazzano'}. Replace assert.fail() and make the test pass.",
+        "Check for 1) status, 2) type, 3) body.name, 4) body.surname",
+        "Follow the assertion order above, We rely on it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.status' to be 200",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(data => { assert.equal(data.assertions[0].method, 'equal'); assert.equal(data.assertions[0].args[0], 'res.status'); assert.equal(data.assertions[0].args[1], '200');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.type' to be 'application/json'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(data => { assert.equal(data.assertions[1].method, 'equal'); assert.equal(data.assertions[1].args[0], 'res.type'); assert.equal(data.assertions[1].args[1], '\\'application/json\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.body.name' to be 'Giovanni'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(data => { assert.equal(data.assertions[2].method, 'equal'); assert.equal(data.assertions[2].args[0], 'res.body.name'); assert.equal(data.assertions[2].args[1], '\\'Giovanni\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "You should test for 'res.body.surname' to be 'da Verrazzano'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=3').then(data => { assert.equal(data.assertions[3].method, 'equal'); assert.equal(data.assertions[3].args[0], 'res.body.surname'); assert.equal(data.assertions[3].args[1], '\\'da Verrazzano\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d824f367417b2b2512c5c",
+      "title": "Run Functional Tests using a Headless Browser",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "In the next challenges we are going to simulate the human interaction with a page using a device called 'Headless Browser'.",
+        "A headless browser is a web browser without a graphical user interface. These kind of tools are particularly useful for testing web pages as they are able to render and understand HTML, CSS, and JavaScript the same way a browser would.",
+        "For these challenges we are using Zombie.JS. It's a lightweight browser which is totally based on JS, without relying on additional binaries to be installed. This feature makes it usable in an environment such as Glitch. There are many other (more powerful) options.<br>",
+        "Look at the examples in the code for the exercise directions Follow the assertions order, We rely on it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the headless browser request succeded",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(data => { assert.equal(data.assertions[0].method, 'browser.success'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the text inside the element 'span#name' is 'Cristoforo'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(data => { assert.equal(data.assertions[1].method, 'browser.text'); assert.equal(data.assertions[1].args[0], '\\'span#name\\''); assert.equal(data.assertions[1].args[1], '\\'Cristoforo\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the text inside the element 'span#surname' is 'Colombo'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(data => { assert.equal(data.assertions[2].method, 'browser.text'); assert.equal(data.assertions[2].args[0], '\\'span#surname\\''); assert.equal(data.assertions[2].args[1], '\\'Colombo\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the element 'span#dates' exist and its count is 1",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=4').then(data => { assert.equal(data.assertions[3].method, 'browser.element'); assert.equal(data.assertions[3].args[0], '\\'span#dates\\''); assert.equal(data.assertions[3].args[1], 1);}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    },
+    {
+      "id": "587d8250367417b2b2512c5d",
+      "title": "Run Functional Tests using a Headless Browser II",
+      "description": [
+        "As a reminder, this project is being built upon the following starter project on <a href='https://glitch.com/#!/import/github/freeCodeCamp/boilerplate-mochachai/'>Glitch</a>, or cloned from <a href='https://github.com/freeCodeCamp/boilerplate-mochachai/'>GitHub</a>.",
+        "This exercise is similar to the preceding.",
+        "Look at  the code for directions. Follow the assertions order, We rely on it."
+      ],
+      "challengeSeed": [],
+      "tests": [
+        {
+          "text": "All tests should pass",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(data => { assert.equal(data.state,'passed'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": " assert that the headless browser request succeded",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(data => { assert.equal(data.assertions[0].method, 'browser.success'); }, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the text inside the element 'span#name' is 'Amerigo'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(data => { assert.equal(data.assertions[1].method, 'browser.text'); assert.equal(data.assertions[1].args[0], '\\'span#name\\''); assert.equal(data.assertions[1].args[1], '\\'Amerigo\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the text inside the element 'span#surname' is 'Vespucci'",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(data => { assert.equal(data.assertions[2].method, 'browser.text'); assert.equal(data.assertions[2].args[0], '\\'span#surname\\''); assert.equal(data.assertions[2].args[1], '\\'Vespucci\\'');}, xhr => { throw new Error(xhr.responseText); })"
+        },
+        {
+          "text": "assert that the element 'span#dates' exist and its count is 1",
+          "testString": "getUserInput => $.get(getUserInput('url') + '/_api/get-tests?type=functional&n=5').then(data => { assert.equal(data.assertions[3].method, 'browser.element'); assert.equal(data.assertions[3].args[0], '\\'span#dates\\''); assert.equal(data.assertions[3].args[1], 1);}, xhr => { throw new Error(xhr.responseText); })"
+        }
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "backend",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 0,
+      "translations": {}
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/07-contribute-to-open-source-and-help-nonprofits/contribute-to-open-source-and-help-nonprofits.json b/seed/math-challenges/07-contribute-to-open-source-and-help-nonprofits/contribute-to-open-source-and-help-nonprofits.json
new file mode 100644
index 0000000000..ad1207d1dd
--- /dev/null
+++ b/seed/math-challenges/07-contribute-to-open-source-and-help-nonprofits/contribute-to-open-source-and-help-nonprofits.json
@@ -0,0 +1,28 @@
+{
+  "name": "Open Source Contributions",
+  "order": 22,
+  "time": "800 Hours",
+  "isLocked": true,
+  "message": "Before you can get credit toward your final Full Stack Development Certificate by contributing to open source, we recommend you complete all six of your certifications.",
+  "challenges": [
+    {
+      "title": "Contribute Pull Requests to Open Source projects",
+      "isRequired": true
+    },
+    {
+      "title": "QA Other Developers' Pull Requests",
+      "isRequired": true
+    },
+    {
+      "title": "Greenfield Code Grant Project for a Nonprofit",
+      "isRequired": true
+    },
+    {
+      "title": "Legacy Code Grant Project for a Nonprofit",
+      "isRequired": true
+    },
+    {
+      "title": "Claim Your Full Stack Development Certificate"
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json
new file mode 100644
index 0000000000..bceca1d983
--- /dev/null
+++ b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-algorithm-questions.json
@@ -0,0 +1,642 @@
+{
+  "name": "Coding Interview Algorithm Questions",
+  "order": 1,
+  "time": "",
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "id": "aff0395860f5d3034dc0bfc9",
+      "title": "Validate US Telephone Numbers",
+      "description": [
+        "Return <code>true</code> if the passed string looks like a valid US phone number.",
+        "The user may fill out the form field any way they choose as long as it has the format of a valid US number. The following are examples of valid formats for US numbers (refer to the tests below for other variants):",
+        "<blockquote>555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555</blockquote>",
+        "For this challenge you will be presented with a string such as <code>800-692-7753</code> or <code>8oo-six427676;laskdjf</code>. 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 <code>1</code>. Return <code>true</code> if the string is a valid US phone number; otherwise return <code>false</code>.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function telephoneCheck(str) {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "telephoneCheck(\"555-555-5555\");"
+      ],
+      "solutions": [
+        "var re = /^([+]?1[\\s]?)?((?:[(](?:[2-9]1[02-9]|[2-9][02-8][0-9])[)][\\s]?)|(?:(?:[2-9]1[02-9]|[2-9][02-8][0-9])[\\s.-]?)){1}([2-9]1[02-9]|[2-9][02-9]1|[2-9][02-9]{2}[\\s.-]?){1}([0-9]{4}){1}$/;\n\nfunction telephoneCheck(str) {\n  return re.test(str);\n}\n\ntelephoneCheck(\"555-555-5555\");"
+      ],
+      "tests": [
+        "assert(typeof telephoneCheck(\"555-555-5555\") === \"boolean\", 'message: <code>telephoneCheck(\"555-555-5555\")</code> should return a boolean.');",
+        "assert(telephoneCheck(\"1 555-555-5555\") === true, 'message: <code>telephoneCheck(\"1 555-555-5555\")</code> should return true.');",
+        "assert(telephoneCheck(\"1 (555) 555-5555\") === true, 'message: <code>telephoneCheck(\"1 (555) 555-5555\")</code> should return true.');",
+        "assert(telephoneCheck(\"5555555555\") === true, 'message: <code>telephoneCheck(\"5555555555\")</code> should return true.');",
+        "assert(telephoneCheck(\"555-555-5555\") === true, 'message: <code>telephoneCheck(\"555-555-5555\")</code> should return true.');",
+        "assert(telephoneCheck(\"(555)555-5555\") === true, 'message: <code>telephoneCheck(\"(555)555-5555\")</code> should return true.');",
+        "assert(telephoneCheck(\"1(555)555-5555\") === true, 'message: <code>telephoneCheck(\"1(555)555-5555\")</code> should return true.');",
+        "assert(telephoneCheck(\"555-5555\") === false, 'message: <code>telephoneCheck(\"555-5555\")</code> should return false.');",
+        "assert(telephoneCheck(\"5555555\") === false, 'message: <code>telephoneCheck(\"5555555\")</code> should return false.');",
+        "assert(telephoneCheck(\"1 555)555-5555\") === false, 'message: <code>telephoneCheck(\"1 555)555-5555\")</code> should return false.');",
+        "assert(telephoneCheck(\"1 555 555 5555\") === true, 'message: <code>telephoneCheck(\"1 555 555 5555\")</code> should return true.');",
+        "assert(telephoneCheck(\"1 456 789 4444\") === true, 'message: <code>telephoneCheck(\"1 456 789 4444\")</code> should return true.');",
+        "assert(telephoneCheck(\"123**&!!asdf#\") === false, 'message: <code>telephoneCheck(\"123**&!!asdf#\")</code> should return false.');",
+        "assert(telephoneCheck(\"55555555\") === false, 'message: <code>telephoneCheck(\"55555555\")</code> should return false.');",
+        "assert(telephoneCheck(\"(6054756961)\") === false, 'message: <code>telephoneCheck(\"(6054756961)\")</code> should return false');",
+        "assert(telephoneCheck(\"2 (757) 622-7382\") === false, 'message: <code>telephoneCheck(\"2 (757) 622-7382\")</code> should return false.');",
+        "assert(telephoneCheck(\"0 (757) 622-7382\") === false, 'message: <code>telephoneCheck(\"0 (757) 622-7382\")</code> should return false.');",
+        "assert(telephoneCheck(\"-1 (757) 622-7382\") === false, 'message: <code>telephoneCheck(\"-1 (757) 622-7382\")</code> should return false');",
+        "assert(telephoneCheck(\"2 757 622-7382\") === false, 'message: <code>telephoneCheck(\"2 757 622-7382\")</code> should return false.');",
+        "assert(telephoneCheck(\"10 (757) 622-7382\") === false, 'message: <code>telephoneCheck(\"10 (757) 622-7382\")</code> should return false.');",
+        "assert(telephoneCheck(\"27576227382\") === false, 'message: <code>telephoneCheck(\"27576227382\")</code> should return false.');",
+        "assert(telephoneCheck(\"(275)76227382\") === false, 'message: <code>telephoneCheck(\"(275)76227382\")</code> should return false.');",
+        "assert(telephoneCheck(\"2(757)6227382\") === false, 'message: <code>telephoneCheck(\"2(757)6227382\")</code> should return false.');",
+        "assert(telephoneCheck(\"2(757)622-7382\") === false, 'message: <code>telephoneCheck(\"2(757)622-7382\")</code> should return false.');",
+        "assert(telephoneCheck(\"555)-555-5555\") === false, 'message: <code>telephoneCheck(\"555)-555-5555\")</code> should return false.');",
+        "assert(telephoneCheck(\"(555-555-5555\") === false, 'message: <code>telephoneCheck(\"(555-555-5555\")</code> should return false.');",
+        "assert(telephoneCheck(\"(555)5(55?)-5555\") === false, 'message: <code>telephoneCheck(\"(555)5(55?)-5555\")</code> should return false.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "RegExp"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Valida Números Telefónicos de los EEUU",
+          "description": [
+            "Haz que la función devuelva true (verdadero) si el texto introducido parece un número válido en los EEUU.",
+            "El usuario debe llenar el campo del formulario de la forma que desee siempre y cuando tenga el formato de un número válido en los EEUU. Los números mostrados a continuación tienen formatos válidos en los EEUU:",
+            "<blockquote>555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555</blockquote>",
+            "Para esta prueba se te presentará una cadena de texto como por ejemplo: <code>800-692-7753</code> o <code>8oo-six427676;laskdjf</code>. 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 <code>1</code>. 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Verifica i numeri telefonici degli Stati Uniti",
+          "description": [
+            "Ritorna <code>true</code> se la stringa passata come argomento è un numero valido negli Stati Uniti.",
+            "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):",
+            "<blockquote>555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555</blockquote>",
+            "In questo problema ti saranno presentate delle stringe come <code>800-692-7753</code> o <code>8oo-six427676;laskdjf</code>. 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 <code>1</code>. Ritorna <code>true</code> se la stringa è un numero di telefono valido negli Stati Uniti; altrimenti ritorna <code>false</code>.",
+            "Ricorda di usare <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Valida números telefônicos dos EUA",
+          "description": [
+            "Retorna <code>true</code> se a string passada é um número telefônico válido nos EUA.",
+            "O usuário pode preencher o campo de qualquer maneira com tanto que seja um número válido nos EUA. Os seguintes exemplos são formatos válidos para números de telefone nos EUA (baseie-se nos testes abaixo para outras variações):",
+            "<blockquote>555-555-5555\n(555)555-5555\n(555) 555-5555\n555 555 5555\n5555555555\n1 555 555 5555</blockquote>",
+            "Para esse desafio será dado a você uma string como <code>800-692-7753</code> ou <code>8oo-six427676;laskdjf</code>. Seu trabalho é validar ou rejeitar o número de telefone dos EUA baseado nos exmplos de formatos fornecidos acima. O código de área é obrigatório. Se o código do país for fornecido, você deve confirmar que o código do país é <code>1</code>. Retorne <code>true</code> se a string é um número válido nos EUA; caso contrário retorne <code>false</code>.",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a3f503de51cf954ede28891d",
+      "title": "Symmetric Difference",
+      "description": [
+        "Create a function that takes two or more arrays and returns an array of the <dfn>symmetric difference</dfn> (<code>&xutri;</code> or <code>&oplus;</code>) of the provided arrays.",
+        "Given two sets (for example set <code>A = {1, 2, 3}</code> and set <code>B = {2, 3, 4}</code>), 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 (<code>A &xutri; B = C = {1, 4}</code>). For every additional symmetric difference you take (say on a set <code>D = {2, 3}</code>), you should get the set with elements which are in either of the two the sets but not both (<code>C &xutri; D = {1, 4} &xutri; {2, 3} = {1, 2, 3, 4}</code>). The resulting array must contain only unique values (<em>no duplicates</em>).",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function sym(args) {",
+        "  return args;",
+        "}",
+        "",
+        "sym([1, 2, 3], [5, 2, 1, 4]);"
+      ],
+      "solutions": [
+        "function sym() {\n  var arrays = [].slice.call(arguments);\n  return arrays.reduce(function (symDiff, arr) {\n    return symDiff.concat(arr).filter(function (val, idx, theArr) {\n      return theArr.indexOf(val) === idx \n        && (symDiff.indexOf(val) === -1 || arr.indexOf(val) === -1);\n    });\n  });\n}\nsym([1, 2, 3], [5, 2, 1, 4]);\n"
+      ],
+      "tests": [
+        "assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4]), [3, 4, 5], 'message: <code>sym([1, 2, 3], [5, 2, 1, 4])</code> should return <code>[3, 4, 5]</code>.');",
+        "assert.equal(sym([1, 2, 3], [5, 2, 1, 4]).length, 3, 'message: <code>sym([1, 2, 3], [5, 2, 1, 4])</code> should contain only three elements.');",
+        "assert.sameMembers(sym([1, 2, 3, 3], [5, 2, 1, 4]), [3, 4, 5], 'message: <code>sym([1, 2, 3, 3], [5, 2, 1, 4])</code> should return <code>[3, 4, 5]</code>.');",
+        "assert.equal(sym([1, 2, 3, 3], [5, 2, 1, 4]).length, 3, 'message: <code>sym([1, 2, 3, 3], [5, 2, 1, 4])</code> should contain only three elements.');",
+        "assert.sameMembers(sym([1, 2, 3], [5, 2, 1, 4, 5]), [3, 4, 5], 'message: <code>sym([1, 2, 3], [5, 2, 1, 4, 5])</code> should return <code>[3, 4, 5]</code>.');",
+        "assert.equal(sym([1, 2, 3], [5, 2, 1, 4, 5]).length, 3, 'message: <code>sym([1, 2, 3], [5, 2, 1, 4, 5])</code> should contain only three elements.');",
+        "assert.sameMembers(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]), [1, 4, 5], 'message: <code>sym([1, 2, 5], [2, 3, 5], [3, 4, 5])</code> should return <code>[1, 4, 5]</code>');",
+        "assert.equal(sym([1, 2, 5], [2, 3, 5], [3, 4, 5]).length, 3, 'message: <code>sym([1, 2, 5], [2, 3, 5], [3, 4, 5])</code> should contain only three elements.');",
+        "assert.sameMembers(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]), [1, 4, 5], 'message: <code>sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])</code> should return <code>[1, 4, 5]</code>.');",
+        "assert.equal(sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5]).length, 3, 'message: <code>sym([1, 1, 2, 5], [2, 2, 3, 5], [3, 4, 5, 5])</code> should contain only three elements.');",
+        "assert.sameMembers(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]), [2, 3, 4, 6, 7], 'message: <code>sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])</code> should return <code>[2, 3, 4, 6, 7]</code>.');",
+        "assert.equal(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3]).length, 5, 'message: <code>sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3])</code> should contain only five elements.');",
+        "assert.sameMembers(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1]), [1, 2, 4, 5, 6, 7, 8, 9], 'message: <code>sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])</code> should return <code>[1, 2, 4, 5, 6, 7, 8, 9]</code>.');",
+        "assert.equal(sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1]).length, 8, 'message: <code>sym([3, 3, 3, 2, 5], [2, 1, 5, 7], [3, 4, 6, 6], [1, 2, 3], [5, 3, 9, 8], [1])</code> should contain only eight elements.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.prototype.reduce()",
+        "Symmetric Difference"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Diferencia Simétrica",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Differenza Simmetrica",
+          "description": [
+            "Crea una funzione che accetti due o più array e che ritorni un array contenente la <dfn>differenza simmetrica</dfn> (<code>&xutri;</code> o <code>&oplus;</code>) degli stessi.",
+            "Dati due insiemi (per esempio l'insieme <code>A = {1, 2, 3}<code> e l'insieme <code>B = {2, 3, 4}</code>, il termine matematico \"differenza simmetrica\" di due insiemi è l'insieme degli elementi che sono in almeno uno dei due insiemi, ma non in entrambi (<code>A &xutri; B = C = {1, 4}</code>). Per ogni differenza simmetrica aggiuntiva che fai (per esempio su un insieme <code>D = {2, 3}</code>), devi prendere l'insieme degli elementi che sono in almeno uno dei due insiemi ma non in entrambi (<code>C &xutri; D = {1, 4} &xutri; {2, 3} = {1, 2, 3, 4}</code>).",
+            "Ricorda di usare <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Diferença Simétrica",
+          "description": [
+            "Crie uma função que recebe duas ou mais matrizes e retorna a matriz <dfn>diferença simétrica</dfn> (<code>&xutri;</code> ou <code>&oplus;</code>) das matrizes fornecidas.",
+            "Dado dois conjuntos (por exemplo conjunto <code>A = {1, 2, 3}</code> e conjunto <code>B = {2, 3, 4}</code>), o termo matemático \"diferença simétrica\" dos dois cojuntos é o conjunto dos elementos que estão em um dos conjuntos, mas não nos dois (<code>A &xutri; B = C = {1, 4}</code>). Para cada diferença simétrica adicional que você faz (digamos em um terceiro conjunto <code>D = {2, 3}</code>), voce deve retornar o conjunto no qual os elementos estão em um dos conjuntos mas não nos dois (<code>C &xutri; D = {1, 4} &xutri; {2, 3} = {1, 2, 3, 4}</code>). O conjunto final deve ter somentes valores únicos (<em>sem números repetidos</em>).",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "aa2e6f85cab2ab736c9a9b24",
+      "title": "Exact Change",
+      "description": [
+        "Design a cash register drawer function <code>checkCashRegister()</code> that accepts purchase price as the first argument (<code>price</code>), payment as the second argument (<code>cash</code>), and cash-in-drawer (<code>cid</code>) as the third argument.",
+        "<code>cid</code> is a 2D array listing available currency.",
+        "Return the string <code>\"Insufficient Funds\"</code> if cash-in-drawer is less than the change due or if you cannot return the exact change. Return the string <code>\"Closed\"</code> 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.",
+        "<table class='table table-striped'><tr><th>Currency Unit</th><th>Amount</th></tr><tr><td>Penny</td><td>$0.01 (PENNY)</td></tr><tr><td>Nickel</td><td>$0.05 (NICKEL)</td></tr><tr><td>Dime</td><td>$0.1 (DIME)</td></tr><tr><td>Quarter</td><td>$0.25 (QUARTER)</td></tr><tr><td>Dollar</td><td>$1 (DOLLAR)</td></tr><tr><td>Five Dollars</td><td>$5 (FIVE)</td></tr><tr><td>Ten Dollars</td><td>$10 (TEN)</td></tr><tr><td>Twenty Dollars</td><td>$20 (TWENTY)</td></tr><tr><td>One-hundred Dollars</td><td>$100 (ONE HUNDRED)</td></tr></table>"
+      ],
+      "challengeSeed": [
+        "function checkCashRegister(price, cash, cid) {",
+        "  var change;",
+        "  // Here is your change, ma'am.",
+        "  return change;",
+        "}",
+        "",
+        "// Example cash-in-drawer array:",
+        "// [[\"PENNY\", 1.01],",
+        "// [\"NICKEL\", 2.05],",
+        "// [\"DIME\", 3.1],",
+        "// [\"QUARTER\", 4.25],",
+        "// [\"ONE\", 90],",
+        "// [\"FIVE\", 55],",
+        "// [\"TEN\", 20],",
+        "// [\"TWENTY\", 60],",
+        "// [\"ONE HUNDRED\", 100]]",
+        "",
+        "checkCashRegister(19.5, 20, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]]);"
+      ],
+      "solutions": [
+        "var denom = [\n\t{ name: 'ONE HUNDRED', val: 100},\n\t{ name: 'TWENTY', val: 20},\n\t{ name: 'TEN', val: 10},\n\t{ name: 'FIVE', val: 5},\n\t{ name: 'ONE', val: 1},\n\t{ name: 'QUARTER', val: 0.25},\n\t{ name: 'DIME', val: 0.1},\n\t{ name: 'NICKEL', val: 0.05},\n\t{ name: 'PENNY', val: 0.01}\n];\n\nfunction checkCashRegister(price, cash, cid) {\n    var change = cash - price;\n    var register = cid.reduce(function(acc, curr) {\n        acc.total += curr[1];\n        acc[curr[0]] = curr[1];\n        return acc;\n    }, {total: 0});\n    if(register.total === change) {\n        return 'Closed';\n    }\n    if(register.total < change) {\n        return 'Insufficient Funds';\n    }\n    var change_arr = denom.reduce(function(acc, curr) {\n        var value = 0;\n        while(register[curr.name] > 0 && change >= curr.val) {\n           change -= curr.val;\n           register[curr.name] -= curr.val;\n           value += curr.val;\n           change = Math.round(change * 100) / 100;\n        }\n        if(value > 0) {\n            acc.push([ curr.name, value ]);\n        }\n        return acc;\n    }, []);\n  if(change_arr.length < 1 || change > 0) {\n    return \"Insufficient Funds\";\n  }\n  return change_arr;\n}"
+      ],
+      "tests": [
+        "assert.isArray(checkCashRegister(19.5, 20, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]]), 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]])</code> should return an array.');",
+        "assert.isString(checkCashRegister(19.5, 20, [[\"PENNY\", 0.01], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]]), 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 0.01], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]])</code> should return a string.');",
+        "assert.isString(checkCashRegister(19.5, 20, [[\"PENNY\", 0.5], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]]), 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 0.5], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]])</code> should return a string.');",
+        "assert.deepEqual(checkCashRegister(19.5, 20, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]]), [[\"QUARTER\", 0.5]], 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]])</code> should return <code>[[\"QUARTER\", 0.5]]</code>.');",
+        "assert.deepEqual(checkCashRegister(3.26, 100, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]]), [[\"TWENTY\", 60], [\"TEN\", 20], [\"FIVE\", 15], [\"ONE\", 1], [\"QUARTER\", 0.5], [\"DIME\", 0.2], [\"PENNY\", 0.04]], 'message: <code>checkCashRegister(3.26, 100, [[\"PENNY\", 1.01], [\"NICKEL\", 2.05], [\"DIME\", 3.1], [\"QUARTER\", 4.25], [\"ONE\", 90], [\"FIVE\", 55], [\"TEN\", 20], [\"TWENTY\", 60], [\"ONE HUNDRED\", 100]])</code> should return <code>[[\"TWENTY\", 60], [\"TEN\", 20], [\"FIVE\", 15], [\"ONE\", 1], [\"QUARTER\", 0.5], [\"DIME\", 0.2], [\"PENNY\", 0.04]]</code>.');",
+        "assert.deepEqual(checkCashRegister(19.5, 20, [[\"PENNY\", 0.01], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]]), \"Insufficient Funds\", 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 0.01], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]])</code> should return \"Insufficient Funds\".');",
+        "assert.deepEqual(checkCashRegister(19.5, 20, [[\"PENNY\", 0.01], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 1], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]]), \"Insufficient Funds\", 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 0.01], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 1], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]])</code> should return \"Insufficient Funds\".');",
+        "assert.deepEqual(checkCashRegister(19.5, 20, [[\"PENNY\", 0.5], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]]), \"Closed\", 'message: <code>checkCashRegister(19.5, 20, [[\"PENNY\", 0.5], [\"NICKEL\", 0], [\"DIME\", 0], [\"QUARTER\", 0], [\"ONE\", 0], [\"FIVE\", 0], [\"TEN\", 0], [\"TWENTY\", 0], [\"ONE HUNDRED\", 0]])</code> should return \"Closed\".');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Global Object",
+        "Floating Point Guide"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Cambio Exacto",
+          "description": [
+            "Crea una función que simule una caja registradora que acepte el precio de compra como el primer argumento, la cantidad recibida como el segundo argumento, y la cantidad de dinero disponible en la registradora (cid) como tercer argumento",
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Cambio Esatto",
+          "description": [
+            "Scrivi una funzione che simuli un registro di cassa chiamata <code>checkCashRegister()</code> che accetti il prezzo degli articoli come primo argomento (<code>price</code>), la somma pagata (<code>cash</code>), e la somma disponibile nel registratore di cassa (<code>cid</code>) come terzo argomento.",
+            "<code>cid</code> è un array a due dimensioni che contiene la quantità di monete e banconote disponibili.",
+            "Ritorna la stringa <code>\"Insufficient Funds\"</code> se la quantità di denaro disponibile nel registratore di cassa non è abbastanza per restituire il resto. Ritorna la stringa <code>\"Closed\"</code> 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Troco Exato",
+          "description": [
+            "Crie uma função que simula uma caixa registradora chamada <code>checkCashRegister()</code> e aceita o valor da compra como primeiro argumento (<code>price</code>), pagamento como segundo argumento (<code>cash</code>), e o dinheiro na caixa registradora (<code>cid</code>) como terceiro argumento.",
+            "<code>cid</code> é uma matriz bidimensional que lista o dinheiro disponível.",
+            "Retorne a string <code>\"Insufficient Funds\"</code> se o dinheiro na caixa registradora é menor do que o troco ou se não é possível retornar o troco exato. Retorne a string <code>\"Closed\"</code> se o dinheiro na caixa é igual ao troco.",
+            "Case cotrário, retorne o troco em moedas e notas, ordenado do maior para menor.",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código.",
+            "<table class='table table-striped'><tr><th>Currency Unit</th><th>Amount</th></tr><tr><td>Penny</td><td>$0.01 (PENNY)</td></tr><tr><td>Nickel</td><td>$0.05 (NICKEL)</td></tr><tr><td>Dime</td><td>$0.1 (DIME)</td></tr><tr><td>Quarter</td><td>$0.25 (QUARTER)</td></tr><tr><td>Dollar</td><td>$1 (DOLLAR)</td></tr><tr><td>Five Dollars</td><td>$5 (FIVE)</td></tr><tr><td>Ten Dollars</td><td>$10 (TEN)</td></tr><tr><td>Twenty Dollars</td><td>$20 (TWENTY)</td></tr><tr><td>One-hundred Dollars</td><td>$100 (ONE HUNDRED)</td></tr></table>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "a56138aff60341a09ed6c480",
+      "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 <code>arr1</code>). 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function updateInventory(arr1, arr2) {",
+        "    // All inventory must be accounted for or you're fired!",
+        "    return arr1;",
+        "}",
+        "",
+        "// Example inventory lists",
+        "var curInv = [",
+        "    [21, \"Bowling Ball\"],",
+        "    [2, \"Dirty Sock\"],",
+        "    [1, \"Hair Pin\"],",
+        "    [5, \"Microphone\"]",
+        "];",
+        "",
+        "var newInv = [",
+        "    [2, \"Hair Pin\"],",
+        "    [3, \"Half-Eaten Apple\"],",
+        "    [67, \"Bowling Ball\"],",
+        "    [7, \"Toothpaste\"]",
+        "];",
+        "",
+        "updateInventory(curInv, newInv);"
+      ],
+      "solutions": [
+        "function updateInventory(arr1, arr2) {\n  arr2.forEach(function(item) {\n    createOrUpdate(arr1, item);\n  });\n  // All inventory must be accounted for or you're fired!\n  return arr1;\n}\n\nfunction createOrUpdate(arr1, item) {\n  var index = -1;\n  while (++index < arr1.length) {\n    if (arr1[index][1] === item[1]) {\n      arr1[index][0] += item[0];\n      return;\n    }\n    if (arr1[index][1] > item[1]) {\n      break;\n    }\n  }\n  arr1.splice(index, 0, item);\n}\n\n// Example inventory lists\nvar curInv = [\n    [21, 'Bowling Ball'],\n    [2, 'Dirty Sock'],\n    [1, 'Hair Pin'],\n    [5, 'Microphone']\n];\n\nvar newInv = [\n    [2, 'Hair Pin'],\n    [3, 'Half-Eaten Apple'],\n    [67, 'Bowling Ball'],\n    [7, 'Toothpaste']\n];\n\nupdateInventory(curInv, newInv);\n"
+      ],
+      "tests": [
+        "assert.isArray(updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]]), 'message: The function <code>updateInventory</code> should return an array.');",
+        "assert.equal(updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]]).length, 6, 'message: <code>updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]])</code> should return an array with a length of 6.');",
+        "assert.deepEqual(updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]]), [[88, \"Bowling Ball\"], [2, \"Dirty Sock\"], [3, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [5, \"Microphone\"], [7, \"Toothpaste\"]], 'message: <code>updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]])</code> should return <code>[[88, \"Bowling Ball\"], [2, \"Dirty Sock\"], [3, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [5, \"Microphone\"], [7, \"Toothpaste\"]]</code>.');",
+        "assert.deepEqual(updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], []), [[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], 'message: <code>updateInventory([[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]], [])</code> should return <code>[[21, \"Bowling Ball\"], [2, \"Dirty Sock\"], [1, \"Hair Pin\"], [5, \"Microphone\"]]</code>.');",
+        "assert.deepEqual(updateInventory([], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]]), [[67, \"Bowling Ball\"], [2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [7, \"Toothpaste\"]], 'message: <code>updateInventory([], [[2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [67, \"Bowling Ball\"], [7, \"Toothpaste\"]])</code> should return <code>[[67, \"Bowling Ball\"], [2, \"Hair Pin\"], [3, \"Half-Eaten Apple\"], [7, \"Toothpaste\"]]</code>.');",
+        "assert.deepEqual(updateInventory([[0, \"Bowling Ball\"], [0, \"Dirty Sock\"], [0, \"Hair Pin\"], [0, \"Microphone\"]], [[1, \"Hair Pin\"], [1, \"Half-Eaten Apple\"], [1, \"Bowling Ball\"], [1, \"Toothpaste\"]]), [[1, \"Bowling Ball\"], [0, \"Dirty Sock\"], [1, \"Hair Pin\"], [1, \"Half-Eaten Apple\"], [0, \"Microphone\"], [1, \"Toothpaste\"]], 'message: <code>updateInventory([[0, \"Bowling Ball\"], [0, \"Dirty Sock\"], [0, \"Hair Pin\"], [0, \"Microphone\"]], [[1, \"Hair Pin\"], [1, \"Half-Eaten Apple\"], [1, \"Bowling Ball\"], [1, \"Toothpaste\"]])</code> should return <code>[[1, \"Bowling Ball\"], [0, \"Dirty Sock\"], [1, \"Hair Pin\"], [1, \"Half-Eaten Apple\"], [0, \"Microphone\"], [1, \"Toothpaste\"]]</code>.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Global Array Object"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Actualizando el Inventario",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Aggiornamento dell'Inventario",
+          "description": [
+            "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 <code>arr1</code>). 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Atualizando Inventário",
+          "description": [
+            "Compare e atualize o inventário armazenado em um matriz 2D contra uma segunda matriz 2D de uma entrega recente. Atualize a quantidade de itens no inventário atual (em <code>arr1</code>). Se um item não pode ser encontrado, adicione um novo item e a sua quantidade na matriz do inventário. O inventário retornado deve estar em ordem alfabética por item.",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a7bf700cd123b9a54eef01d5",
+      "title": "No Repeats Please",
+      "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, <code>aab</code> should return 2 because it has 6 total permutations (<code>aab</code>, <code>aab</code>, <code>aba</code>, <code>aba</code>, <code>baa</code>, <code>baa</code>), but only 2 of them (<code>aba</code> and <code>aba</code>) don't have the same letter (in this case <code>a</code>) repeating.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function permAlone(str) {",
+        "  return str;",
+        "}",
+        "",
+        "permAlone('aab');"
+      ],
+      "solutions": [
+        "function permAlone(str) {\n  return permutor(str).filter(function(perm) {\n    return !perm.match(/(.)\\1/g);\n  }).length;\n}\n\nfunction permutor(str) {\n  // http://staff.roguecc.edu/JMiller/JavaScript/permute.html\n  //permArr: Global array which holds the list of permutations\n  //usedChars: Global utility array which holds a list of \"currently-in-use\" characters\n  var permArr = [], usedChars = [];\n  function permute(input) {\n    //convert input into a char array (one element for each character)\n    var i, ch, chars = input.split(\"\");\n    for (i = 0; i < chars.length; i++) {\n      //get and remove character at index \"i\" from char array\n      ch = chars.splice(i, 1);\n      //add removed character to the end of used characters\n      usedChars.push(ch);\n      //when there are no more characters left in char array to add, add used chars to list of permutations\n      if (chars.length === 0) permArr[permArr.length] = usedChars.join(\"\");\n      //send characters (minus the removed one from above) from char array to be permuted\n      permute(chars.join(\"\"));\n      //add removed character back into char array in original position\n      chars.splice(i, 0, ch);\n      //remove the last character used off the end of used characters array\n      usedChars.pop();\n    }\n  }\n  permute(str);\n  return permArr;\n}\n\npermAlone('aab');\n"
+      ],
+      "tests": [
+        "assert.isNumber(permAlone('aab'), 'message: <code>permAlone(\"aab\")</code> should return a number.');",
+        "assert.strictEqual(permAlone('aab'), 2, 'message: <code>permAlone(\"aab\")</code> should return 2.');",
+        "assert.strictEqual(permAlone('aaa'), 0, 'message: <code>permAlone(\"aaa\")</code> should return 0.');",
+        "assert.strictEqual(permAlone('aabb'), 8, 'message: <code>permAlone(\"aabb\")</code> should return 8.');",
+        "assert.strictEqual(permAlone('abcdefa'), 3600, 'message: <code>permAlone(\"abcdefa\")</code> should return 3600.');",
+        "assert.strictEqual(permAlone('abfdefa'), 2640, 'message: <code>permAlone(\"abfdefa\")</code> should return 2640.');",
+        "assert.strictEqual(permAlone('zzzzzzzz'), 0, 'message: <code>permAlone(\"zzzzzzzz\")</code> should return 0.');",
+        "assert.strictEqual(permAlone('a'), 1, 'message: <code>permAlone(\"a\")</code> should return 1.');",
+        "assert.strictEqual(permAlone('aaab'), 0, 'message: <code>permAlone(\"aaab\")</code> should return 0.');",
+        "assert.strictEqual(permAlone('aaabb'), 12, 'message: <code>permAlone(\"aaabb\")</code> should return 12.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Permutations",
+        "RegExp"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "Sin Repeticiones, por Favor",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "Niente Ripetizioni, per Favore",
+          "description": [
+            "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, <code>aab</code> deve ritornare 2, perchè la stringa ha 6 permutazioni possibili in totale (<code>aab</code>, <code>aab</code>, <code>aba</code>, <code>aba</code>, <code>baa</code>, <code>baa</code>), ma solo 2 di loro (<code>aba</code> e <code>aba</code>) non contengono la stessa lettera (in questo caso <code>a</code> ripetuta).",
+            "Ricorda di usare <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Sem repetição, por favor",
+          "description": [
+            "Retorne o número total de permutações da string fornecida que não tem letras consecutivas repetidas. Assuma que todos os caracteres na string fornecida são únicos.",
+            "Por exemplo, <code>aab</code> deve retornar 2 porque tem um total de 6 permutações (<code>aab</code>, <code>aab</code>, <code>aba</code>, <code>aba</code>, <code>baa</code>, <code>baa</code>), mas somente duas delas (<code>aba</code> and <code>aba</code>) não tem a mesma letra (nesse caso <code>a</code>) se repetindo.",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "a3f503de51cfab748ff001aa",
+      "title": "Pairwise",
+      "description": [
+        "Given an array <code>arr</code>, find element pairs whose sum equal the second argument <code>arg</code> and return the sum of their indices.",
+        "You may use multiple pairs that have the same numeric elements but different indices. Each pair should use the lowest possible available indices. Once an element has been used it cannot be reused to pair with another element.",
+        "For example <code>pairwise([7, 9, 11, 13, 15], 20)</code> returns <code>6</code>. The pairs that sum to 20 are <code>[7, 13]</code> and <code>[9, 11]</code>. We can then write out the array with their indices and values.",
+        "<table class=\"table\"><tr><th><strong>Index</strong></th><th>0</th><th>1</th><th>2</th><th>3</th><th>4</th></tr><tr><td>Value</td><td>7</td><td>9</td><td>11</td><td>13</td><td>15</td></tr></table>",
+        "Below we'll take their corresponding indices and add them.",
+        "7 + 13 = 20 &#8594; Indices 0 + 3 = 3<br>9 + 11 = 20 &#8594; Indices 1 + 2 = 3<br>3 + 3 = 6 &#8594 Return <code>6</code>",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code."
+      ],
+      "challengeSeed": [
+        "function pairwise(arr, arg) {",
+        "  return arg;",
+        "}",
+        "",
+        "pairwise([1,4,2,3,0,5], 7);"
+      ],
+      "solutions": [
+        "function pairwise(arr, arg) {\n  var sum = 0;\n  arr.forEach(function(e, i, a) {\n    if (e != null) {      \n      var diff = arg-e;\n      a[i] = null;\n      var dix = a.indexOf(diff);\n      if (dix !== -1) {\n        sum += dix;\n        sum += i;\n        a[dix] = null;\n      }  \n    }\n  });\n  return sum;\n}\n\npairwise([1,4,2,3,0,5], 7);\n"
+      ],
+      "tests": [
+        "assert.deepEqual(pairwise([1, 4, 2, 3, 0, 5], 7), 11, 'message: <code>pairwise([1, 4, 2, 3, 0, 5], 7)</code> should return 11.');",
+        "assert.deepEqual(pairwise([1, 3, 2, 4], 4), 1, 'message: <code>pairwise([1, 3, 2, 4], 4)</code> should return 1.');",
+        "assert.deepEqual(pairwise([1, 1, 1], 2), 1, 'message: <code>pairwise([1, 1, 1], 2)</code> should return 1.');",
+        "assert.deepEqual(pairwise([0, 0, 0, 0, 1, 1], 1), 10, 'message: <code>pairwise([0, 0, 0, 0, 1, 1], 1)</code> should return 10.');",
+        "assert.deepEqual(pairwise([], 100), 0, 'message: <code>pairwise([], 100)</code> should return 0.');"
+      ],
+      "type": "bonfire",
+      "MDNlinks": [
+        "Array.prototype.reduce()"
+      ],
+      "challengeType": 5,
+      "translations": {
+        "es": {
+          "title": "En Parejas",
+          "description": [
+            "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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> si te sientes atascado. Intenta programar en pareja. Escribe tu propio código."
+          ]
+        },
+        "it": {
+          "title": "A Coppie",
+          "description": [
+            "Dato un array <code>arr</code>, trova le coppie di elementi la cui somma è uguale al secondo argomento passato <code>arg</code>. Ritorna quindi la somma dei loro indici.",
+            "Se ci sono più coppie possibili che hanno lo stesso valore numerico ma indici differenti, ritorna la somma degli indici minore. Una volta usato un elemento, lo stesso non può essere riutilizzato per essere accoppiato con un altro.",
+            "Per esempio <code>pairwise([7, 9, 11, 13, 15], 20)</code> ritorna <code>6</code>. Le coppia la cui somma è 20 sono <code>[7, 13]</code> e <code>[9, 11]</code>. Possiamo quindi osservare l'array con i loro indici e valori.",
+            "<table class=\"table\"><tr><th><strong>Indice</strong></th><th>0</th><th>1</th><th>2</th><th>3</th><th>4</th></tr><tr><td>Valore</td><td>7</td><td>9</td><td>11</td><td>13</td><td>15</td></tr></table>",
+            "Qui sotto prendiamo gli indici corrispondenti e li sommiamo.",
+            "7 + 13 = 20 &#8594; Indici 0 + 3 = 3<br>9 + 11 = 20 &#8594; Indici 1 + 2 = 3<br>3 + 3 = 6 &#8594 Ritorna <code>6</code>",
+            "Ricorda di usare <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leggi-Cerca-Chiedi</a> se rimani bloccato. Prova a programmare in coppia. Scrivi il codice da te."
+          ]
+        },
+        "pt-br": {
+          "title": "Emparelhados",
+          "description": [
+            "Dado uma matriz <code>arr</code>, encontre pares de elementos no qual a soma é igual ao segundo argumento <code>arg</code> e retorne a soma dos seus indices.",
+            "Se multiplos pares tem o mesmo elemento numérico mas indices diferentes, retorne a soma dos menores indices. Uma vez que um elemento é usado, este não pode ser emparelhado novamente com outro elemento.",
+            "Por exemplo <code>pairwise([7, 9, 11, 13, 15], 20)</code> retorna <code>6</code>. Os pares que somam 20 são <code>[7, 13]</code> e <code>[9, 11]</code>. Nós podemos então criar a matriz com seus indices e valores.",
+            "<table class=\"table\"><tr><th><strong>Index</strong></th><th>0</th><th>1</th><th>2</th><th>3</th><th>4</th></tr><tr><td>Value</td><td>7</td><td>9</td><td>11</td><td>13</td><td>15</td></tr></table>",
+            "Abaixo nós pegamos os índices correspondentes e somá-los.",
+            "7 + 13 = 20 &#8594; Indices 0 + 3 = 3<br>9 + 11 = 20 &#8594; Indices 1 + 2 = 3<br>3 + 3 = 6 &#8594 Retorna <code>6</code>",
+            "Lembre-se de usar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Ler-Procurar-Perguntar</a> se você ficar preso. Tente programar em par. Escreva seu próprio código."
+          ]
+        }
+      }
+    },
+    {
+      "id": "8d5123c8c441eddfaeb5bdef",
+      "title": "Implement Bubble Sort",
+      "description": [
+        "This is the first of several challenges on sorting algorithms. Given an array of unsorted items, we want to be able to return a sorted array. We will see several different methods to do this and learn some tradeoffs between these different approaches. While most modern languages have built-in sorting methods for operations like this, it is still important to understand some of the common basic approaches and learn how they can be implemented.",
+        "Here we will see bubble sort. The bubble sort method starts at the beginning of an unsorted array and 'bubbles up' unsorted values towards the end, iterating through the array until it is completely sorted. It does this by comparing adjacent items and swapping them if they are out of order. The method continues looping through the array until no swaps occur at which point the array is sorted.",
+        "This method requires multiple iterations through the array and for average and worst cases has quadratic time complexity. While simple, it is usually impractical in most situations.",
+        "<strong>Instructions:</strong> Write a function <code>bubbleSort</code> which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.",
+        "<strong>Note:</strong><br>We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging <code>array</code> to see your sorting alogrithm in action!"
+      ],
+      "challengeSeed": [
+        "function bubbleSort(array) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return array;",
+        "}",
+        "",
+        "// test array:",
+        "// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]"
+      ],
+      "tail": [
+        "function isSorted(arr) {",
+        "  var check = (i) => (i == arr.length - 1) ? true : (arr[i] > arr[i + 1]) ? false : check(i + 1);",
+        "  return check(0);",
+        "};"
+      ],
+      "tests": [
+        "assert(typeof bubbleSort == 'function', 'message: <code>bubbleSort</code> is a function.');",
+        "assert(isSorted(bubbleSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])), 'message: <code>bubbleSort</code> returns a sorted array (least to greatest).');",
+        "assert.sameMembers(bubbleSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92], 'message: <code>bubbleSort</code> returns an array that is unchanged except for order.');",
+        "assert.strictEqual(code.search(/\\.sort\\(/), -1, 'message: <code>bubbleSort</code> should not use the built-in <code>.sort()</code> method.');"
+      ],
+      "type": "waypoint",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {},
+      "releasedOn": "February 17, 2017"
+    },
+    {
+      "id": "587d8259367417b2b2512c85",
+      "title": "Implement Selection Sort",
+      "description": [
+        "Here we will implement selection sort. Selection sort works by selecting the minimum value in a list and swapping it with the first value in the list. It then starts at the second position, selects the smallest value in the remaining list, and swaps it with the second element. It continues iterating through the list and swapping elements until it reaches the end of the list. Now the list is sorted. Selection sort has quadratic time complexity in all cases.",
+        "<stong>Instructions</stong>: Write a function <code>selectionSort</code> which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.",
+        "<strong>Note:</strong><br>We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging <code>array</code> to see your sorting alogrithm in action!"
+      ],
+      "challengeSeed": [
+        "function selectionSort(array) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return array;",
+        "}",
+        "",
+        "// test array:",
+        "// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]"
+      ],
+      "tail": [
+        "function isSorted(arr) {",
+        "  var check = (i) => (i == arr.length - 1) ? true : (arr[i] > arr[i + 1]) ? false : check(i + 1);",
+        "  return check(0);",
+        "};"
+      ],
+      "tests": [
+        "assert(typeof selectionSort == 'function', 'message: <code>selectionSort</code> is a function.');",
+        "assert(isSorted(selectionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])), 'message: <code>selectionSort</code> returns a sorted array (least to greatest).');",
+        "assert.sameMembers(selectionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92], 'message: <code>selectionSort</code> returns an array that is unchanged except for order.');",
+        "assert.strictEqual(code.search(/\\.sort\\(/), -1, 'message: <code>selectionSort</code> should not use the built-in <code>.sort()</code> method.');"
+      ],
+      "type": "waypoint",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {},
+      "releasedOn": "February 17, 2017"
+    },
+    {
+      "id": "587d8259367417b2b2512c86",
+      "title": "Implement Insertion Sort",
+      "description": [
+        "The next sorting method we'll look at is insertion sort. This method works by building up a sorted array at the beginning of the list. It begins the sorted array with the first element. Then it inspects the next element and swaps it backwards into the sorted array until it is in sorted position. It continues iterating through the list and swapping new items backwards into the sorted portion until it reaches the end. This algorithm has quadratic time complexity in the average and worst cases.",
+        "<strong>Instructions:</strong> Write a function <code>insertionSort</code> which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest.",
+        "<strong>Note:</strong><br>We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging <code>array</code> to see your sorting alogrithm in action!"
+      ],
+      "challengeSeed": [
+        "function insertionSort(array) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return array;",
+        "}",
+        "",
+        "// test array:",
+        "// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]"
+      ],
+      "tail": [
+        "function isSorted(arr) {",
+        "  var check = (i) => (i == arr.length - 1) ? true : (arr[i] > arr[i + 1]) ? false : check(i + 1);",
+        "  return check(0);",
+        "};"
+      ],
+      "tests": [
+        "assert(typeof insertionSort == 'function', 'message: <code>insertionSort</code> is a function.');",
+        "assert(isSorted(insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])), 'message: <code>insertionSort</code> returns a sorted array (least to greatest).');",
+        "assert.sameMembers(insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92], 'message: <code>insertionSort</code> returns an array that is unchanged except for order.');",
+        "assert.strictEqual(code.search(/\\.sort\\(/), -1, 'message: <code>insertionSort</code> should not use the built-in <code>.sort()</code> method.');"
+      ],
+      "type": "waypoint",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {},
+      "releasedOn": "February 17, 2017"
+    },
+    {
+      "id": "587d825a367417b2b2512c89",
+      "title": "Implement Quick Sort",
+      "description": [
+        "Here we will move on to an intermediate sorting algorithm: quick sort. Quick sort is an efficient, recursive divide-and-conquer approach to sorting an array. In this method, a pivot value is chosen in the original array. The array is then partitioned into two subarrays of values less than and greater than the pivot value. We then combine the result of recursively calling the quick sort algorithm on both sub-arrays. This continues until the base case of an empty or single-item array is reached, which we return. The unwinding of the recursive calls return us the sorted array.",
+        "Quick sort is a very efficient sorting method, providing <i>O(nlog(n))</i> performance on average. It is also relatively easy to implement. These attributes make it a popular and useful sorting method.",
+        "<strong>Instructions:</strong> Write a function <code>quickSort</code> which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. While the choice of the pivot value is important, any pivot will do for our purposes here. For simplicity, the first or last element could be used.",
+        "<strong>Note:</strong><br>We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging <code>array</code> to see your sorting alogrithm in action!"
+      ],
+      "challengeSeed": [
+        "function quickSort(array) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return array;",
+        "}",
+        "",
+        "// test array:",
+        "// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]"
+      ],
+      "tests": [
+        "assert(typeof quickSort == 'function', 'message: <code>quickSort</code> is a function.');",
+        "assert(isSorted(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])), 'message: <code>quickSort</code> returns a sorted array (least to greatest).');",
+        "assert.sameMembers(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92], 'message: <code>quickSort</code> returns an array that is unchanged except for order.');",
+        "assert.strictEqual(code.search(/\\.sort\\(/), -1, 'message: <code>quickSort</code> should not use the built-in <code>.sort()</code> method.');"
+      ],
+      "tail": [
+        "function isSorted(arr) {",
+        "  var check = (i) => (i == arr.length - 1) ? true : (arr[i] > arr[i + 1]) ? false : check(i + 1);",
+        "  return check(0);",
+        "};"
+      ],
+      "type": "waypoint",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {},
+      "releasedOn": "February 17, 2017"
+    },
+    {
+      "id": "587d825c367417b2b2512c8f",
+      "title": "Implement Merge Sort",
+      "description": [
+        "Another intermediate sorting algorithm that is very common is merge sort. Like quick sort, merge sort also uses a divide-and-conquer, recursive methodology to sort an array. It takes advantage of the fact that it is relatively easy to sort two arrays as long as each is sorted in the first place. But we'll start with only one array as input, so how do we get to two sorted arrays from that? Well, we can recursively divide the original input in two until we reach the base case of an array with one item. A single-item array is naturally sorted, so then we can start combining. This combination will unwind the recursive calls that split the original array, eventually producing a final sorted array of all the elements. The steps of merge sort, then, are:",
+        "<strong>1)</strong> Recursively split the input array in half until a sub-array with only one element is produced.",
+        "<strong>2)</strong> Merge each sorted sub-array together to produce the final sorted array.",
+        "Merge sort is an efficient sorting method, with time complexity of <i>O(nlog(n))</i>. This algorithm is popular because it is performant and relatively easy to implement.",
+        "As an aside, this will be the last sorting algorithm we cover here. However, later in the section on tree data structures we will describe heap sort, another efficient sorting method that requires a binary heap in its implementation.",
+        "<strong>Instructions:</strong> Write a function <code>mergeSort</code> which takes an array of integers as input and returns an array of these integers in sorted order from least to greatest. A good way to implement this is to write one function, for instance <code>merge</code>, which is responsible for merging two sorted arrays, and another function, for instance <code>mergeSort</code>, which is responsible for the recursion that produces single-item arrays to feed into merge. Good luck!",
+        "<strong>Note:</strong><br>We are calling this function from behind the scenes; the test array we are using is commented out in the editor. Try logging <code>array</code> to see your sorting alogrithm in action!"
+      ],
+      "challengeSeed": [
+        "function mergeSort(array) {",
+        "  // change code below this line",
+        "",
+        "  // change code above this line",
+        "  return array;",
+        "}",
+        "",
+        "// test array:",
+        "// [1, 4, 2, 8, 345, 123, 43, 32, 5643, 63, 123, 43, 2, 55, 1, 234, 92]"
+      ],
+      "tests": [
+        "assert(typeof mergeSort == 'function', 'message: <code>mergeSort</code> is a function.');",
+        "assert(isSorted(mergeSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])), 'message: <code>mergeSort</code> returns a sorted array (least to greatest).');",
+        "assert.sameMembers(mergeSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92], 'message: <code>mergeSort</code> returns an array that is unchanged except for order.');",
+        "assert.strictEqual(code.search(/\\.sort\\(/), -1, 'message: <code>mergeSort</code> should not use the built-in <code>.sort()</code> method.');"
+      ],
+      "tail": [
+        "function isSorted(arr) {",
+        "  var check = (i) => (i == arr.length - 1) ? true : (arr[i] > arr[i + 1]) ? false : check(i + 1);",
+        "  return check(0);",
+        "};"
+      ],
+      "type": "waypoint",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {},
+      "releasedOn": "February 17, 2017"
+    }
+  ]
+}
diff --git a/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-data-structure-questions.json b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-data-structure-questions.json
new file mode 100644
index 0000000000..899ebfd88b
--- /dev/null
+++ b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/coding-interview-data-structure-questions.json
@@ -0,0 +1,2834 @@
+{
+  "name": "Coding Interview Data Structure Questions",
+  "order": 2,
+  "time": "",
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "id": "587d8253367417b2b2512c6a",
+      "title": "Typed Arrays",
+      "description": [
+        "Arrays are JavaScript objects that can hold a lot of different elements.",
+        "<code>var complexArr = [1, 5, \"2\", \"Word\", {\"name\": \"James\"}];</code>",
+        "Basically what happens in the background is that your browser will automatically give the right amount of memory space for that array. It will also change as needed if you add or remove data.",
+        "However, in the world of high performance and different element types, sometimes you need to be more specific on how much memory is given to an array.",
+        "<dfn>Typed arrays</dfn> are the answer to this problem. You are now able to say how much memory you want to give an array. Below is a basic overview of the different types of arrays available and the size in bytes for each element in that array.",
+        "<table class='table table-striped'><tr><th>Type</th><th>Each element size in bytes</th></tr><tr><td><code>Int8Array</code></td><td>1</td></tr><tr><td><code>Uint8Array</code></td><td>1</td></tr><tr><td><code>Uint8ClampedArray</code></td><td>1</td></tr><tr><td><code>Int16Array</code></td><td>2</td></tr><tr><td><code>Uint16Array</code></td><td>2</td></tr><tr><td><code>Int32Array</code></td><td>4</td></tr><tr><td><code>Uint32Array</code></td><td>4</td></tr><tr><td><code>Float32Array</code></td><td>4</td></tr><tr><td><code>Float64Array</code></td><td>8</td></tr></table>",
+        "There are two ways in creating these kind of arrays. One way is to create it directly. Below is how to create a 3 length <code>Int16Array</code>.",
+        "<blockquote>var i8 = new Int16Array(3);<br>console.log(i8);<br>// Returns [0, 0, 0]</blockquote>",
+        "You can also create a <dfn>buffer</dfn> to assign how much data (in bytes) you want the array to take up.",
+        "<strong>Note</strong><br>To create typed arrays using buffers, you need to assign the number of bytes to be a multiple of the bytes listed above.",
+        "<blockquote>// Create same Int16Array array differently<br>var byteSize = 6; // Needs to be multiple of 2<br>var buffer = new ArrayBuffer(byteSize);<br>var i8View = new Int16Array(buffer);<br>buffer.byteLength; // Returns 6<br>i8View.byteLength; // Returns 6<br>console.log(i8View); // Returns [0, 0, 0]</blockquote>",
+        "<dfn>Buffers</dfn> are general purpose objects that just carry data. You cannot access them normally. To access them, you need to first create a <dfn>view</dfn>.",
+        "<blockquote>i8View[0] = 42;<br>console.log(i8View); // Returns [42, 0, 0]</blockquote>",
+        "<strong>Note</strong><br>Typed arrays do not have some of the methods traditional arrays have such as <code>.pop()</code> or <code>.push()</code>. Typed arrays also fail <code>Array.isArray()</code> that checks if something is an array. Although simpler, this can be an advantage for less-sophisticated JavaScript engines to implement them.",
+        "<hr>",
+        "First create a <code>buffer</code> that is 64-bytes. Then create a <code>Int32Array</code> typed array with a view of it called <code>i32View</code>."
+      ],
+      "challengeSeed": [
+        "var buffer;",
+        "var i32View;"
+      ],
+      "tests": [
+        "assert(buffer.byteLength === 64, 'message: Your <code>buffer</code> should be 64 bytes large.');",
+        "assert(i32View.byteLength === 64, 'message: Your <code>i32View</code> view of your buffer should be 64 bytes large.');",
+        "assert(i32View.length === 16, 'message: Your <code>i32View</code> view of your buffer should be 16 elements long.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "var buffer = new ArrayBuffer(64);\nvar i32View = new Int32Array(buffer);"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8250367417b2b2512c5e",
+      "title": "Learn how a Stack Works",
+      "description": [
+        "You are probably familiar with stack of books on your table. You have likely used the undo feature of a text editor. You are also probably used to hitting the back button on your phone to go back to the previous view in your app.",
+        "You know what they all have in common? They all store the data in a way so that you can traverse backwards.",
+        "The topmost book in the stack was the one that was put there last. If you remove that book from your stack's top, you would expose the book that was put there before the last book and so on.",
+        "If you think about it, in all the above examples, you are getting <dfn>Last-In-First-Out</dfn> type of service. We will try to mimic this with our code.",
+        "This data storage scheme is called a <dfn>Stack</dfn>. In particular, we would have to implement the <code>push()</code> method that pushes JavaScript objects at the top of the stack; and <code>pop()</code> method, that removes the JavaScript object that's at the top of the stack at the current moment.",
+        "<hr>",
+        "Here we have a stack of homework assignments represented as an array: <code>\"BIO12\"</code> is at the base, and <code>\"PSY44\"</code> is at the top of the stack.",
+        "Modify the given array and treat it like a <code>stack</code> using the JavaScript methods mentioned above. Remove the top element <code>\"PSY44\"</code> from the stack. Then add <code>\"CS50\"</code> to be the new top element of the stack."
+      ],
+      "challengeSeed": [
+        "var homeworkStack = [\"BIO12\",\"HIS80\",\"MAT122\",\"PSY44\"];",
+        "// Only change code below this line",
+        ""
+      ],
+      "tests": [
+        "assert(homeworkStack.length === 4, 'message: <code>homeworkStack</code> should only contain 4 elements.');",
+        "assert(homeworkStack[3] === 'CS50', 'message: The last element in <code>homeworkStack</code> should be <code>\"CS50\"</code>.');",
+        "assert(homeworkStack.indexOf('PSY44') === -1, 'message: <code>homeworkStack</code> should not contain <code>\"PSY44\"</code>.');",
+        "assert(code.match(/=/g).length === 1 && /homeworkStack\\s*=\\s*\\[\"BIO12\"\\s*,\\s*\"HIS80\"\\s*,\\s*\"MAT122\"\\s*,\\s*\"PSY44\"\\]/.test(code), 'message: The initial declaration of the <code>homeworkStack</code> should not be changed.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8250367417b2b2512c5f",
+      "title": "Create a Stack Class",
+      "description": [
+        "In the last section, we talked about what a stack is and how we can use an array to represent a stack. In this section, we will be creating our own stack class.",
+        "Although you can use arrays to create stacks, sometimes it is best to limit the amount of control we have with our stacks.",
+        "Apart from the <code>push</code> and <code>pop</code> method, stacks have other useful methods. Let's add a <code>peek</code>, <code>isEmpty</code>, and <code>clear</code> method to our stack class.",
+        "Instructions",
+        "Write a <code>push</code> method that pushes an element to the top of the stack, a <code>pop</code> method that removes the element on the top of the stack, a <code>peek</code> method that looks at the first element in the stack, an <code>isEmpty</code> method that checks if the stack is empty, and a <code>clear</code> method that removes all elements from the stack.",
+        "Normally stacks don't have this, but we've added a <code>print</code> helper method that console logs the collection."
+      ],
+      "challengeSeed": [
+        "function Stack() { ",
+        "    collection = [];",
+        "    this.print = function() {",
+        "        console.log(collection);",
+        "    };",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new Stack(); return (typeof test.push === 'function')}()), 'message: Your <code>Stack</code> class should have a <code>push</code> method.');",
+        "assert((function(){var test = new Stack(); return (typeof test.pop === 'function')}()), 'message: Your <code>Stack</code> class should have a <code>pop</code> method.');",
+        "assert((function(){var test = new Stack(); return (typeof test.peek === 'function')}()), 'message: Your <code>Stack</code> class should have a <code>peek</code> method.');",
+        "assert((function(){var test = new Stack(); return (typeof test.isEmpty === 'function')}()), 'message: Your <code>Stack</code> class should have a <code>isEmpty</code> method.');",
+        "assert((function(){var test = new Stack(); return (typeof test.clear === 'function')}()), 'message: Your <code>Stack</code> class should have a <code>clear</code> method.');",
+        "assert((function(){var test = new Stack();  test.push('CS50'); return (test.peek() === 'CS50')}()), 'message: The <code>peek</code> method should return the top element of the stack');",
+        "assert((function(){var test = new Stack(); test.push('CS50'); return (test.pop() === 'CS50');}()), 'message: The <code>pop</code> method should remove and return the top element of the stack');",
+        "assert((function(){var test = new Stack(); return test.isEmpty()}()), 'message: The <code>isEmpty</code> method should return true if a stack does not contain any elements');",
+        "assert((function(){var test = new Stack();  test.push('CS50'); test.clear(); return (test.isEmpty())}()), 'message: The <code>clear</code> method should remove all element from the stack');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8250367417b2b2512c60",
+      "title": "Create a Queue Class",
+      "description": [
+        "Like stacks, queues are a collection of elements. But unlike stacks, queues follow the FIFO (First-In First-Out) principle. Elements added to a queue are pushed to the tail, or the end, of the queue, and only the element at the front of the queue is allowed to be removed.",
+        "We could use an array to represent a queue, but just like stacks, we want to limit the amount of control we have over our queues.",
+        "The two main methods of a queue class is the enqueue and the dequeue method. The enqueue method pushes an element to the tail of the queue, and the dequeue method removes and returns the element at the front of the queue. Other useful methods are the front, size, and isEmpty methods.",
+        "Instructions",
+        "Write an enqueue method that pushes an element to the tail of the queue, a dequeue method that removes and returns the front element, a front method that lets us see the front element, a size method that shows the length, and an isEmpty method to check if the queue is empty."
+      ],
+      "challengeSeed": [
+        "function Queue () { ",
+        "    collection = [];",
+        "    this.print = function() {",
+        "        console.log(collection);",
+        "    };",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new Queue();  return (typeof test.enqueue === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>enqueue</code> method.');",
+        "assert((function(){var test = new Queue();  return (typeof test.dequeue === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>dequeue</code> method.');",
+        "assert((function(){var test = new Queue();  return (typeof test.front === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>front</code> method.');",
+        "assert((function(){var test = new Queue();  return (typeof test.size === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>size</code> method.');",
+        "assert((function(){var test = new Queue();  return (typeof test.isEmpty === 'function')}()), 'message: Your <code>Queue</code> class should have an <code>isEmpty</code> method.');",
+        "assert((function(){var test = new Queue();  test.enqueue('Smith'); return (test.dequeue() === 'Smith')}()), 'message: The <code>dequeue</code> method should remove and return the front element of the queue');",
+        "assert((function(){var test = new Queue();  test.enqueue('Smith'); test.enqueue('John'); return (test.front() === 'Smith')}()), 'message: The <code>front</code> method should return value of the front element of the queue');",
+        "assert((function(){var test = new Queue();  test.enqueue('Smith'); return (test.size() === 1)}()), 'message: The <code>size</code> method should return the length of the queue');",
+        "assert((function(){var test = new Queue();  test.enqueue('Smith'); return !(test.isEmpty())}()), 'message: The <code>isEmpty</code> method should return <code>false</code> if there are elements in the queue');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8255367417b2b2512c74",
+      "title": "Create a Priority Queue Class",
+      "description": [
+        "In this challenge you will be creating a Priority Queue. A Priority Queue is a special type of Queue in which items may have additional information which specifies their priority. This could be simply represented with an integer. Item priority will override placement order in determining the sequence items are dequeued. If an item with a higher priority is enqueued after items with lower priority, the higher priority item will be dequeued before all the others.",
+        "For instance, let’s imagine we have a priority queue with three items:",
+        "<code>[[’kitten’, 2], [‘dog’, 2], [‘rabbit’, 2]]</code>",
+        "Here the second value (an integer) represents item priority. If we enqueue <code>[‘human’, 1]</code> with a priority of <code>1</code> (assuming lower priorities are given precedence) it would then be the first item to be dequeued. The collection would like this:",
+        "<code>[[‘human’, 1], [’kitten’, 2], [‘dog’, 2], [‘rabbit’, 2]]</code>.",
+        "We’ve started writing a <code>PriorityQueue</code> in the code editor. You will need to add an <code>enqueue</code> method for adding items with a priority, a <code>dequeue</code> method for removing items, a <code>size</code> method to return the number of items in the queue, a <code>front</code> method to return the element at the front of the queue, and finally an <code>isEmpty</code> method that will return <code>true</code> if the queue is empty or <code>false</code> if it is not.",
+        "The <code>enqueue</code> should accept items with the format shown above (<code>['human', 1]</code>) where <code>1</code> represents the priority. The <code>dequeue</code> should return only the current item, not its priority."
+      ],
+      "challengeSeed": [
+        "function PriorityQueue () {",
+        "    this.collection = [];",
+        "    this.printCollection = function() {",
+        "      console.log(this.collection);",
+        "    };",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new PriorityQueue();  return (typeof test.enqueue === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>enqueue</code> method.');",
+        "assert((function(){var test = new PriorityQueue();  return (typeof test.dequeue === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>dequeue</code> method.');",
+        "assert((function(){var test = new PriorityQueue();  return (typeof test.size === 'function')}()), 'message: Your <code>Queue</code> class should have a <code>size</code> method.');",
+        "assert((function(){var test = new PriorityQueue();  return (typeof test.isEmpty === 'function')}()), 'message: Your <code>Queue</code> class should have an <code>isEmpty</code> method.');",
+        "assert((function(){var test = new PriorityQueue(); test.enqueue(['David Brown', 2]); test.enqueue(['Jon Snow', 1]); var size1 = test.size(); test.dequeue(); var size2 = test.size(); test.enqueue(['A', 3]); test.enqueue(['B', 3]); test.enqueue(['C', 3]); return (size1 === 2 && size2 === 1 && test.size() === 4)}()), 'message: Your PriorityQueue should correctly keep track of the current number of items using the <code>size</code> method as items are enqueued and dequeued.');",
+        "assert((function(){var test = new PriorityQueue(); test.enqueue(['A', 1]); test.enqueue(['B', 1]); test.dequeue(); var first = test.isEmpty(); test.dequeue(); return (!first && test.isEmpty()); }()), 'message: The <code>isEmpty</code> method should return <code>true</code> when the queue is empty.');",
+        "assert((function(){var test = new PriorityQueue(); test.enqueue(['A', 5]); test.enqueue(['B', 5]); test.enqueue(['C', 5]); test.enqueue(['D', 3]); test.enqueue(['E', 1]); test.enqueue(['F', 7]); var result = []; result.push(test.dequeue()); result.push(test.dequeue()); result.push(test.dequeue()); result.push(test.dequeue()); result.push(test.dequeue()); result.push(test.dequeue()); return result.join('') === 'EDABCF';}()), 'message: The priority queue should return items with a higher priority before items with a lower priority and return items in first-in-first-out order otherwise.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function PriorityQueue () { \n this.collection = []; \n this.printCollection = function(){ \n console.log(this.collection); \n }; \n this.size = function() { \n return this.collection.length; \n }; \n this.isEmpty = function() { \n return this.size() > 0 ? false : true; \n }; \n this.enqueue = function (newitem) {\n  if (this.isEmpty()) {\n    return this.collection.push(newitem);\n  }\n\n  this.collection = this.collection.reverse();\n  var found_index = this.collection.findIndex(function (item) {\n    return newitem[1] >= item[1];\n  });\n  if (found_index === -1) {\n    this.collection.push(newitem);\n  } else {\n    this.collection.splice(found_index, 0, newitem);\n  }\n  this.collection = this.collection.reverse();\n}; \n this.dequeue = function() { \n if (!this.isEmpty()) { \n return this.collection.shift()[0]; \n } else { \n return 'The queue is empty.' \n } \n }; \n }"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8255367417b2b2512c75",
+      "title": "Create a Circular Queue",
+      "description": [
+        "In this challenge you will be creating a Circular Queue. A circular queue is basically a queue that writes to the end of a collection then begins over writing itself at the beginning of the collection. This is type of data structure has some useful applications in certain situations. For example, a circular queue can be used for streaming media. Once the queue is full, new media data simply begins to overwrite old data.",
+        "A good way to illustrate this concept is with an array:",
+        "<blockquote>[1, 2, 3, 4, 5]<br> ^Read @ 0<br> ^Write @ 0</blockquote>",
+        "Here the read and write are both at position <code>0</code>. Now the queue gets 3 new records <code>a</code>, <code>b</code>, and <code>c</code>. Our queue now looks like:",
+        "<blockquote>[a, b, c, 4, 5]<br> ^Read @ 0<br>       ^Write @ 3</blockquote>",
+        "As the read head reads, it can remove values or keep them:",
+        "<blockquote>[null, null, null, 4, 5]<br>                   ^Read @ 3<br>                   ^Write @ 3</blockquote>",
+        "Once the write reaches the end of the array it loops back to the beginning:",
+        "<blockquote>[f, null, null, d, e]<br>                ^Read @ 3<br> ^Write @ 1</blockquote>",
+        "This approach requires a constant amount of memory but allows files of a much larger size to be processed.",
+        "Instructions:",
+        "In this challenge we will implement a circular queue. The circular queue should provide <code>enqueue</code> and <code>dequeue</code> methods which allow you to read from and write to the queue. The class itself should also accept an integer which you can use to specify the size of the queue when you create it. We've written the starting version of this class for you in the code editor. When you enqueue items to the queue, the write pointer should advance forward and loop back to the beginning once it reaches the end of the queue. Likewise, the read pointer should advance forward as you dequeue items. The write pointer should not be allowed to move past the read pointer (our class won't let you overwrite data you haven't read yet) and the read pointer should not be able to advance past data you have written.",
+        "In addition, the <code>enqueue</code> method should return the item you enqueued if it is successfully and otherwise return <code>null</code>. Similarly, when you dequeue an item it should be returned and if you cannot dequeue you should return <code>null</code>."
+      ],
+      "challengeSeed": [
+        "class CircularQueue {",
+        "   constructor(size) {",
+        "",
+        "     this.queue = [];",
+        "     this.read = 0;",
+        "     this.write = 0;",
+        "     this.max = size - 1;",
+        "",
+        "     while (size > 0) {",
+        "        this.queue.push(null);",
+        "        size--;",
+        "     }",
+        "",
+        "   }",
+        "",
+        "   print() {",
+        "     return this.queue;",
+        "   }",
+        "",
+        "",
+        "   enqueue(item) {",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "   }",
+        "",
+        "   dequeue() {",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "   }",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){ var test = new CircularQueue(3); test.enqueue(17); test.enqueue(32); test.enqueue(591); var print = test.print(); return print[0] === 17 && print[1] === 32 && print[2] === 591; })(), 'message: The <code>enqueue</code> method adds items to the circular queue.');",
+        "assert((function(){ var test = new CircularQueue(3); test.enqueue(17); test.enqueue(32); test.enqueue(591); test.enqueue(13); test.enqueue(25); test.enqueue(59); var print = test.print(); return print[0] === 17 && print[1] === 32 && print[2] === 591; })(), 'message: You cannot enqueue items past the read pointer.');",
+        "assert((function(){ var test = new CircularQueue(3); test.enqueue(17); test.enqueue(32); test.enqueue(591); return test.dequeue() === 17 && test.dequeue() === 32 && test.dequeue() === 591; })(), 'message: The <code>dequeue</code> method dequeues items from the queue.');",
+        "assert((function(){ var test = new CircularQueue(3); test.enqueue(17); test.enqueue(32); test.enqueue(672); test.dequeue(); test.dequeue(); var print = test.print(); return print[0] === null && print[1] === null && print[2] === 672; })(), 'message: After an item is dequeued its position in the queue should be reset to <code>null</code>.');",
+        "assert((function(){ var test = new CircularQueue(3); test.enqueue(17); test.enqueue(32); test.enqueue(591); return test.dequeue() === 17 && test.dequeue() === 32 && test.dequeue() === 591 && test.dequeue() === null && test.dequeue() === null && test.dequeue() === null && test.dequeue() === null && test.enqueue(100) === 100 && test.dequeue() === 100; })(), 'message: Trying to dequeue past the write pointer returns <code>null</code> and does not advance the write pointer.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "class CircularQueue { \n constructor(size) { \n this.queue = []; \n this.read = 0; \n this.write = 0; \n this.max = size - 1; \n while (size > 0) { \n this.queue.push(null); \n size--; \n } \n } \n print() { \n return this.queue; \n } \n enqueue(item) { \n if (this.queue[this.write] === null) { \n this.queue[this.write] = item; \n if (this.write === this.max) { \n this.write = 0; \n } else { \n this.write++; \n } \n return item; \n } \n return null; \n } \n dequeue() { \n if (this.queue[this.read] !== null) { \n var item = this.queue[this.read]; \n this.queue[this.read] = null; \n if (this.read === this.max) { \n this.read = 0; \n } else { \n this.read++; \n } \n return item; \n } else { \n return null; \n } \n } \n }"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "8d1323c8c441eddfaeb5bdef",
+      "title": "Create a Set Class",
+      "description": [
+        "In the next few exercises we are going to create a function to emulate a data structure called a \"Set\". A Set is like an array, but it cannot contain duplicate values. The typical use for a Set is to simply check for the presence of an item. This can be implemented with an object, for instance:",
+        "<blockquote>var set = new Object();<br>set.foo = true;<br>// See if foo exists in our set:<br>console.log(set.foo) // true</blockquote>",
+        "In the next few exercises, we will build a full featured Set from scratch.",
+        "For this exercise, create a function that will add a value to our set collection as long as the value does not already exist in the set. For example:",
+        "<blockquote>this.add = function(element) {<br>  //some code to add value to the set<br>}</blockquote>",
+        "The function should return <code>true</code> if the value is successfully added and <code>false</code> otherwise."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold our set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new Set(); return (typeof test.add === 'function')}()), 'message: Your <code>Set</code> class should have an <code>add</code> method.');",
+        "assert((function(){var test = new Set(); test.add('a'); test.add('b'); test.add('a'); var vals = test.values(); return (vals[0] === 'a' && vals[1] === 'b' && vals.length === 2)}()), 'message: Your <code>add</code> method should not add duplicate values.');",
+        "assert((function(){var test = new Set(); var result = test.add('a'); return (result != undefined) && (result === true);}()), 'message: Your <code>add</code> method should return <code>true</code> when a value has been successfully added.');",
+        "assert((function(){var test = new Set(); test.add('a'); var result = test.add('a'); return (result != undefined) && (result === false);}()), 'message: Your <code>add</code> method should return <code>false</code> when a duplicate value is added.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8253367417b2b2512c6b",
+      "title": "Remove from a Set",
+      "description": [
+        "In this exercises we are going to create a delete function for our set. The function should be named <code>this.remove</code>. This function should accept a value and check if it exists in the set. If it does, remove that value from the set, and return true. Otherwise, return false."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold the set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "    // this method will add an element to the set",
+        "    this.add = function(element) {",
+        "        if(!this.has(element)){",
+        "            collection.push(element);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new Set(); return (typeof test.remove === 'function')}()), 'message: Your <code>Set</code> class should have a <code>remove</code> method.');",
+        "assert.deepEqual((function(){var test = new Set(); test.add('a');test.add('b');test.remove('c'); return test.values(); })(), ['a', 'b'], 'message: Your <code>remove</code> method should only remove items that are present in the set.');",
+        "assert((function(){var test = new Set(); test.add('a');test.add('b');test.remove('a'); var vals = test.values(); return (vals[0] === 'b' && vals.length === 1)}()), 'message: Your <code>remove</code> method should remove the given item from the set.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};this.remove = function(element) {if(this.has(element)) {var i = collection.indexOf(element);collection.splice(i, 1);return true;}return false;};}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "8d1923c8c441eddfaeb5bdef",
+      "title": "Size of the Set",
+      "description": [
+        "In this exercise we are going to create a size function for our Set. This function should be named <code>this.size</code> and it should return the size of the collection."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold the set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "    // this method will add an element to the set",
+        "    this.add = function(element) {",
+        "        if(!this.has(element)){",
+        "            collection.push(element);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will remove an element from a set",
+        "    this.remove = function(element) {",
+        "        if(this.has(element)){",
+        "            index = collection.indexOf(element);",
+        "            collection.splice(index,1);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new Set(); return (typeof test.size === 'function')}()), 'message: Your <code>Set</code> class should have a <code>size</code> method.');",
+        "assert((function(){var test = new Set(); test.add('a');test.add('b');test.remove('a');return (test.size() === 1)}()), 'message: The <code>size</code> method should return the number of elements in the collection.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};this.remove = function(element) {if(this.has(element)) {var i = collection.indexOf(element);collection.splice(i, 1);return true;}return false;};this.size = function() {return collection.length;};}"
+    ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8253367417b2b2512c6c",
+      "title": "Perform a Union on Two Sets",
+      "description": [
+        "In this exercise we are going to perform a union on two sets of data. We will create a method on our <code>Set</code> data structure called <code>union</code>. This method should take another <code>Set</code> as an argument and return the <code>union</code> of the two sets, excluding any duplicate values.",
+        "For example, if <code>setA = ['a','b','c']</code> and <code>setB = ['a','b','d','e']</code>, then the union of setA and setB is: <code>setA.union(setB) = ['a', 'b', 'c', 'd', 'e']</code>."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold the set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "    // this method will add an element to the set",
+        "    this.add = function(element) {",
+        "        if(!this.has(element)){",
+        "            collection.push(element);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "   // this method will remove an element from a set",
+        "    this.remove = function(element) {",
+        "        if(this.has(element)){",
+        "            index = collection.indexOf(element);",
+        "            collection.splice(index,1);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will return the size of the set",
+        "    this.size = function() {",
+        "        return collection.length;",
+        "    };",
+        "    // change code below this line",
+        "",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new Set(); return (typeof test.union === 'function')})(), 'message: Your <code>Set</code> class should have a <code>union</code> method.');",
+        "assert((function(){var setA = new Set();  var setB = new Set();  setA.add('a');  setA.add('b');  setA.add('c');  setB.add('c');  setB.add('d');  var unionSetAB = setA.union(setB); var final = unionSetAB.values(); return (final.indexOf('a') !== -1 && final.indexOf('b') !== -1 && final.indexOf('c') !== -1 && final.indexOf('d') !== -1 && final.length === 4)})(), 'message: The proper collection was returned');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};this.remove = function(element) {if(this.has(element)) {var i = collection.indexOf(element);collection.splice(i, 1);return true;}return false;};this.size = function() {return collection.length;};this.union = function(set) {var u = new Set();var c = this.values();var s = set.values();c.forEach(function(element){u.add(element);});s.forEach(function(element){u.add(element);});return u;};}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8253367417b2b2512c6d",
+      "title": "Perform an Intersection on Two Sets of Data",
+      "description": [
+        "In this exercise we are going to perform an intersection on 2 sets of data. We will create a method on our <code>Set</code> data structure called <code>intersection</code>. An intersection of sets represents all values that are common to two or more sets. This method should take another <code>Set</code> as an argument and return the <code>intersection</code> of the two sets.",
+        "For example, if <code>setA = ['a','b','c']</code> and <code>setB = ['a','b','d','e']</code>, then the intersection of setA and setB is: <code>setA.intersection(setB) = ['a', 'b']</code>."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold the set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "   // this method will add an element to the set",
+        "    this.add = function(element) {",
+        "        if(!this.has(element)){",
+        "            collection.push(element);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will remove an element from a set",
+        "    this.remove = function(element) {",
+        "        if(this.has(element)){",
+        "            index = collection.indexOf(element);",
+        "            collection.splice(index,1);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will return the size of the collection",
+        "    this.size = function() {",
+        "        return collection.length;",
+        "    };",
+        "    // this method will return the union of two sets",
+        "    this.union = function(otherSet) {",
+        "        var unionSet = new Set();",
+        "        var firstSet = this.values();",
+        "        var secondSet = otherSet.values();",
+        "        firstSet.forEach(function(e){",
+        "            unionSet.add(e);",
+        "        });",
+        "        secondSet.forEach(function(e){",
+        "            unionSet.add(e);",
+        "        });",
+        "        return unionSet;",
+        "    };",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert(function(){var test = new Set(); return (typeof test.intersection === 'function')}, 'message: Your <code>Set</code> class should have a <code>intersection</code> method.');",
+        "assert(function(){  var setA = new Set();  var setB = new Set();  setA.add('a');  setA.add('b');  setA.add('c');  setB.add('c');  setB.add('d');  var intersectionSetAB = setA.intersection(setB); return (intersectionSetAB.size() === 1 && intersectionSetAB.values()[0] === 'c')}, 'message: The proper collection was returned');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};this.remove = function(element) {if(this.has(element)) {var i = collection.indexOf(element);collection.splice(i, 1);return true;}return false;};this.size = function() {return collection.length;};this.union = function(set) {var u = new Set();var c = this.values();var s = set.values();c.forEach(function(element){u.add(element);});s.forEach(function(element){u.add(element);});return u;};this.intersection = function(set) {var i = new Set();var c = this.values();c.forEach(function(element){if(s.has(element)) i.add(element);});};}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8254367417b2b2512c6e",
+      "title": "Perform a Difference on Two Sets of Data",
+      "description": [
+        "In this exercise we are going to perform a difference on 2 sets of data. We will create a method on our <code>Set</code> data structure called <code>difference</code>. A difference of sets should compare two sets and return the items present in the first set that are absent in the second. This method should take another <code>Set</code> as an argument and return the <code>difference</code> of the two sets.",
+        "For example, if <code>setA = ['a','b','c']</code> and <code>setB = ['a','b','d','e']</code>, then the difference of setA and setB is: <code>setA.difference(setB) = ['c']</code>."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold the set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "    // this method will add an element to the set",
+        "    this.add = function(element) {",
+        "        if(!this.has(element)){",
+        "            collection.push(element);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will remove an element from a set",
+        "    this.remove = function(element) {",
+        "        if(this.has(element)){",
+        "            index = collection.indexOf(element);",
+        "            collection.splice(index,1);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will return the size of the collection",
+        "    this.size = function() {",
+        "        return collection.length;",
+        "    };",
+        "    // this method will return the union of two sets",
+        "    this.union = function(otherSet) {",
+        "        var unionSet = new Set();",
+        "        var firstSet = this.values();",
+        "        var secondSet = otherSet.values();",
+        "        firstSet.forEach(function(e){",
+        "            unionSet.add(e);",
+        "        });",
+        "        secondSet.forEach(function(e){",
+        "            unionSet.add(e);",
+        "        });",
+        "        return unionSet;",
+        "    };",
+        "    // this method will return the intersection of two sets as a new set",
+        "    this.intersection = function(otherSet) {",
+        "        var intersectionSet = new Set();",
+        "        var firstSet = this.values();",
+        "        firstSet.forEach(function(e){",
+        "            if(otherSet.has(e)){",
+        "                intersectionSet.add(e);",
+        "            }",
+        "        });",
+        "        return intersectionSet;",
+        "    };",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert(function(){var test = new Set(); return (typeof test.difference === 'function')}, 'message: Your <code>Set</code> class should have a <code>difference</code> method.');",
+        "assert(function(){var setA = new Set(); var setB = new Set(); setA.add('a'); setA.add('b'); setA.add('c'); setB.add('c'); setB.add('d'); var differenceSetAB = setA.difference(setB); return (differenceSetAB.size() === 2) && (differenceSetAB.values() === [ 'a', 'b' ])}, 'message: The proper collection was returned');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};this.remove = function(element) {if(this.has(element)) {var i = collection.indexOf(element);collection.splice(i, 1);return true;}return false;};this.size = function() {return collection.length;};this.union = function(set) {var u = new Set();var c = this.values();var s = set.values();c.forEach(function(element){u.add(element);});s.forEach(function(element){u.add(element);});return u;};this.intersection = function(set) {var i = new Set();var c = this.values();c.forEach(function(element){if(s.has(element)) i.add(element);});};this.difference = function(set) {var d = new Set();var c = this.values();c.forEach(function(e){if(!set.has(e)) d.add(e);});};}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8254367417b2b2512c6f",
+      "title": "Perform a Subset Check on Two Sets of Data",
+      "description": [
+        "In this exercise we are going to perform a subset test on 2 sets of data. We will create a method on our <code>Set</code> data structure called <code>subset</code>. This will compare the first set, against the second and if the first set is fully contained within the Second then it will return true.",
+        "For example, if <code>setA = ['a','b']</code> and <code>setB = ['a','b','c','d']</code>, then the subset of setA and setB is: <code>setA.subset(setB)</code> should be <code>true</code>."
+      ],
+      "challengeSeed": [
+        "function Set() {",
+        "    // the var collection will hold the set",
+        "    var collection = [];",
+        "    // this method will check for the presence of an element and return true or false",
+        "    this.has = function(element) {",
+        "        return (collection.indexOf(element) !== -1);",
+        "    };",
+        "    // this method will return all the values in the set",
+        "    this.values = function() {",
+        "        return collection;",
+        "    };",
+        "    // this method will add an element to the set",
+        "    this.add = function(element) {",
+        "        if(!this.has(element)){",
+        "            collection.push(element);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will remove an element from a set",
+        "    this.remove = function(element) {",
+        "        if(this.has(element)){",
+        "            index = collection.indexOf(element);",
+        "            collection.splice(index,1);",
+        "            return true;",
+        "        }",
+        "        return false;",
+        "    };",
+        "    // this method will return the size of the collection",
+        "    this.size = function() {",
+        "        return collection.length;",
+        "    };",
+        "    // this method will return the union of two sets",
+        "    this.union = function(otherSet) {",
+        "        var unionSet = new Set();",
+        "        var firstSet = this.values();",
+        "        var secondSet = otherSet.values();",
+        "        firstSet.forEach(function(e){",
+        "            unionSet.add(e);",
+        "        });",
+        "        secondSet.forEach(function(e){",
+        "            unionSet.add(e);",
+        "        });",
+        "        return unionSet;",
+        "    };",
+        "    // this method will return the intersection of two sets as a new set",
+        "    this.intersection = function(otherSet) {",
+        "        var intersectionSet = new Set();",
+        "        var firstSet = this.values();",
+        "        firstSet.forEach(function(e){",
+        "            if(otherSet.has(e)){",
+        "                intersectionSet.add(e);",
+        "            }",
+        "        });",
+        "        return intersectionSet;",
+        "    };",
+        "    // this method will return the difference of two sets as a new set",
+        "    this.difference = function(otherSet) {",
+        "        var differenceSet = new Set();",
+        "        var firstSet = this.values();",
+        "        firstSet.forEach(function(e){",
+        "            if(!otherSet.has(e)){",
+        "                differenceSet.add(e);",
+        "            }",
+        "        });",
+        "        return differenceSet;",
+        "    };",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert(function(){var test = new Set(); return (typeof test.subset === 'function')}, 'message: Your <code>Set</code> class should have a <code>union</code> method.');",
+        "assert(function(){var setA = new Set(); var setB = new Set(); setA.add('a'); setB.add('b'); setB.add('c'); setB.add('a'); setB.add('d'); var subsetSetAB = setA.subset(setB);return (subsetSetAB === true)}, 'message: The first Set() was contained in the second Set');",
+        "assert(function(){var setA = new Set(); var setB = new Set(); setA.add('a'); setA.add('b'); setB.add('a'); setB.add('b'); setB.add('c'); setB.add('d'); var subsetSetAB = setA.subset(setB); return (subsetSetAB === true)}, \"message: <code>['a', 'b'].subset(['a', 'b', 'c', 'd'])</code> should return <code>true</code>\");",
+        "assert(function(){var setA = new Set(); var setB = new Set(); setA.add('a'); setA.add('b'); setA.add('c'); setB.add('a'); setB.add('b'); var subsetSetAB = setA.subset(setB); return (subsetSetAB === false)}, \"message: <code>['a', 'b', 'c'].subset(['a', 'b'])</code> should return <code>false</code>\");",
+        "assert(function(){var setA = new Set(); var setB = new Set(); var subsetSetAB = setA.subset(setB); return (subsetSetAB === true)}, 'message: <code>[].subset([])</code> should return <code>true</code>');",
+        "assert(function(){var setA = new Set(); var setB = new Set(); setA.add('a'); setA.add('b'); setB.add('c'); setB.add('d'); var subsetSetAB = setA.subset(setB); return (subsetSetAB === false)}, \"message: <code>['a', 'b'].subset(['c', 'd'])</code> should return <code>false</code>\");"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function Set() {var collection = []; this.has = function(e){return(collection.indexOf(e) !== -1);};this.values = function() {return collection;};this.add = function(element) {if (!this.has(element)) {collection.push(element);return true;} else {return false;}};this.remove = function(element) {if(this.has(element)) {var i = collection.indexOf(element);collection.splice(i, 1);return true;}return false;};this.size = function() {return collection.length;};this.union = function(set) {var u = new Set();var c = this.values();var s = set.values();c.forEach(function(element){u.add(element);});s.forEach(function(element){u.add(element);});return u;};this.intersection = function(set) {var i = new Set();var c = this.values();c.forEach(function(element){if(s.has(element)) i.add(element);});};this.difference = function(set) {var d = new Set();var c = this.values();c.forEach(function(e){if(!set.has(e)) d.add(e);});};this.subset = function(set) {var isSubset = true;var c = this.values();c.forEach(function(e){if(!set.has(e)) isSubset = false;});return isSubset;};}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8254367417b2b2512c70",
+      "title": "Create and Add to Sets in ES6",
+      "description": [
+        "Now that you have worked through ES5, you are going to perform something similar in ES6. This will be considerably easier. ES6 contains a built-in data structure <code>Set</code> so many of the operations you wrote by hand are now included for you. Let's take a look:",
+        "To create a new empty set:",
+        "<code>var set = new Set();</code>",
+        "You can create a set with a value:",
+        "<code>var set = new Set(1);</code>",
+        "You can create a set with an array:",
+        "<code>var set = new Set([1, 2, 3]);</code>",
+        "Once you have created a set, you can add the values you wish using the <code>add</code> method:",
+        "<blockquote>var set = new Set([1, 2, 3]);<br>set.add([4, 5, 6]);</blockquote>",
+        "As a reminder, a set is a data structure that cannot contain duplicate values:",
+        "<blockquote>var set = new Set([1, 2, 3, 1, 2, 3]);<br>// set contains [1, 2, 3] only</blockquote>",
+        "<hr>",
+        "For this exercise, return a set with the following values: <code>1, 2, 3, 'Taco', 'Cat', 'Awesome'</code>"
+      ],
+      "challengeSeed": [
+        "function checkSet() {",
+        "  var set = new Set([1, 2, 3, 3, 2, 1, 2, 3, 1]);",
+        "  // change code below this line",
+        "  ",
+        "  // change code above this line",
+        "  console.log(set);",
+        "  return set;",
+        "}",
+        "",
+        "checkSet();"
+      ],
+      "tests": [
+        "assert(function(){var test = checkSet(); return (test.size == 6) && test.has(1) && test.has(2) && test.has(3) && test.has('Taco') && test.has('Cat') && test.has('Awesome');}, 'message: Your <code>Set</code> should only contains the values <code>1, 2, 3, Taco, Cat, Awesome</code>.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function checkSet(){var set = new Set([1,2,3,'Taco','Cat','Awesome']);\nreturn set;}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8254367417b2b2512c71",
+      "title": "Remove items from a set in ES6",
+      "description": [
+        "Let's practice removimg items from an ES6 Set using the <code>delete</code> method.",
+        "First, create an ES6 Set",
+        "<code>var set = new Set([1,2,3]);</code>",
+        "Now remove an item from your Set with the <code>delete</code> method.",
+        "<blockquote>set.delete(1);<br>console.log([...set]) // should return [ 2, 3 ]<blockquote>",
+        "<hr>",
+        "Now, create a set with the integers 1, 2, 3, 4, & 5. \n Remove the values 2 and 5, and then return the set."
+      ],
+      "challengeSeed": [
+        "function checkSet(){",
+        "   var set = //Create a set with values 1, 2, 3, 4, & 5",
+        "   //Remove the value 2",
+        "   //Remove the value 5",
+        "   //Return the set",
+        "   return set;",
+        "}"
+      ],
+      "tests": [
+        "assert(function(){var test = checkSet(); return test.has(1) && test.has(3) && test.has(4) && test.size === 3}, 'message: Your Set should contain the values 1, 3, & 4');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function checkSet(){\nvar set = new Set([1,2,3,4,5]);\nset.delete(2);\nset.delete(5);\nreturn set;}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8255367417b2b2512c72",
+      "title": "Use .has and .size on an ES6 Set",
+      "description": [
+        "Let's look at the .has and .size methods available on the ES6 Set object.",
+        "First, create an ES6 Set",
+        "<code>var set = new Set([1,2,3]);</code>",
+        "The .has method will check if the value is contained within the set.",
+        "<code>var hasTwo = set.has(2);</code>",
+        "The .size method will return an integer representing the size of the Set",
+        "<code>var howBig = set.size;</code>",
+        "<hr>",
+        "In this exercise we will pass an array and a value to the checkSet() function. Your function should create an ES6 set from the array argument. Find if the set contains the value argument. Find the size of the set. And return those two values in an array."
+      ],
+      "challengeSeed": [
+        "function checkSet(arrToBeSet, checkValue){",
+        "",
+        "   // change code below this line",
+        "",
+        "   // change code above this line",
+        "",
+        "}",
+        "",
+        "checkSet([ 1, 2, 3], 2); // Should return [ true, 3 ]"
+      ],
+      "tests": [
+        "assert(function(){var test = checkSet([4,5,6], 3); test === [ false, 3 ]}, 'message: <code>checkSet([4, 5, 6], 3)</code> should return [ false, 3 ]');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function checkSet(arrToBeSet, checkValue){\nvar set = new Set(arrToBeSet);\nvar result = [\nset.has(checkValue),\nset.size\n];\nreturn result;\n}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8255367417b2b2512c73",
+      "title": "Use Spread and Notes for ES5 Set() Integration",
+      "description": [
+        "Do you remember the ES6 spread operator <code>...</code>?",
+        "<code>...</code> can take iterable objects in ES6 and turn them into arrays.",
+        "Let's create a Set, and check out the spread function.",
+        "<blockquote>var set = new Set([1,2,3]);<br>var setToArr = [...set]<br>console.log(setToArr) // returns [ 1, 2, 3 ]</blockquote>",
+        "<hr>",
+        "In this exercise we will pass a set object to the <code>checkSet</code> function. It should return an array containing the values of the Set.",
+        "Now you've successfully learned how to use the ES6 <code>Set()</code> object, good job!"
+      ],
+      "challengeSeed": [
+        "function checkSet(set){",
+        "   // change code below this line",
+        "",
+        "   // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert(function(){var test = checkSet(new Set([1,2,3,4,5,6,7])); test === [ 1, 2, 3, 4, 5, 6, 7 ]}, 'message: Your Set was returned correctly!');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function checkSet(set){\nreturn [...set];}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "8d5823c8c441eddfaeb5bdef",
+      "title": "Create a Map Data Structure",
+      "description": [
+        "The next few challenges will cover maps and hash tables. Maps are data structurs that store key-value pairs. In JavaScript, these are available to us as objects. Maps provide rapid lookup of stored items based on key values and are very common and useful data structures.",
+        "Instructions: Let's get some practice creating our own map. Because JavaScript objects provide a much more efficient map structure than anything we could write here, this is intended primarily as a learning exercise. However, JavaScript objects only provide us with certain operations. What if we wanted to define custom operations?",
+        "Use the <code>Map</code> object provided here as a wrapper around a JavaScript <code>object</code>. Create the following methods and operations on the Map object:",
+        "<code>add</code> accepts a <code>key, value</code> pair to add to the map",
+        "<code>remove</code> accepts a key and removes the associated <code>key, value</code> pair",
+        "<code>get</code> accepts a <code>key</code> and returns the stored <code>value</code>",
+        "<code>has</code> returns a <code>boolean</code> for the presence or absence of an item",
+        "<code>values</code> returns an array of all the values in the map",
+        "<code>size</code> returns the number of items in the map",
+        "<code>clear</code> empties the map"
+      ],
+      "challengeSeed": [
+        "var Map = function() {",
+        "  this.collection = {};",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; return (typeof test == 'object')})(), 'message: The Map data structure exists.');",
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; return (typeof test.add == 'function' && typeof test.remove == 'function' && typeof test.get == 'function' && typeof test.has == 'function' && typeof test.values == 'function' && typeof test.clear == 'function' && typeof test.size == 'function')})(), 'message: The Map object has the following methods: add, remove, get, has, values, clear, and size.');",
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; test.add(5,6); test.add(2,3); test.add(2,5); return (test.size() == 3)})(), 'message: The add method adds items to the map.');",
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; test.add('test','value'); return (test.has('test') && !test.has('false'))})(), 'message: The has method returns true for added items and false for absent items.');",
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; test.add('abc','def'); return (test.get('abc') == 'def')})(), 'message: The get method accepts keys as input and returns the associated values.');",
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; test.add('a','b'); test.add('c','d'); test.add('e','f'); var vals = test.values(); return (vals.indexOf('b') != -1 && vals.indexOf('d') != -1 && vals.indexOf('f') != -1)})(), 'message: The values method returns all the values stored in the map as strings in an array.');",
+        "assert((function() { var test = false; if (typeof Map !== 'undefined') { test = new Map() }; test.add('b','b'); test.add('c','d'); test.remove('asdfas'); var init = test.size(); test.clear(); return (init == 2 && test.size() == 0)})(), 'message: The clear method empties the map and the size method returns the number of items present in the map.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825b367417b2b2512c8d",
+      "title": "Create an ES6 JavaScript Map",
+      "description": [
+        "The new version of JavaScript provides us with a built-in Map object which provides much of the functionality we wrote by hand in the last challenge. This Map object, although similar to regular JavaScript objects, provides some useful functionality that normal objects lack. For example, an ES6 Map tracks the insertion order of items that are added to it. Here is a more complete overview of its methods:",
+        "<code>.has(key)</code> returns true or false based on the presence of a key",
+        "<code>.get(key)</code> returns the value associated with a key",
+        "<code>.set(key, value)</code> sets a new key, value pair",
+        "<code>.delete(key)</code> removes a key, value pair",
+        "<code>.clear()</code> removes all key, value pairs",
+        "<code>.entries()</code> returns an array of all the keys in insertion order",
+        "<code>.values()</code> returns an array of all the values in insertion order",
+        "Instructions: Define a JavaScript Map object and assign to it a variable called myMap. Add the key, value pair <code>freeCodeCamp</code>, <code>Awesome!</code> to it."
+      ],
+      "challengeSeed": [
+        "// change code below this line"
+      ],
+      "tests": [
+        "assert(typeof myMap === 'object', 'message: The myMap object exists.');",
+        "assert(myMap.get('freeCodeCamp') === 'Awesome!', 'message: myMap contains the key value pair <code>freeCodeCamp</code>, <code>Awesome!</code>.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825b367417b2b2512c8e",
+      "title": "Create a Hash Table",
+      "description": [
+        "In this challenge we will learn about hash tables. A Hash table is used to implement associative arrays, or mappings of key-value pairs, like the objects and Maps we have just been studying. A JavaScript object could be implemented as a hash table, for instance (its actual implementation will depend on the environment it's running in). The way a hash table works is that it takes a key input and hashes this key in a deterministic way to some numerical value. This numerical value is then used as the actual key the associated value is stored by. Then, if you try to access the same key again, the hashing function will process the key, return the same numerical result, which will then be used to look up the associated value. This provides very efficient O(n) lookup time on average.",
+        "Hash tables can be implemented as arrays with hash functions producing array indices within a specified range. In this method, the choice of the array size is important, as is the hashing function. For instance, what if the hashing function produces the same value for two different keys? This is called a collision. One way to handle collisions is to just store both key-value pairs at that index. Then, upon lookup of either, you would have to iterate through the bucket of items to find the key you are looking for. A good hashing function will minimize collisions to maintain efficient search time.",
+        "Here, we won't be concerned with the details of hashing or hash table implementation, we will just try to get a general sense of how they work.",
+        "Instructions: Let's create the basic functionality of a hash table. We've created a naive hashing function for you to use. You can pass a string value to the function hash and it will return a hashed value you can use as a key for storage. Store items based on this hashed value in the this.collection object. Create these three methods: add, remove, and lookup. The first should accept a key value pair to add to the hash table. The second should remove a key-value pair when passed a key. The third should accept a key and return the associated value or null if the key is not present.",
+        "Be sure to write your code to account for collisions!"
+      ],
+      "head": [
+        "  var called = 0;",
+        "    var hash = (string) => {",
+        "     called++;",
+        "      var hash = 0;",
+        "      for (var i = 0; i < string.length; i++) { hash += string.charCodeAt(i); };",
+        "      return hash;",
+        "    };"
+      ],
+      "challengeSeed": [
+        "var called = 0;",
+        "var hash = (string) => {",
+        "  called++;",
+        "  var hash = 0;",
+        "  for (var i = 0; i < string.length; i++) { hash += string.charCodeAt(i); }",
+        "  return hash;",
+        "};",
+        "var HashTable = function() {",
+        "  this.collection = {};",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; return (typeof test === 'object')})(), 'message: The HashTable data structure exists.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; return ((typeof test.add) === 'function')})(), 'message: The HashTable has an add method.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; return ((typeof test.remove) === 'function')})(), 'message: The HashTable has an remove method.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; return ((typeof test.lookup) === 'function')})(), 'message: The HashTable has an lookup method.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; test.add('key', 'value'); return (test.lookup('key') === 'value')})(), 'message: The add method adds key value pairs and the lookup method returns the values associated with a given key.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; test.add('key', 'value'); test.remove('key'); return (test.lookup('key') === null)})(), 'message: The remove method accepts a key as input and removes the associated key value pair.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; called = 0; test.add('key1','value1'); test.add('key2','value2'); test.add('key3','value3'); return (called === 3)})(), 'message: Items are added using the hash function.');",
+        "assert((function() { var test = false; if (typeof HashTable !== 'undefined') { test = new HashTable() }; called = 0; test.add('key1','value1'); test.add('1key','value2'); test.add('ke1y','value3'); return (test.lookup('key1') === 'value1' && test.lookup('1key') == 'value2' && test.lookup('ke1y') == 'value3')})(), 'message: The hash table handles collisions.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8251367417b2b2512c61",
+      "title": "Work with Nodes in a Linked List",
+      "description": [
+        "Another common data structure you'll run into in computer science is the <dfn>linked list</dfn>. A linked list is a linear collection of data elements, called 'nodes', each of which points to the next. Each <dfn>node</dfn> in a linked list contains two key pieces of information: the <code>element</code> itself, and a reference to the next <code>node</code>.",
+        "Imagine that you are in a conga line. You have your hands on the next person in the line, and the person behind you has their hands on you. You can see the person straight ahead of you, but they are blocking the view of the other people ahead in line. A node is just like a person in a conga line: they know who they are and they can only see the next person in line, but they are not aware of the other people ahead or behind them.",
+        "<hr>",
+        "In our code editor, we've created two nodes, <code>Kitten</code> and <code>Puppy</code>, and we've manually connected the <code>Kitten</code> node to the <code>Puppy</code> node.",
+        "Create a <code>Cat</code> and <code>Dog</code> node and manually add them to the line."
+      ],
+      "challengeSeed": [
+        "var Node = function(element){",
+        "    this.element = element; ",
+        "    this.next = null; ",
+        "};",
+        "var Kitten = new Node(\"Kitten\");",
+        "var Puppy = new Node(\"Puppy\");",
+        "",
+        "Kitten.next = Puppy;",
+        "// only add code below this line",
+        "",
+        "// test your code",
+        "console.log(Kitten.next);"
+      ],
+      "tests": [
+        "assert(Puppy.next.element === \"Cat\", 'message: Your <code>Puppy</code> node should have a reference to a <code>Cat</code> node.');",
+        "assert(Cat.next.element === \"Dog\", 'message: Your <code>Cat</code> node should have a reference to a <code>Dog</code> node.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8251367417b2b2512c62",
+      "title": "Create a Linked List Class",
+      "description": [
+        "Let's create a <code>linked list</code> class. Every linked list should start out with a few basic properties: a <code>head</code> (the first item in your list) and a <code>length</code> (number of items in your list). Sometimes you'll see implementations of linked lists that incorporate a <code>tail</code> for the last element of the list, but for now we'll just stick with these two. Whenever we add an element to the linked list, our <code>length</code> property should be incremented by one.",
+        "We'll want to have a way to add items to our linked list, so the first method we'll want to create is the <code>add</code> method.",
+        "If our list is empty, adding an element to our linked list is straightforward enough: we just wrap that element in a <code>Node</code> class, and we assign that node to the <code>head</code> of our linked list." ,
+        "But what if our list already has one or more members? How do we add an element to the list? Recall that each node in a linked list has a <code>next</code> property. To add a node to the list, find the last node in the list, and point that last node's <code>next</code> property at our new node. (Hint: you know you've reached the end of a linked list when a node's <code>next</code> property is <code>null</node>.)",
+        "<hr>",
+        "Write an add method that assigns the first node you push to the linked list to the <code>head</code>; after that, whenever adding a node, every node should be referenced by the previous node's <code>next</code> property.",
+        "Note",
+        "Your list's <code>length</code> should increase by one every time an element is added to the linked list."
+      ],
+      "challengeSeed": [
+        "function LinkedList() { ",
+        "  var length = 0; ",
+        "  var head = null; ",
+        "",
+        "  var Node = function(element){",
+        "    this.element = element; ",
+        "    this.next = null; ",
+        "  }; ",
+        "",
+        "  this.head = function(){",
+        "    return head;",
+        "  };",
+        "",
+        "  this.size = function(){",
+        "    return length;",
+        "  };",
+        "",
+        "  this.add = function(element){",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "  };",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new LinkedList(); return (typeof test.add === 'function')}()), 'message: Your <code>LinkedList</code> class should have a <code>add</code> method.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); return test.head().element === 'cat'}()), 'message: Your <code>LinkedList</code> class should assign <code>head</code> to the first node added.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); return test.head().next.element === 'dog'}()), 'message: The previous <code>node</code> in your <code>LinkedList</code> class should have reference to the newest node created.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); return test.size() === 2}()), 'message: The  <code>size</code> of your <code>LinkedList</code> class should equal the amount of nodes in the linked list.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8251367417b2b2512c63",
+      "title": "Remove Elements from a Linked List",
+      "description": [
+        "The next important method that any implementation of a linked list will need is a <code>remove</code> method. This method should take the element we want to remove as an argument, and then search the list to find and remove the node that contains that element.",
+        "Whenever we remove a node from a linked list, it's important that we don't accidentally orphan the rest of the list in doing so. Recall that every node's <code>next</code> property points to the node that follows it in the list. If we're removing the middle element, say, we'll want to make sure that we have a connection from that element's previous node's <code>next</code> property to the middle element's <code>next</code> property (which is the next node in the list!)",
+        "This might sound really confusing, so let's return to the conga line example so we have a good conceptual model. Picture yourself in a conga line, and the person directly in front of you leaves the line. The person who just left the line no longer has her hands on anyone in line--and you no longer have your hands on the person that left. You step forward and put your hands on next person you see.",
+        "If the element we wish to remove is the <code>head</code> element, we reassign the <code>head</code> to the second node of the linked list.",
+        "<hr>",
+        "Write a <code>remove</code> method that takes an element and removes it from the linked list.",
+        "Note",
+        "The <code>length</code> of the list should decrease by one every time an element is removed from the linked list."
+      ],
+      "challengeSeed": [
+        "function LinkedList() { ",
+        "  var length = 0; ",
+        "  var head = null; ",
+        "",
+        "  var Node = function(element){ ",
+        "    this.element = element; ",
+        "    this.next = null; ",
+        "  }; ",
+        "",
+        "  this.size = function(){",
+        "    return length;",
+        "  };",
+        "",
+        "  this.head = function(){",
+        "    return head;",
+        "  };",
+        "",
+        "  this.add = function(element){",
+        "    var node = new Node(element);",
+        "    if(head === null){",
+        "        head = node;",
+        "    } else {",
+        "        currentNode = head;",
+        "",
+        "        while(currentNode.next){",
+        "            currentNode  = currentNode.next;",
+        "        }",
+        "",
+        "        currentNode.next = node;",
+        "    }",
+        "",
+        "    length++;",
+        "  }; ",
+        "",
+        "  this.remove = function(element){",
+        "    // Only change code below this line",
+        "",
+        "    // Only change code above this line",
+        "  };",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new LinkedList(); return (typeof test.remove === 'function')}()), 'message: Your <code>LinkedList</code> class should have a <code>remove</code> method.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.remove('cat'); return test.head().element === 'dog'}()), 'message: Your <code>remove</code> method should reassign <code>head</code> to the second node when the first node is removed.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.remove('cat'); return test.size() === 1})(), 'message: Your <code>remove</code> method should decrease the <code>length</code> of the linked list by one for every node removed.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog');test.add('kitten'); test.remove('dog'); return test.head().next.element === 'kitten'})(), 'message: Your <code>remove</code> method should reassign the reference of the previous node of the removed node to the removed node&apos;s <code>next</code> reference.');"
+      ],
+      "solutions": [
+        "class Node {\n  constructor (element) {\n    this.element = element;\n    this.next = null;\n  }\n}\n\nclass LinkedList {\n  constructor () {\n    this._length = 0;\n    this._head = null;\n  }\n\n  head () {\n    return this._head;\n  }\n\n  size () {\n    return this._length;\n  }\n\n  add (element) {\n    const node = new Node(element);\n\n    if (this._head === null) {\n      this._head = node;\n    } else {\n      let current = this._head;\n\n      while (current.next !== null) {\n        current = current.next;\n      }\n\n      current.next = node; \n    }\n    \n    ++this._length;\n  }\n  \n  remove (element) {\n    if (this._head === null) return;\n    \n    let previous;\n    let current = this._head;\n    \n    while (current.next !== null && current.element !== element) {\n      previous = current;\n      current = current.next;\n    }\n    \n    if (previous) {\n      previous.next = current.next;\n    } else {\n      this._head = current.next;\n    }\n    \n    --this._length;\n  }\n}"
+      ],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8251367417b2b2512c64",
+      "title": "Search within a Linked List",
+      "description": [
+        "Let's add a few more useful methods to our linked list class. Wouldn't it be useful if we could tell if our list was empty or not, as with our <code>Stack</code> and <code>Queue</code> classes?",
+        "We should also be able to find specific elements in our linked list. Traversing through data structures is something you'll want to get a lot of practice with! Let's create an <code>indexOf</code> method that takes an <code>element</code> as an argument, and returns that element's <code>index</code> in the linked list. If the element is not found in the linked list, return <code>-1</code>.",
+        "Let's also implement a method that does the opposite: an <code>elementAt</code> method that takes an <code>index</code> as an argument and returns the <code>element</code> at the given <code>index</code>. If no <code>element</code> is found, return <code>undefined</code>.",
+        "<hr>",
+        "Write an <code>isEmpty</code> method that checks if the linked list is empty, an <code>indexOf</code> method that returns the <code>index</code> of a given element, and an <code>elementAt</code> that returns an <code>element</code> at a given <code>index."
+      ],
+      "challengeSeed": [
+        "function LinkedList() { ",
+        "  var length = 0; ",
+        "  var head = null; ",
+        "",
+        "  var Node = function(element){ // {1} ",
+        "    this.element = element; ",
+        "    this.next = null; ",
+        "  }; ",
+        "",
+        "  this.size = function() {",
+        "    return length;",
+        "  };",
+        "",
+        "  this.head = function(){",
+        "    return head;",
+        "  };",
+        "",
+        "  this.add = function(element){",
+        "    var node = new Node(element);",
+        "    if(head === null){",
+        "        head = node;",
+        "    } else {",
+        "        currentNode = head;",
+        "",
+        "        while(currentNode.next){",
+        "            currentNode  = currentNode.next;",
+        "        }",
+        "",
+        "        currentNode.next = node;",
+        "    }",
+        "",
+        "    length++;",
+        "  }; ",
+        "",
+        "  this.remove = function(element){",
+        "    var currentNode = head;",
+        "    var previousNode;",
+        "    if(currentNode.element === element){",
+        "        head = currentNode.next;",
+        "    } else {",
+        "        while(currentNode.element !== element) {",
+        "            previousNode = currentNode;",
+        "            currentNode = currentNode.next;",
+        "        }",
+        "",
+        "        previousNode.next = currentNode.next;",
+        "    }",
+        "",
+        "    length --;",
+        "  };",
+        "",
+        "  // Only change code below this line",
+        "",
+        "  // Only change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new LinkedList(); return (typeof test.indexOf === 'function')}()), 'message: Your <code>LinkedList</code> class should have a <code>indexOf</code> method.');",
+        "assert((function(){var test = new LinkedList(); return (typeof test.elementAt === 'function')}()), 'message: Your <code>LinkedList</code> class should have a <code>elementAt</code> method.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten'); return test.size() === 3}()), 'message: Your <code>size</code> method should return the length of the linked list');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten'); return test.indexOf('kitten') === 2}()), 'message: Your <code>indexOf</code> method should return the index of the given element.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten'); return test.elementAt(1) === 'dog'}()), 'message: Your <code>elementAt</code> method should return at element at a given index.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8251367417b2b2512c65",
+      "title": "Remove Elements from a Linked List by Index",
+      "description": [
+        "Before we move on to another data structure, let's get a couple of last bits of practice with linked lists.",
+        "Let's write a <code>removeAt</code> method that removes the <code>element</code> at a given <code>index</code>. The method should be called <code>removeAt(index)</code>. To remove an <code>element</code> at a certain <code>index</code>, we'll need to keep a running count of each node as we move along the linked list.",
+        "A common technique used to iterate through the elements of a linked list involves a <dfn>'runner'</dfn>, or sentinel, that 'points' at the nodes that your code is comparing. In our case, starting at the <code>head</code> of our list, we start with a <code>currentIndex</code> variable that starts at <code>0</code>. The <code>currentIndex</code> should increment by one for each node we pass.",
+        "Just like our <code>remove(element)</code> method, we need to be careful not to orphan the rest of our list when we remove the node in our removeAt(index) method. We keep our nodes contiguous by making sure that the node that has reference to the removed node has a reference to the next node.",
+        "<hr>",
+        "Write a <code>removeAt(index)</code> method that removes and returns a node at a given <code>index</code>. The method should return <code>null</code> if the given <code>index</code> is either negative, or greater than or equal to the <code>length</code> of the linked list.",
+        "Note",
+        "Remember to keep count of the <code>currentIndex</code>."
+      ],
+      "challengeSeed": [
+        "function LinkedList() { ",
+        "  var length = 0; ",
+        "  var head = null; ",
+        "",
+        "  var Node = function(element){ // {1} ",
+        "    this.element = element; ",
+        "    this.next = null; ",
+        "  }; ",
+        "",
+        "  this.size = function(){",
+        "    return length;",
+        "  };",
+        "",
+        "  this.head = function(){",
+        "    return head;",
+        "  };",
+        "",
+        "  this.add = function(element){",
+        "    var node = new Node(element);",
+        "    if(head === null){",
+        "        head = node;",
+        "    } else {",
+        "        currentNode = head;",
+        "",
+        "        while(currentNode.next){",
+        "            currentNode  = currentNode.next;",
+        "        }",
+        "",
+        "        currentNode.next = node;",
+        "    }",
+        "",
+        "    length++;",
+        "  }; ",
+        "",
+        "  this.remove = function(element){",
+        "    var currentNode = head;",
+        "    var previousNode;",
+        "    if(currentNode.element === element){",
+        "        head = currentNode.next;",
+        "    } else {",
+        "        while(currentNode.element !== element) {",
+        "            previousNode = currentNode;",
+        "            currentNode = currentNode.next;",
+        "        }",
+        "",
+        "        previousNode.next = currentNode.next;",
+        "    }",
+        "",
+        "    length --;",
+        "  };",
+        "",
+        "  // Only change code below this line",
+        "",
+        "  // Only change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new LinkedList(); return (typeof test.removeAt === 'function')}()), 'message: Your <code>LinkedList</code> class should have a <code>removeAt</code> method.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten'); test.removeAt(1); return test.size() === 2}()), 'message: Your <code>removeAt</code> method should reduce the <code>length</code> of the linked list');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten');  return test.removeAt(1) === 'dog'}()), 'message: Your <code>removeAt</code> method should also return the element of the removed node.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten');  return (test.removeAt(-1) === null)}()), 'message: Your <code>removeAt</code> method should also return <code>null</code> if the given index is less than <code>0</code>');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.add('kitten');  return (test.removeAt(3) === null)}()), 'message: Your <code>removeAt</code> method should also return <code>null</code> if the given index is equal or more than the <code>length</code> of the linked list.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8252367417b2b2512c67",
+      "title": "Add Elements at a Specific Index in a Linked List",
+      "description": [
+        "Let's create a addAt(index,element) method that adds an element at a given index.",
+        "Just like how we remove elements at a given index, we need to keep track of the currentIndex as we traverse the linked list. When the currentIndex matches the given index, we would need to reassign the previous node's next property to reference the new added node. And the new node should reference the next node in the currentIndex.",
+        "Returning to the conga line example, a new person wants to join the line, but he wants to join in the middle. You are in the middle of the line, so you take your hands off of the person ahead of you. The new person walks over and puts his hands on the person you once had hands on, and you now have your hands on the new person.",
+        "Instructions",
+        "Create an addAt(index,element) method that adds an element at a given index. Return false if an element was unable to be added.",
+        "Note",
+        "Remember to check if the given index is a negative or is longer than the length of the linked list."
+      ],
+      "challengeSeed": [
+        "function LinkedList() { ",
+        "  var length = 0; ",
+        "  var head = null; ",
+        "",
+        "  var Node = function(element){",
+        "    this.element = element; ",
+        "    this.next = null; ",
+        "  }; ",
+        "",
+        "  this.size = function(){",
+        "    return length;",
+        "  };",
+        "",
+        "  this.head = function(){",
+        "    return head;",
+        "  };",
+        "",
+        "  this.add = function(element){",
+        "    var node = new Node(element);",
+        "    if(head === null){",
+        "        head = node;",
+        "    } else {",
+        "        currentNode = head;",
+        "",
+        "        while(currentNode.next){",
+        "            currentNode  = currentNode.next;",
+        "        }",
+        "",
+        "        currentNode.next = node;",
+        "    }",
+        "",
+        "    length++;",
+        "  }; ",
+        "",
+        "  // Only change code below this line",
+        "",
+        "  // Only change code above this line",
+        "",
+        "}"
+      ],
+      "tests": [
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.addAt(0,'cat'); return test.head().element === 'cat'}()), 'message: Your <code>addAt</code> method should reassign <code>head</code> to the new node when the given index is 0.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); test.addAt(0,'cat'); return test.size() === 3}()), 'message: Your <code>addAt</code> method should increase the length of the linked list by one for each new node added to the linked list.');",
+        "assert((function(){var test = new LinkedList(); test.add('cat'); test.add('dog'); return (test.addAt(4,'cat') === false); }()), 'message: Your <code>addAt</code> method should return <code>false</code> if a node was unable to be added.');"
+      ],
+      "solutions": [],
+      "hints": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825a367417b2b2512c87",
+      "title": "Create a Doubly Linked List",
+      "description": [
+        "All of the linked lists we've created so far are singly linked lists. Here, we'll create a <dfn>doubly linked list</dfn>. As the name implies, nodes in a doubly linked list have references to the next and previous node in the list.",
+        "This allows us to traverse the list in both directions but it also requires more memory to be used because every node must contain an additional reference to the previous node in the list.",
+        "<hr>",
+        "We've provided a <code>Node</code> object and started our <code>DoublyLinkedList</code>. Let's add two methods to our doubly linked list called <code>add</code> and <code>remove</code>. The <code>add</code> method should add the given element to the list while the <code>remove</code> method should remove all occurrences of a given element in the list.",
+        "Be careful to handle any possible edge cases when writing these methods, such as deletions for the first or last element. Also, removing any item on an empty list should return <code>null</code>."
+      ],
+      "challengeSeed": [
+        "var Node = function(data, prev) {",
+        "  this.data = data;",
+        "  this.prev = prev;",
+        "  this.next = null;",
+        "};",
+        "var DoublyLinkedList = function() {",
+        "  this.head = null;",
+        "  this.tail = null;",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tail": [
+        "DoublyLinkedList.prototype = {",
+        "  print() {",
+        "    if (this.head == null) {",
+        "      return null;",
+        "    } else {",
+        "      var result = new Array();",
+        "      var node = this.head;",
+        "      while (node.next != null) {",
+        "        result.push(node.data);",
+        "        node = node.next;",
+        "      };",
+        "      result.push(node.data);",
+        "      return result;",
+        "    };",
+        "  },",
+        "  printReverse() {",
+        "    if (this.tail == null) {",
+        "      return null;",
+        "    } else {",
+        "      var result = new Array();",
+        "      var node = this.tail;",
+        "      while (node.prev != null) {",
+        "        result.push(node.data);",
+        "        node = node.prev;",
+        "      };",
+        "      result.push(node.data);",
+        "      return result;",
+        "    };",
+        "  } ",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; return (typeof test == 'object')})(), 'message: The DoublyLinkedList data structure exists.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; if (test.add == undefined) { return false; }; return (typeof test.add == 'function')})(), 'message: The DoublyLinkedList has a method called add.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; if (test.remove == undefined) { return false; }; return (typeof test.remove == 'function')})(), 'message: The DoublyLinkedList has a method called remove.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; return (test.remove(100) == null); })(), 'message: Removing an item from an empty list returns null.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(5); test.add(6); test.add(723); return (test.print().join('') == '56723'); })(), 'message: The add method adds items to the list.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(50); test.add(68); test.add(73); return (test.printReverse().join('') == '736850'); })(), 'message: Each node keeps track of the previous node.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(25); test.add(35); test.add(60); test.remove(25); return ( test.print().join('') == '3560' ) })(), 'message: The first item can be removed from the list.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(25); test.add(35); test.add(60); test.remove(60); return ( test.print().join('') == '2535' ) })(), 'message: The last item can be removed from the list.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825a367417b2b2512c88",
+      "title": "Reverse a Doubly Linked List",
+      "description": [
+        "Let's create one more method for our doubly linked list called reverse which reverses the list in place. Once the method is executed the head should point to the previous tail and the tail should point to the previous head. Now, if we traverse the list from head to tail we should meet the nodes in a reverse order compared to the original list. Trying to reverse an empty list should return null."
+      ],
+      "challengeSeed": [
+        "var Node = function(data, prev) {",
+        "  this.data = data;",
+        "  this.prev = prev;",
+        "  this.next = null;",
+        "};",
+        "var DoublyLinkedList = function() {",
+        "  this.head = null;",
+        "  this.tail = null;",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; return (typeof test == 'object')})(), 'message: The DoublyLinkedList data structure exists.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; if (test.add == undefined) { return false; }; return (typeof test.add == 'function')})(), 'message: The DoublyLinkedList has a method called add.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; if (test.reverse == undefined) { return false; }; return (typeof test.reverse == 'function')})(), 'message: The DoublyLinkedList has a method called reverse.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; return (test.reverse() == null); })(), 'message: Reversing an empty list returns null.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(58); test.add(61); test.add(32); test.reverse(); return (test.print().join('') == '326158'); })(), 'message: The reverse method reverses the list.');",
+        "assert((function() { var test = false; if (typeof DoublyLinkedList !== 'undefined') { test = new DoublyLinkedList() }; test.add(11); test.add(22); test.add(33); test.reverse(); return (test.printReverse().join('') == '112233'); })(), 'message: The next and previous references are correctly maintained when a list is reversed.');"
+      ],
+      "tail": [
+        "DoublyLinkedList.prototype = {",
+        "  add(data) {",
+        "    if (this.head == null) {",
+        "      this.head = new Node(data, null);",
+        "      this.tail = this.head;",
+        "    } else {",
+        "      var node = this.head;",
+        "      var prev = null;",
+        "      while (node.next != null) {",
+        "        prev = node;",
+        "        node = node.next;",
+        "      };",
+        "      var newNode = new Node(data, node);",
+        "      node.next = newNode;",
+        "      this.tail = newNode;",
+        "    };",
+        "  },",
+        "  print() {",
+        "    if (this.head == null) {",
+        "      return null;",
+        "    } else {",
+        "      var result = new Array();",
+        "      var node = this.head;",
+        "      while (node.next != null) {",
+        "        result.push(node.data);",
+        "        node = node.next;",
+        "      };",
+        "      result.push(node.data);",
+        "      return result;",
+        "    };",
+        "  },",
+        "  printReverse() {",
+        "    if (this.tail == null) {",
+        "      return null;",
+        "    } else {",
+        "      var result = new Array();",
+        "      var node = this.tail;",
+        "      while (node.prev != null) {",
+        "        result.push(node.data);",
+        "        node = node.prev;",
+        "      };",
+        "      result.push(node.data);",
+        "      return result;",
+        "    };",
+        "  }",
+        "};"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8256367417b2b2512c7a",
+      "title": "Find the Minimum and Maximum Value in a Binary Search Tree",
+      "description": [
+        "This series of challenges will introduce the tree data structure. Trees are an important and versatile data structure in computer science. Of course, their name comes from the fact that when visualized they look much like the trees we are familiar with in the natural world. A tree data structure begins with one node, typically referred to as the root, and from here branches out to additional nodes, each of which may have more child nodes, and so on and so forth. The data structure is usually visualized with the root node at the top; you can think of it as a natural tree flipped upside down.",
+        "First, let's describe some common terminology we will encounter with trees. The root node is the top of the tree. Data points in the tree are called nodes. Nodes with branches leading to other nodes are referred to as the parent of the node the branch leads to (the child). Other more complicated familial terms apply as you might expect. A subtree refers to all the descendants of a particular node, branches may be referred to as edges, and leaf nodes are nodes at the end of the tree that have no children. Finally, note that trees are inherently recursive data structures. That is, any children of a node are parents of their own subtree, and so on. The recursive nature of trees is important to understand when designing algorithms for common tree operations.",
+        "To begin, we will discuss a particular type of a tree, the binary tree. In fact, we will actually discuss a particular binary tree, a binary search tree. Let's describe what this means. While the tree data structure can have any number of branches at a single node, a binary tree can only have two branches for every node. Furthermore, a binary search tree is ordered with respective to the child subtrees, such that each left subtree is less than or equal to the parent node, and each right subtree is greater than or equal to the parent node. Binary search trees are very common and useful data structures because they provide logarithmic time in the average case for several common operations such as lookup, insertion, and deletion.",
+        "Instructions: We'll start simple. We've defined the skeleton of a binary search tree structure here in addition to a function to create nodes for our tree. Observe that each node may have a left and right value. These will be assigned child subtrees if they exist. In our binary search tree, define two methods,",
+        "findMin and findMax. These methods should return the minimum and maximum value held in the binary search tree. If you get stuck, reflect on the invariant that must be true for binary search trees: each left subtree is less than or equal to its parent and each right subtree is greater than or equal to",
+        "its parent. Let's also say that our tree can only store integer values. If the tree is empty, either method should return null."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.findMin == 'function')})(), 'message: The binary search tree has a method called findMin.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.findMax == 'function')})(), 'message: The binary search tree has a method called findMax.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMin !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return test.findMin() == 1; })(), 'message: The findMin method returns the minimum value in the binary search tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMax !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return test.findMax() == 87; })(), 'message: The findMax method returns the maximum value in the binary search tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMin !== 'function') { return false; }; if (typeof test.findMax !== 'function') { return false; }; return (test.findMin() == null && test.findMax() == null) })(), 'message: The findMin and findMax methods return null for an empty tree.');"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8257367417b2b2512c7b",
+      "title": "Add a New Element to a Binary Search Tree",
+      "description": [
+        "Now that we have an idea of the basics lets write a more complex method.",
+        "In this challenge, we will create a method to add new values to our binary search tree. The method should be called add and it should accept an integer value to add to the tree. Take care to maintain the invariant of a binary search tree: the value in each left child should be less than or equal to the parent value, and the value in each right child should be greater than or equal to the parent value. Here, let's make it so our tree cannot hold duplicate values. If we try to add a value that already exists, the method should return null. Otherwise, if the addition is successful, undefined should be returned.",
+        "Hint: trees are naturally recursive data structures!"
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    isBinarySearchTree() {",
+        "        if (this.root == null) {",
+        "            return null;",
+        "        } else {",
+        "            var check = true;",
+        "            function checkTree(node) {",
+        "                if (node.left != null) {",
+        "                    var left = node.left;",
+        "                    if (left.value > node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(left);",
+        "                    }",
+        "                }",
+        "                if (node.right != null) {",
+        "                    var right = node.right;",
+        "                    if (right.value < node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(right);",
+        "                    };",
+        "                };",
+        "            };",
+        "            checkTree(this.root);",
+        "            return check;",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.add == 'function')})(), 'message: The binary search tree has a method called add.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.add !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return (test.isBinarySearchTree()); })(), 'message: The add method adds elements according to the binary search tree rules.')",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.add !== 'function') { return false; }; test.add(4); return test.add(4) == null; })(), 'message: Adding an element that already exists returns null');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8257367417b2b2512c7c",
+      "title": "Check if an Element is Present in a Binary Search Tree",
+      "description": [
+        "Now that we have a general sense of what a binary search tree is let's talk about it in a little more detail. Binary search trees provide logarithmic time for the common operations of lookup, insertion, and deletion in the average case, and linear time in the worst case. Why is this? Each of those basic operations requires us to find an item in the tree (or in the case of insertion to find where it should go) and because of the tree structure at each parent node we are branching left or right and effectively excluding half the size of the remaining tree. This makes the search proportional to the logarithm of the number of nodes in the tree, which creates logarithmic time for these operations in the average case.",
+        "Ok, but what about the worst case? Well, consider constructing a tree from the following values, adding them left to right: 10, 12, 17, 25. Following our rules for a binary search tree, we will add 12 to the right of 10, 17 to the right of this, and 25 to the right of this. Now our tree resembles a linked list and traversing it to find 25 would require us to traverse all the items in linear fashion. Hence, linear time in the worst case. The problem here is that the tree is unbalanced. We'll look a little more into what this means in the following challenges.",
+        "Instructions: In this challenge, we will create a utility for our tree. Write a method isPresent which takes an integer value as input and returns a boolean value for the presence or absence of that value in the binary search tree."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {    ",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.isPresent == 'function')})(), 'message: The binary search tree has a method called isPresent.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isPresent !== 'function') { return false; }; test.add(4); test.add(7); test.add(411); test.add(452); return ( test.isPresent(452) && test.isPresent(411) && test.isPresent(7) && !test.isPresent(100) ); })(), 'message: The isPresent method correctly checks for the presence or absence of elements added to the tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isPresent !== 'function') { return false; }; return test.isPresent(5) == false; })(), 'message: isPresent handles cases where the tree is empty.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8257367417b2b2512c7d",
+      "title": "Find the Minimum and Maximum Height of a Binary Search Tree",
+      "description": [
+        "In the last challenge we described a scenario in which a tree could become unbalanced. To understand the concept of balance, let's take a look at another tree property: height. Height in a tree represents the distance from the root node to any given leaf node. Different paths in a highly branched tree structure may have different heights, but for a given tree there will be a minimum and maximum height. If the tree is balanced, these values will differ at most by one. This means that in a balanced tree, all the leaf nodes exist within the same level, or if they are not within the same level they are at most one level apart.",
+        "The property of balance is important for trees because it is what determines the efficiency of tree operations. As we explained in the last challenge, we face worst case time complexity for heavily unbalanced trees. Self-balancing trees are commonly used to account for this issue in trees with dynamic data sets. Common examples of these include AVL trees, red-black trees, and B-trees. These trees all contain additional internal logic which re-balance the tree when insertions or deletions create a state of imbalance.",
+        "Note: A similar property to height is depth, which refers to how far a given node is from the root node.",
+        "Instructions: Write two methods for our binary tree: findMinHeight and findMaxHeight. These methods should return an integer value for the minimum and maximum height within a given binary tree, respectively. If the node is empty let's assign it a height of -1 (that's the base case). Finally, add a third method isBalanced which returns a true or false depending on whether the tree is balanced or not. You can use the first two methods you just wrote to determine this."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.findMinHeight == 'function')})(), 'message: The binary search tree has a method called findMinHeight.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.findMaxHeight == 'function')})(), 'message: The binary search tree has a method called findMaxHeight.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.isBalanced == 'function')})(), 'message: The binary search tree has a method called isBalanced.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMinHeight !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return (test.findMinHeight() == 1); })(), 'message: The findMinHeight method returns the minimum height of the tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMaxHeight !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return (test.findMaxHeight() == 5); })(), 'message: The findMaxHeight method returns the maximum height of the tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMaxHeight !== 'function') { return false; }; return (test.findMaxHeight() == -1); })(), 'message: An empty tree returns a height of -1.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isBalanced !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return test.isBalanced(); })(), 'message: The isBalanced method returns true if the tree is a balanced binary search tree.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8257367417b2b2512c7e",
+      "title": "Use Depth First Search in a Binary Search Tree",
+      "description": [
+        "We know how to search a binary search tree for a specific value. But what if we just want to explore the entire tree? Or what if we don't have an ordered tree and we need to just search for a value? Here we will introduce some tree traversal methods which can be used to explore tree data structures. First up is depth-first search. In depth-first search, a given subtree is explored as deeply as possible before the search continues on to another subtree. There are three ways this can be done:",
+        "In-order: Begin the search at the left-most node and end at the right-most node.",
+        "Pre-order: Explore all the roots before the leaves.",
+        "Post-order: Explore all the leaves before the roots.",
+        "As you may guess, you may choose different search methods depending on what type of data your tree is storing and what you are looking for. For a binary search tree, an inorder traversal returns the nodes in sorted order.",
+        "Instructions: Here we will create these three search methods on our binary search tree. Depth-first search is an inherently recursive operation which continues to explore further subtrees so long as child nodes are present. Once you understand this basic concept, you can simply rearrange the order in which you explore the nodes and subtrees to produce any of the three searches above. For example, in post-order search we would want to recurse all the way to a leaf node before we begin to return any of the nodes themselves, whereas in pre-order search we would want to return the nodes first, and then continue recursing down the tree.",
+        "Define inorder, preorder, and postorder methods on our tree. Each of these methods should return an array of items which represent the tree traversal. Be sure to return the integer values at each node in the array, not the nodes themselves. Finally, return null if the tree is empty."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.inorder == 'function')})(), 'message: The binary search tree has a method called inorder.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.preorder == 'function')})(), 'message: The binary search tree has a method called preorder.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.postorder == 'function')})(), 'message: The binary search tree has a method called postorder.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.inorder !== 'function') { return false; }; test.add(7); test.add(1); test.add(9); test.add(0); test.add(3); test.add(8); test.add(10); test.add(2); test.add(5); test.add(4); test.add(6); return (test.inorder().join('') == '012345678910'); })(), 'message: The inorder method returns an array of the node values that result from an inorder traversal.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.preorder !== 'function') { return false; }; test.add(7); test.add(1); test.add(9); test.add(0); test.add(3); test.add(8); test.add(10); test.add(2); test.add(5); test.add(4); test.add(6); return (test.preorder().join('') == '710325469810'); })(), 'message: The preorder method returns an array of the node values that result from a preorder traversal.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.postorder !== 'function') { return false; }; test.add(7); test.add(1); test.add(9); test.add(0); test.add(3); test.add(8); test.add(10); test.add(2); test.add(5); test.add(4); test.add(6); return (test.postorder().join('') == '024653181097'); })(), 'message: The postorder method returns an array of the node values that result from a postorder traversal.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.inorder !== 'function') { return false; }; return (test.inorder() == null); })(), 'message: The inorder method returns null for an empty tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.preorder !== 'function') { return false; }; return (test.preorder() == null); })(), 'message: The preorder method returns null for an empty tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.postorder !== 'function') { return false; }; return (test.postorder() == null); })(), 'message: The postorder method returns null for an empty tree.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8258367417b2b2512c7f",
+      "title": "Use Breadth First Search in a Binary Search Tree",
+      "description": [
+        "Here we will introduce another tree traversal method: breadth-first search. In contrast to the depth-first search methods from the last challenge, breadth-first search explores all the nodes in a given level within a tree before continuing on to the next level. Typically, queues are utilized as helper data structures in the design of breadth-first search algorithms.",
+        "In this method, we start by adding the root node to a queue. Then we begin a loop where we dequeue the first item in the queue, add it to a new array, and then inspect both its child subtrees. If its children are not null, they are each enqueued. This process continues until the queue is empty.",
+        "Instructions: Let's create a breadth-first search method in our tree called levelOrder. This method should return an array containing the values of all the tree nodes, explored in a breadth-first manner. Be sure to return the values in the array, not the nodes themselves. A level should be",
+        "traversed from left to right. Next, let's write a similar method called reverseLevelOrder which performs the same search but in the reverse direction (right to left) at each level."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.levelOrder == 'function')})(), 'message: The binary search tree has a method called levelOrder.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.reverseLevelOrder == 'function')})(), 'message: The binary search tree has a method called reverseLevelOrder.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.levelOrder !== 'function') { return false; }; test.add(7); test.add(1); test.add(9); test.add(0); test.add(3); test.add(8); test.add(10); test.add(2); test.add(5); test.add(4); test.add(6); return (test.levelOrder().join('') == '719038102546'); })(), 'message: The levelOrder method returns an array of the tree node values explored in level order.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.reverseLevelOrder !== 'function') { return false; }; test.add(7); test.add(1); test.add(9); test.add(0); test.add(3); test.add(8); test.add(10); test.add(2); test.add(5); test.add(4); test.add(6); return (test.reverseLevelOrder().join('') == '791108305264'); })(), 'message: The reverseLevelOrder method returns an array of the tree node values explored in reverse level order.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.levelOrder !== 'function') { return false; }; return (test.levelOrder() == null); })(), 'message: The levelOrder method returns null for an empty tree.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.reverseLevelOrder !== 'function') { return false; }; return (test.reverseLevelOrder() == null); })(), 'message: The reverseLevelOrder method returns null for an empty tree.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8258367417b2b2512c80",
+      "title": "Delete a Leaf Node in a Binary Search Tree",
+      "description": [
+        "This is the first of three challenges where we will implement a more difficult operation in binary search trees: deletion. Deletion is difficult because removing nodes breaks links in the tree. These links must be carefully reestablished to ensure the binary tree structure is maintained. For some deletions, this means the tree must be rearranged. In general, you will encounter one of three cases when trying to delete a node:",
+        "Leaf Node: The target to delete has zero children.",
+        "One Child: The target to delete only has one child.",
+        "Two Children: The target to delete has two child nodes.",
+        "Removing a leaf node is easy, we simply remove it. Deleting a node with one child is also relatively easy, we simply remove it and link its parent to child of the node we deleted. Removing a node with two children is more difficult, however, because this creates two child nodes that need to be reconnected to the parent tree. We'll see how to deal with this case in the third challenge. Additionally, you need to be mindful of some edge cases when handling deletion. What if the tree is empty? What if the node to delete is the root node? What if there are only two elements in the tree? For now, let's handle the first case where we delete a leaf node.",
+        "Instructions: Create a method on our binary tree called remove. We'll build the logic for our deletion operation in here. First, you'll want to create a function within remove that finds the node we are trying to delete in the current tree. If the node is not present in the tree, remove should return null. Now, if the target node is a leaf node with no children, then the parent reference to it should be set to null. This effectively deletes the node from the tree. To do this, you will have to keep track of",
+        "the parent of the node we are trying to delete as well. It will also be useful to create a way to track the number of children the target node has, as this will determine which case our deletion falls under.",
+        "We will handle the second and third cases in the next challenges. Good luck!"
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // case 1: target has no children, change code below this line",
+        "}"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.remove == 'function')})(), 'message: The binary search tree has a method called remove.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; return (test.remove(100) == null); })(), 'message: Trying to remove an element that does not exist returns null.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(500); test.remove(500); return (test.inorder() == null); })(), 'message: If the root node has no children, deleting it sets the root to null.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(5); test.add(3); test.add(7); test.add(6); test.add(10); test.add(12); test.remove(3); test.remove(12); test.remove(10); return (test.inorder().join('') == '567'); })(), 'message: The remove method removes leaf nodes from the tree');"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    },",
+        "    inorder: function() {",
+        "        if (this.root == null) {",
+        "          return null;",
+        "        } else {",
+        "          var result = new Array();",
+        "          function traverseInOrder(node) {",
+        "              if (node.left != null) {",
+        "                  traverseInOrder(node.left);",
+        "              };",
+        "              result.push(node.value);",
+        "              if (node.right != null) {",
+        "                  traverseInOrder(node.right);",
+        "              };",
+        "          }",
+        "          traverseInOrder(this.root);",
+        "          return result;",
+        "        };",
+        "    },    ",
+        "    isBinarySearchTree() {",
+        "        if (this.root == null) {",
+        "            return null;",
+        "        } else {",
+        "            var check = true;",
+        "            function checkTree(node) {",
+        "                if (node.left != null) {",
+        "                    var left = node.left;",
+        "                    if (left.value > node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(left);",
+        "                    }",
+        "                }",
+        "                if (node.right != null) {",
+        "                    var right = node.right;",
+        "                    if (right.value < node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(right);",
+        "                    };",
+        "                };",
+        "            };",
+        "            checkTree(this.root);",
+        "            return check;",
+        "        }",
+        "    }",
+        "};"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8258367417b2b2512c81",
+      "title": "Delete a Node with One Child in a Binary Search Tree",
+      "description": [
+        "Now that we can delete leaf nodes let's move on to the second case: deleting a node with one child. For this case, say we have a tree with the following nodes 1 — 2 — 3 where 1 is the root. To delete 2, we simply need to make the right reference in 1 point to 3. More generally,",
+        "to delete a node with only one child, we make that node's parent reference the next node in the tree.",
+        "Instructions: We've provided some code in our remove method that accomplishes the tasks from the last challenge. We find the target to delete and its parent and define the number of children",
+        "the target node has. Let's add the next case here for target nodes with only one child. Here, we'll have to determine if the single child is a left or right branch in the tree and then set the correct reference in the parent to point to this node. In addition, let's account for the case where the target is the root node (this means the parent node will be null). Feel free to replace all the starter code with your own as long as it passes the tests."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "  this.value = value;",
+        "  this.left = null;",
+        "  this.right = null;",
+        "}",
+        "",
+        "function BinarySearchTree() {",
+        "  this.root = null;",
+        "  this.remove = function(value) {",
+        "    if (this.root === null) {",
+        "      return null;",
+        "    }",
+        "    var target;",
+        "    var parent = null;",
+        "    // find the target value and its parent",
+        "    (function findValue(node = this.root) {",
+        "      if (value == node.value) {",
+        "        target = node;",
+        "      } else if (value < node.value && node.left !== null) {",
+        "        parent = node;",
+        "        return findValue(node.left);",
+        "      } else if (value < node.value && node.left === null) {",
+        "        return null;",
+        "      } else if (value > node.value && node.right !== null) {",
+        "        parent = node;",
+        "        return findValue(node.right);",
+        "      } else {",
+        "        return null;",
+        "      }",
+        "    }).bind(this)();",
+        "    if (target === null) {",
+        "      return null;",
+        "    }",
+        "    // count the children of the target to delete",
+        "    var children = (target.left !== null ? 1 : 0) + (target.right !== null ? 1 : 0);",
+        "    // case 1: target has no children",
+        "    if (children === 0) {",
+        "      if (target == this.root) {",
+        "        this.root = null;",
+        "      }",
+        "      else {",
+        "        if (parent.left == target) {",
+        "          parent.left = null;",
+        "        } else {",
+        "          parent.right = null;",
+        "        }",
+        "      }",
+        "    }",
+        "    // case 2: target has one child, change code below this line",
+        "  };",
+        "}"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.remove == 'function')})(), 'message: The binary search tree has a method called remove.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; return (test.remove(100) == null); })(), 'message: Trying to remove an element that does not exist returns null.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(500); test.remove(500); return (test.inorder() == null); })(), 'message: If the root node has no children, deleting it sets the root to null.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(5); test.add(3); test.add(7); test.add(6); test.add(10); test.add(12); test.remove(3); test.remove(12); test.remove(10); return (test.inorder().join('') == '567'); })(), 'message: The remove method removes leaf nodes from the tree');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(-1); test.add(3); test.add(7); test.add(16); test.remove(16); test.remove(7); test.remove(3); return (test.inorder().join('') == '-1'); })(), 'message: The remove method removes nodes with one child.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(15); test.add(27); test.remove(15); return (test.inorder().join('') == '27'); })(), 'message: Removing the root in a tree with two nodes sets the second to be the root.');"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    },",
+        "    inorder: function() {",
+        "        if (this.root == null) {",
+        "          return null;",
+        "        } else {",
+        "          var result = new Array();",
+        "          function traverseInOrder(node) {",
+        "              if (node.left != null) {",
+        "                  traverseInOrder(node.left);",
+        "              };",
+        "              result.push(node.value);",
+        "              if (node.right != null) {",
+        "                  traverseInOrder(node.right);",
+        "              };",
+        "          }",
+        "          traverseInOrder(this.root);",
+        "          return result;",
+        "        };",
+        "    },    ",
+        "    isBinarySearchTree() {",
+        "        if (this.root == null) {",
+        "            return null;",
+        "        } else {",
+        "            var check = true;",
+        "            function checkTree(node) {",
+        "                if (node.left != null) {",
+        "                    var left = node.left;",
+        "                    if (left.value > node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(left);",
+        "                    }",
+        "                }",
+        "                if (node.right != null) {",
+        "                    var right = node.right;",
+        "                    if (right.value < node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(right);",
+        "                    };",
+        "                };",
+        "            };",
+        "            checkTree(this.root);",
+        "            return check;",
+        "        }",
+        "    }",
+        "};"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8258367417b2b2512c82",
+      "title": "Delete a Node with Two Children in a Binary Search Tree",
+      "description": [
+        "Removing nodes that have two children is the hardest case to implement. Removing a node like this produces two subtrees that are no longer connected to the original tree structure. How can we reconnect them? One method is to find the smallest value in the right subtree of the target node and replace the target node with this value. Selecting the replacement in this way ensures that it is greater than every node in the left subtree it becomes the new parent of but also less than every node in the right subtree it becomes the new parent of.",
+        "Once this replacement is made the replacement node must be removed from the right subtree. Even this operation is tricky because the replacement may be a leaf or it may itself be the parent of a right subtree. If it is a leaf we must remove its parent's reference to it. Otherwise, it must be the right child of the target. In this case, we must replace the target value with the replacement value and make the target reference the replacement's right child.",
+        "Instructions: Let's finish our remove method by handling the third case. We've provided some code again for the first two cases. Add some code now to handle target nodes with two children. Any edge cases to be aware of? What if the tree has only three nodes? Once you are finished this will complete our deletion operation for binary search trees. Nice job, this is a pretty hard problem!"
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "  this.value = value;",
+        "  this.left = null;",
+        "  this.right = null;",
+        "}",
+        "",
+        "function BinarySearchTree() {",
+        "  this.root = null;",
+        "  this.remove = function(value) {",
+        "    if (this.root === null) {",
+        "      return null;",
+        "    }",
+        "    var target;",
+        "    var parent = null;",
+        "    // find the target value and its parent",
+        "    (function findValue(node = this.root) {",
+        "      if (value == node.value) {",
+        "        target = node;",
+        "      } else if (value < node.value && node.left !== null) {",
+        "        parent = node;",
+        "        return findValue(node.left);",
+        "      } else if (value < node.value && node.left === null) {",
+        "        return null;",
+        "      } else if (value > node.value && node.right !== null) {",
+        "        parent = node;",
+        "        return findValue(node.right);",
+        "      } else {",
+        "        return null;",
+        "      }",
+        "    }).bind(this)();",
+        "    if (target === null) {",
+        "      return null;",
+        "    }",
+        "    // count the children of the target to delete",
+        "    var children = (target.left !== null ? 1 : 0) + (target.right !== null ? 1 : 0);",
+        "    // case 1: target has no children",
+        "    if (children === 0) {",
+        "      if (target == this.root) {",
+        "        this.root = null;",
+        "      }",
+        "      else {",
+        "        if (parent.left == target) {",
+        "          parent.left = null;",
+        "        } else {",
+        "          parent.right = null;",
+        "        }",
+        "      }",
+        "    }",
+        "    // case 2: target has one child",
+        "    else if (children == 1) {",
+        "      var newChild = (target.left !== null) ? target.left : target.right;",
+        "      if (parent === null) {",
+        "        target.value = newChild.value;",
+        "        target.left = null;",
+        "        target.right = null;",
+        "      } else if (newChild.value < parent.value) {",
+        "        parent.left = newChild;",
+        "      } else {",
+        "        parent.right = newChild;",
+        "      }",
+        "      target = null;",
+        "    }",
+        "    // case 3: target has two children, change code below this line",
+        "  };",
+        "}"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.remove == 'function')})(), 'message: The binary search tree has a method called remove.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.remove == 'function') ? (test.remove(100) == null) : false})(), 'message: Trying to remove an element that does not exist returns null.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; test.add(500); test.remove(500); return (typeof test.remove == 'function') ? (test.inorder() == null) : false})(), 'message: If the root node has no children, deleting it sets the root to null.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; test.add(5); test.add(3); test.add(7); test.add(6); test.add(10); test.add(12); test.remove(3); test.remove(12); test.remove(10); return (typeof test.remove == 'function') ? (test.inorder().join('') == '567') : false})(), 'message: The remove method removes leaf nodes from the tree');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(-1); test.add(3); test.add(7); test.add(16); test.remove(16); test.remove(7); test.remove(3); return (test.inorder().join('') == '-1'); })(), 'message: The remove method removes nodes with one child.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(15); test.add(27); test.remove(15); return (test.inorder().join('') == '27'); })(), 'message: Removing the root in a tree with two nodes sets the second to be the root.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(1); test.add(4); test.add(3); test.add(7); test.add(9); test.add(11); test.add(14); test.add(15); test.add(19); test.add(50); test.remove(9); if (!test.isBinarySearchTree()) { return false; }; test.remove(11); if (!test.isBinarySearchTree()) { return false; }; test.remove(14); if (!test.isBinarySearchTree()) { return false; }; test.remove(19); if (!test.isBinarySearchTree()) { return false; }; test.remove(3); if (!test.isBinarySearchTree()) { return false; }; test.remove(50); if (!test.isBinarySearchTree()) { return false; }; test.remove(15); if (!test.isBinarySearchTree()) { return false; }; return (test.inorder().join('') == '147'); })(), 'message: The remove method removes nodes with two children while maintaining the binary search tree structure.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.remove !== 'function') { return false; }; test.add(100); test.add(50); test.add(300); test.remove(100); return (test.inorder().join('') == 50300); })(), 'message: The root can be removed on a tree of three nodes.');"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    },",
+        "    inorder: function() {",
+        "        if (this.root == null) {",
+        "          return null;",
+        "        } else {",
+        "          var result = new Array();",
+        "          function traverseInOrder(node) {",
+        "              if (node.left != null) {",
+        "                  traverseInOrder(node.left);",
+        "              };",
+        "              result.push(node.value);",
+        "              if (node.right != null) {",
+        "                  traverseInOrder(node.right);",
+        "              };",
+        "          }",
+        "          traverseInOrder(this.root);",
+        "          return result;",
+        "        };",
+        "    },    ",
+        "    isBinarySearchTree() {",
+        "        if (this.root == null) {",
+        "            return null;",
+        "        } else {",
+        "            var check = true;",
+        "            function checkTree(node) {",
+        "                if (node.left != null) {",
+        "                    var left = node.left;",
+        "                    if (left.value > node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(left);",
+        "                    }",
+        "                }",
+        "                if (node.right != null) {",
+        "                    var right = node.right;",
+        "                    if (right.value < node.value) {",
+        "                        check = false;",
+        "                    } else {",
+        "                        checkTree(right);",
+        "                    };",
+        "                };",
+        "            };",
+        "            checkTree(this.root);",
+        "            return check;",
+        "        }",
+        "    }",
+        "};"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8259367417b2b2512c83",
+      "title": "Invert a Binary Tree",
+      "description": [
+        "Here will we create a function to invert a binary tree. Given a binary tree, we want to produce a new tree that is equivalently the mirror image of this tree. Running an inorder traversal on an inverted tree will explore the nodes in reverse order when compared to the inorder traversal of the original tree. Write a method to do this called invert on our binary tree. Calling this method should invert the current tree structure. Ideally, we would like to do this in-place in linear time. That is, we only visit each node once and we modify the existing tree structure as we go, without using any additional memory. Good luck!"
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "function Node(value) {",
+        "    this.value = value;",
+        "    this.left = null;",
+        "    this.right = null;",
+        "}",
+        "function BinarySearchTree() {",
+        "    this.root = null;",
+        "    // change code below this line",
+        "    // change code above this line",
+        "}"
+      ],
+      "tail": [
+        "BinarySearchTree.prototype = {",
+        "    add: function(value) {",
+        "        var node = this.root;",
+        "        if (node == null) {",
+        "          this.root = new Node(value);",
+        "          return;",
+        "        } else {",
+        "            function searchTree(node) {",
+        "                if (value < node.value) {",
+        "                    if (node.left == null) {",
+        "                        node.left = new Node(value);",
+        "                        return;",
+        "                    } else if (node.left != null) {",
+        "                        return searchTree(node.left)",
+        "                    };",
+        "                } else if (value > node.value) {",
+        "                    if (node.right == null) {",
+        "                        node.right = new Node(value);",
+        "                        return;",
+        "                    } else if (node.right != null) {",
+        "                        return searchTree(node.right);",
+        "                    };",
+        "                } else {",
+        "                    return null;",
+        "                };",
+        "            };",
+        "            return searchTree(node);",
+        "        };",
+        "    },",
+        "    inorder: function() {",
+        "        if (this.root == null) {",
+        "          return null;",
+        "        } else {",
+        "          var result = new Array();",
+        "          function traverseInOrder(node) {",
+        "              if (node.left != null) {",
+        "                  traverseInOrder(node.left);",
+        "              };",
+        "              result.push(node.value);",
+        "              if (node.right != null) {",
+        "                  traverseInOrder(node.right);",
+        "              };",
+        "          }",
+        "          traverseInOrder(this.root);",
+        "          return result;",
+        "        };",
+        "    }",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() }; return (typeof test == 'object')})(), 'message: The BinarySearchTree data structure exists.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; return (typeof test.invert == 'function')})(), 'message: The binary search tree has a method called invert.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.invert !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); test.invert(); return test.inorder().join('') == '877345348741'; })(), 'message: The invert method correctly inverts the tree structure.');",
+        "assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.invert !== 'function') { return false; }; return (test.invert() == null); })(), 'message: Inverting an empty tree returns null.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8259367417b2b2512c84",
+      "title": "Create a Trie Search Tree",
+      "description": [
+        "Here we will move on from binary search trees and take a look at another type of tree structure called a trie. A trie is an ordered search tree commonly used to hold strings, or more generically associative arrays or dynamic datasets in which the keys are strings. They are very good at storing sets of data when many keys will have overlapping prefixes, for example, all",
+        "the words in a dictionary.",
+        "Unlike a binary tree, nodes are not associated with actual values. Instead, the path to a node represents a specific key. For instance, if we wanted to store the string code in a trie, we would have four nodes, one for each letter: c — o — d — e. Following that path through all these nodes will then create code as a string — that path is the key we stored. Then, if we wanted to add the string coding, it would share the first three nodes of code before branching away after the d. In this way, large datasets can be stored very compactly. In addition, search can be very quick because it is effectively limited to the length of the string you are storing. Furthermore, unlike binary trees a node can store any number of child nodes.",
+        "As you might have guessed from the above example, some metadata is commonly stored at nodes that hold the end of a key so that on later traversals that key can still be retrieved. For instance, if we added codes in our example above we would need some way to know that the e in code represents the end of a key that was previously entered. Otherwise, this information would effectively be lost when we add codes.",
+        "Instructions: Let's create a trie to store words. It will accept words through an add method and store these in a trie data structure. It will also allow us to query if a given string is a word with an isWord method, and retrieve all the words entered into the trie with a print method. isWord should return a",
+        "boolean value and print should return an array of all these words as string values.",
+        "In order for us to verify that this data structure is implemented correctly, we've provided a Node structure for each node in the tree. Each node will be an object with a keys property which is a JavaScript Map object. This will hold the individual letters that are valid keys of each node. We've also",
+        "created an end property on the nodes that can be set to true if the node represents the termination of a word."
+      ],
+      "challengeSeed": [
+        "var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));",
+        "var Node = function() {",
+        "  this.keys = new Map();",
+        "  this.end = false;",
+        "  this.setEnd = function() {",
+        "    this.end = true;",
+        "  };",
+        "  this.isEnd = function() {",
+        "    return this.end;",
+        "  };",
+        "};",
+        "var Trie = function() {",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function testTrie() { var test = false; if (typeof Trie !== 'undefined') { test = new Trie() } else { return false; }; return (typeof test.add == 'function') }()), 'message: The Trie has an add method.');",
+        "assert((function testTrie() { var test = false; if (typeof Trie !== 'undefined') { test = new Trie() } else { return false; }; return (typeof test.print == 'function') }()), 'message: The Trie has a print method.');",
+        "assert((function testTrie() { var test = false; if (typeof Trie !== 'undefined') { test = new Trie() } else { return false; }; return (typeof test.isWord == 'function') }()), 'message: The Trie has an isWord method.');",
+        "assert((function testTrie() { var test = false; if (typeof Trie !== 'undefined') { test = new Trie() } else { return false; }; test.add('jump'); test.add('jumps'); test.add('jumped'); test.add('house'); test.add('mouse'); var added = test.print(); return (added.indexOf('jump') != -1 && added.indexOf('jumps') != -1 && added.indexOf('jumped') != -1 && added.indexOf('house') != -1 && added.indexOf('mouse') != -1 && added.length == 5); }()), 'message: The print method returns all items added to the trie as strings in an array.');",
+        "assert((function testTrie() { var test = false; if (typeof Trie !== 'undefined') { test = new Trie() } else { return false; }; test.add('hop'); test.add('hops'); test.add('hopped'); test.add('hoppy'); test.add('hope'); return (test.isWord('hop') && !test.isWord('ho') && test.isWord('hopped') && !test.isWord('hopp') && test.isWord('hoppy') && !test.isWord('hoping')); }()), 'message: The isWord method returns true only for words added to the trie and false for all other words.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825a367417b2b2512c8a",
+      "title": "Insert an Element into a Max Heap",
+      "description": [
+        "Now we will move on to another tree data structure, the binary heap. A binary heap is a partially ordered binary tree which satisfies the heap property. The heap property specifies a relationship between parent and child nodes. You may have a max heap, in which all parent nodes are greater than or equal to their child nodes, or a min heap, in which the reverse is true. Binary heaps are also complete binary trees. This means that all levels of the tree are fully filled and if the last level is partially filled it is filled from left to right.",
+        "While binary heaps may be implemented as tree structures with nodes that contain left and right references, the partial ordering according to the heap property allows us to represent the heap with an array. The parent-children relationship is what we're interested in and with simple arithmetic we can compute the children of any parent and the parent of any child node.",
+        "For instance, consider this array representation of a binary max heap:",
+        "<code>[ 76, 63, 48, 42, 37, 6, 42, 22 ]</code>",
+        "The root node is the first element, 6. Its children are 22 and 30. If we look at the relationship between the array indices of these values, for index i the children are 2 * i + 1 and 2 * i + 2. Similarly, the element at index 0 is the parent of these two children at indices 1 and 2. More generally, we can find the parent of a node at any index with the following: i - 1 / 2. These patterns will hold true as the binary tree grows to any size. Finally, we can make a slight adjustment to make this arithmetic even easier by skipping the first element in the array. Doing this creates the following relationship for any element at a given index i:",
+        "Example Array representation: <code>[ null, 76, 63, 48, 42, 37, 6, 42, 22 ]</code>",
+        "An element's left child: i * 2",
+        "An element's right child: i * 2 + 1",
+        "An element's parent: i / 2",
+        "Once you wrap your head around the math, using an array representation is very useful because node locations can be quickly determined with this arithmetic and memory usage is diminished because you don't need to maintain references to child nodes.",
+        "Instructions: Here we will create a max heap. Start by just creating an insert method which adds elements to our heap. During insertion, it is important to always maintain the heap property. For a max heap this means the root element should always have the greatest value in the tree and all parent nodes should be greater than their children. For an array implementation of a heap, this is typically accomplished in three steps:",
+        "Add the new element to the end of the array.",
+        "If the element is larger than its parents, switch them.",
+        "Continue switching until the new element is either smaller than its parent or you reach the root of the tree.",
+        "Finally, add a print method which returns an array of all the items that have been added to the heap."
+      ],
+      "challengeSeed": [
+        "var MaxHeap = function() {",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() }; return (typeof test == 'object')})(), 'message: The MaxHeap data structure exists.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; return (typeof test.insert == 'function')})(), 'message: MaxHeap has a method called insert.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; return (typeof test.print == 'function')})(), 'message: MaxHeap has a method called print.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; test.insert(50); test.insert(100); test.insert(700); test.insert(32); test.insert(51); let result = test.print(); return ((result.length == 5) ? result[0] == 700 : result[1] == 700) })(), 'message: The insert method adds elements according to the max heap property.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825b367417b2b2512c8b",
+      "title": "Remove an Element from a Max Heap",
+      "description": [
+        "Now that we can add elements to our heap let's see how we can remove elements. Removing and inserting elements both require similar logic. In a max heap you will usually want to remove the greatest value, so this involves simply extracting it from the root of our tree. This will break the heap property of our tree, so we must reestablish it in some way. Typically, for a max heap this is done in the following way:",
+        "Move the last element in the heap into the root position.",
+        "If either child of the root is greater than it, swap the root with the child of greater value.",
+        "Continue swapping until the parent is greater than both children, or you reach the last level in the tree.",
+        "Instructions: Add a method to our max heap called remove. This method should return the greatest value that has been added to our max heap and remove it from the heap. It should also reorder the heap so the heap property is maintained. After removing an element, the next greatest element remaining in the heap should become the root. Add your insert method again here as well."
+      ],
+      "challengeSeed": [
+        "var MaxHeap = function() {",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() }; return (typeof test == 'object')})(), 'The MaxHeap data structure exists.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; return (typeof test.print == 'function')})(), 'MaxHeap has a method called print.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; return (typeof test.insert == 'function')})(), 'MaxHeap has a method called insert.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; return (typeof test.remove == 'function')})(), 'MaxHeap has a method called remove.');",
+        "assert((function() { var test = false; if (typeof MaxHeap !== 'undefined') { test = new MaxHeap() } else { return false; }; test.insert(30); test.insert(300); test.insert(500); test.insert(10); let result = []; result.push(test.remove()); result.push(test.remove()); result.push(test.remove()); result.push(test.remove());  return (result.join('') == '5003003010') })(), 'The remove method removes the greatest element from the max heap while maintaining the max heap property.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825b367417b2b2512c8c",
+      "title": "Implement Heap Sort with a Min Heap",
+      "description": [
+        "Now that we can add and remove elements let's see some of the applications heaps can be used for. Heaps are commonly used to implement priority queues because they always store an item of greatest or least value in first position. In addition, they are used to implement a sorting algorithm called heap sort. We'll see how to do this here. Heap sort uses a min heap, the reverse of a max heap. A min heap always stores the element of least value in the root position.",
+        "Heap sort works by taking an unsorted array, adding each item in the array into a min heap, and then extracting every item out of the min heap into a new array. The min heap structure ensures that the new array will contain the original items in least to greatest order. This is one of the most efficient sorting algorithms with average and worst case performance of O(nlog(n)).",
+        "Instructions: Let's implement heap sort with a min heap. Feel free to adapt your max heap code here. Create an object MinHeap with insert, remove, and sort methods. The sort method should return an array of all the elements in the min heap sorted from smallest to largest."
+      ],
+      "challengeSeed": [
+        "// check if array is sorted",
+        "function isSorted(arr) {",
+        "  var check = (i) => (i == arr.length - 1) ? true : (arr[i] > arr[i + 1]) ? false : check(i + 1);",
+        "  return check(0);",
+        "}",
+        "// generate a randomly filled array",
+        "var array = new Array();",
+        "(function createArray(size = 5) {",
+        "  array.push(+(Math.random() * 100).toFixed(0));",
+        "  return (size > 1) ? createArray(size - 1) : undefined;",
+        "})(25);",
+        "var MinHeap = function() {",
+        "  // change code below this line",
+        "  // change code above this line",
+        "};"
+      ],
+      "tests": [
+        "assert((function() { var test = false; if (typeof MinHeap !== 'undefined') { test = new MinHeap() }; return (typeof test == 'object')})(), 'message: The MinHeap data structure exists.');",
+        "assert((function() { var test = false; if (typeof MinHeap !== 'undefined') { test = new MinHeap() } else { return false; }; return (typeof test.insert == 'function')})(), 'message: MinHeap has a method called insert.');",
+        "assert((function() { var test = false; if (typeof MinHeap !== 'undefined') { test = new MinHeap() } else { return false; }; return (typeof test.remove == 'function')})(), 'message: MinHeap has a method called remove.');",
+        "assert((function() { var test = false; if (typeof MinHeap !== 'undefined') { test = new MinHeap() } else { return false; }; return (typeof test.sort == 'function')})(), 'message: MinHeap has a method called sort.');",
+        "assert((function() { var test = false; if (typeof MinHeap !== 'undefined') { test = new MinHeap() } else { return false; }; test.insert(3); test.insert(12); test.insert(5); test.insert(10); test.insert(1); test.insert(27); test.insert(42); test.insert(57); test.insert(5); var result = test.sort(); return (isSorted(result)); })(), 'message: The sort method returns an array containing all items added to the min heap in sorted order.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8255367417b2b2512c76",
+      "title": "Introduction to Graphs",
+      "description": [
+        [
+          "//i.stack.imgur.com/XfuFe.gif",
+          "Picture of an X-Y coordinate graph seen in typical math classes",
+          "This challenge starts a series of challenges that will teach graph data structures and some algorithms involving graphs. You may be familiar with graphs with an x- and y-axis found in your math classes. However, here graphs mean a different thing.",
+          ""
+        ],
+        [
+          "//upload.wikimedia.org/wikipedia/commons/5/5b/6n-graf.svg",
+          "Figure of undirected network with 6 nodes",
+          "The data structure of <dfn>graphs</dfn> are collections of things and the relationships or connections among them. Graphs are also known as networks.<br><br>When talking about graphs, the precise term for \"objects\" are <dfn>nodes</dfn> or <dfn>vertices</dfn>. Similarly, the precise term for \"connections\" is <dfn>edges</dfn>.",
+          ""
+        ],
+        [
+          "//upload.wikimedia.org/wikipedia/commons/b/b6/Moreno_Sociogram_2nd_Grade.png",
+          "Figure of psychologist Moreno's social network of a 2nd grade class",
+          "One example of graphs is a social network where the <dfn>nodes</dfn> are you and other people, and the edges are whether two people are friends with each other.",
+          ""
+        ],
+        [
+          "//i.stack.imgur.com/5xkVt.png",
+          "Figures of directed graphs with arrows on edges while undirected graphs do not have directions on edges",
+          "There are two major types of graphs: <dfn>directed</dfn> and <dfn>undirected</dfn>. Undirected graphs are graphs without any direction on the edges between nodes. Directed graphs, in contrast, are graphs with a direction in its edges.<br><br>An example of an undirected graph could be a social network. The nodes are people and the edges are friendship. An example of a directed network could be the internet and web page links. Here, the nodes are web pages and the directed edges are links to other pages, which might not necessarily point the other way.",
+          ""
+        ]
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [],
+      "challengeType": 7,
+      "translations": {}
+    },
+    {
+      "id": "587d8256367417b2b2512c77",
+      "title": "Adjacency List",
+      "description": [
+        "Graphs can be represented in different ways. Here we describe one way, which is called an <dfn>adjacency list</dfn>.",
+        "An adjacency list is essentially a bulleted list where the left side is the node and the right side lists all the other nodes it's connected to. Below is a representation of an adjacency list.",
+        "<blockquote>Node1: Node2, Node3<br>Node2: Node1<br>Node3: Node1</blockquote>",
+        "Above is an undirected graph because <code>Node1</code> is connected to <code>Node2</code> and <code>Node3</code>, and that information is consistent with the connections <code>Node2</code> and <code>Node3</code> show. An adjacency list for a directed graph would mean each row of the list shows direction. If the above was directed, then <code>Node2: Node1</code> would mean there the directed edge is pointing from <code>Node2</code> towards <code>Node1</code>.",
+        "We can represent the undirected graph above as an adjacency list by putting it within a JavaScript object.",
+        "<blockquote>var undirectedG = {<br>  Node1: [\"Node2\", \"Node3\"],<br>  Node2: [\"Node1\"],<br>  Node3: [\"Node1\"]<br>};</blockquote>",
+        "This can also be more simply represented as an array where the nodes just have numbers rather than string labels.",
+        "<blockquote>var undirectedGArr = [<br>  [1, 2], # Node1<br>  [0],    # Node2<br>  [0]     # Node3<br>];</blockquote>",
+        "<hr>",
+        "Create a social network as an undirected graph with 4 nodes/people named <code>James</code>, <code>Jill</code>, <code>Jenny</code>, and <code>Jeff</code>. There are edges/relationships between James and Jeff, Jill and Jenny, and Jeff and Jenny."
+      ],
+      "challengeSeed": [
+        "var undirectedAdjList = {",
+        "};"
+      ],
+      "tests": [
+        "assert(Object.keys(undirectedAdjList).length === 4, 'message: <code>undirectedAdjList</code> should only contain four nodes.');",
+        "assert(undirectedAdjList.James.indexOf(\"Jeff\") !== -1 && undirectedAdjList.Jeff.indexOf(\"James\") !== -1, 'message: There should be an edge between <code>Jeff</code> and <code>James</code>.');",
+        "assert(undirectedAdjList.Jill.indexOf(\"Jenny\") !== -1 && undirectedAdjList.Jill.indexOf(\"Jenny\") !== -1, 'message: There should be an edge between <code>Jill</code> and <code>Jenny</code>.');",
+        "assert(undirectedAdjList.Jeff.indexOf(\"Jenny\") !== -1 && undirectedAdjList.Jenny.indexOf(\"Jeff\") !== -1, 'message: There should be an edge between <code>Jeff</code> and <code>Jenny</code>.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "var undirectedAdjList = {\n\"James\": [\"Jeff\"],\"Jill\": [\"Jenny\"],\"Jenny\": [\"Jill\", \"Jeff\"],\n\"Jeff\": [\"James\", \"Jenny\"]\n};"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8256367417b2b2512c78",
+      "title": "Adjacency Matrix",
+      "description": [
+        "Another way to represent a graph is to put it in an <dfn>adjacency matrix</dfn>.",
+        "An <dfn>adjacency matrix</dfn> is a two-dimensional (2D) array where each nested array has the same number of elements as the outer array. In other words, it is a matrix or grid of numbers, where the numbers represent the edges. Zeros mean there is no edge or relationship.",
+        "<blockquote>    1 2 3<br>   ------<br>1 | 0 1 1<br>2 | 1 0 0<br>3 | 1 0 0</blockquote>",
+        "Above is a very simple, undirected graph where you have three nodes, where the first node is connected to the second and third node. <strong>Note</strong>: The numbers to the top and left of the matrix are just labels for the nodes.",
+        "Below is a JavaScript implementation of the same thing.",
+        "<blockquote>var adjMat = [<br>  [0, 1, 1],<br>  [1, 0, 0],<br>  [1, 0, 0]<br>];</blockquote>",
+        "Unlike an adjacency list, each \"row\" of the matrix has to have the same number of elements as nodes in the graph. Here we have a three by three matrix, which means we have three nodes in our graph.",
+        "A directed graph would look similar. Below is a graph where the first node has an edge pointing toward the second node, and then the second node has an edge pointing to the third node.",
+        "<blockquote>var adjMatDirected = [<br>  [0, 1, 0],<br>  [0, 0, 1],<br>  [0, 0, 0]<br>];</blockquote>",
+        "Graphs can also have <dfn>weights</dfn> on their edges. So far, we have <dfn>unweighted</dfn> edges where just the presence and lack of edge is binary (<code>0</code> or <code>1</code>). You can have different weights depending on your application.",
+        "<hr>",
+        "Create an adjacency matrix of an undirected graph with five nodes. This matrix should be in a multi-dimensional array. These five nodes have relationships between the first and fourth node, the first and third node, the third and fifth node, and the fourth and fifth node. All edge weights are one."
+      ],
+      "challengeSeed": [
+        "var adjMatUndirected = [",
+        "];"
+      ],
+      "tests": [
+        "assert((adjMatUndirected.length === 5) && adjMatUndirected.map(function(x) { return x.length === 5 }).reduce(function(a, b) { return a && b }) , 'message: <code>undirectedAdjList</code> should only contain five nodes.');",
+        "assert((adjMatUndirected[0][3] === 1) && (adjMatUndirected[3][0] === 1), 'message: There should be an edge between the first and fourth node.');",
+        "assert((adjMatUndirected[0][2] === 1) && (adjMatUndirected[2][0] === 1), 'message: There should be an edge between the first and third node.');",
+        "assert((adjMatUndirected[2][4] === 1) && (adjMatUndirected[4][2] === 1), 'message: There should be an edge between the third and fifth node.');",
+        "assert((adjMatUndirected[3][4] === 1) && (adjMatUndirected[4][3] === 1), 'message: There should be an edge between the fourth and fifth node.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "var adjMatUndirected = [[0, 0, 1, 1, 0],[0, 0, 0, 0, 0],[1, 0, 0, 0, 1],[1, 0, 0, 0, 1],[0, 0, 1, 1, 0]];"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d8256367417b2b2512c79",
+      "title": "Incidence Matrix",
+      "description": [
+        "Yet another way to represent a graph is to put it in an <dfn>incidence matrix.</dfn>",
+        "An <dfn>incidence matrix</dfn> is a two-dimensional (2D) array. Generally speaking, an incidence matrix relates two different classes of objects between its two dimensions. This kind of matrix is similar to an adjacency matrix. However, the rows and columns mean something else here.",
+        "In graphs, we have edges and nodes. These will be our \"two different classes of objects\". This matrix will have the rows be the nodes and columns be the edges. This means that we can have an uneven number of rows and columns.",
+        "Each column will represent a unique edge. Also, each edge connects two nodes. To show that there is an edge between two nodes, you will put a 1 in the two rows of a particular column. Below is a 3 node graph with one edge between node 1 and node 3.",
+        "<blockquote>    1<br>   ---<br>1 | 1<br>2 | 0<br>3 | 1</blockquote>",
+        "Here is an example of an <code>incidence matrix</code> with 4 edges and 4 nodes. Remember, the columns are the edges and rows are the nodes themselves.",
+        "<blockquote>    1 2 3 4<br>   --------<br>1 | 0 1 1 1<br>2 | 1 1 0 0<br>3 | 1 0 0 1<br>4 | 0 0 1 0</blockquote>",
+        "Below is a JavaScript implementation of the same thing.",
+        "<blockquote>var incMat = [<br>  [0, 1, 1, 1],<br>  [1, 1, 0, 0],<br>  [1, 0, 0, 1],<br>  [0, 0, 1, 0]<br>];</blockquote>",
+        "To make a directed graph, use <code>-1</code> for an edge leaving a particular node and <code>1</code> for an edge entering a node.",
+        "<blockquote>var incMatDirected = [<br>  [ 0, -1,  1, -1],<br>  [-1,  1,  0,  0],<br>  [ 1,  0,  0,  1],<br>  [ 0,  0, -1,  0]<br>];</blockquote>",
+        "Graphs can also have <dfn>weights</dfn> on their edges. So far, we have <dfn>unweighted</dfn> edges where just the presence and lack of edge is binary (<code>0</code> or <code>1</code>). You can have different weights depending on your application. A different weight is represented as numbers greater than 1.",
+        "<hr>",
+        "Create an incidence matrix of an undirected graph with five nodes and four edges. This matrix should be in a multi-dimensional array.",
+        "These five nodes have relationships following relationships. The first edge is between the first and second node. The second edge is between the second and third node. The third edge is between the third and fifth node. And four edge is between the fourth and second node. All edge weights are one and the edge order matters."
+      ],
+      "challengeSeed": [
+        "var incMatUndirected = [",
+        "  ",
+        "];"
+      ],
+      "tests": [
+        "assert((incMatUndirected.length === 5) && incMatUndirected.map(function(x) { return x.length === 4 }).reduce(function(a, b) { return a && b }) , 'message: <code>incMatUndirected</code> should only contain five nodes.');",
+        "assert((incMatUndirected[0][0] === 1) && (incMatUndirected[1][0] === 1), 'message: There should be a first edge between the first and second node.');",
+        "assert((incMatUndirected[1][1] === 1) && (incMatUndirected[2][1] === 1), 'message: There should be a second edge between the second and third node.');",
+        "assert((incMatUndirected[2][2] === 1) && (incMatUndirected[4][2] === 1), 'message: There should be a third edge between the third and fifth node.');",
+        "assert((incMatUndirected[1][3] === 1) && (incMatUndirected[3][3] === 1), 'message: There should be a fourth edge between the second and fourth node.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "var incMatUndirected = [[1, 0, 0, 0],[1, 1, 0, 1],[0, 1, 1, 0],[0, 0, 0, 1],[0, 0, 1, 0]];"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825c367417b2b2512c90",
+      "title": "Breadth-First Search",
+      "description": [
+        "So far, we've learned different ways of creating representations of graphs. What now? One natural question to have is what are the distances between any two nodes in the graph? Enter <dfn>graph traversal algorithms</dfn>.",
+        "<dfn>Traversal algorithms</dfn> are algorithms to traverse or visit nodes in a graph. One type of traversal algorithm is the breadth-first search algorithm.",
+        "This algorithm starts at one node, first visits all its neighbors that are one edge away, then goes on to visiting each of their neighbors.",
+        "Visually, this is what the algorithm is doing.",
+        "<img class='img-responsive' src='https://camo.githubusercontent.com/2f57e6239884a1a03402912f13c49555dec76d06/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f342f34362f416e696d617465645f4246532e676966'>",
+        "To implement this algorithm, you'll need to input a graph structure and a node you want to start at.",
+        "First, you'll want to be aware of the distances from the start node. This you'll want to start all your distances initially some large number, like <code>Infinity</code>. This gives a reference for the case where a node may not be reachable from your start node.",
+        "Next, you'll want to go from the start node to its neighbors. These neighbors are one edge away and at this point you should add one unit of distance to the distances you're keeping track of.",
+        "Last, an important data structure that will help implement the breadth-first search algorithm is the queue. This is an array where you can add elements to one end and remove elements from the other end. This is also known as a <dfn>FIFO</dfn> or <dfn>First-In-First-Out</dfn> data structure.",
+        "<hr>",
+        "Write a function <code>bfs()</code> that takes an adjacency matrix graph (a two-dimensional array) and a node label root as parameters. The node label will just be the integer value of the node between <code>0</code> and <code>n - 1</code>, where <code>n</code> is the total number of nodes in the graph.",
+        "Your function will output a JavaScript object key-value pairs with the node and its distance from the root. If the node could not be reached, it should have a distance of <code>Infinity</code>."
+      ],
+      "challengeSeed": [
+        "function bfs(graph, root) {",
+        "  // Distance object returned",
+        "  var nodesLen = {};",
+        "  ",
+        "  return nodesLen;",
+        "};",
+        "",
+        "var exBFSGraph = [",
+        "  [0, 1, 0, 0],",
+        "  [1, 0, 1, 0],",
+        "  [0, 1, 0, 1],",
+        "  [0, 0, 1, 0]",
+        "];",
+        "console.log(bfs(exBFSGraph, 3));"
+      ],
+      "tests": [
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]; var results = bfs(graph, 1); return isEquivalent(results, {0: 1, 1: 0, 2: 1, 3: 2})})(), 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>1</code> should return <code>{0: 1, 1: 0, 2: 1, 3: 2}</code>');",
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]; var results = bfs(graph, 1); return isEquivalent(results, {0: 1, 1: 0, 2: 1, 3: Infinity})})(), 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]</code> with a start node of <code>1</code> should return <code>{0: 1, 1: 0, 2: 1, 3: Infinity}</code>');",
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]; var results = bfs(graph, 0); return isEquivalent(results, {0: 0, 1: 1, 2: 2, 3: 3})})(), 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>0</code> should return <code>{0: 0, 1: 1, 2: 2, 3: 3}</code>');",
+        "assert((function() { var graph = [[0, 1], [1, 0]]; var results = bfs(graph, 0); return isEquivalent(results, {0: 0, 1: 1})})(), 'message: The input graph <code>[[0, 1], [1, 0]]</code> with a start node of <code>0</code> should return <code>{0: 0, 1: 1}</code>');"
+      ],
+      "tail": [
+        "// Source: http://adripofjavascript.com/blog/drips/object-equality-in-javascript.html",
+        "function isEquivalent(a, b) {",
+        "    // Create arrays of property names",
+        "    var aProps = Object.getOwnPropertyNames(a);",
+        "    var bProps = Object.getOwnPropertyNames(b);",
+        "    // If number of properties is different,",
+        "    // objects are not equivalent",
+        "    if (aProps.length != bProps.length) {",
+        "        return false;",
+        "    }",
+        "    for (var i = 0; i < aProps.length; i++) {",
+        "        var propName = aProps[i];",
+        "        // If values of same property are not equal,",
+        "        // objects are not equivalent",
+        "        if (a[propName] !== b[propName]) {",
+        "            return false;",
+        "        }",
+        "    }",
+        "    // If we made it this far, objects",
+        "    // are considered equivalent",
+        "    return true;",
+        "}"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function bfs(graph, root) {\n// Distance object returned\nvar nodesLen = {};\n// Set all distances to infinity\nfor (var i = 0; i < graph.length; i++) {\nnodesLen[i] = Infinity;\n}\nnodesLen[root] = 0; // ...except root node\nvar queue = [root]; // Keep track of nodes to visit\nvar current; // Current node traversing\n// Keep on going until no more nodes to traverse\nwhile (queue.length !== 0) {\ncurrent = queue.shift();\n// Get adjacent nodes from current node\nvar curConnected = graph[current]; // Get layer of edges from current\nvar neighborIdx = []; // List of nodes with edges\nvar idx = curConnected.indexOf(1); // Get first edge connection\nwhile (idx !== -1) {\nneighborIdx.push(idx); // Add to list of neighbors\nidx = curConnected.indexOf(1, idx + 1); // Keep on searching\n}\n// Loop through neighbors and get lengths\nfor (var j = 0; j < neighborIdx.length; j++) {\n// Increment distance for nodes traversed\nif (nodesLen[neighborIdx[j]] === Infinity) {\nnodesLen[neighborIdx[j]] = nodesLen[current] + 1;\nqueue.push(neighborIdx[j]); // Add new neighbors to queue\n}\n}\n}\nreturn nodesLen;}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    },
+    {
+      "id": "587d825d367417b2b2512c96",
+      "title": "Depth-First Search",
+      "description": [
+        "Similar to <dfn>breadth-first search</dfn>, here we will learn about another graph traversal algorithm called <dfn>depth-first search</dfn>.",
+        "Whereas the breadth-first search searches incremental edge lengths away from the source node, <dfn>depth-first search</dfn> first goes down a path of edges as far as it can.",
+        "Once it reaches one end of a path, the search will backtrack to the last node with an un-visited edge path and continue searching.",
+        "Visually, this is what the algorithm is doing where the top node is the starting point of the search.",
+        "<img class='img-responsive' src='https://camo.githubusercontent.com/aaad9e39961daf34d967c616edeb50abf3bf1235/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f372f37662f44657074682d46697273742d5365617263682e676966'>",
+        "A simple output of this algorithm is a list of nodes which are reachable from a given node. So when implementing this algorithm, you'll need to keep track of the nodes you visit.",
+        "<hr>",
+        "Write a function <code>dfs()</code> that takes an undirected, adjacency matrix <code>graph</code> and a node label <code>root</code> as parameters. The node label will just be the numeric value of the node between <code>0</code> and <code>n - 1</code>, where <code>n</code> is the total number of nodes in the graph.",
+        "Your function should output an array of all nodes reachable from <code>root</code>."
+      ],
+      "challengeSeed": [
+        "function dfs(graph, root) {",
+        "  ",
+        "}",
+        "",
+        "var exDFSGraph = [",
+        "  [0, 1, 0, 0],",
+        "  [1, 0, 1, 0],",
+        "  [0, 1, 0, 1],",
+        "  [0, 0, 1, 0]",
+        "];",
+        "console.log(dfs(exDFSGraph, 3));"
+      ],
+      "tests": [
+        "assert.sameMembers((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]; return dfs(graph, 1);})(), [0, 1, 2, 3], 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>1</code> should return an array with <code>0</code>, <code>1</code>, <code>2</code>, and <code>3</code>.');",
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]; return dfs(graph, 1);})().length === 4, 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>1</code> should return an array with four elements.');",
+        "assert.sameMembers((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]; return dfs(graph, 3);})(), [3], 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]</code> with a start node of <code>3</code> should return an array with <code>3</code>.');",
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]; return dfs(graph, 3);})().length === 1, 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 1, 0], [0, 1, 0, 0], [0, 0, 0, 0]]</code> with a start node of <code>3</code> should return an array with one element.');",
+        "assert.sameMembers((function() { var graph = [[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]; return dfs(graph, 3);})(), [2, 3], 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>3</code> should return an array with <code>2</code> and <code>3</code>.');",
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]; return dfs(graph, 3);})().length === 2, 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>3</code> should return an array with two elements.');",
+        "assert.sameMembers((function() { var graph = [[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]; return dfs(graph, 0);})(), [0, 1], 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>0</code> should return an array with <code>0</code> and <code>1</code>.');",
+        "assert((function() { var graph = [[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]; return dfs(graph, 0);})().length === 2, 'message: The input graph <code>[[0, 1, 0, 0], [1, 0, 0, 0], [0, 0, 0, 1], [0, 0, 1, 0]]</code> with a start node of <code>0</code> should return an array with two elements.');"
+      ],
+      "type": "waypoint",
+      "releasedOn": "Feb 17, 2017",
+      "solutions": [
+        "function dfs(graph, root) { var stack = []; var tempV; var visited = []; var tempVNeighbors = []; stack.push(root); while (stack.length > 0) { tempV = stack.pop(); if (visited.indexOf(tempV) == -1) { visited.push(tempV); tempVNeighbors = graph[tempV]; for (var i = 0; i < tempVNeighbors.length; i++) { if (tempVNeighbors[i] == 1) { stack.push(i); }}}} return visited;}"
+      ],
+      "challengeType": 1,
+      "translations": {}
+    }
+  ]
+}
diff --git a/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/javascript-multiple-choice-questions.json b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/javascript-multiple-choice-questions.json
new file mode 100644
index 0000000000..5baca9cd39
--- /dev/null
+++ b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/javascript-multiple-choice-questions.json
@@ -0,0 +1,112 @@
+{
+  "name": "JavaScript Multiple Choice Questions",
+  "order": 8,
+  "time": "",
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "id": "59874fc749228906236a3275",
+      "title": "Array.prototype.map",
+      "description": [
+        {
+          "subtitle": "Flooring an Array",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = [1.32, 2.43, 3.9]\n  .map(Math.floor);\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>1.32 2.43 3.9</code></pre>",
+            "<pre><code class='language-javascript'>['1.32', '2.43', '3.9']</code></pre>",
+            "<pre><code class='language-javascript'>[1, 2, 3]</code></pre>",
+            "<pre><code class='language-javascript'>'1 2 3'</code></pre>"
+          ],
+          "answer": 2,
+          "explanation": "The map function takes a callback function as it's first parameter and applies that function against every value inside the array.  In this example, our callback function is the <code>Math.floor</code> function which will truncate the decimal points of all the numbers and convert them to integers."
+        },
+        {
+          "subtitle": "Custom Map Functions",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = ['a', 'b', 'c']\n  .map(a => [a.toUpperCase()]);\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>[['A'], ['B'], ['C']]</code></pre>",
+            "<pre><code class='language-javascript'>['A', 'B', 'C']</code></pre>",
+            "<pre><code class='language-javascript'>['a', 'b', 'c]</code></pre>",
+            "<pre><code class='language-javascript'>'ABC'</code></pre>"
+          ],
+          "answer": 0,
+          "explanation": "The map function will return a new array with each element equal to the old element ran through a callback function.  Our callback function takes our original element, changes it to a upper case, and then wraps it in an array; thus, leaving us with <code>[['A', 'B', 'C']]</code>"
+        },
+        {
+          "subtitle": "Maps on Maps",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = [[4, 1], [2, 0], [3, 3]]\n  .map(a => \n    a.map(b => b % 2)[0] + a.map(b => b - 1)[1]\n  )\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>[[0, 1], [0, 0], [1, 1]]</code></pre>",
+            "<pre><code class='language-javascript'>[[0, 0], [0, -1], [1, 2]]</code></pre>",
+            "<pre><code class='language-javascript'>[1, 1, 2]</code></pre>",
+            "<pre><code class='language-javascript'>[0, -1, 3]</code></pre>"
+          ],
+          "answer": 3,
+          "explanation": "This answer can be explained by first looking at the example of what happens with the first element in our array, <code>[4, 1]</code>.  Our first map callback will run a mod 2 map function over <code>[4, 1]</code> leaving us with a new array of <code>[0, 1]</code>.  The second map call which is inside our callback will subtract 1 from every element, leaving us with <code>[3, 0]</code>.  Last, we take element at index 0, <code>0</code>, and add it to element of index 1 from our second map function, <code>0</code>, leaving us with 0; thus, after the first iteration of the top level map function, we are left with an array that looks like so: <code>[1, [2, 0], [3, 3]]</code>.  We simply keep doing that logic for the other elements until we finish: <code>[1, -1, [3, 3]]</code>, and <code>[1, -1, 3]</code>"
+        },
+        {
+          "subtitle": "Words Containing 'a'",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = ['apple', 'dog', 'cat']\n  .map((a, i) => \n    a.indexOf('a') !== -1 ? i : null)\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>[0, -1, 1]</code></pre>",
+            "<pre><code class='language-javascript'>[0, null, 2]</code></pre>",
+            "<pre><code class='language-javascript'>[null, null, null]</code></pre>",
+            "<pre><code class='language-javascript'>[-1, null, 2]</code></pre>"
+          ],
+          "answer": 1,
+          "explanation": "This map example will return an array where each elements of the new array is either the original array index when the element contains the character 'a'; otherwise, an element of null for any words that do not have the character 'a'."
+        },
+        {
+          "subtitle": "Accessing the Original Array Elements",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = [1, 2, 3]\n  .map((a, _, o) => a + o[0])\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>[1, 2, 3]</code></pre>",
+            "<pre><code class='language-javascript'>[0, 0, 0]</code></pre>",
+            "<pre><code class='language-javascript'>[3, 2, 1]</code></pre>",
+            "<pre><code class='language-javascript'>[2, 3, 4]</code></pre>"
+          ],
+          "answer": 3,
+          "explanation": "This map example will add the value of the first element in the original array to all the other elements in the array."
+        },
+        {
+          "subtitle": "More Map Hacking",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = [8, 5, 3]\n  .map((a, i, o) => o[o.length - i - i])\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>[3, 5, 8]</code></pre>",
+            "<pre><code class='language-javascript'>[5, 3, 8]</code></pre>",
+            "<pre><code class='language-javascript'>[8, 5, 3]</code></pre>",
+            "<pre><code class='language-javascript'>[3, 8, 5]</code></pre>"
+          ],
+          "answer": 0,
+          "explanation": "This map example will reverse the array.  The third argument to the map callback function is the original array; therefore, we can use the current index in the map function, and work our way backwards from the end of the array using the o.length."
+        },
+        {
+          "subtitle": "Custom Scoping",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = ['a', 'b', 'c']\n  .map(function(a) { return this[a]; }, {a: 9, b: 3, c: 1})\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>['a', 'b', 'c']</code></pre>",
+            "<pre><code class='language-javascript'>[9, 3, 1]</code></pre>",
+            "<pre><code class='language-javascript'>[3, 9, 1]</code></pre>",
+            "<pre><code class='language-javascript'>[{a: 9}, {b: 3}, {c: 1}]</code></pre>"
+          ],
+          "answer": 1,
+          "explanation": "This map example will reverse the array.  The third argument to the map callback function is the original array; therefore, we can use the current index in the map function, and work our way backwards from the end of the array using the o.length."
+        },
+        {
+          "subtitle": "Reversing in Map, Just Because",
+          "question": "What will the following code print out?\n<pre><code class='language-javascript'>const results = [1, 2, 3, 4, 5]\n  .map((a, _, o) => o.reverse() && a)\nconsole.log(results);</code></pre>",
+          "choices": [
+            "<pre><code class='language-javascript'>[5, 4, 3, 2, 1]</code></pre>",
+            "<pre><code class='language-javascript'>[5, 2, 3, 5, 1]</code></pre>",
+            "<pre><code class='language-javascript'>[1, 2, 3, 4, 5]</code></pre>",
+            "<pre><code class='language-javascript'>[1, 4, 3, 2, 5]</code></pre>"
+          ],
+          "answer": 3,
+          "explanation": "This map example will reverse the array.  The third argument to the map callback function is the original array; therefore, we can use the current index in the map function, and work our way backwards from the end of the array using the o.length."
+        }
+      ],
+      "tests": [],
+      "challengeType": 8
+    }
+  ]
+}
diff --git a/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
new file mode 100644
index 0000000000..1b06261e49
--- /dev/null
+++ b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
@@ -0,0 +1,20548 @@
+{
+  "name": "Project Euler Problems",
+  "order": 3,
+  "time": "",
+  "helpRoom": "HelpJavaScript",
+  "challenges": [
+    {
+      "_id": "5900f36e1000cf542c50fe80",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 1: Multiples of 3 and 5",
+      "tests": [
+        "assert.strictEqual(euler1(1000), 233168, 'message: <code>euler1(1000)</code> should return 233168.');",
+        "assert.strictEqual(euler1(49), 543, 'message: <code>euler1(49)</code> should return 543.');",
+        "assert.strictEqual(euler1(19564), 89301183, 'message: <code>euler1(19564)</code> should return 89301183.');",
+        "assert.strictEqual(euler1(8456), 16687353, 'message: Your function is not returning the correct result using our tests values.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler1(number) {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler1(1000);"
+      ],
+      "description": [
+        "If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.",
+        "Find the sum of all the multiples of 3 or 5 below the provided parameter value <code>number</code>."
+      ]
+    },
+    {
+      "_id": "5900f36e1000cf542c50fe81",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 2: Even Fibonacci numbers",
+      "tests": [
+        "assert.strictEqual(euler2(), 4613732, 'message: <code>euler2()</code> should return 4613732.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler2() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler2();"
+      ],
+      "description": [
+        "Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:",
+        "1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...",
+        "By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms."
+      ]
+    },
+    {
+      "_id": "5900f36f1000cf542c50fe82",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 3: Largest prime factor",
+      "tests": [
+        "assert.strictEqual(euler3(), 6857, 'message: <code>euler3()</code> should return 6857.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler3() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler3();"
+      ],
+      "description": [
+        "The prime factors of 13195 are 5, 7, 13 and 29.",
+        "What is the largest prime factor of the number 600851475143 ?"
+      ]
+    },
+    {
+      "_id": "5900f3701000cf542c50fe83",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 4: Largest palindrome product",
+      "tests": [
+        "assert.strictEqual(euler4(), 906609, 'message: <code>euler4()</code> should return 906609.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler4() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler4();"
+      ],
+      "description": [
+        "A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.",
+        "Find the largest palindrome made from the product of two 3-digit numbers."
+      ]
+    },
+    {
+      "_id": "5900f3711000cf542c50fe84",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 5: Smallest multiple",
+      "tests": [
+        "assert.strictEqual(euler5(), 232792560, 'message: <code>euler5()</code> should return 232792560.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler5() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler5();"
+      ],
+      "description": [
+        "2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.",
+        "What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?"
+      ]
+    },
+    {
+      "_id": "5900f3721000cf542c50fe85",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 6: Sum square difference",
+      "tests": [
+        "assert.strictEqual(euler6(), 25164150, 'message: <code>euler6()</code> should return 25164150.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler6() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler6();"
+      ],
+      "description": [
+        "The sum of the squares of the first ten natural numbers is,",
+        "12 + 22 + ... + 102 = 385",
+        "The square of the sum of the first ten natural numbers is,",
+        "(1 + 2 + ... + 10)2 = 552 = 3025",
+        "Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.",
+        "Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum."
+      ]
+    },
+    {
+      "_id": "5900f3731000cf542c50fe86",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 7: 10001st prime",
+      "tests": [
+        "assert.strictEqual(euler7(), 104743, 'message: <code>euler7()</code> should return 104743.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler7() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler7();"
+      ],
+      "description": [
+        "By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.",
+        "What is the 10 001st prime number?"
+      ]
+    },
+    {
+      "_id": "5900f3741000cf542c50fe87",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 8: Largest product in a series",
+      "tests": [
+        "assert.strictEqual(euler8(), 23514624000, 'message: <code>euler8()</code> should return 23514624000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler8() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler8();"
+      ],
+      "description": [
+        "The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.",
+        "",
+        "73167176531330624919225119674426574742355349194934",
+        "96983520312774506326239578318016984801869478851843",
+        "85861560789112949495459501737958331952853208805511",
+        "12540698747158523863050715693290963295227443043557",
+        "66896648950445244523161731856403098711121722383113",
+        "62229893423380308135336276614282806444486645238749",
+        "30358907296290491560440772390713810515859307960866",
+        "70172427121883998797908792274921901699720888093776",
+        "65727333001053367881220235421809751254540594752243",
+        "52584907711670556013604839586446706324415722155397",
+        "53697817977846174064955149290862569321978468622482",
+        "83972241375657056057490261407972968652414535100474",
+        "82166370484403199890008895243450658541227588666881",
+        "16427171479924442928230863465674813919123162824586",
+        "17866458359124566529476545682848912883142607690042",
+        "24219022671055626321111109370544217506941658960408",
+        "07198403850962455444362981230987879927244284909188",
+        "84580156166097919133875499200524063689912560717606",
+        "05886116467109405077541002256983155200055935729725",
+        "71636269561882670428252483600823257530420752963450",
+        "Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?"
+      ]
+    },
+    {
+      "_id": "5900f3761000cf542c50fe88",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 9: Special Pythagorean triplet",
+      "tests": [
+        "assert.strictEqual(euler9(), 31875000, 'message: <code>euler9()</code> should return 31875000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler9() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler9();"
+      ],
+      "description": [
+        "A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,",
+        " a2 + b2 = c2",
+        "For example, 32 + 42 = 9 + 16 = 25 = 52.",
+        "There exists exactly one Pythagorean triplet for which a + b + c = 1000.Find the product abc."
+      ]
+    },
+    {
+      "_id": "5900f3761000cf542c50fe89",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 10: Summation of primes",
+      "tests": [
+        "assert.strictEqual(euler10(), 142913828922, 'message: <code>euler10()</code> should return 142913828922.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler10() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler10();"
+      ],
+      "description": [
+        "The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.",
+        "Find the sum of all the primes below two million."
+      ]
+    },
+    {
+      "_id": "5900f3781000cf542c50fe8a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 11: Largest product in a grid",
+      "tests": [
+        "assert.strictEqual(euler11(), 70600674, 'message: <code>euler11()</code> should return 70600674.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler11() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler11();"
+      ],
+      "description": [
+        "In the 20×20 grid below, four numbers along a diagonal line have been marked in red.",
+        "",
+        "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08",
+        "49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00",
+        "81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65",
+        "52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91",
+        "22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80",
+        "24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50",
+        "32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70",
+        "67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21",
+        "24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72",
+        "21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95",
+        "78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92",
+        "16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57",
+        "86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58",
+        "19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40",
+        "04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66",
+        "88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69",
+        "04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36",
+        "20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16",
+        "20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54",
+        "01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48",
+        "The product of these numbers is 26 × 63 × 78 × 14 = 1788696.",
+        "What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?"
+      ]
+    },
+    {
+      "_id": "5900f3781000cf542c50fe8b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 12: Highly divisible triangular number",
+      "tests": [
+        "assert.strictEqual(euler12(), 76576500, 'message: <code>euler12()</code> should return 76576500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler12() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler12();"
+      ],
+      "description": [
+        "The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:",
+        "1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...",
+        "Let us list the factors of the first seven triangle numbers:",
+        " 1: 1 3: 1,3 6: 1,2,3,610: 1,2,5,1015: 1,3,5,1521: 1,3,7,2128: 1,2,4,7,14,28",
+        "We can see that 28 is the first triangle number to have over five divisors.",
+        "What is the value of the first triangle number to have over five hundred divisors?"
+      ]
+    },
+    {
+      "_id": "5900f37a1000cf542c50fe8c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 13: Large sum",
+      "tests": [
+        "assert.strictEqual(euler13(), 5537376230, 'message: <code>euler13()</code> should return 5537376230.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler13() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler13();"
+      ],
+      "description": [
+        "Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.",
+        "",
+        "37107287533902102798797998220837590246510135740250",
+        "46376937677490009712648124896970078050417018260538",
+        "74324986199524741059474233309513058123726617309629",
+        "91942213363574161572522430563301811072406154908250",
+        "23067588207539346171171980310421047513778063246676",
+        "89261670696623633820136378418383684178734361726757",
+        "28112879812849979408065481931592621691275889832738",
+        "44274228917432520321923589422876796487670272189318",
+        "47451445736001306439091167216856844588711603153276",
+        "70386486105843025439939619828917593665686757934951",
+        "62176457141856560629502157223196586755079324193331",
+        "64906352462741904929101432445813822663347944758178",
+        "92575867718337217661963751590579239728245598838407",
+        "58203565325359399008402633568948830189458628227828",
+        "80181199384826282014278194139940567587151170094390",
+        "35398664372827112653829987240784473053190104293586",
+        "86515506006295864861532075273371959191420517255829",
+        "71693888707715466499115593487603532921714970056938",
+        "54370070576826684624621495650076471787294438377604",
+        "53282654108756828443191190634694037855217779295145",
+        "36123272525000296071075082563815656710885258350721",
+        "45876576172410976447339110607218265236877223636045",
+        "17423706905851860660448207621209813287860733969412",
+        "81142660418086830619328460811191061556940512689692",
+        "51934325451728388641918047049293215058642563049483",
+        "62467221648435076201727918039944693004732956340691",
+        "15732444386908125794514089057706229429197107928209",
+        "55037687525678773091862540744969844508330393682126",
+        "18336384825330154686196124348767681297534375946515",
+        "80386287592878490201521685554828717201219257766954",
+        "78182833757993103614740356856449095527097864797581",
+        "16726320100436897842553539920931837441497806860984",
+        "48403098129077791799088218795327364475675590848030",
+        "87086987551392711854517078544161852424320693150332",
+        "59959406895756536782107074926966537676326235447210",
+        "69793950679652694742597709739166693763042633987085",
+        "41052684708299085211399427365734116182760315001271",
+        "65378607361501080857009149939512557028198746004375",
+        "35829035317434717326932123578154982629742552737307",
+        "94953759765105305946966067683156574377167401875275",
+        "88902802571733229619176668713819931811048770190271",
+        "25267680276078003013678680992525463401061632866526",
+        "36270218540497705585629946580636237993140746255962",
+        "24074486908231174977792365466257246923322810917141",
+        "91430288197103288597806669760892938638285025333403",
+        "34413065578016127815921815005561868836468420090470",
+        "23053081172816430487623791969842487255036638784583",
+        "11487696932154902810424020138335124462181441773470",
+        "63783299490636259666498587618221225225512486764533",
+        "67720186971698544312419572409913959008952310058822",
+        "95548255300263520781532296796249481641953868218774",
+        "76085327132285723110424803456124867697064507995236",
+        "37774242535411291684276865538926205024910326572967",
+        "23701913275725675285653248258265463092207058596522",
+        "29798860272258331913126375147341994889534765745501",
+        "18495701454879288984856827726077713721403798879715",
+        "38298203783031473527721580348144513491373226651381",
+        "34829543829199918180278916522431027392251122869539",
+        "40957953066405232632538044100059654939159879593635",
+        "29746152185502371307642255121183693803580388584903",
+        "41698116222072977186158236678424689157993532961922",
+        "62467957194401269043877107275048102390895523597457",
+        "23189706772547915061505504953922979530901129967519",
+        "86188088225875314529584099251203829009407770775672",
+        "11306739708304724483816533873502340845647058077308",
+        "82959174767140363198008187129011875491310547126581",
+        "97623331044818386269515456334926366572897563400500",
+        "42846280183517070527831839425882145521227251250327",
+        "55121603546981200581762165212827652751691296897789",
+        "32238195734329339946437501907836945765883352399886",
+        "75506164965184775180738168837861091527357929701337",
+        "62177842752192623401942399639168044983993173312731",
+        "32924185707147349566916674687634660915035914677504",
+        "99518671430235219628894890102423325116913619626622",
+        "73267460800591547471830798392868535206946944540724",
+        "76841822524674417161514036427982273348055556214818",
+        "97142617910342598647204516893989422179826088076852",
+        "87783646182799346313767754307809363333018982642090",
+        "10848802521674670883215120185883543223812876952786",
+        "71329612474782464538636993009049310363619763878039",
+        "62184073572399794223406235393808339651327408011116",
+        "66627891981488087797941876876144230030984490851411",
+        "60661826293682836764744779239180335110989069790714",
+        "85786944089552990653640447425576083659976645795096",
+        "66024396409905389607120198219976047599490197230297",
+        "64913982680032973156037120041377903785566085089252",
+        "16730939319872750275468906903707539413042652315011",
+        "94809377245048795150954100921645863754710598436791",
+        "78639167021187492431995700641917969777599028300699",
+        "15368713711936614952811305876380278410754449733078",
+        "40789923115535562561142322423255033685442488917353",
+        "44889911501440648020369068063960672322193204149535",
+        "41503128880339536053299340368006977710650566631954",
+        "81234880673210146739058568557934581403627822703280",
+        "82616570773948327592232845941706525094512325230608",
+        "22918802058777319719839450180888072429661980811197",
+        "77158542502016545090413245809786882778948721859617",
+        "72107838435069186155435662884062257473692284509516",
+        "20849603980134001723930671666823555245252804609722",
+        "53503534226472524250874054075591789781264330331690"
+      ]
+    },
+    {
+      "_id": "5900f37a1000cf542c50fe8d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 14: Longest Collatz sequence",
+      "tests": [
+        "assert.strictEqual(euler14(), 837799, 'message: <code>euler14()</code> should return 837799.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler14() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler14();"
+      ],
+      "description": [
+        "The following iterative sequence is defined for the set of positive integers:",
+        "n → n/2 (n is even)n → 3n + 1 (n is odd)",
+        "Using the rule above and starting with 13, we generate the following sequence:",
+        "13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1",
+        "It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.",
+        "Which starting number, under one million, produces the longest chain?",
+        "NOTE: Once the chain starts the terms are allowed to go above one million."
+      ]
+    },
+    {
+      "_id": "5900f37b1000cf542c50fe8e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 15: Lattice paths",
+      "tests": [
+        "assert.strictEqual(euler15(), 137846528820, 'message: <code>euler15()</code> should return 137846528820.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler15() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler15();"
+      ],
+      "description": [
+        "Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.",
+        "",
+        "",
+        "How many such routes are there through a 20×20 grid?"
+      ]
+    },
+    {
+      "_id": "5900f37d1000cf542c50fe8f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 16: Power digit sum",
+      "tests": [
+        "assert.strictEqual(euler16(), 1366, 'message: <code>euler16()</code> should return 1366.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler16() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler16();"
+      ],
+      "description": [
+        "215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.",
+        "What is the sum of the digits of the number 21000?"
+      ]
+    },
+    {
+      "_id": "5900f37d1000cf542c50fe90",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 17: Number letter counts",
+      "tests": [
+        "assert.strictEqual(euler17(), 21124, 'message: <code>euler17()</code> should return 21124.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler17() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler17();"
+      ],
+      "description": [
+        "If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.",
+        "If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used? ",
+        "NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of \"and\" when writing out numbers is in compliance with British usage."
+      ]
+    },
+    {
+      "_id": "5900f37e1000cf542c50fe91",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 18: Maximum path sum I",
+      "tests": [
+        "assert.strictEqual(euler18(), 1074, 'message: <code>euler18()</code> should return 1074.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler18() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler18();"
+      ],
+      "description": [
+        "By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.",
+        "37 4",
+        "2 4 6",
+        "8 5 9 3",
+        "That is, 3 + 7 + 4 + 9 = 23.",
+        "Find the maximum total from top to bottom of the triangle below:",
+        "75",
+        "95 64",
+        "17 47 82",
+        "18 35 87 10",
+        "20 04 82 47 65",
+        "19 01 23 75 03 34",
+        "88 02 77 73 07 63 67",
+        "99 65 04 28 06 16 70 92",
+        "41 41 26 56 83 40 80 70 33",
+        "41 48 72 33 47 32 37 16 94 29",
+        "53 71 44 65 25 43 91 52 97 51 14",
+        "70 11 33 28 77 73 17 78 39 68 17 57",
+        "91 71 52 38 17 14 91 43 58 50 27 29 48",
+        "63 66 04 68 89 53 67 30 73 16 69 87 40 31",
+        "04 62 98 27 23 09 70 98 73 93 38 53 60 04 23",
+        "NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)"
+      ]
+    },
+    {
+      "_id": "5900f37f1000cf542c50fe92",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 19: Counting Sundays",
+      "tests": [
+        "assert.strictEqual(euler19(), 171, 'message: <code>euler19()</code> should return 171.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler19() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler19();"
+      ],
+      "description": [
+        "You are given the following information, but you may prefer to do some research for yourself.",
+        "1 Jan 1900 was a Monday.",
+        "Thirty days has September,",
+        "April, June and November.",
+        "All the rest have thirty-one,",
+        "Saving February alone,",
+        "Which has twenty-eight, rain or shine.",
+        "And on leap years, twenty-nine.",
+        "A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.",
+        "How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?"
+      ]
+    },
+    {
+      "_id": "5900f3801000cf542c50fe93",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 20: Factorial digit sum",
+      "tests": [
+        "assert.strictEqual(sumFactorialDigits(10), 27, 'message: \u003ccode\u003esumFactorialDigits(10)\u003c/code\u003e should return 27.');",
+        "assert.strictEqual(sumFactorialDigits(25), 72, 'message: \u003ccode\u003esumFactorialDigits(25)\u003c/code\u003e should return 72.');",
+        "assert.strictEqual(sumFactorialDigits(50), 216, 'message: \u003ccode\u003esumFactorialDigits(50)\u003c/code\u003e should return 216.');",
+        "assert.strictEqual(sumFactorialDigits(75), 432, 'message: \u003ccode\u003esumFactorialDigits(75)\u003c/code\u003e should return 432.');",
+        "assert.strictEqual(sumFactorialDigits(100), 648, 'message: \u003ccode\u003esumFactorialDigits(100)\u003c/code\u003e should return 648.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function sumFactorialDigits(n) {",
+        "  // Good luck!",
+        "  return n;",
+        "}",
+        "",
+        "sumFactorialDigits(100);"
+      ],
+      "description": [
+        "n! means n × (n − 1) × ... × 3 × 2 × 1",
+        "For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.",
+        "Find the sum of the digits n!"
+      ]
+    },
+    {
+      "_id": "5900f3811000cf542c50fe94",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 21: Amicable numbers",
+      "tests": [
+        "assert.strictEqual(euler21(), 31626, 'message: <code>euler21()</code> should return 31626.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler21() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler21();"
+      ],
+      "description": [
+        "Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).",
+        "If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.",
+        "For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.",
+        "Evaluate the sum of all the amicable numbers under 10000."
+      ]
+    },
+    {
+      "_id": "5900f3831000cf542c50fe95",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 22: Names scores",
+      "tests": [
+        "assert.strictEqual(euler22(), 871198282, 'message: <code>euler22()</code> should return 871198282.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler22() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler22();"
+      ],
+      "description": [
+        "Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.",
+        "For example, when the list is sorted into alphabetical order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would obtain a score of 938 × 53 = 49714.",
+        "What is the total of all the name scores in the file?"
+      ]
+    },
+    {
+      "_id": "5900f3831000cf542c50fe96",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 23: Non-abundant sums",
+      "tests": [
+        "assert.strictEqual(euler23(), 4179871, 'message: <code>euler23()</code> should return 4179871.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler23() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler23();"
+      ],
+      "description": [
+        "A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.",
+        "A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.",
+        "",
+        "As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.",
+        "Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers."
+      ]
+    },
+    {
+      "_id": "5900f3841000cf542c50fe97",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 24: Lexicographic permutations",
+      "tests": [
+        "assert.strictEqual(euler24(), 2783915460, 'message: <code>euler24()</code> should return 2783915460.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler24() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler24();"
+      ],
+      "description": [
+        "A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:",
+        "012   021   102   120   201   210",
+        "What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?"
+      ]
+    },
+    {
+      "_id": "5900f3851000cf542c50fe98",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 25: 1000-digit Fibonacci number",
+      "tests": [
+        "assert.strictEqual(euler25(), 4782, 'message: <code>euler25()</code> should return 4782.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler25() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler25();"
+      ],
+      "description": [
+        "The Fibonacci sequence is defined by the recurrence relation:",
+        "Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.",
+        "Hence the first 12 terms will be:",
+        "F1 = 1",
+        "F2 = 1",
+        "F3 = 2",
+        "F4 = 3",
+        "F5 = 5",
+        "F6 = 8",
+        "F7 = 13",
+        "F8 = 21",
+        "F9 = 34",
+        "F10 = 55",
+        "F11 = 89",
+        "F12 = 144",
+        "The 12th term, F12, is the first term to contain three digits.",
+        "What is the index of the first term in the Fibonacci sequence to contain 1000 digits?"
+      ]
+    },
+    {
+      "_id": "5900f3861000cf542c50fe99",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 26: Reciprocal cycles",
+      "tests": [
+        "assert.strictEqual(euler26(), 983, 'message: <code>euler26()</code> should return 983.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler26() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler26();"
+      ],
+      "description": [
+        "A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:",
+        "",
+        "1/2= 0.5",
+        "1/3= 0.(3)",
+        "1/4= 0.25",
+        "1/5= 0.2",
+        "1/6= 0.1(6)",
+        "1/7= 0.(142857)",
+        "1/8= 0.125",
+        "1/9= 0.(1)",
+        "1/10= 0.1",
+        "",
+        "Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.",
+        "Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part."
+      ]
+    },
+    {
+      "_id": "5900f3871000cf542c50fe9a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 27: Quadratic primes",
+      "tests": [
+        "assert.strictEqual(euler27(), -59231, 'message: <code>euler27()</code> should return -59231.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler27() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler27();"
+      ],
+      "description": [
+        "Euler discovered the remarkable quadratic formula:",
+        "$n^2 + n + 41$",
+        "It turns out that the formula will produce 40 primes for the consecutive integer values $0 \\le n \\le 39$. However, when $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ is divisible by 41, and certainly when $n = 41, 41^2 + 41 + 41$ is clearly divisible by 41.",
+        "The incredible formula $n^2 - 79n + 1601$ was discovered, which produces 80 primes for the consecutive values $0 \\le n \\le 79$. The product of the coefficients, −79 and 1601, is −126479.",
+        "Considering quadratics of the form:",
+        "",
+        "$n^2 + an + b$, where $|a| < 1000$ and $|b| \\le 1000$where $|n|$ is the modulus/absolute value of $n$e.g. $|11| = 11$ and $|-4| = 4$",
+        "",
+        "Find the product of the coefficients, $a$ and $b$, for the quadratic expression that produces the maximum number of primes for consecutive values of $n$, starting with $n = 0$."
+      ]
+    },
+    {
+      "_id": "5900f3881000cf542c50fe9b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 28: Number spiral diagonals",
+      "tests": [
+        "assert.strictEqual(euler28(), 669171001, 'message: <code>euler28()</code> should return 669171001.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler28() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler28();"
+      ],
+      "description": [
+        "Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows:",
+        "21 22 23 24 25",
+        "20  7  8  9 10",
+        "19  6  1  2 11",
+        "18  5  4  3 1217 16 15 14 13",
+        "It can be verified that the sum of the numbers on the diagonals is 101.",
+        "What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?"
+      ]
+    },
+    {
+      "_id": "5900f3891000cf542c50fe9c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 29: Distinct powers",
+      "tests": [
+        "assert.strictEqual(euler29(), 9183, 'message: <code>euler29()</code> should return 9183.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler29() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler29();"
+      ],
+      "description": [
+        "Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:",
+        "22=4, 23=8, 24=16, 25=32",
+        "32=9, 33=27, 34=81, 35=243",
+        "42=16, 43=64, 44=256, 45=1024",
+        "52=25, 53=125, 54=625, 55=3125",
+        "If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:",
+        "4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125",
+        "How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?"
+      ]
+    },
+    {
+      "_id": "5900f38a1000cf542c50fe9d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 30: Digit fifth powers",
+      "tests": [
+        "assert.strictEqual(euler30(), 443839, 'message: <code>euler30()</code> should return 443839.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler30() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler30();"
+      ],
+      "description": [
+        "Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:",
+        "1634 = 14 + 64 + 34 + 44",
+        "8208 = 84 + 24 + 04 + 84",
+        "9474 = 94 + 44 + 74 + 44",
+        "As 1 = 14 is not a sum it is not included.",
+        "The sum of these numbers is 1634 + 8208 + 9474 = 19316.",
+        "Find the sum of all the numbers that can be written as the sum of fifth powers of their digits."
+      ]
+    },
+    {
+      "_id": "5900f38b1000cf542c50fe9e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 31: Coin sums",
+      "tests": [
+        "assert.strictEqual(euler31(), 73682, 'message: <code>euler31()</code> should return 73682.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler31() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler31();"
+      ],
+      "description": [
+        "In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:",
+        "1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).",
+        "It is possible to make £2 in the following way:",
+        "1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p",
+        "How many different ways can £2 be made using any number of coins?"
+      ]
+    },
+    {
+      "_id": "5900f38c1000cf542c50fe9f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 32: Pandigital products",
+      "tests": [
+        "assert.strictEqual(euler32(), 45228, 'message: <code>euler32()</code> should return 45228.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler32() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler32();"
+      ],
+      "description": [
+        "We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.",
+        "",
+        "The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.",
+        "",
+        "Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.",
+        "",
+        "HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum."
+      ]
+    },
+    {
+      "_id": "5900f38d1000cf542c50fea0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 33: Digit cancelling fractions",
+      "tests": [
+        "assert.strictEqual(euler33(), 100, 'message: <code>euler33()</code> should return 100.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler33() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler33();"
+      ],
+      "description": [
+        "The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s.",
+        "We shall consider fractions like, 30/50 = 3/5, to be trivial examples.",
+        "There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.",
+        "If the product of these four fractions is given in its lowest common terms, find the value of the denominator."
+      ]
+    },
+    {
+      "_id": "5900f38e1000cf542c50fea1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 34: Digit factorials",
+      "tests": [
+        "assert.strictEqual(euler34(), 40730, 'message: <code>euler34()</code> should return 40730.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler34() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler34();"
+      ],
+      "description": [
+        "145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.",
+        "Find the sum of all numbers which are equal to the sum of the factorial of their digits.",
+        "Note: as 1! = 1 and 2! = 2 are not sums they are not included."
+      ]
+    },
+    {
+      "_id": "5900f38f1000cf542c50fea2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 35: Circular primes",
+      "tests": [
+        "assert.strictEqual(euler35(), 55, 'message: <code>euler35()</code> should return 55.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler35() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler35();"
+      ],
+      "description": [
+        "The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.",
+        "There are thirteen such primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79, and 97.",
+        "How many circular primes are there below one million?"
+      ]
+    },
+    {
+      "_id": "5900f3901000cf542c50fea3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 36: Double-base palindromes",
+      "tests": [
+        "assert.strictEqual(euler36(), 872187, 'message: <code>euler36()</code> should return 872187.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler36() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler36();"
+      ],
+      "description": [
+        "The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.",
+        "Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.",
+        "(Please note that the palindromic number, in either base, may not include leading zeros.)"
+      ]
+    },
+    {
+      "_id": "5900f3911000cf542c50fea4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 37: Truncatable primes",
+      "tests": [
+        "assert.strictEqual(euler37(), 748317, 'message: <code>euler37()</code> should return 748317.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler37() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler37();"
+      ],
+      "description": [
+        "The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.",
+        "Find the sum of the only eleven primes that are both truncatable from left to right and right to left.",
+        "NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes."
+      ]
+    },
+    {
+      "_id": "5900f3931000cf542c50fea5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 38: Pandigital multiples",
+      "tests": [
+        "assert.strictEqual(euler38(), 932718654, 'message: <code>euler38()</code> should return 932718654.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler38() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler38();"
+      ],
+      "description": [
+        "Take the number 192 and multiply it by each of 1, 2, and 3:",
+        "192 × 1 = 192",
+        "192 × 2 = 384",
+        "192 × 3 = 576",
+        "By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)",
+        "The same can be achieved by starting with 9 and multiplying by 1, 2, 3, 4, and 5, giving the pandigital, 918273645, which is the concatenated product of 9 and (1,2,3,4,5).",
+        "What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n > 1?"
+      ]
+    },
+    {
+      "_id": "5900f3931000cf542c50fea6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 39: Integer right triangles",
+      "tests": [
+        "assert.strictEqual(euler39(), 840, 'message: <code>euler39()</code> should return 840.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler39() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler39();"
+      ],
+      "description": [
+        "If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120.",
+        "{20,48,52}, {24,45,51}, {30,40,50}",
+        "For which value of p ≤ 1000, is the number of solutions maximised?"
+      ]
+    },
+    {
+      "_id": "5900f3941000cf542c50fea7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 40: Champernowne's constant",
+      "tests": [
+        "assert.strictEqual(euler40(), 210, 'message: <code>euler40()</code> should return 210.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler40() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler40();"
+      ],
+      "description": [
+        "An irrational decimal fraction is created by concatenating the positive integers:",
+        "0.123456789101112131415161718192021...",
+        "It can be seen that the 12th digit of the fractional part is 1.",
+        "If dn represents the nth digit of the fractional part, find the value of the following expression.",
+        "d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000"
+      ]
+    },
+    {
+      "_id": "5900f3951000cf542c50fea8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 41: Pandigital prime",
+      "tests": [
+        "assert.strictEqual(euler41(), 7652413, 'message: <code>euler41()</code> should return 7652413.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler41() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler41();"
+      ],
+      "description": [
+        "We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.",
+        "What is the largest n-digit pandigital prime that exists?"
+      ]
+    },
+    {
+      "_id": "5900f3961000cf542c50fea9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 42: Coded triangle numbers",
+      "tests": [
+        "assert.strictEqual(euler42(), 162, 'message: <code>euler42()</code> should return 162.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler42() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler42();"
+      ],
+      "description": [
+        "The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); so the first ten triangle numbers are:",
+        "1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...",
+        "By converting each letter in a word to a number corresponding to its alphabetical position and adding these values we form a word value. For example, the word value for SKY is 19 + 11 + 25 = 55 = t10. If the word value is a triangle number then we shall call the word a triangle word.",
+        "Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, how many are triangle words?"
+      ]
+    },
+    {
+      "_id": "5900f3971000cf542c50feaa",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 43: Sub-string divisibility",
+      "tests": [
+        "assert.strictEqual(euler43(), 16695334890, 'message: <code>euler43()</code> should return 16695334890.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler43() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler43();"
+      ],
+      "description": [
+        "The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.",
+        "Let d1 be the 1st digit, d2 be the 2nd digit, and so on. In this way, we note the following:",
+        "d2d3d4=406 is divisible by 2",
+        "d3d4d5=063 is divisible by 3",
+        "d4d5d6=635 is divisible by 5",
+        "d5d6d7=357 is divisible by 7",
+        "d6d7d8=572 is divisible by 11",
+        "d7d8d9=728 is divisible by 13",
+        "d8d9d10=289 is divisible by 17",
+        "Find the sum of all 0 to 9 pandigital numbers with this property."
+      ]
+    },
+    {
+      "_id": "5900f3981000cf542c50feab",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 44: Pentagon numbers",
+      "tests": [
+        "assert.strictEqual(euler44(), 5482660, 'message: <code>euler44()</code> should return 5482660.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler44() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler44();"
+      ],
+      "description": [
+        "Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are:",
+        "1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...",
+        "It can be seen that P4 + P7 = 22 + 70 = 92 = P8. However, their difference, 70 − 22 = 48, is not pentagonal.",
+        "Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference are pentagonal and D = |Pk − Pj| is minimised; what is the value of D?"
+      ]
+    },
+    {
+      "_id": "5900f3991000cf542c50feac",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 45: Triangular, pentagonal, and hexagonal",
+      "tests": [
+        "assert.strictEqual(euler45(), 1533776805, 'message: <code>euler45()</code> should return 1533776805.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler45() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler45();"
+      ],
+      "description": [
+        "Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:",
+        "Triangle",
+        " ",
+        "Tn=n(n+1)/2",
+        " ",
+        "1, 3, 6, 10, 15, ...",
+        "Pentagonal",
+        " ",
+        "Pn=n(3n−1)/2",
+        " ",
+        "1, 5, 12, 22, 35, ...",
+        "Hexagonal",
+        " ",
+        "Hn=n(2n−1)",
+        " ",
+        "1, 6, 15, 28, 45, ...",
+        "It can be verified that T285 = P165 = H143 = 40755.",
+        "Find the next triangle number that is also pentagonal and hexagonal."
+      ]
+    },
+    {
+      "_id": "5900f39a1000cf542c50fead",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 46: Goldbach's other conjecture",
+      "tests": [
+        "assert.strictEqual(euler46(), 5777, 'message: <code>euler46()</code> should return 5777.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler46() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler46();"
+      ],
+      "description": [
+        "It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.",
+        "9 = 7 + 2×12",
+        "15 = 7 + 2×22",
+        "21 = 3 + 2×32",
+        "25 = 7 + 2×32",
+        "27 = 19 + 2×22",
+        "33 = 31 + 2×12",
+        "It turns out that the conjecture was false.",
+        "What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?"
+      ]
+    },
+    {
+      "_id": "5900f39c1000cf542c50feae",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 47: Distinct primes factors",
+      "tests": [
+        "assert.strictEqual(euler47(), 134043, 'message: <code>euler47()</code> should return 134043.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler47() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler47();"
+      ],
+      "description": [
+        "The first two consecutive numbers to have two distinct prime factors are:",
+        "14 = 2 × 715 = 3 × 5",
+        "The first three consecutive numbers to have three distinct prime factors are:",
+        "644 = 2² × 7 × 23645 = 3 × 5 × 43646 = 2 × 17 × 19.",
+        "Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?"
+      ]
+    },
+    {
+      "_id": "5900f39c1000cf542c50feaf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 48: Self powers",
+      "tests": [
+        "assert.strictEqual(euler48(), 9110846700, 'message: <code>euler48()</code> should return 9110846700.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler48() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler48();"
+      ],
+      "description": [
+        "The series, 11 + 22 + 33 + ... + 1010 = 10405071317.",
+        "Find the last ten digits of the series, 11 + 22 + 33 + ... + 10001000."
+      ]
+    },
+    {
+      "_id": "5900f39d1000cf542c50feb0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 49: Prime permutations",
+      "tests": [
+        "assert.strictEqual(euler49(), 296962999629, 'message: <code>euler49()</code> should return 296962999629.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler49() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler49();"
+      ],
+      "description": [
+        "The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.",
+        "There are no arithmetic sequences made up of three 1-, 2-, or 3-digit primes, exhibiting this property, but there is one other 4-digit increasing sequence.",
+        "What 12-digit number do you form by concatenating the three terms in this sequence?"
+      ]
+    },
+    {
+      "_id": "5900f39e1000cf542c50feb1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 50: Consecutive prime sum",
+      "tests": [
+        "assert.strictEqual(euler50(), 997651, 'message: <code>euler50()</code> should return 997651.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler50() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler50();"
+      ],
+      "description": [
+        "The prime 41, can be written as the sum of six consecutive primes:",
+        "41 = 2 + 3 + 5 + 7 + 11 + 13",
+        "This is the longest sum of consecutive primes that adds to a prime below one-hundred.",
+        "The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953.",
+        "Which prime, below one-million, can be written as the sum of the most consecutive primes?"
+      ]
+    },
+    {
+      "_id": "5900f39f1000cf542c50feb2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 51: Prime digit replacements",
+      "tests": [
+        "assert.strictEqual(euler51(), 121313, 'message: <code>euler51()</code> should return 121313.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler51() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler51();"
+      ],
+      "description": [
+        "By replacing the 1st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.",
+        "By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.",
+        "Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family."
+      ]
+    },
+    {
+      "_id": "5900f3a01000cf542c50feb3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 52: Permuted multiples",
+      "tests": [
+        "assert.strictEqual(euler52(), 142857, 'message: <code>euler52()</code> should return 142857.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler52() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler52();"
+      ],
+      "description": [
+        "It can be seen that the number, 125874, and its double, 251748, contain exactly the same digits, but in a different order.",
+        "Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits."
+      ]
+    },
+    {
+      "_id": "5900f3a11000cf542c50feb4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 53: Combinatoric selections",
+      "tests": [
+        "assert.strictEqual(euler53(), 4075, 'message: <code>euler53()</code> should return 4075.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler53() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler53();"
+      ],
+      "description": [
+        "There are exactly ten ways of selecting three from five, 12345:",
+        "123, 124, 125, 134, 135, 145, 234, 235, 245, and 345",
+        "In combinatorics, we use the notation, 5C3 = 10.",
+        "In general,",
+        "",
+        "nCr = ",
+        "n!r!(n−r)!",
+        ",where r ≤ n, n! = n×(n−1)×...×3×2×1, and 0! = 1.",
+        "",
+        "It is not until n = 23, that a value exceeds one-million: 23C10 = 1144066.",
+        "How many, not necessarily distinct, values of  nCr, for 1 ≤ n ≤ 100, are greater than one-million?"
+      ]
+    },
+    {
+      "_id": "5900f3a21000cf542c50feb5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 54: Poker hands",
+      "tests": [
+        "assert.strictEqual(euler54(), 376, 'message: <code>euler54()</code> should return 376.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler54() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler54();"
+      ],
+      "description": [
+        "In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:",
+        "High Card: Highest value card.",
+        "One Pair: Two cards of the same value.",
+        "Two Pairs: Two different pairs.",
+        "Three of a Kind: Three cards of the same value.",
+        "Straight: All cards are consecutive values.",
+        "Flush: All cards of the same suit.",
+        "Full House: Three of a kind and a pair.",
+        "Four of a Kind: Four cards of the same value.",
+        "Straight Flush: All cards are consecutive values of same suit.",
+        "Royal Flush: Ten, Jack, Queen, King, Ace, in same suit.",
+        "The cards are valued in the order:2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ace.",
+        "If two players have the same ranked hands then the rank made up of the highest value wins; for example, a pair of eights beats a pair of fives (see example 1 below). But if two ranks tie, for example, both players have a pair of queens, then highest cards in each hand are compared (see example 4 below); if the highest cards tie then the next highest cards are compared, and so on.",
+        "Consider the following five hands dealt to two players:",
+        "",
+        "Hand Player 1 Player 2 Winner",
+        "1 5H 5C 6S 7S KDPair of Fives 2C 3S 8S 8D TDPair of Eights Player 2",
+        "2 5D 8C 9S JS ACHighest card Ace 2C 5C 7D 8S QHHighest card Queen Player 1",
+        "3 2D 9C AS AH ACThree Aces 3D 6D 7D TD QDFlush  with Diamonds Player 2",
+        "4 4D 6S 9H QH QCPair of QueensHighest card Nine 3D 6D 7H QD QSPair of QueensHighest card Seven Player 1",
+        "5 2H 2D 4C 4D 4SFull HouseWith Three Fours 3C 3D 3S 9S 9DFull Housewith Three Threes Player 1",
+        "",
+        "The file, poker.txt, contains one-thousand random hands dealt to two players. Each line of the file contains ten cards (separated by a single space): the first five are Player 1's cards and the last five are Player 2's cards. You can assume that all hands are valid (no invalid characters or repeated cards), each player's hand is in no specific order, and in each hand there is a clear winner.",
+        "How many hands does Player 1 win?"
+      ]
+    },
+    {
+      "_id": "5900f3a31000cf542c50feb6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 55: Lychrel numbers",
+      "tests": [
+        "assert.strictEqual(euler55(), 249, 'message: <code>euler55()</code> should return 249.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler55() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler55();"
+      ],
+      "description": [
+        "If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.",
+        "Not all numbers produce palindromes so quickly. For example,",
+        "349 + 943 = 1292,",
+        "1292 + 2921 = 4213",
+        "4213 + 3124 = 7337",
+        "That is, 349 took three iterations to arrive at a palindrome.",
+        "Although no one has proved it yet, it is thought that some numbers, like 196, never produce a palindrome. A number that never forms a palindrome through the reverse and add process is called a Lychrel number. Due to the theoretical nature of these numbers, and for the purpose of this problem, we shall assume that a number is Lychrel until proven otherwise. In addition you are given that for every number below ten-thousand, it will either (i) become a palindrome in less than fifty iterations, or, (ii) no one, with all the computing power that exists, has managed so far to map it to a palindrome. In fact, 10677 is the first number to be shown to require over fifty iterations before producing a palindrome: 4668731596684224866951378664 (53 iterations, 28-digits).",
+        "Surprisingly, there are palindromic numbers that are themselves Lychrel numbers; the first example is 4994.",
+        "How many Lychrel numbers are there below ten-thousand?",
+        "NOTE: Wording was modified slightly on 24 April 2007 to emphasise the theoretical nature of Lychrel numbers."
+      ]
+    },
+    {
+      "_id": "5900f3a41000cf542c50feb7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 56: Powerful digit sum",
+      "tests": [
+        "assert.strictEqual(euler56(), 972, 'message: <code>euler56()</code> should return 972.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler56() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler56();"
+      ],
+      "description": [
+        "A googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.",
+        "Considering natural numbers of the form, ab, where a, b < 100, what is the maximum digital sum?"
+      ]
+    },
+    {
+      "_id": "5900f3a51000cf542c50feb8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 57: Square root convergents",
+      "tests": [
+        "assert.strictEqual(euler57(), 153, 'message: <code>euler57()</code> should return 153.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler57() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler57();"
+      ],
+      "description": [
+        "It is possible to show that the square root of two can be expressed as an infinite continued fraction.",
+        "√ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...",
+        "By expanding this for the first four iterations, we get:",
+        "1 + 1/2 = 3/2 = 1.5",
+        "1 + 1/(2 + 1/2) = 7/5 = 1.4",
+        "1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666...",
+        "1 + 1/(2 + 1/(2 + 1/(2 + 1/2))) = 41/29 = 1.41379...",
+        "The next three expansions are 99/70, 239/169, and 577/408, but the eighth expansion, 1393/985, is the first example where the number of digits in the numerator exceeds the number of digits in the denominator.",
+        "In the first one-thousand expansions, how many fractions contain a numerator with more digits than denominator?"
+      ]
+    },
+    {
+      "_id": "5900f3a61000cf542c50feb9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 58: Spiral primes",
+      "tests": [
+        "assert.strictEqual(euler58(), 26241, 'message: <code>euler58()</code> should return 26241.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler58() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler58();"
+      ],
+      "description": [
+        "Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.",
+        "37 36 35 34 33 32 31",
+        "38 17 16 15 14 13 30",
+        "39 18  5  4  3 12 29",
+        "40 19  6  1  2 11 28",
+        "41 20  7  8  9 10 27",
+        "42 21 22 23 24 25 2643 44 45 46 47 48 49",
+        "It is interesting to note that the odd squares lie along the bottom right diagonal, but what is more interesting is that 8 out of the 13 numbers lying along both diagonals are prime; that is, a ratio of 8/13 ≈ 62%.",
+        "If one complete new layer is wrapped around the spiral above, a square spiral with side length 9 will be formed. If this process is continued, what is the side length of the square spiral for which the ratio of primes along both diagonals first falls below 10%?"
+      ]
+    },
+    {
+      "_id": "5900f3a81000cf542c50feba",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 59: XOR decryption",
+      "tests": [
+        "assert.strictEqual(euler59(), 107359, 'message: <code>euler59()</code> should return 107359.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler59() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler59();"
+      ],
+      "description": [
+        "Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and lowercase k = 107.",
+        "A modern encryption method is to take a text file, convert the bytes to ASCII, then XOR each byte with a given value, taken from a secret key. The advantage with the XOR function is that using the same encryption key on the cipher text, restores the plain text; for example, 65 XOR 42 = 107, then 107 XOR 42 = 65.",
+        "For unbreakable encryption, the key is the same length as the plain text message, and the key is made up of random bytes. The user would keep the encrypted message and the encryption key in different locations, and without both \"halves\", it is impossible to decrypt the message.",
+        "Unfortunately, this method is impractical for most users, so the modified method is to use a password as a key. If the password is shorter than the message, which is likely, the key is repeated cyclically throughout the message. The balance for this method is using a sufficiently long password key for security, but short enough to be memorable.",
+        "Your task has been made easy, as the encryption key consists of three lower case characters. Using cipher.txt (right click and 'Save Link/Target As...'), a file containing the encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the ASCII values in the original text."
+      ]
+    },
+    {
+      "_id": "5900f3a81000cf542c50febb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 60: Prime pair sets",
+      "tests": [
+        "assert.strictEqual(euler60(), 26033, 'message: <code>euler60()</code> should return 26033.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler60() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler60();"
+      ],
+      "description": [
+        "The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property.",
+        "Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime."
+      ]
+    },
+    {
+      "_id": "5900f3a91000cf542c50febc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 61: Cyclical figurate numbers",
+      "tests": [
+        "assert.strictEqual(euler61(), 28684, 'message: <code>euler61()</code> should return 28684.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler61() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler61();"
+      ],
+      "description": [
+        "Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:",
+        "Triangle",
+        " ",
+        "P3,n=n(n+1)/2",
+        " ",
+        "1, 3, 6, 10, 15, ...",
+        "Square",
+        " ",
+        "P4,n=n2",
+        " ",
+        "1, 4, 9, 16, 25, ...",
+        "Pentagonal",
+        " ",
+        "P5,n=n(3n−1)/2",
+        " ",
+        "1, 5, 12, 22, 35, ...",
+        "Hexagonal",
+        " ",
+        "P6,n=n(2n−1)",
+        " ",
+        "1, 6, 15, 28, 45, ...",
+        "Heptagonal",
+        " ",
+        "P7,n=n(5n−3)/2",
+        " ",
+        "1, 7, 18, 34, 55, ...",
+        "Octagonal",
+        " ",
+        "P8,n=n(3n−2)",
+        " ",
+        "1, 8, 21, 40, 65, ...",
+        "The ordered set of three 4-digit numbers: 8128, 2882, 8281, has three interesting properties.",
+        "The set is cyclic, in that the last two digits of each number is the first two digits of the next number (including the last number with the first).",
+        "Each polygonal type: triangle (P3,127=8128), square (P4,91=8281), and pentagonal (P5,44=2882), is represented by a different number in the set.",
+        "This is the only set of 4-digit numbers with this property.",
+        "Find the sum of the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different number in the set."
+      ]
+    },
+    {
+      "_id": "5900f3aa1000cf542c50febd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 62: Cubic permutations",
+      "tests": [
+        "assert.strictEqual(euler62(), 127035954683, 'message: <code>euler62()</code> should return 127035954683.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler62() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler62();"
+      ],
+      "description": [
+        "The cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube.",
+        "Find the smallest cube for which exactly five permutations of its digits are cube."
+      ]
+    },
+    {
+      "_id": "5900f3ab1000cf542c50febe",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 63: Powerful digit counts",
+      "tests": [
+        "assert.strictEqual(euler63(), 49, 'message: <code>euler63()</code> should return 49.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler63() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler63();"
+      ],
+      "description": [
+        "The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number, 134217728=89, is a ninth power.",
+        "How many n-digit positive integers exist which are also an nth power?"
+      ]
+    },
+    {
+      "_id": "5900f3ac1000cf542c50febf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 64: Odd period square roots",
+      "tests": [
+        "assert.strictEqual(euler64(), 1322, 'message: <code>euler64()</code> should return 1322.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler64() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler64();"
+      ],
+      "description": [
+        "All square roots are periodic when written as continued fractions and can be written in the form:",
+        "",
+        "√N = a0 +",
+        "1",
+        " ",
+        "a1 +",
+        "1",
+        " ",
+        " ",
+        "a2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        "a3 + ...",
+        "",
+        "For example, let us consider √23:",
+        "",
+        "√23 = 4 + √23 — 4 = 4 + ",
+        "1",
+        " = 4 + ",
+        "1",
+        " ",
+        "1√23—4",
+        " ",
+        "1 + ",
+        "√23 – 37",
+        "",
+        "If we continue we would get the following expansion:",
+        "",
+        "√23 = 4 +",
+        "1",
+        " ",
+        "1 +",
+        "1",
+        " ",
+        " ",
+        "3 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        "1 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        " ",
+        "8 + ...",
+        "",
+        "The process can be summarised as follows:",
+        "",
+        "a0 = 4,",
+        " ",
+        "1√23—4",
+        " = ",
+        "√23+47",
+        " = 1 + ",
+        "√23—37",
+        "a1 = 1,",
+        " ",
+        "7√23—3",
+        " = ",
+        "7(√23+3)14",
+        " = 3 + ",
+        "√23—32",
+        "a2 = 3,",
+        " ",
+        "2√23—3",
+        " = ",
+        "2(√23+3)14",
+        " = 1 + ",
+        "√23—47",
+        "a3 = 1,",
+        " ",
+        "7√23—4",
+        " = ",
+        "7(√23+4)7",
+        " = 8 + ",
+        "√23—4",
+        "a4 = 8,",
+        " ",
+        "1√23—4",
+        " = ",
+        "√23+47",
+        " = 1 + ",
+        "√23—37",
+        "a5 = 1,",
+        " ",
+        "7√23—3",
+        " = ",
+        "7(√23+3)14",
+        " = 3 + ",
+        "√23—32",
+        "a6 = 3,",
+        " ",
+        "2√23—3",
+        " = ",
+        "2(√23+3)14",
+        " = 1 + ",
+        "√23—47",
+        "a7 = 1,",
+        " ",
+        "7√23—4",
+        " = ",
+        "7(√23+4)7",
+        " = 8 + ",
+        "√23—4",
+        "",
+        "It can be seen that the sequence is repeating. For conciseness, we use the notation √23 = [4;(1,3,1,8)], to indicate that the block (1,3,1,8) repeats indefinitely.",
+        "",
+        "The first ten continued fraction representations of (irrational) square roots are:",
+        "√2=[1;(2)], period=1",
+        "√3=[1;(1,2)], period=2",
+        "√5=[2;(4)], period=1",
+        "√6=[2;(2,4)], period=2",
+        "√7=[2;(1,1,1,4)], period=4",
+        "√8=[2;(1,4)], period=2",
+        "√10=[3;(6)], period=1",
+        "√11=[3;(3,6)], period=2",
+        "√12= [3;(2,6)], period=2",
+        "√13=[3;(1,1,1,1,6)], period=5",
+        "Exactly four continued fractions, for N ≤ 13, have an odd period.",
+        "How many continued fractions for N ≤ 10000 have an odd period?"
+      ]
+    },
+    {
+      "_id": "5900f3ad1000cf542c50fec0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 65: Convergents of e",
+      "tests": [
+        "assert.strictEqual(euler65(), 272, 'message: <code>euler65()</code> should return 272.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler65() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler65();"
+      ],
+      "description": [
+        "The square root of 2 can be written as an infinite continued fraction.",
+        "",
+        "√2 = 1 +",
+        "1",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        " ",
+        "2 + ...",
+        "",
+        "The infinite continued fraction can be written, √2 = [1;(2)], (2) indicates that 2 repeats ad infinitum. In a similar way, √23 = [4;(1,3,1,8)].",
+        "It turns out that the sequence of partial values of continued fractions for square roots provide the best rational approximations. Let us consider the convergents for √2.",
+        "",
+        "",
+        "1 +",
+        "1",
+        "= 3/2",
+        " ",
+        "2",
+        " ",
+        "1 +",
+        "1",
+        "= 7/5",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        "2",
+        " ",
+        "1 +",
+        "1",
+        "= 17/12",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        " ",
+        "2",
+        " ",
+        "1 +",
+        "1",
+        "= 41/29",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        " ",
+        "2 +",
+        "1",
+        " ",
+        " ",
+        " ",
+        " ",
+        " ",
+        "2",
+        " ",
+        "",
+        "Hence the sequence of the first ten convergents for √2 are:",
+        "1, 3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408, 1393/985, 3363/2378, ...",
+        "What is most surprising is that the important mathematical constant,e = [2; 1,2,1, 1,4,1, 1,6,1 , ... , 1,2k,1, ...].",
+        "The first ten terms in the sequence of convergents for e are:",
+        "2, 3, 8/3, 11/4, 19/7, 87/32, 106/39, 193/71, 1264/465, 1457/536, ...",
+        "The sum of digits in the numerator of the 10th convergent is 1+4+5+7=17.",
+        "Find the sum of digits in the numerator of the 100th convergent of the continued fraction for e."
+      ]
+    },
+    {
+      "_id": "5900f3ae1000cf542c50fec1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 66: Diophantine equation",
+      "tests": [
+        "assert.strictEqual(euler66(), 661, 'message: <code>euler66()</code> should return 661.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler66() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler66();"
+      ],
+      "description": [
+        "Consider quadratic Diophantine equations of the form:",
+        "x2 – Dy2 = 1",
+        "For example, when D=13, the minimal solution in x is 6492 – 13×1802 = 1.",
+        "It can be assumed that there are no solutions in positive integers when D is square.",
+        "By finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the following:",
+        "32 – 2×22 = 1",
+        "22 – 3×12 = 192 – 5×42 = 1",
+        "52 – 6×22 = 1",
+        "82 – 7×32 = 1",
+        "Hence, by considering minimal solutions in x for D ≤ 7, the largest x is obtained when D=5.",
+        "Find the value of D ≤ 1000 in minimal solutions of x for which the largest value of x is obtained."
+      ]
+    },
+    {
+      "_id": "5900f3b01000cf542c50fec2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 67: Maximum path sum II",
+      "tests": [
+        "assert.strictEqual(euler67(), 7273, 'message: <code>euler67()</code> should return 7273.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler67() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler67();"
+      ],
+      "description": [
+        "By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.",
+        "37 4",
+        "2 4 6",
+        "8 5 9 3",
+        "That is, 3 + 7 + 4 + 9 = 23.",
+        "Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.",
+        "NOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 299 altogether! If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)"
+      ]
+    },
+    {
+      "_id": "5900f3b01000cf542c50fec3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 68: Magic 5-gon ring",
+      "tests": [
+        "assert.strictEqual(euler68(), 6531031914842725, 'message: <code>euler68()</code> should return 6531031914842725.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler68() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler68();"
+      ],
+      "description": [
+        "Consider the following \"magic\" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.",
+        "",
+        "",
+        "Working clockwise, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.",
+        "It is possible to complete the ring with four different totals: 9, 10, 11, and 12. There are eight solutions in total.",
+        "",
+        "TotalSolution Set",
+        "94,2,3; 5,3,1; 6,1,2",
+        "94,3,2; 6,2,1; 5,1,3",
+        "102,3,5; 4,5,1; 6,1,3",
+        "102,5,3; 6,3,1; 4,1,5",
+        "111,4,6; 3,6,2; 5,2,4",
+        "111,6,4; 5,4,2; 3,2,6",
+        "121,5,6; 2,6,4; 3,4,5",
+        "121,6,5; 3,5,4; 2,4,6",
+        "",
+        "By concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513.",
+        "Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum 16-digit string for a \"magic\" 5-gon ring?"
+      ]
+    },
+    {
+      "_id": "5900f3b11000cf542c50fec4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 69: Totient maximum",
+      "tests": [
+        "assert.strictEqual(euler69(), 510510, 'message: <code>euler69()</code> should return 510510.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler69() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler69();"
+      ],
+      "description": [
+        "Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.",
+        "",
+        "n",
+        "Relatively Prime",
+        "φ(n)",
+        "n/φ(n)",
+        "2",
+        "1",
+        "1",
+        "2",
+        "3",
+        "1,2",
+        "2",
+        "1.5",
+        "4",
+        "1,3",
+        "2",
+        "2",
+        "5",
+        "1,2,3,4",
+        "4",
+        "1.25",
+        "6",
+        "1,5",
+        "2",
+        "3",
+        "7",
+        "1,2,3,4,5,6",
+        "6",
+        "1.1666...",
+        "8",
+        "1,3,5,7",
+        "4",
+        "2",
+        "9",
+        "1,2,4,5,7,8",
+        "6",
+        "1.5",
+        "10",
+        "1,3,7,9",
+        "4",
+        "2.5",
+        "",
+        "It can be seen that n=6 produces a maximum n/φ(n) for n ≤ 10.",
+        "Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum."
+      ]
+    },
+    {
+      "_id": "5900f3b21000cf542c50fec5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 70: Totient permutation",
+      "tests": [
+        "assert.strictEqual(euler70(), 8319823, 'message: <code>euler70()</code> should return 8319823.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler70() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler70();"
+      ],
+      "description": [
+        "Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.The number 1 is considered to be relatively prime to every positive number, so φ(1)=1. ",
+        "Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.",
+        "Find the value of n, 1 < n < 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum."
+      ]
+    },
+    {
+      "_id": "5900f3b31000cf542c50fec6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 71: Ordered fractions",
+      "tests": [
+        "assert.strictEqual(euler71(), 428570, 'message: <code>euler71()</code> should return 428570.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler71() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler71();"
+      ],
+      "description": [
+        "Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.",
+        "If we list the set of reduced proper fractions for d ≤ 8 in ascending order of size, we get:",
+        "1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8",
+        "It can be seen that 2/5 is the fraction immediately to the left of 3/7.",
+        "By listing the set of reduced proper fractions for d ≤ 1,000,000 in ascending order of size, find the numerator of the fraction immediately to the left of 3/7."
+      ]
+    },
+    {
+      "_id": "5900f3b41000cf542c50fec7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 72: Counting fractions",
+      "tests": [
+        "assert.strictEqual(euler72(), 303963552391, 'message: <code>euler72()</code> should return 303963552391.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler72() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler72();"
+      ],
+      "description": [
+        "Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.",
+        "If we list the set of reduced proper fractions for d ≤ 8 in ascending order of size, we get:",
+        "1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8",
+        "It can be seen that there are 21 elements in this set.",
+        "How many elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000?"
+      ]
+    },
+    {
+      "_id": "5900f3b61000cf542c50fec8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 73: Counting fractions in a range",
+      "tests": [
+        "assert.strictEqual(euler73(), 7295372, 'message: <code>euler73()</code> should return 7295372.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler73() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler73();"
+      ],
+      "description": [
+        "Consider the fraction, n/d, where n and d are positive integers. If n<d and HCF(n,d)=1, it is called a reduced proper fraction.",
+        "If we list the set of reduced proper fractions for d ≤ 8 in ascending order of size, we get:",
+        "1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8",
+        "It can be seen that there are 3 fractions between 1/3 and 1/2.",
+        "How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for d ≤ 12,000?"
+      ]
+    },
+    {
+      "_id": "5900f3b61000cf542c50fec9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 74: Digit factorial chains",
+      "tests": [
+        "assert.strictEqual(euler74(), 402, 'message: <code>euler74()</code> should return 402.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler74() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler74();"
+      ],
+      "description": [
+        "The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:",
+        "1! + 4! + 5! = 1 + 24 + 120 = 145",
+        "Perhaps less well known is 169, in that it produces the longest chain of numbers that link back to 169; it turns out that there are only three such loops that exist:",
+        "169 → 363601 → 1454 → 169",
+        "871 → 45361 → 871",
+        "872 → 45362 → 872",
+        "It is not difficult to prove that EVERY starting number will eventually get stuck in a loop. For example,",
+        "69 → 363600 → 1454 → 169 → 363601 (→ 1454)",
+        "78 → 45360 → 871 → 45361 (→ 871)",
+        "540 → 145 (→ 145)",
+        "Starting with 69 produces a chain of five non-repeating terms, but the longest non-repeating chain with a starting number below one million is sixty terms.",
+        "How many chains, with a starting number below one million, contain exactly sixty non-repeating terms?"
+      ]
+    },
+    {
+      "_id": "5900f3b71000cf542c50feca",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 75: Singular integer right triangles",
+      "tests": [
+        "assert.strictEqual(euler75(), 161667, 'message: <code>euler75()</code> should return 161667.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler75() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler75();"
+      ],
+      "description": [
+        "It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples.",
+        "12 cm: (3,4,5)24 cm: (6,8,10)30 cm: (5,12,13)36 cm: (9,12,15)40 cm: (8,15,17)48 cm: (12,16,20)",
+        "In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided right angle triangle, and other lengths allow more than one solution to be found; for example, using 120 cm it is possible to form exactly three different integer sided right angle triangles.",
+        "120 cm: (30,40,50), (20,48,52), (24,45,51)",
+        "Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can exactly one integer sided right angle triangle be formed?"
+      ]
+    },
+    {
+      "_id": "5900f3b81000cf542c50fecb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 76: Counting summations",
+      "tests": [
+        "assert.strictEqual(euler76(), 190569291, 'message: <code>euler76()</code> should return 190569291.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler76() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler76();"
+      ],
+      "description": [
+        "It is possible to write five as a sum in exactly six different ways:",
+        "4 + 1",
+        "3 + 2",
+        "3 + 1 + 1",
+        "2 + 2 + 1",
+        "2 + 1 + 1 + 1",
+        "1 + 1 + 1 + 1 + 1",
+        "How many different ways can one hundred be written as a sum of at least two positive integers?"
+      ]
+    },
+    {
+      "_id": "5900f3b91000cf542c50fecc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 77: Prime summations",
+      "tests": [
+        "assert.strictEqual(euler77(), 71, 'message: <code>euler77()</code> should return 71.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler77() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler77();"
+      ],
+      "description": [
+        "It is possible to write ten as the sum of primes in exactly five different ways:",
+        "7 + 3",
+        "5 + 5",
+        "5 + 3 + 2",
+        "3 + 3 + 2 + 2",
+        "2 + 2 + 2 + 2 + 2",
+        "What is the first value which can be written as the sum of primes in over five thousand different ways?"
+      ]
+    },
+    {
+      "_id": "5900f3ba1000cf542c50fecd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 78: Coin partitions",
+      "tests": [
+        "assert.strictEqual(euler78(), 55374, 'message: <code>euler78()</code> should return 55374.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler78() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler78();"
+      ],
+      "description": [
+        "Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.",
+        "",
+        "OOOOO",
+        "OOOO   O",
+        "OOO   OO",
+        "OOO   O   O",
+        "OO   OO   O",
+        "OO   O   O   O",
+        "O   O   O   O   O",
+        "",
+        "Find the least value of n for which p(n) is divisible by one million."
+      ]
+    },
+    {
+      "_id": "5900f3bb1000cf542c50fece",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 79: Passcode derivation",
+      "tests": [
+        "assert.strictEqual(euler79(), 73162890, 'message: <code>euler79()</code> should return 73162890.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler79() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler79();"
+      ],
+      "description": [
+        "A common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask for the 2nd, 3rd, and 5th characters; the expected reply would be: 317.",
+        "The text file, keylog.txt, contains fifty successful login attempts.",
+        "Given that the three characters are always asked for in order, analyse the file so as to determine the shortest possible secret passcode of unknown length."
+      ]
+    },
+    {
+      "_id": "5900f3bc1000cf542c50fecf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 80: Square root digital expansion",
+      "tests": [
+        "assert.strictEqual(euler80(), 40886, 'message: <code>euler80()</code> should return 40886.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler80() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler80();"
+      ],
+      "description": [
+        "It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.",
+        "The square root of two is 1.41421356237309504880..., and the digital sum of the first one hundred decimal digits is 475.",
+        "For the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots."
+      ]
+    },
+    {
+      "_id": "5900f3bd1000cf542c50fed0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 81: Path sum: two ways",
+      "tests": [
+        "assert.strictEqual(euler81(), 427337, 'message: <code>euler81()</code> should return 427337.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler81() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler81();"
+      ],
+      "description": [
+        "In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.",
+        "",
+        "$$",
+        "\\begin{pmatrix}",
+        "\\color{red}{131} & 673 & 234 & 103 & 18\\\\",
+        "\\color{red}{201} & \\color{red}{96} & \\color{red}{342} & 965 & 150\\\\",
+        "630 & 803 & \\color{red}{746} & \\color{red}{422} & 111\\\\",
+        "537 & 699 & 497 & \\color{red}{121} & 956\\\\",
+        "805 & 732 & 524 & \\color{red}{37} & \\color{red}{331}",
+        "\\end{pmatrix}",
+        "$$",
+        "",
+        "Find the minimal path sum, in matrix.txt (right click and \"Save Link/Target As...\"), a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by only moving right and down."
+      ]
+    },
+    {
+      "_id": "5900f3be1000cf542c50fed1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 82: Path sum: three ways",
+      "tests": [
+        "assert.strictEqual(euler82(), 260324, 'message: <code>euler82()</code> should return 260324.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler82() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler82();"
+      ],
+      "description": [
+        "NOTE: This problem is a more challenging version of Problem 81.",
+        "The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red and bold; the sum is equal to 994.",
+        "",
+        "$$",
+        "\\begin{pmatrix}",
+        "131 & 673 & \\color{red}{234} & \\color{red}{103} & \\color{red}{18}\\\\",
+        "\\color{red}{201} & \\color{red}{96} & \\color{red}{342} & 965 & 150\\\\",
+        "630 & 803 & 746 & 422 & 111\\\\",
+        "537 & 699 & 497 & 121 & 956\\\\",
+        "805 & 732 & 524 & 37 & 331",
+        "\\end{pmatrix}",
+        "$$",
+        "",
+        "Find the minimal path sum, in matrix.txt (right click and \"Save Link/Target As...\"), a 31K text file containing a 80 by 80 matrix, from the left column to the right column."
+      ]
+    },
+    {
+      "_id": "5900f3bf1000cf542c50fed2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 83: Path sum: four ways",
+      "tests": [
+        "assert.strictEqual(euler83(), 425185, 'message: <code>euler83()</code> should return 425185.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler83() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler83();"
+      ],
+      "description": [
+        "NOTE: This problem is a significantly more challenging version of Problem 81.",
+        "In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to 2297.",
+        "",
+        "$$",
+        "\\begin{pmatrix}",
+        "\\color{red}{131} & 673 & \\color{red}{234} & \\color{red}{103} & \\color{red}{18}\\\\",
+        "\\color{red}{201} & \\color{red}{96} & \\color{red}{342} & 965 & \\color{red}{150}\\\\",
+        "630 & 803 & 746 & \\color{red}{422} & \\color{red}{111}\\\\",
+        "537 & 699 & 497 & \\color{red}{121} & 956\\\\",
+        "805 & 732 & 524 & \\color{red}{37} & \\color{red}{331}",
+        "\\end{pmatrix}",
+        "$$",
+        "",
+        "Find the minimal path sum, in matrix.txt (right click and ",
+        "\"Save Link/Target As...\"), a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by moving left, right, up, and down."
+      ]
+    },
+    {
+      "_id": "5900f3c11000cf542c50fed3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 84: Monopoly odds",
+      "tests": [
+        "assert.strictEqual(euler84(), 101524, 'message: <code>euler84()</code> should return 101524.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler84() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler84();"
+      ],
+      "description": [
+        "In the game, Monopoly, the standard board is set up in the following way:",
+        "",
+        "GO",
+        "A1",
+        "CC1",
+        "A2",
+        "T1",
+        "R1",
+        "B1",
+        "CH1",
+        "B2",
+        "B3",
+        "JAIL",
+        "H2",
+        " ",
+        "C1",
+        "T2",
+        " ",
+        "U1",
+        "H1",
+        " ",
+        "C2",
+        "CH3",
+        " ",
+        "C3",
+        "R4",
+        " ",
+        "R2",
+        "G3",
+        " ",
+        "D1",
+        "CC3",
+        " ",
+        "CC2",
+        "G2",
+        " ",
+        "D2",
+        "G1",
+        " ",
+        "D3",
+        "G2J",
+        "F3",
+        "U2",
+        "F2",
+        "F1",
+        "R3",
+        "E3",
+        "E2",
+        "CH2",
+        "E1",
+        "FP",
+        "",
+        "A player starts on the GO square and adds the scores on two 6-sided dice to determine the number of squares they advance in a clockwise direction. Without any further rules we would expect to visit each square with equal probability: 2.5%. However, landing on G2J (Go To Jail), CC (community chest), and CH (chance) changes this distribution.",
+        "In addition to G2J, and one card from each of CC and CH, that orders the player to go directly to jail, if a player rolls three consecutive doubles, they do not advance the result of their 3rd roll. Instead they proceed directly to jail.",
+        "At the beginning of the game, the CC and CH cards are shuffled. When a player lands on CC or CH they take a card from the top of the respective pile and, after following the instructions, it is returned to the bottom of the pile. There are sixteen cards in each pile, but for the purpose of this problem we are only concerned with cards that order a movement; any instruction not concerned with movement will be ignored and the player will remain on the CC/CH square.",
+        "Community Chest (2/16 cards):",
+        "Advance to GO",
+        "Go to JAIL",
+        "",
+        "Chance (10/16 cards):",
+        "Advance to GO",
+        "Go to JAIL",
+        "Go to C1",
+        "Go to E3",
+        "Go to H2",
+        "Go to R1",
+        "Go to next R (railway company)",
+        "Go to next R",
+        "Go to next U (utility company)",
+        "Go back 3 squares.",
+        "",
+        "The heart of this problem concerns the likelihood of visiting a particular square. That is, the probability of finishing at that square after a roll. For this reason it should be clear that, with the exception of G2J for which the probability of finishing on it is zero, the CH squares will have the lowest probabilities, as 5/8 request a movement to another square, and it is the final square that the player finishes at on each roll that we are interested in. We shall make no distinction between \"Just Visiting\" and being sent to JAIL, and we shall also ignore the rule about requiring a double to \"get out of jail\", assuming that they pay to get out on their next turn.",
+        "By starting at GO and numbering the squares sequentially from 00 to 39 we can concatenate these two-digit numbers to produce strings that correspond with sets of squares.",
+        "Statistically it can be shown that the three most popular squares, in order, are JAIL (6.24%) = Square 10, E3 (3.18%) = Square 24, and GO (3.09%) = Square 00. So these three most popular squares can be listed with the six-digit modal string: 102400.",
+        "If, instead of using two 6-sided dice, two 4-sided dice are used, find the six-digit modal string."
+      ]
+    },
+    {
+      "_id": "5900f3c11000cf542c50fed4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 85: Counting rectangles",
+      "tests": [
+        "assert.strictEqual(euler85(), 2772, 'message: <code>euler85()</code> should return 2772.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler85() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler85();"
+      ],
+      "description": [
+        "By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:",
+        "",
+        "",
+        "Although there exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution."
+      ]
+    },
+    {
+      "_id": "5900f3c31000cf542c50fed5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 86: Cuboid route",
+      "tests": [
+        "assert.strictEqual(euler86(), 1818, 'message: <code>euler86()</code> should return 1818.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler86() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler86();"
+      ],
+      "description": [
+        "A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest \"straight line\" distance from S to F is 10 and the path is shown on the diagram.",
+        "",
+        "",
+        "However, there are up to three \"shortest\" path candidates for any given cuboid and the shortest route doesn't always have integer length.",
+        "It can be shown that there are exactly 2060 distinct cuboids, ignoring rotations, with integer dimensions, up to a maximum size of M by M by M, for which the shortest route has integer length when M = 100. This is the least value of M for which the number of solutions first exceeds two thousand; the number of solutions when M = 99 is 1975.",
+        "Find the least value of M such that the number of solutions first exceeds one million."
+      ]
+    },
+    {
+      "_id": "5900f3c51000cf542c50fed8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 87: Prime power triples",
+      "tests": [
+        "assert.strictEqual(euler87(), 1097343, 'message: <code>euler87()</code> should return 1097343.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler87() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler87();"
+      ],
+      "description": [
+        "The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way:",
+        "28 = 22 + 23 + 24",
+        "33 = 32 + 23 + 24",
+        "49 = 52 + 23 + 24",
+        "47 = 22 + 33 + 24",
+        "How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?"
+      ]
+    },
+    {
+      "_id": "5900f3c51000cf542c50fed6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 88: Product-sum numbers",
+      "tests": [
+        "assert.strictEqual(euler88(), 7587457, 'message: <code>euler88()</code> should return 7587457.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler88() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler88();"
+      ],
+      "description": [
+        "A natural number, N, that can be written as the sum and product of a given set of at least two natural numbers, {a1, a2, ... , ak} is called a product-sum number: N = a1 + a2 + ... + ak = a1 × a2 × ... × ak.",
+        "For example, 6 = 1 + 2 + 3 = 1 × 2 × 3.",
+        "For a given set of size, k, we shall call the smallest N with this property a minimal product-sum number. The minimal product-sum numbers for sets of size, k = 2, 3, 4, 5, and 6 are as follows.",
+        "k=2: 4 = 2 × 2 = 2 + 2k=3: 6 = 1 × 2 × 3 = 1 + 2 + 3k=4: 8 = 1 × 1 × 2 × 4 = 1 + 1 + 2 + 4k=5: 8 = 1 × 1 × 2 × 2 × 2  = 1 + 1 + 2 + 2 + 2k=6: 12 = 1 × 1 × 1 × 1 × 2 × 6 = 1 + 1 + 1 + 1 + 2 + 6",
+        "Hence for 2≤k≤6, the sum of all the minimal product-sum numbers is 4+6+8+12 = 30; note that 8 is only counted once in the sum.",
+        "In fact, as the complete set of minimal product-sum numbers for 2≤k≤12 is {4, 6, 8, 12, 15, 16}, the sum is 61.",
+        "What is the sum of all the minimal product-sum numbers for 2≤k≤12000?"
+      ]
+    },
+    {
+      "_id": "5900f3c51000cf542c50fed7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 89: Roman numerals",
+      "tests": [
+        "assert.strictEqual(euler89(), 743, 'message: <code>euler89()</code> should return 743.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler89() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler89();"
+      ],
+      "description": [
+        "For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is always a \"best\" way of writing a particular number.",
+        "For example, it would appear that there are at least six ways of writing the number sixteen:",
+        "IIIIIIIIIIIIIIII",
+        "VIIIIIIIIIII",
+        "VVIIIIII",
+        "XIIIIII",
+        "VVVI",
+        "XVI",
+        "However, according to the rules only XIIIIII and XVI are valid, and the last example is considered to be the most efficient, as it uses the least number of numerals.",
+        "The 11K text file, roman.txt (right click and 'Save Link/Target As...'), contains one thousand numbers written in valid, but not necessarily minimal, Roman numerals; see About... Roman Numerals for the definitive rules for this problem.",
+        "Find the number of characters saved by writing each of these in their minimal form.",
+        "Note: You can assume that all the Roman numerals in the file contain no more than four consecutive identical units."
+      ]
+    },
+    {
+      "_id": "5900f3c61000cf542c50fed9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 90: Cube digit pairs",
+      "tests": [
+        "assert.strictEqual(euler90(), 1217, 'message: <code>euler90()</code> should return 1217.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler90() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler90();"
+      ],
+      "description": [
+        "Each of the six faces on a cube has a different digit (0 to 9) written on it; the same is done to a second cube. By placing the two cubes side-by-side in different positions we can form a variety of 2-digit numbers.",
+        "",
+        "For example, the square number 64 could be formed:",
+        "",
+        "",
+        "",
+        "",
+        "In fact, by carefully choosing the digits on both cubes it is possible to display all of the square numbers below one-hundred: 01, 04, 09, 16, 25, 36, 49, 64, and 81.",
+        "",
+        "For example, one way this can be achieved is by placing {0, 5, 6, 7, 8, 9} on one cube and {1, 2, 3, 4, 8, 9} on the other cube.",
+        "",
+        "However, for this problem we shall allow the 6 or 9 to be turned upside-down so that an arrangement like {0, 5, 6, 7, 8, 9} and {1, 2, 3, 4, 6, 7} allows for all nine square numbers to be displayed; otherwise it would be impossible to obtain 09.",
+        "",
+        "In determining a distinct arrangement we are interested in the digits on each cube, not the order.",
+        "",
+        "{1, 2, 3, 4, 5, 6} is equivalent to {3, 6, 4, 1, 2, 5}",
+        "{1, 2, 3, 4, 5, 6} is distinct from {1, 2, 3, 4, 5, 9}",
+        "",
+        "But because we are allowing 6 and 9 to be reversed, the two distinct sets in the last example both represent the extended set {1, 2, 3, 4, 5, 6, 9} for the purpose of forming 2-digit numbers.",
+        "",
+        "How many distinct arrangements of the two cubes allow for all of the square numbers to be displayed?"
+      ]
+    },
+    {
+      "_id": "5900f3c71000cf542c50feda",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 91: Right triangles with integer coordinates",
+      "tests": [
+        "assert.strictEqual(euler91(), 14234, 'message: <code>euler91()</code> should return 14234.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler91() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler91();"
+      ],
+      "description": [
+        "The points P (x1, y1) and Q (x2, y2) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.",
+        "",
+        "",
+        "",
+        "",
+        "There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is,0 ≤ x1, y1, x2, y2 ≤ 2.",
+        "",
+        "",
+        "",
+        "",
+        "Given that 0 ≤ x1, y1, x2, y2 ≤ 50, how many right triangles can be formed?"
+      ]
+    },
+    {
+      "_id": "5900f3c81000cf542c50fedb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 92: Square digit chains",
+      "tests": [
+        "assert.strictEqual(euler92(), 8581146, 'message: <code>euler92()</code> should return 8581146.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler92() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler92();"
+      ],
+      "description": [
+        "A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.",
+        "For example,",
+        "44 → 32 → 13 → 10 → 1 → 1",
+        "85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89",
+        "Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY starting number will eventually arrive at 1 or 89.",
+        "How many starting numbers below ten million will arrive at 89?"
+      ]
+    },
+    {
+      "_id": "5900f3ca1000cf542c50fedc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 93: Arithmetic expressions",
+      "tests": [
+        "assert.strictEqual(euler93(), 1258, 'message: <code>euler93()</code> should return 1258.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler93() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler93();"
+      ],
+      "description": [
+        "By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, *, /) and brackets/parentheses, it is possible to form different positive integer targets.",
+        "For example,",
+        "8 = (4 * (1 + 3)) / 2",
+        "14 = 4 * (3 + 1 / 2)",
+        "19 = 4 * (2 + 3) − 1",
+        "36 = 3 * 4 * (2 + 1)",
+        "Note that concatenations of the digits, like 12 + 34, are not allowed.",
+        "Using the set, {1, 2, 3, 4}, it is possible to obtain thirty-one different target numbers of which 36 is the maximum, and each of the numbers 1 to 28 can be obtained before encountering the first non-expressible number.",
+        "Find the set of four distinct digits, a < b < c < d, for which the longest set of consecutive positive integers, 1 to n, can be obtained, giving your answer as a string: abcd."
+      ]
+    },
+    {
+      "_id": "5900f3ca1000cf542c50fedd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 94: Almost equilateral triangles",
+      "tests": [
+        "assert.strictEqual(euler94(), 518408346, 'message: <code>euler94()</code> should return 518408346.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler94() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler94();"
+      ],
+      "description": [
+        "It is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the almost equilateral triangle 5-5-6 has an area of 12 square units.",
+        "We shall define an almost equilateral triangle to be a triangle for which two sides are equal and the third differs by no more than one unit.",
+        "Find the sum of the perimeters of all almost equilateral triangles with integral side lengths and area and whose perimeters do not exceed one billion (1,000,000,000)."
+      ]
+    },
+    {
+      "_id": "5900f3cc1000cf542c50fede",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 95: Amicable chains",
+      "tests": [
+        "assert.strictEqual(euler95(), 14316, 'message: <code>euler95()</code> should return 14316.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler95() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler95();"
+      ],
+      "description": [
+        "The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these divisors is equal to 28, we call it a perfect number.",
+        "Interestingly the sum of the proper divisors of 220 is 284 and the sum of the proper divisors of 284 is 220, forming a chain of two numbers. For this reason, 220 and 284 are called an amicable pair.",
+        "Perhaps less well known are longer chains. For example, starting with 12496, we form a chain of five numbers:",
+        "12496 → 14288 → 15472 → 14536 → 14264 (→ 12496 → ...)",
+        "Since this chain returns to its starting point, it is called an amicable chain.",
+        "Find the smallest member of the longest amicable chain with no element exceeding one million."
+      ]
+    },
+    {
+      "_id": "5900f3cc1000cf542c50fedf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 96: Su Doku",
+      "tests": [
+        "assert.strictEqual(euler96(), 24702, 'message: <code>euler96()</code> should return 24702.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler96() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler96();"
+      ],
+      "description": [
+        "Su Doku (Japanese meaning number place) is the name given to a popular puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard Euler who invented a similar, and much more difficult, puzzle idea called Latin Squares. The objective of Su Doku puzzles, however, is to replace the blanks (or zeros) in a 9 by 9 grid in such that each row, column, and 3 by 3 box contains each of the digits 1 to 9. Below is an example of a typical starting puzzle grid and its solution grid.",
+        "",
+        "",
+        "0 0 39 0 00 0 1",
+        "0 2 03 0 58 0 6",
+        "6 0 00 0 14 0 0",
+        "0 0 87 0 00 0 6",
+        "1 0 20 0 07 0 8",
+        "9 0 00 0 82 0 0",
+        "0 0 28 0 00 0 5",
+        "6 0 92 0 30 1 0",
+        "5 0 00 0 93 0 0",
+        "",
+        "",
+        "",
+        "4 8 39 6 72 5 1",
+        "9 2 13 4 58 7 6",
+        "6 5 78 2 14 9 3",
+        "5 4 87 2 91 3 6",
+        "1 3 25 6 47 9 8",
+        "9 7 61 3 82 4 5",
+        "3 7 28 1 46 9 5",
+        "6 8 92 5 34 1 7",
+        "5 1 47 6 93 8 2",
+        "",
+        "",
+        "A well constructed Su Doku puzzle has a unique solution and can be solved by logic, although it may be necessary to employ \"guess and test\" methods in order to eliminate options (there is much contested opinion over this). The complexity of the search determines the difficulty of the puzzle; the example above is considered easy because it can be solved by straight forward direct deduction.",
+        "The 6K text file, sudoku.txt (right click and 'Save Link/Target As...'), contains fifty different Su Doku puzzles ranging in difficulty, but all with unique solutions (the first puzzle in the file is the example above).",
+        "By solving all fifty puzzles find the sum of the 3-digit numbers found in the top left corner of each solution grid; for example, 483 is the 3-digit number found in the top left corner of the solution grid above."
+      ]
+    },
+    {
+      "_id": "5900f3ce1000cf542c50fee0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 97: Large non-Mersenne prime",
+      "tests": [
+        "assert.strictEqual(euler97(), 8739992577, 'message: <code>euler97()</code> should return 8739992577.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler97() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler97();"
+      ],
+      "description": [
+        "The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 26972593−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2p−1, have been found which contain more digits.",
+        "However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433×27830457+1.",
+        "Find the last ten digits of this prime number."
+      ]
+    },
+    {
+      "_id": "5900f3cf1000cf542c50fee1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 98: Anagramic squares",
+      "tests": [
+        "assert.strictEqual(euler98(), 18769, 'message: <code>euler98()</code> should return 18769.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler98() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler98();"
+      ],
+      "description": [
+        "By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = 362. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216 = 962. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.",
+        "Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words, find all the square anagram word pairs (a palindromic word is NOT considered to be an anagram of itself).",
+        "What is the largest square number formed by any member of such a pair?",
+        "NOTE: All anagrams formed must be contained in the given text file."
+      ]
+    },
+    {
+      "_id": "5900f3d01000cf542c50fee2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 99: Largest exponential",
+      "tests": [
+        "assert.strictEqual(euler99(), 709, 'message: <code>euler99()</code> should return 709.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler99() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler99();"
+      ],
+      "description": [
+        "Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would confirm that 211 = 2048 < 37 = 2187.",
+        "However, confirming that 632382518061 > 519432525806 would be much more difficult, as both numbers contain over three million digits.",
+        "Using base_exp.txt (right click and 'Save Link/Target As...'), a 22K text file containing one thousand lines with a base/exponent pair on each line, determine which line number has the greatest numerical value.",
+        "NOTE: The first two lines in the file represent the numbers in the example given above."
+      ]
+    },
+    {
+      "_id": "5900f3d01000cf542c50fee3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 100: Arranged probability",
+      "tests": [
+        "assert.strictEqual(euler100(), 756872327473, 'message: <code>euler100()</code> should return 756872327473.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler100() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler100();"
+      ],
+      "description": [
+        "If a box contains twenty-one coloured discs, composed of fifteen blue discs and six red discs, and two discs were taken at random, it can be seen that the probability of taking two blue discs, P(BB) = (15/21)×(14/20) = 1/2.",
+        "The next such arrangement, for which there is exactly 50% chance of taking two blue discs at random, is a box containing eighty-five blue discs and thirty-five red discs.",
+        "By finding the first arrangement to contain over 1012 = 1,000,000,000,000 discs in total, determine the number of blue discs that the box would contain."
+      ]
+    },
+    {
+      "_id": "5900f3d21000cf542c50fee4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 101: Optimum polynomial",
+      "tests": [
+        "assert.strictEqual(euler101(), 37076114526, 'message: <code>euler101()</code> should return 37076114526.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler101() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler101();"
+      ],
+      "description": [
+        "If we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term, as there are infinitely many polynomial functions that can model the sequence.",
+        "As an example, let us consider the sequence of cube numbers. This is defined by the generating function, un = n3: 1, 8, 27, 64, 125, 216, ...",
+        "Suppose we were only given the first two terms of this sequence. Working on the principle that \"simple is best\" we should assume a linear relationship and predict the next term to be 15 (common difference 7). Even if we were presented with the first three terms, by the same principle of simplicity, a quadratic relationship should be assumed.",
+        "We shall define OP(k, n) to be the nth term of the optimum polynomial generating function for the first k terms of a sequence. It should be clear that OP(k, n) will accurately generate the terms of the sequence for n ≤ k, and potentially the first incorrect term (FIT) will be OP(k, k+1); in which case we shall call it a bad OP (BOP).",
+        "As a basis, if we were only given the first term of sequence, it would be most sensible to assume constancy; that is, for n ≥ 2, OP(1, n) = u1.",
+        "Hence we obtain the following OPs for the cubic sequence:",
+        "",
+        "OP(1, n) = 1",
+        "1, 1, 1, 1, ...",
+        "OP(2, n) = 7n−6",
+        "1, 8, 15, ...",
+        "OP(3, n) = 6n2−11n+6     ",
+        "1, 8, 27, 58, ...",
+        "OP(4, n) = n3",
+        "1, 8, 27, 64, 125, ...",
+        "",
+        "Clearly no BOPs exist for k ≥ 4.",
+        "By considering the sum of FITs generated by the BOPs (indicated in red above), we obtain 1 + 15 + 58 = 74.",
+        "Consider the following tenth degree polynomial generating function:",
+        "un = 1 − n + n2 − n3 + n4 − n5 + n6 − n7 + n8 − n9 + n10",
+        "Find the sum of FITs for the BOPs."
+      ]
+    },
+    {
+      "_id": "5900f3d21000cf542c50fee5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 102: Triangle containment",
+      "tests": [
+        "assert.strictEqual(euler102(), 228, 'message: <code>euler102()</code> should return 228.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler102() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler102();"
+      ],
+      "description": [
+        "Three distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed.",
+        "Consider the following two triangles:",
+        "A(-340,495), B(-153,-910), C(835,-947)",
+        "X(-175,41), Y(-421,-714), Z(574,-645)",
+        "It can be verified that triangle ABC contains the origin, whereas triangle XYZ does not.",
+        "Using triangles.txt (right click and 'Save Link/Target As...'), a 27K text file containing the co-ordinates of one thousand \"random\" triangles, find the number of triangles for which the interior contains the origin.",
+        "NOTE: The first two examples in the file represent the triangles in the example given above."
+      ]
+    },
+    {
+      "_id": "5900f3d61000cf542c50fee7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 103: Special subset sums: optimum",
+      "tests": [
+        "assert.strictEqual(euler103(), 20313839404245, 'message: <code>euler103()</code> should return 20313839404245.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler103() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler103();"
+      ],
+      "description": [
+        "Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:",
+        "S(B) ≠ S(C); that is, sums of subsets cannot be equal.",
+        "If B contains more elements than C then S(B) > S(C).",
+        "If S(A) is minimised for a given n, we shall call it an optimum special sum set. The first five optimum special sum sets are given below.",
+        "n = 1: {1}n = 2: {1, 2}n = 3: {2, 3, 4}n = 4: {3, 5, 6, 7}n = 5: {6, 9, 11, 12, 13}",
+        "It seems that for a given optimum set, A = {a1, a2, ... , an}, the next optimum set is of the form B = {b, a1+b, a2+b, ... ,an+b}, where b is the \"middle\" element on the previous row.",
+        "By applying this \"rule\" we would expect the optimum set for n = 6 to be A = {11, 17, 20, 22, 23, 24}, with S(A) = 117. However, this is not the optimum set, as we have merely applied an algorithm to provide a near optimum set. The optimum set for n = 6 is A = {11, 18, 19, 20, 22, 25}, with S(A) = 115 and corresponding set string: 111819202225.",
+        "Given that A is an optimum special sum set for n = 7, find its set string.",
+        "NOTE: This problem is related to Problem 105 and Problem 106."
+      ]
+    },
+    {
+      "_id": "5900f3d51000cf542c50fee6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 104: Pandigital Fibonacci ends",
+      "tests": [
+        "assert.strictEqual(euler104(), 329468, 'message: <code>euler104()</code> should return 329468.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler104() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler104();"
+      ],
+      "description": [
+        "The Fibonacci sequence is defined by the recurrence relation:",
+        "Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.",
+        "It turns out that F541, which contains 113 digits, is the first Fibonacci number for which the last nine digits are 1-9 pandigital (contain all the digits 1 to 9, but not necessarily in order). And F2749, which contains 575 digits, is the first Fibonacci number for which the first nine digits are 1-9 pandigital.",
+        "Given that Fk is the first Fibonacci number for which the first nine digits AND the last nine digits are 1-9 pandigital, find k."
+      ]
+    },
+    {
+      "_id": "5900f3d61000cf542c50fee8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 105: Special subset sums: testing",
+      "tests": [
+        "assert.strictEqual(euler105(), 73702, 'message: <code>euler105()</code> should return 73702.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler105() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler105();"
+      ],
+      "description": [
+        "Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:",
+        "S(B) ≠ S(C); that is, sums of subsets cannot be equal.",
+        "If B contains more elements than C then S(B) > S(C).",
+        "For example, {81, 88, 75, 42, 87, 84, 86, 65} is not a special sum set because 65 + 87 + 88 = 75 + 81 + 84, whereas {157, 150, 164, 119, 79, 159, 161, 139, 158} satisfies both rules for all possible subset pair combinations and S(A) = 1286.",
+        "Using sets.txt (right click and \"Save Link/Target As...\"), a 4K text file with one-hundred sets containing seven to twelve elements (the two examples given above are the first two sets in the file), identify all the special sum sets, A1, A2, ..., Ak, and find the value of S(A1) + S(A2) + ... + S(Ak).",
+        "NOTE: This problem is related to Problem 103 and Problem 106."
+      ]
+    },
+    {
+      "_id": "5900f3d71000cf542c50fee9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 106: Special subset sums: meta-testing",
+      "tests": [
+        "assert.strictEqual(euler106(), 21384, 'message: <code>euler106()</code> should return 21384.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler106() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler106();"
+      ],
+      "description": [
+        "Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the following properties are true:",
+        "S(B) ≠ S(C); that is, sums of subsets cannot be equal.",
+        "If B contains more elements than C then S(B) > S(C).",
+        "For this problem we shall assume that a given set contains n strictly increasing elements and it already satisfies the second rule.",
+        "Surprisingly, out of the 25 possible subset pairs that can be obtained from a set for which n = 4, only 1 of these pairs need to be tested for equality (first rule). Similarly, when n = 7, only 70 out of the 966 subset pairs need to be tested.",
+        "For n = 12, how many of the 261625 subset pairs that can be obtained need to be tested for equality?",
+        "NOTE: This problem is related to Problem 103 and Problem 105."
+      ]
+    },
+    {
+      "_id": "5900f3d91000cf542c50feea",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 107: Minimal network",
+      "tests": [
+        "assert.strictEqual(euler107(), 259679, 'message: <code>euler107()</code> should return 259679.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler107() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler107();"
+      ],
+      "description": [
+        "The following undirected network consists of seven vertices and twelve edges with a total weight of 243.",
+        "",
+        "",
+        "The same network can be represented by the matrix below.",
+        "    ABCDEFG",
+        "A-161221---",
+        "B16--1720--",
+        "C12--28-31-",
+        "D211728-181923",
+        "E-20-18--11",
+        "F--3119--27",
+        "G---231127-",
+        "However, it is possible to optimise the network by removing some edges and still ensure that all points on the network remain connected. The network which achieves the maximum saving is shown below. It has a weight of 93, representing a saving of 243 − 93 = 150 from the original network.",
+        "",
+        "",
+        "Using network.txt (right click and 'Save Link/Target As...'), a 6K text file containing a network with forty vertices, and given in matrix form, find the maximum saving which can be achieved by removing redundant edges whilst ensuring that the network remains connected."
+      ]
+    },
+    {
+      "_id": "5900f3d91000cf542c50feeb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 108: About Project Euler",
+      "tests": [
+        "assert.strictEqual(euler108(), 180180, 'message: <code>euler108()</code> should return 180180.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler108() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler108();"
+      ],
+      "description": [
+        ""
+      ]
+    },
+    {
+      "_id": "5900f3db1000cf542c50feec",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 109: Darts",
+      "tests": [
+        "assert.strictEqual(euler109(), 38182, 'message: <code>euler109()</code> should return 38182.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler109() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler109();"
+      ],
+      "description": [
+        "In the game of darts a player throws three darts at a target board which is split into twenty equal sized sections numbered one to twenty.",
+        "",
+        "",
+        "The score of a dart is determined by the number of the region that the dart lands in. A dart landing outside the red/green outer ring scores zero. The black and cream regions inside this ring represent single scores. However, the red/green outer ring and middle ring score double and treble scores respectively.",
+        "At the centre of the board are two concentric circles called the bull region, or bulls-eye. The outer bull is worth 25 points and the inner bull is a double, worth 50 points.",
+        "There are many variations of rules but in the most popular game the players will begin with a score 301 or 501 and the first player to reduce their running total to zero is a winner. However, it is normal to play a \"doubles out\" system, which means that the player must land a double (including the double bulls-eye at the centre of the board) on their final dart to win; any other dart that would reduce their running total to one or lower means the score for that set of three darts is \"bust\".",
+        "When a player is able to finish  on their current score it is called a \"checkout\" and the highest checkout is 170: T20 T20 D25 (two treble 20s and double bull).",
+        "There are exactly eleven distinct ways to checkout on a score of 6:",
+        "",
+        "D3",
+        " ",
+        " ",
+        "D1",
+        "D2",
+        " ",
+        "S2",
+        "D2",
+        " ",
+        "D2",
+        "D1",
+        " ",
+        "S4",
+        "D1",
+        " ",
+        "S1",
+        "S1",
+        "D2",
+        "S1",
+        "T1",
+        "D1",
+        "S1",
+        "S3",
+        "D1",
+        "D1",
+        "D1",
+        "D1",
+        "D1",
+        "S2",
+        "D1",
+        "S2",
+        "S2",
+        "D1",
+        "",
+        "Note that D1 D2 is considered different to D2 D1 as they finish on different doubles. However, the combination S1 T1 D1 is considered the same as T1 S1 D1.",
+        "In addition we shall not include misses in considering combinations; for example, D3 is the same as 0 D3 and 0 0 D3.",
+        "Incredibly there are 42336 distinct ways of checking out in total.",
+        "How many distinct ways can a player checkout with a score less than 100?"
+      ]
+    },
+    {
+      "_id": "5900f3db1000cf542c50feed",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 110: About Project Euler",
+      "tests": [
+        "assert.strictEqual(euler110(), 9350130049860600, 'message: <code>euler110()</code> should return 9350130049860600.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler110() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler110();"
+      ],
+      "description": [
+        ""
+      ]
+    },
+    {
+      "_id": "5900f3db1000cf542c50feee",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 111: Primes with runs",
+      "tests": [
+        "assert.strictEqual(euler111(), 612407567715, 'message: <code>euler111()</code> should return 612407567715.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler111() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler111();"
+      ],
+      "description": [
+        "Considering 4-digit primes containing repeated digits it is clear that they cannot all be the same: 1111 is divisible by 11, 2222 is divisible by 22, and so on. But there are nine 4-digit primes containing three ones:",
+        "1117, 1151, 1171, 1181, 1511, 1811, 2111, 4111, 8111",
+        "We shall say that M(n, d) represents the maximum number of repeated digits for an n-digit prime where d is the repeated digit, N(n, d) represents the number of such primes, and S(n, d) represents the sum of these primes.",
+        "So M(4, 1) = 3 is the maximum number of repeated digits for a 4-digit prime where one is the repeated digit, there are N(4, 1) = 9 such primes, and the sum of these primes is S(4, 1) = 22275. It turns out that for d = 0, it is only possible to have M(4, 0) = 2 repeated digits, but there are N(4, 0) = 13 such cases.",
+        "In the same way we obtain the following results for 4-digit primes.",
+        "",
+        "Digit, d",
+        "M(4, d)",
+        "N(4, d)",
+        "S(4, d)",
+        "0",
+        "2",
+        "13",
+        "67061",
+        "1",
+        "3",
+        "9",
+        "22275",
+        "2",
+        "3",
+        "1",
+        "2221",
+        "3",
+        "3",
+        "12",
+        "46214",
+        "4",
+        "3",
+        "2",
+        "8888",
+        "5",
+        "3",
+        "1",
+        "5557",
+        "6",
+        "3",
+        "1",
+        "6661",
+        "7",
+        "3",
+        "9",
+        "57863",
+        "8",
+        "3",
+        "1",
+        "8887",
+        "9",
+        "3",
+        "7",
+        "48073",
+        "",
+        "For d = 0 to 9, the sum of all S(4, d) is 273700.",
+        "Find the sum of all S(10, d)."
+      ]
+    },
+    {
+      "_id": "5900f3dd1000cf542c50feef",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 112: Bouncy numbers",
+      "tests": [
+        "assert.strictEqual(euler112(), 1587000, 'message: <code>euler112()</code> should return 1587000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler112() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler112();"
+      ],
+      "description": [
+        "Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.",
+        "Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420.",
+        "We shall call a positive integer that is neither increasing nor decreasing a \"bouncy\" number; for example, 155349.",
+        "Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538.",
+        "Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%.",
+        "Find the least number for which the proportion of bouncy numbers is exactly 99%."
+      ]
+    },
+    {
+      "_id": "5900f3dd1000cf542c50fef0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 113: Non-bouncy numbers",
+      "tests": [
+        "assert.strictEqual(euler113(), 51161058134250, 'message: <code>euler113()</code> should return 51161058134250.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler113() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler113();"
+      ],
+      "description": [
+        "Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.",
+        "Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420.",
+        "We shall call a positive integer that is neither increasing nor decreasing a \"bouncy\" number; for example, 155349.",
+        "As n increases, the proportion of bouncy numbers below n increases such that there are only 12951 numbers below one-million that are not bouncy and only 277032 non-bouncy numbers below 1010.",
+        "How many numbers below a googol (10100) are not bouncy?"
+      ]
+    },
+    {
+      "_id": "5900f3e01000cf542c50fef2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 114: Counting block combinations I",
+      "tests": [
+        "assert.strictEqual(euler114(), 16475640049, 'message: <code>euler114()</code> should return 16475640049.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler114() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler114();"
+      ],
+      "description": [
+        "A row measuring seven units in length has red blocks with a minimum length of three units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square. There are exactly seventeen ways of doing this.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        " ",
+        "How many ways can a row measuring fifty units in length be filled?",
+        "NOTE: Although the example above does not lend itself to the possibility, in general it is permitted to mix block sizes. For example, on a row measuring eight units in length you could use red (3), black (1), and red (4)."
+      ]
+    },
+    {
+      "_id": "5900f3df1000cf542c50fef1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 115: Counting block combinations II",
+      "tests": [
+        "assert.strictEqual(euler115(), 168, 'message: <code>euler115()</code> should return 168.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler115() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler115();"
+      ],
+      "description": [
+        "NOTE: This is a more difficult version of Problem 114.",
+        "A row measuring n units in length has red blocks with a minimum length of m units placed on it, such that any two red blocks (which are allowed to be different lengths) are separated by at least one black square.",
+        "Let the fill-count function, F(m, n), represent the number of ways that a row can be filled.",
+        "For example, F(3, 29) = 673135 and F(3, 30) = 1089155.",
+        "That is, for m = 3, it can be seen that n = 30 is the smallest value for which the fill-count function first exceeds one million.",
+        "In the same way, for m = 10, it can be verified that F(10, 56) = 880711 and F(10, 57) = 1148904, so n = 57 is the least value for which the fill-count function first exceeds one million.",
+        "For m = 50, find the least value of n for which the fill-count function first exceeds one million."
+      ]
+    },
+    {
+      "_id": "5900f3e01000cf542c50fef3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 116: Red, green or blue tiles",
+      "tests": [
+        "assert.strictEqual(euler116(), 20492570929, 'message: <code>euler116()</code> should return 20492570929.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler116() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler116();"
+      ],
+      "description": [
+        "A row of five black square tiles is to have a number of its tiles replaced with coloured oblong tiles chosen from red (length two), green (length three), or blue (length four).",
+        "If red tiles are chosen there are exactly seven ways this can be done.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        " ",
+        "If green tiles are chosen there are three ways.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        " ",
+        "And if blue tiles are chosen there are two ways.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "Assuming that colours cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black tiles in a row measuring five units in length.",
+        "How many different ways can the black tiles in a row measuring fifty units in length be replaced if colours cannot be mixed and at least one coloured tile must be used?",
+        "NOTE: This is related to Problem 117."
+      ]
+    },
+    {
+      "_id": "5900f3e21000cf542c50fef4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 117: Red, green, and blue tiles",
+      "tests": [
+        "assert.strictEqual(euler117(), 100808458960497, 'message: <code>euler117()</code> should return 100808458960497.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler117() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler117();"
+      ],
+      "description": [
+        "Using a combination of black square tiles and oblong tiles chosen from: red tiles measuring two units, green tiles measuring three units, and blue tiles measuring four units, it is possible to tile a row measuring five units in length in exactly fifteen different ways.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        " ",
+        "How many ways can a row measuring fifty units in length be tiled?",
+        "NOTE: This is related to Problem 116."
+      ]
+    },
+    {
+      "_id": "5900f3e21000cf542c50fef5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 118: Pandigital prime sets",
+      "tests": [
+        "assert.strictEqual(euler118(), 44680, 'message: <code>euler118()</code> should return 44680.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler118() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler118();"
+      ],
+      "description": [
+        "Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can be formed. Interestingly with the set {2,5,47,89,631}, all of the elements belonging to it are prime.",
+        "How many distinct sets containing each of the digits one through nine exactly once contain only prime elements?"
+      ]
+    },
+    {
+      "_id": "5900f3e41000cf542c50fef6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 119: Digit power sum",
+      "tests": [
+        "assert.strictEqual(euler119(), 248155780267521, 'message: <code>euler119()</code> should return 248155780267521.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler119() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler119();"
+      ],
+      "description": [
+        "The number 512 is interesting because it is equal to the sum of its digits raised to some power: 5 + 1 + 2 = 8, and 83 = 512. Another example of a number with this property is 614656 = 284.",
+        "We shall define an to be the nth term of this sequence and insist that a number must contain at least two digits to have a sum.",
+        "You are given that a2 = 512 and a10 = 614656.",
+        "Find a30."
+      ]
+    },
+    {
+      "_id": "5900f3e41000cf542c50fef7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 120: Square remainders",
+      "tests": [
+        "assert.strictEqual(euler120(), 333082500, 'message: <code>euler120()</code> should return 333082500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler120() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler120();"
+      ],
+      "description": [
+        "Let r be the remainder when (a−1)n + (a+1)n is divided by a2.",
+        "For example, if a = 7 and n = 3, then r = 42: 63 + 83 = 728 ≡ 42 mod 49. And as n varies, so too will r, but for a = 7 it turns out that rmax = 42.",
+        "For 3 ≤ a ≤ 1000, find ∑ rmax."
+      ]
+    },
+    {
+      "_id": "5900f3e51000cf542c50fef8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 121: Disc game prize fund",
+      "tests": [
+        "assert.strictEqual(euler121(), 2269, 'message: <code>euler121()</code> should return 2269.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler121() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler121();"
+      ],
+      "description": [
+        "A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the bag, an extra red disc is added, and another disc is taken at random.",
+        "The player pays £1 to play and wins if they have taken more blue discs than red discs at the end of the game.",
+        "If the game is played for four turns, the probability of a player winning is exactly 11/120, and so the maximum prize fund the banker should allocate for winning in this game would be £10 before they would expect to incur a loss. Note that any payout will be a whole number of pounds and also includes the original £1 paid to play the game, so in the example given the player actually wins £9.",
+        "Find the maximum prize fund that should be allocated to a single game in which fifteen turns are played."
+      ]
+    },
+    {
+      "_id": "5900f3e61000cf542c50fef9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 122: Efficient exponentiation",
+      "tests": [
+        "assert.strictEqual(euler122(), 1582, 'message: <code>euler122()</code> should return 1582.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler122() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler122();"
+      ],
+      "description": [
+        "The most naive way of computing n15 requires fourteen multiplications:",
+        "n × n × ... × n = n15",
+        "But using a \"binary\" method you can compute it in six multiplications:",
+        "n × n = n2n2 × n2 = n4n4 × n4 = n8n8 × n4 = n12n12 × n2 = n14n14 × n = n15",
+        "However it is yet possible to compute it in only five multiplications:",
+        "n × n = n2n2 × n = n3n3 × n3 = n6n6 × n6 = n12n12 × n3 = n15",
+        "We shall define m(k) to be the minimum number of multiplications to compute nk; for example m(15) = 5.",
+        "For 1 ≤ k ≤ 200, find ∑ m(k)."
+      ]
+    },
+    {
+      "_id": "5900f3e71000cf542c50fefa",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 123: Prime square remainders",
+      "tests": [
+        "assert.strictEqual(euler123(), 21035, 'message: <code>euler123()</code> should return 21035.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler123() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler123();"
+      ],
+      "description": [
+        "Let pn be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder when (pn−1)n + (pn+1)n is divided by pn2.",
+        "For example, when n = 3, p3 = 5, and 43 + 63 = 280 ≡ 5 mod 25.",
+        "The least value of n for which the remainder first exceeds 109 is 7037.",
+        "Find the least value of n for which the remainder first exceeds 1010."
+      ]
+    },
+    {
+      "_id": "5900f3e81000cf542c50fefb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 124: Ordered radicals",
+      "tests": [
+        "assert.strictEqual(euler124(), 21417, 'message: <code>euler124()</code> should return 21417.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler124() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler124();"
+      ],
+      "description": [
+        "The radical of n, rad(n), is the product of the distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.",
+        "If we calculate rad(n) for 1 ≤ n ≤ 10, then sort them on rad(n), and sorting on n if the radical values are equal, we get:",
+        "Unsorted",
+        " ",
+        "Sorted",
+        "n",
+        "rad(n)",
+        "",
+        "n",
+        "rad(n)",
+        "k",
+        "11",
+        " ",
+        "111",
+        "22",
+        " ",
+        "222",
+        "33",
+        " ",
+        "423",
+        "42",
+        " ",
+        "824",
+        "55",
+        " ",
+        "335",
+        "66",
+        " ",
+        "936",
+        "77",
+        " ",
+        "557",
+        "82",
+        " ",
+        "668",
+        "93",
+        " ",
+        "779",
+        "1010",
+        " ",
+        "101010",
+        "Let E(k) be the kth element in the sorted n column; for example, E(4) = 8 and E(6) = 9.",
+        "If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000)."
+      ]
+    },
+    {
+      "_id": "5900f3e91000cf542c50fefc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 125: Palindromic sums",
+      "tests": [
+        "assert.strictEqual(euler125(), 2906969179, 'message: <code>euler125()</code> should return 2906969179.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler125() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler125();"
+      ],
+      "description": [
+        "The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 62 + 72 + 82 + 92 + 102 + 112 + 122.",
+        "There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is 4164. Note that 1 = 02 + 12 has not been included as this problem is concerned with the squares of positive integers.",
+        "Find the sum of all the numbers less than 108 that are both palindromic and can be written as the sum of consecutive squares."
+      ]
+    },
+    {
+      "_id": "5900f3ea1000cf542c50fefd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 126: Cuboid layers",
+      "tests": [
+        "assert.strictEqual(euler126(), 18522, 'message: <code>euler126()</code> should return 18522.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler126() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler126();"
+      ],
+      "description": [
+        "The minimum number of cubes to cover every visible face on a cuboid measuring 3 x 2 x 1 is twenty-two.",
+        "",
+        "",
+        "If we then add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one-hundred and eighteen cubes to cover every visible face.",
+        "However, the first layer on a cuboid measuring 5 x 1 x 1 also requires twenty-two cubes; similarly the first layer on cuboids measuring 5 x 3 x 1, 7 x 2 x 1, and 11 x 1 x 1 all contain forty-six cubes.",
+        "We shall define C(n) to represent the number of cuboids that contain n cubes in one of its layers. So C(22) = 2, C(46) = 4, C(78) = 5, and C(118) = 8.",
+        "It turns out that 154 is the least value of n for which C(n) = 10.",
+        "Find the least value of n for which C(n) = 1000."
+      ]
+    },
+    {
+      "_id": "5900f3ec1000cf542c50fefe",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 127: abc-hits",
+      "tests": [
+        "assert.strictEqual(euler127(), 18407904, 'message: <code>euler127()</code> should return 18407904.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler127() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler127();"
+      ],
+      "description": [
+        "The radical of n, rad(n), is the product of distinct prime factors of n. For example, 504 = 23 × 32 × 7, so rad(504) = 2 × 3 × 7 = 42.",
+        "We shall define the triplet of positive integers (a, b, c) to be an abc-hit if:",
+        "GCD(a, b) = GCD(a, c) = GCD(b, c) = 1",
+        "a < b",
+        "a + b = c",
+        "rad(abc) < c",
+        "For example, (5, 27, 32) is an abc-hit, because:",
+        "GCD(5, 27) = GCD(5, 32) = GCD(27, 32) = 1",
+        "5 < 27",
+        "5 + 27 = 32",
+        "rad(4320) = 30 < 32",
+        "It turns out that abc-hits are quite rare and there are only thirty-one abc-hits for c < 1000, with ∑c = 12523.",
+        "Find ∑c for c < 120000."
+      ]
+    },
+    {
+      "_id": "5900f3ec1000cf542c50feff",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 128: Hexagonal tile differences",
+      "tests": [
+        "assert.strictEqual(euler128(), 14516824220, 'message: <code>euler128()</code> should return 14516824220.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler128() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler128();"
+      ],
+      "description": [
+        "A hexagonal tile with number 1 is surrounded by a ring of six hexagonal tiles, starting at \"12 o'clock\" and numbering the tiles 2 to 7 in an anti-clockwise direction.",
+        "New rings are added in the same fashion, with the next rings being numbered 8 to 19, 20 to 37, 38 to 61, and so on. The diagram below shows the first three rings.",
+        "",
+        "",
+        "By finding the difference between tile n and each of its six neighbours we shall define PD(n) to be the number of those differences which are prime.",
+        "For example, working clockwise around tile 8 the differences are 12, 29, 11, 6, 1, and 13. So PD(8) = 3.",
+        "In the same way, the differences around tile 17 are 1, 17, 16, 1, 11, and 10, hence PD(17) = 2.",
+        "It can be shown that the maximum value of PD(n) is 3.",
+        "If all of the tiles for which PD(n) = 3 are listed in ascending order to form a sequence, the 10th tile would be 271.",
+        "Find the 2000th tile in this sequence."
+      ]
+    },
+    {
+      "_id": "5900f3ef1000cf542c50ff01",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 129: Repunit divisibility",
+      "tests": [
+        "assert.strictEqual(euler129(), 1000023, 'message: <code>euler129()</code> should return 1000023.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler129() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler129();"
+      ],
+      "description": [
+        "A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.",
+        "Given that n is a positive integer and GCD(n, 10) = 1, it can be shown that there always exists a value, k, for which R(k) is divisible by n, and let A(n) be the least such value of k; for example, A(7) = 6 and A(41) = 5.",
+        "The least value of n for which A(n) first exceeds ten is 17.",
+        "Find the least value of n for which A(n) first exceeds one-million."
+      ]
+    },
+    {
+      "_id": "5900f3ee1000cf542c50ff00",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 130: Composites with prime repunit property",
+      "tests": [
+        "assert.strictEqual(euler130(), 149253, 'message: <code>euler130()</code> should return 149253.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler130() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler130();"
+      ],
+      "description": [
+        "A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.",
+        "Given that n is a positive integer and GCD(n, 10) = 1, it can be shown that there always exists a value, k, for which R(k) is divisible by n, and let A(n) be the least such value of k; for example, A(7) = 6 and A(41) = 5.",
+        "You are given that for all primes, p > 5, that p − 1 is divisible by A(p). For example, when p = 41, A(41) = 5, and 40 is divisible by 5.",
+        "However, there are rare composite values for which this is also true; the first five examples being 91, 259, 451, 481, and 703.",
+        "Find the sum of the first twenty-five composite values of n for whichGCD(n, 10) = 1 and n − 1 is divisible by A(n)."
+      ]
+    },
+    {
+      "_id": "5900f3ef1000cf542c50ff02",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 131: Prime cube partnership",
+      "tests": [
+        "assert.strictEqual(euler131(), 173, 'message: <code>euler131()</code> should return 173.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler131() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler131();"
+      ],
+      "description": [
+        "There are some prime values, p, for which there exists a positive integer, n, such that the expression n3 + n2p is a perfect cube.",
+        "For example, when p = 19, 83 + 82×19 = 123.",
+        "What is perhaps most surprising is that for each prime with this property the value of n is unique, and there are only four such primes below one-hundred.",
+        "How many primes below one million have this remarkable property?"
+      ]
+    },
+    {
+      "_id": "5900f3f11000cf542c50ff03",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 132: Large repunit factors",
+      "tests": [
+        "assert.strictEqual(euler132(), 843296, 'message: <code>euler132()</code> should return 843296.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler132() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler132();"
+      ],
+      "description": [
+        "A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k.",
+        "For example, R(10) = 1111111111 = 11×41×271×9091, and the sum of these prime factors is 9414.",
+        "Find the sum of the first forty prime factors of R(109)."
+      ]
+    },
+    {
+      "_id": "5900f3f21000cf542c50ff04",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 133: Repunit nonfactors",
+      "tests": [
+        "assert.strictEqual(euler133(), 453647705, 'message: <code>euler133()</code> should return 453647705.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler133() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler133();"
+      ],
+      "description": [
+        "A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k; for example, R(6) = 111111.",
+        "Let us consider repunits of the form R(10n).",
+        "Although R(10), R(100), or R(1000) are not divisible by 17, R(10000) is divisible by 17. Yet there is no value of n for which R(10n) will divide by 19. In fact, it is remarkable that 11, 17, 41, and 73 are the only four primes below one-hundred that can  be a factor of R(10n).",
+        "Find the sum of all the primes below one-hundred thousand that will never be a factor of R(10n)."
+      ]
+    },
+    {
+      "_id": "5900f3f21000cf542c50ff05",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 134: Prime pair connection",
+      "tests": [
+        "assert.strictEqual(euler134(), 18613426663617120, 'message: <code>euler134()</code> should return 18613426663617120.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler134() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler134();"
+      ],
+      "description": [
+        "Consider the consecutive primes p1 = 19 and p2 = 23. It can be verified that 1219 is the smallest number such that the last digits are formed by p1 whilst also being divisible by p2.",
+        "In fact, with the exception of p1 = 3 and p2 = 5, for every pair of consecutive primes, p2 > p1, there exist values of n for which the last digits are formed by p1 and n is divisible by p2. Let S be the smallest of these values of n.",
+        "Find ∑ S for every pair of consecutive primes with 5 ≤ p1 ≤ 1000000."
+      ]
+    },
+    {
+      "_id": "5900f3f31000cf542c50ff06",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 135: Same differences",
+      "tests": [
+        "assert.strictEqual(euler135(), 4989, 'message: <code>euler135()</code> should return 4989.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler135() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler135();"
+      ],
+      "description": [
+        "Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least value of the positive integer, n, for which the equation, x2 − y2 − z2 = n, has exactly two solutions is n = 27:",
+        "342 − 272 − 202 = 122 − 92 − 62 = 27",
+        "It turns out that n = 1155 is the least value which has exactly ten solutions.",
+        "How many values of n less than one million have exactly ten distinct solutions?"
+      ]
+    },
+    {
+      "_id": "5900f3f51000cf542c50ff07",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 136: Singleton difference",
+      "tests": [
+        "assert.strictEqual(euler136(), 2544559, 'message: <code>euler136()</code> should return 2544559.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler136() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler136();"
+      ],
+      "description": [
+        "The positive integers, x, y, and z, are consecutive terms of an arithmetic progression. Given that n is a positive integer, the equation, x2 − y2 − z2 = n, has exactly one solution when n = 20:",
+        "132 − 102 − 72 = 20",
+        "In fact there are twenty-five values of n below one hundred for which the equation has a unique solution.",
+        "How many values of n less than fifty million have exactly one solution?"
+      ]
+    },
+    {
+      "_id": "5900f3f51000cf542c50ff08",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 137: Fibonacci golden nuggets",
+      "tests": [
+        "assert.strictEqual(euler137(), 1120149658760, 'message: <code>euler137()</code> should return 1120149658760.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler137() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler137();"
+      ],
+      "description": [
+        "Consider the infinite polynomial series AF(x) = xF1 + x2F2 + x3F3 + ..., where Fk is the kth term in the Fibonacci sequence: 1, 1, 2, 3, 5, 8, ... ; that is, Fk = Fk−1 + Fk−2, F1 = 1 and F2 = 1.",
+        "For this problem we shall be interested in values of x for which AF(x) is a positive integer.",
+        "Surprisingly AF(1/2)",
+        " = ",
+        "(1/2).1 + (1/2)2.1 + (1/2)3.2 + (1/2)4.3 + (1/2)5.5 + ...",
+        " ",
+        " = ",
+        "1/2 + 1/4 + 2/8 + 3/16 + 5/32 + ...",
+        " ",
+        " = ",
+        "2",
+        "The corresponding values of x for the first five natural numbers are shown below.",
+        "",
+        "xAF(x)",
+        "√2−11",
+        "1/22",
+        "(√13−2)/33",
+        "(√89−5)/84",
+        "(√34−3)/55",
+        "",
+        "We shall call AF(x) a golden nugget if x is rational, because they become increasingly rarer; for example, the 10th golden nugget is 74049690.",
+        "Find the 15th golden nugget."
+      ]
+    },
+    {
+      "_id": "5900f3f61000cf542c50ff09",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 138: Special isosceles triangles",
+      "tests": [
+        "assert.strictEqual(euler138(), 1118049290473932, 'message: <code>euler138()</code> should return 1118049290473932.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler138() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler138();"
+      ],
+      "description": [
+        "Consider the isosceles triangle with base length, b = 16, and legs, L = 17.",
+        "",
+        "",
+        "By using the Pythagorean theorem it can be seen that the height of the triangle, h = √(172 − 82) = 15, which is one less than the base length.",
+        "With b = 272 and L = 305, we get h = 273, which is one more than the base length, and this is the second smallest isosceles triangle with the property that h = b ± 1.",
+        "Find ∑ L for the twelve smallest isosceles triangles for which h = b ± 1 and b, L are positive integers."
+      ]
+    },
+    {
+      "_id": "5900f3f71000cf542c50ff0a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 139: Pythagorean tiles",
+      "tests": [
+        "assert.strictEqual(euler139(), 10057761, 'message: <code>euler139()</code> should return 10057761.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler139() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler139();"
+      ],
+      "description": [
+        "Let (a, b, c) represent the three sides of a right angle triangle with integral length sides. It is possible to place four such triangles together to form a square with length c.",
+        "For example, (3, 4, 5) triangles can be placed together to form a 5 by 5 square with a 1 by 1 hole in the middle and it can be seen that the 5 by 5 square can be tiled with twenty-five 1 by 1 squares.",
+        "",
+        "",
+        "However, if (5, 12, 13) triangles were used then the hole would measure 7 by 7 and these could not be used to tile the 13 by 13 square.",
+        "Given that the perimeter of the right triangle is less than one-hundred million, how many Pythagorean triangles would allow such a tiling to take place?"
+      ]
+    },
+    {
+      "_id": "5900f3fa1000cf542c50ff0c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 140: Modified Fibonacci golden nuggets",
+      "tests": [
+        "assert.strictEqual(euler140(), 5673835352990, 'message: <code>euler140()</code> should return 5673835352990.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler140() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler140();"
+      ],
+      "description": [
+        "Consider the infinite polynomial series AG(x) = xG1 + x2G2 + x3G3 + ..., where Gk is the kth term of the second order recurrence relation Gk = Gk−1 + Gk−2, G1 = 1 and G2 = 4; that is, 1, 4, 5, 9, 14, 23, ... .",
+        "For this problem we shall be concerned with values of x for which AG(x) is a positive integer.",
+        "The corresponding values of x for the first five natural numbers are shown below.",
+        "",
+        "xAG(x)",
+        "(√5−1)/41",
+        "2/52",
+        "(√22−2)/63",
+        "(√137−5)/144",
+        "1/25",
+        "",
+        "We shall call AG(x) a golden nugget if x is rational, because they become increasingly rarer; for example, the 20th golden nugget is 211345365.",
+        "Find the sum of the first thirty golden nuggets."
+      ]
+    },
+    {
+      "_id": "5900f3f91000cf542c50ff0b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 141: Investigating progressive numbers, n, which are also square",
+      "tests": [
+        "assert.strictEqual(euler141(), 878454337159, 'message: <code>euler141()</code> should return 878454337159.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler141() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler141();"
+      ],
+      "description": [
+        "A positive integer, n, is divided by d and the quotient and remainder are q and r respectively. In addition d, q, and r are consecutive positive integer terms in a geometric sequence, but not necessarily in that order.",
+        "For example, 58 divided by 6 has quotient 9 and remainder 4. It can also be seen that 4, 6, 9 are consecutive terms in a geometric sequence (common ratio 3/2).",
+        "We will call such numbers, n, progressive.",
+        "Some progressive numbers, such as 9 and 10404 = 1022, happen to also be perfect squares. The sum of all progressive perfect squares below one hundred thousand is 124657.",
+        "Find the sum of all progressive perfect squares below one trillion (1012)."
+      ]
+    },
+    {
+      "_id": "5900f3fa1000cf542c50ff0d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 142: Perfect Square Collection",
+      "tests": [
+        "assert.strictEqual(euler142(), 1006193, 'message: <code>euler142()</code> should return 1006193.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler142() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler142();"
+      ],
+      "description": [
+        "Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares."
+      ]
+    },
+    {
+      "_id": "5900f3fc1000cf542c50ff0e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 143: Investigating the Torricelli point of a triangle",
+      "tests": [
+        "assert.strictEqual(euler143(), 30758397, 'message: <code>euler143()</code> should return 30758397.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler143() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler143();"
+      ],
+      "description": [
+        "Let ABC be a triangle with all interior angles being less than 120 degrees. Let X be any point inside the triangle and let XA = p, XC = q, and XB = r.",
+        "Fermat challenged Torricelli to find the position of X such that p + q + r was minimised.",
+        "Torricelli was able to prove that if equilateral triangles AOB, BNC and AMC are constructed on each side of triangle ABC, the circumscribed circles of AOB, BNC, and AMC will intersect at a single point, T, inside the triangle. Moreover he proved that T, called the Torricelli/Fermat point, minimises p + q + r. Even more remarkable, it can be shown that when the sum is minimised, AN = BM = CO = p + q + r and that AN, BM and CO also intersect at T.",
+        "",
+        "If the sum is minimised and a, b, c, p, q and r are all positive integers we shall call triangle ABC a Torricelli triangle. For example, a = 399, b = 455, c = 511 is an example of a Torricelli triangle, with p + q + r = 784.",
+        "Find the sum of all distinct values of p + q + r ≤ 120000 for Torricelli triangles."
+      ]
+    },
+    {
+      "_id": "5900f3fc1000cf542c50ff0f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 144: Investigating multiple reflections of a laser beam",
+      "tests": [
+        "assert.strictEqual(euler144(), 354, 'message: <code>euler144()</code> should return 354.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler144() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler144();"
+      ],
+      "description": [
+        "In laser physics, a \"white cell\" is a mirror system that acts as a delay line for the laser beam. The beam enters the cell, bounces around on the mirrors, and eventually works its way back out.",
+        "The specific white cell we will be considering is an ellipse with the equation 4x2 + y2 = 100",
+        "The section corresponding to −0.01 ≤ x ≤ +0.01 at the top is missing, allowing the light to enter and exit through the hole.",
+        "",
+        "The light beam in this problem starts at the point (0.0,10.1) just outside the white cell, and the beam first impacts the mirror at (1.4,-9.6).",
+        "Each time the laser beam hits the surface of the ellipse, it follows the usual law of reflection \"angle of incidence equals angle of reflection.\" That is, both the incident and reflected beams make the same angle with the normal line at the point of incidence.",
+        "In the figure on the left, the red line shows the first two points of contact between the laser beam and the wall of the white cell; the blue line shows the line tangent to the ellipse at the point of incidence of the first bounce.The slope m of the tangent line at any point (x,y) of the given ellipse is: m = −4x/yThe normal line is perpendicular to this tangent line at the point of incidence.",
+        "The animation on the right shows the first 10 reflections of the beam.",
+        "",
+        "How many times does the beam hit the internal surface of the white cell before exiting?"
+      ]
+    },
+    {
+      "_id": "5900f3fd1000cf542c50ff10",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 145: How many reversible numbers are there below one-billion?",
+      "tests": [
+        "assert.strictEqual(euler145(), 608720, 'message: <code>euler145()</code> should return 608720.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler145() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler145();"
+      ],
+      "description": [
+        "Some positive integers n have the property that the sum [ n + reverse(n) ] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not allowed in either n or reverse(n).",
+        "",
+        "There are 120 reversible numbers below one-thousand.",
+        "",
+        "How many reversible numbers are there below one-billion (109)?"
+      ]
+    },
+    {
+      "_id": "5900f3fe1000cf542c50ff11",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 146: Investigating a Prime Pattern",
+      "tests": [
+        "assert.strictEqual(euler146(), 676333270, 'message: <code>euler146()</code> should return 676333270.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler146() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler146();"
+      ],
+      "description": [
+        "The smallest positive integer n for which the numbers n2+1, n2+3, n2+7, n2+9, n2+13, and n2+27 are consecutive primes is 10. The sum of all such integers n below one-million is 1242490.",
+        "",
+        "What is the sum of all such integers n below 150 million?"
+      ]
+    },
+    {
+      "_id": "5900f3ff1000cf542c50ff12",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 147: Rectangles in cross-hatched grids",
+      "tests": [
+        "assert.strictEqual(euler147(), 846910284, 'message: <code>euler147()</code> should return 846910284.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler147() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler147();"
+      ],
+      "description": [
+        "In a 3x2 cross-hatched grid, a total of 37 different rectangles could be situated within that grid as indicated in the sketch.",
+        "",
+        "There are 5 grids smaller than 3x2, vertical and horizontal dimensions being important, i.e. 1x1, 2x1, 3x1, 1x2 and 2x2. If each of them is cross-hatched, the following number of different rectangles could be situated within those smaller grids:",
+        "1x1: 1",
+        "2x1: 4",
+        "3x1: 8",
+        "1x2: 4",
+        "2x2: 18",
+        "",
+        "Adding those to the 37 of the 3x2 grid, a total of 72 different rectangles could be situated within 3x2 and smaller grids.",
+        "",
+        "How many different rectangles could be situated within 47x43 and smaller grids?"
+      ]
+    },
+    {
+      "_id": "5900f4021000cf542c50ff14",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 148: Exploring Pascal's triangle",
+      "tests": [
+        "assert.strictEqual(euler148(), 2129970655314432, 'message: <code>euler148()</code> should return 2129970655314432.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler148() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler148();"
+      ],
+      "description": [
+        "We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:",
+        " ",
+        " ",
+        " ",
+        " ",
+        " ",
+        " ",
+        " 1",
+        " ",
+        " ",
+        " ",
+        " ",
+        " ",
+        " 1",
+        " ",
+        " 1",
+        " ",
+        " ",
+        " ",
+        " ",
+        " 1",
+        " ",
+        " 2",
+        " ",
+        " 1",
+        " ",
+        " ",
+        " ",
+        " 1",
+        " ",
+        " 3",
+        " ",
+        " 3",
+        " ",
+        " 1",
+        " ",
+        " ",
+        " 1",
+        " ",
+        " 4",
+        " ",
+        " 6",
+        " ",
+        " 4",
+        " ",
+        " 1",
+        " ",
+        " 1",
+        " ",
+        " 5",
+        " ",
+        "10",
+        " ",
+        "10",
+        " ",
+        " 5",
+        " ",
+        " 1",
+        "1",
+        " ",
+        " 6",
+        " ",
+        "15",
+        " ",
+        "20",
+        " ",
+        "15",
+        " ",
+        " 6",
+        " ",
+        " 1",
+        "However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are not divisible by 7.",
+        "",
+        "Find the number of entries which are not divisible by 7 in the first one billion (109) rows of Pascal's triangle."
+      ]
+    },
+    {
+      "_id": "5900f4021000cf542c50ff13",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 149: Searching for a maximum-sum subsequence",
+      "tests": [
+        "assert.strictEqual(euler149(), 52852124, 'message: <code>euler149()</code> should return 52852124.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler149() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler149();"
+      ],
+      "description": [
+        "Looking at the table below, it is easy to verify that the maximum possible sum of adjacent numbers in any direction (horizontal, vertical, diagonal or anti-diagonal) is 16 (= 8 + 7 + 1).",
+        "",
+        "",
+        "−25329−6513273−18−4  8",
+        "",
+        "Now, let us repeat the search, but on a much larger scale:",
+        "",
+        "First, generate four million pseudo-random numbers using a specific form of what is known as a \"Lagged Fibonacci Generator\":",
+        "",
+        "For 1 ≤ k ≤ 55, sk = [100003 − 200003k + 300007k3] (modulo 1000000) − 500000.",
+        "For 56 ≤ k ≤ 4000000, sk = [sk−24 + sk−55 + 1000000] (modulo 1000000) − 500000.",
+        "",
+        "Thus, s10 = −393027 and s100 = 86613.",
+        "",
+        "The terms of s are then arranged in a 2000×2000 table, using the first 2000 numbers to fill the first row (sequentially), the next 2000 numbers to fill the second row, and so on.",
+        "",
+        "Finally, find the greatest sum of (any number of) adjacent entries in any direction (horizontal, vertical, diagonal or anti-diagonal)."
+      ]
+    },
+    {
+      "_id": "5900f4031000cf542c50ff15",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 150: Searching a triangular array for a sub-triangle having minimum-sum",
+      "tests": [
+        "assert.strictEqual(euler150(), -271248680, 'message: <code>euler150()</code> should return -271248680.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler150() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler150();"
+      ],
+      "description": [
+        "In a triangular array of positive and negative integers, we wish to find a sub-triangle such that the sum of the numbers it contains is the smallest possible.",
+        "In the example below, it can be easily verified that the marked triangle satisfies this condition having a sum of −42.",
+        "",
+        "",
+        "We wish to make such a triangular array with one thousand rows, so we generate 500500 pseudo-random numbers sk in the range ±219, using a type of random number generator (known as a Linear Congruential Generator) as follows:",
+        "t := 0",
+        "",
+        "for k = 1 up to k = 500500:",
+        "",
+        "    t := (615949*t + 797807) modulo 220",
+        "    sk := t−219",
+        "Thus: s1 = 273519, s2 = −153582, s3 = 450905 etc",
+        "Our triangular array is then formed using the pseudo-random numbers thus:",
+        "",
+        "s1",
+        "s2  s3",
+        "s4  s5  s6  ",
+        "",
+        "s7  s8  s9  s10",
+        "...",
+        "",
+        "Sub-triangles can start at any element of the array and extend down as far as we like (taking-in the two elements directly below it from the next row, the three elements directly below from the row after that, and so on).",
+        "",
+        "The \"sum of a sub-triangle\" is defined as the sum of all the elements it contains.",
+        "",
+        "Find the smallest possible sub-triangle sum."
+      ]
+    },
+    {
+      "_id": "5900f4031000cf542c50ff16",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 151: Paper sheets of standard sizes: an expected-value problem",
+      "tests": [
+        "assert.strictEqual(euler151(), 0.464399, 'message: <code>euler151()</code> should return 0.464399.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler151() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler151();"
+      ],
+      "description": [
+        "A printing shop runs 16 batches (jobs) every week and each batch requires a sheet of special colour-proofing paper of size A5.",
+        "Every Monday morning, the foreman opens a new envelope, containing a large sheet of the special paper with size A1.",
+        "He proceeds to cut it in half, thus getting two sheets of size A2. Then he cuts one of them in half to get two sheets of size A3 and so on until he obtains the A5-size sheet needed for the first batch of the week.",
+        "All the unused sheets are placed back in the envelope.",
+        "",
+        "At the beginning of each subsequent batch, he takes from the envelope one sheet of paper at random. If it is of size A5, he uses it. If it is larger, he repeats the 'cut-in-half' procedure until he has what he needs and any remaining sheets are always placed back in the envelope.",
+        "Excluding the first and last batch of the week, find the expected number of times (during each week) that the foreman finds a single sheet of paper in the envelope.",
+        "Give your answer rounded to six decimal places using the format x.xxxxxx ."
+      ]
+    },
+    {
+      "_id": "5900f4041000cf542c50ff17",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 152: Writing 1/2 as a sum of inverse squares",
+      "tests": [
+        "assert.strictEqual(euler152(), 301, 'message: <code>euler152()</code> should return 301.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler152() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler152();"
+      ],
+      "description": [
+        "There are several ways to write the number 1/2 as a sum of inverse squares using distinct integers.",
+        "For instance, the numbers {2,3,4,5,7,12,15,20,28,35} can be used:",
+        "",
+        "In fact, only using integers between 2 and 45 inclusive, there are exactly three ways to do it, the remaining two being: {2,3,4,6,7,9,10,20,28,35,36,45} and {2,3,4,6,7,9,12,15,28,30,35,36,45}.",
+        "How many ways are there to write the number 1/2 as a sum of inverse squares using distinct integers between 2 and 80 inclusive?"
+      ]
+    },
+    {
+      "_id": "5900f4051000cf542c50ff18",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 153: Investigating Gaussian Integers",
+      "tests": [
+        "assert.strictEqual(euler153(), 17971254122360636, 'message: <code>euler153()</code> should return 17971254122360636.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler153() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler153();"
+      ],
+      "description": [
+        "As we all know the equation x2=-1 has no solutions for real x.",
+        "",
+        "If we however introduce the imaginary number i this equation has two solutions: x=i and x=-i.",
+        "",
+        "If we go a step further the equation (x-3)2=-4 has two complex solutions: x=3+2i and x=3-2i.",
+        "x=3+2i and x=3-2i are called each others' complex conjugate.",
+        "",
+        "Numbers of the form a+bi are called complex numbers.",
+        "",
+        "In general a+bi and a−bi are each other's complex conjugate.",
+        "A Gaussian Integer is a complex number a+bi such that both a and b are integers.",
+        "",
+        "The regular integers are also Gaussian integers (with b=0).",
+        "",
+        "To distinguish them from Gaussian integers with b ≠ 0 we call such integers \"rational integers.\"",
+        "",
+        "A Gaussian integer is called a divisor of a rational integer n if the result is also a Gaussian integer.",
+        "",
+        "If for example we divide 5 by 1+2i we can simplify  in the following manner:",
+        "",
+        "Multiply numerator and denominator by the complex conjugate of 1+2i: 1−2i.",
+        "",
+        "The result is ",
+        ".",
+        "",
+        "So 1+2i is a divisor of 5.",
+        "",
+        "Note that 1+i is not a divisor of 5 because .",
+        "",
+        "Note also that if the Gaussian Integer (a+bi) is a divisor of a rational integer n, then its complex conjugate (a−bi) is also a divisor of n.",
+        "In fact, 5 has six divisors such that the real part is positive: {1, 1 + 2i, 1 − 2i, 2 + i, 2 − i, 5}.",
+        "",
+        "The following is a table of all of the divisors for the first five positive rational integers:",
+        "",
+        "n Gaussian integer divisors",
+        "with positive real partSum s(n) of these",
+        "",
+        "divisors111",
+        "21, 1+i, 1-i, 25",
+        "31, 34",
+        "41, 1+i, 1-i, 2, 2+2i, 2-2i,413",
+        "51, 1+2i, 1-2i, 2+i, 2-i, 512",
+        "For divisors with positive real parts, then, we have: .",
+        "For 1 ≤ n ≤ 105, ∑ s(n)=17924657155.",
+        "What is ∑ s(n) for 1 ≤ n ≤ 108?"
+      ]
+    },
+    {
+      "_id": "5900f4071000cf542c50ff19",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 154: Exploring Pascal's pyramid",
+      "tests": [
+        "assert.strictEqual(euler154(), 479742450, 'message: <code>euler154()</code> should return 479742450.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler154() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler154();"
+      ],
+      "description": [
+        "A triangular pyramid is constructed using spherical balls so that each ball rests on exactly three balls of the next lower level.",
+        "",
+        "Then, we calculate the number of paths leading from the apex to each position:",
+        "A path starts at the apex and progresses downwards to any of the three spheres directly below the current position.",
+        "Consequently, the number of paths to reach a certain position is the sum of the numbers immediately above it (depending on the position, there are up to three numbers above it).",
+        "The result is Pascal's pyramid and the numbers at each level n are the coefficients of the trinomial expansion ",
+        "(x + y + z)n.",
+        "How many coefficients in the expansion of (x + y + z)200000 are multiples of 1012?"
+      ]
+    },
+    {
+      "_id": "5900f4081000cf542c50ff1a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 155: Counting Capacitor Circuits",
+      "tests": [
+        "assert.strictEqual(euler155(), 3857447, 'message: <code>euler155()</code> should return 3857447.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler155() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler155();"
+      ],
+      "description": [
+        "An electric circuit uses exclusively identical capacitors of the same value C.",
+        "",
+        "The capacitors can be connected in series or in parallel to form sub-units, which can then be connected in series or in parallel with other capacitors or other sub-units to form larger sub-units, and so on up to a final circuit.",
+        "Using this simple procedure and up to n identical capacitors, we can make circuits having a range of different total capacitances. For example, using up to n=3 capacitors of 60 F each, we can obtain the following 7 distinct total capacitance values: ",
+        "",
+        "If we denote by D(n) the number of distinct total capacitance values we can obtain when using up to n equal-valued capacitors and the simple procedure described above, we have: D(1)=1, D(2)=3, D(3)=7 ...",
+        "Find D(18).",
+        "Reminder : When connecting capacitors C1, C2 etc in parallel, the total capacitance is CT = C1 + C2 +...,",
+        "",
+        "whereas when connecting them in series, the overall capacitance is given by:"
+      ]
+    },
+    {
+      "_id": "5900f4091000cf542c50ff1b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 156: Counting Digits",
+      "tests": [
+        "assert.strictEqual(euler156(), 21295121502550, 'message: <code>euler156()</code> should return 21295121502550.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler156() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler156();"
+      ],
+      "description": [
+        "Starting from zero the natural numbers are written down in base 10 like this:",
+        "",
+        "0 1 2 3 4 5 6 7 8 9 10 11 12....",
+        "",
+        "Consider the digit d=1. After we write down each number n, we will update the number of ones that have occurred and call this number f(n,1). The first values for f(n,1), then, are as follows:",
+        "",
+        "nf(n,1)",
+        "00",
+        "11",
+        "21",
+        "31",
+        "41",
+        "51",
+        "61",
+        "71",
+        "81",
+        "91",
+        "102",
+        "114",
+        "125",
+        "",
+        "Note that f(n,1) never equals 3.",
+        "",
+        "So the first two solutions of the equation f(n,1)=n are n=0 and n=1. The next solution is n=199981.",
+        "In the same manner the function f(n,d) gives the total number of digits d that have been written down after the number n has been written.",
+        "",
+        "In fact, for every digit d ≠ 0, 0 is the first solution of the equation f(n,d)=n.",
+        "Let s(d) be the sum of all the solutions for which f(n,d)=n.",
+        "",
+        "You are given that s(1)=22786974071.",
+        "Find  ∑ s(d) for 1 ≤ d ≤ 9.",
+        "Note: if, for some n, f(n,d)=n",
+        " for more than one value of d this value of n is counted again for every value of d for which f(n,d)=n."
+      ]
+    },
+    {
+      "_id": "5900f4091000cf542c50ff1c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 157: Solving the diophantine equation 1/a+1/b= p/10n",
+      "tests": [
+        "assert.strictEqual(euler157(), 53490, 'message: <code>euler157()</code> should return 53490.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler157() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler157();"
+      ],
+      "description": [
+        "Consider the diophantine equation 1/a+1/b= p/10n with a, b, p, n positive integers and a ≤ b.",
+        "For n=1 this equation has 20 solutions that are listed below:",
+        "1/1+1/1=20/10",
+        "1/1+1/2=15/10",
+        "1/1+1/5=12/10",
+        "1/1+1/10=11/10",
+        "1/2+1/2=10/10",
+        "1/2+1/5=7/10",
+        "1/2+1/10=6/10",
+        "1/3+1/6=5/10",
+        "1/3+1/15=4/10",
+        "1/4+1/4=5/10",
+        "1/4+1/20=3/10",
+        "1/5+1/5=4/10",
+        "1/5+1/10=3/10",
+        "1/6+1/30=2/10",
+        "1/10+1/10=2/10",
+        "1/11+1/110=1/10",
+        "1/12+1/60=1/10",
+        "1/14+1/35=1/10",
+        "1/15+1/30=1/10",
+        "1/20+1/20=1/10",
+        "How many solutions has this equation for 1 ≤ n ≤ 9?"
+      ]
+    },
+    {
+      "_id": "5900f40a1000cf542c50ff1d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left",
+      "tests": [
+        "assert.strictEqual(euler158(), 409511334375, 'message: <code>euler158()</code> should return 409511334375.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler158() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler158();"
+      ],
+      "description": [
+        "Taking three different letters from the 26 letters of the alphabet, character strings of length three can be formed.",
+        "Examples are 'abc', 'hat' and 'zyx'.",
+        "When we study these three examples we see that for 'abc' two characters come lexicographically after its neighbour to the left. ",
+        "For 'hat' there is exactly one character that comes lexicographically after its neighbour to the left. For 'zyx' there are zero characters that come lexicographically after its neighbour to the left.",
+        "In all there are 10400 strings of length 3 for which exactly one character comes lexicographically after its neighbour to the left.",
+        "We now consider strings of n ≤ 26 different characters from the alphabet. ",
+        "For every n, p(n) is the number of strings of length n for which exactly one character comes lexicographically after its neighbour to the left. ",
+        "What is the maximum value of p(n)?"
+      ]
+    },
+    {
+      "_id": "5900f40c1000cf542c50ff1e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 159: Digital root sums of factorisations",
+      "tests": [
+        "assert.strictEqual(euler159(), 14489159, 'message: <code>euler159()</code> should return 14489159.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler159() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler159();"
+      ],
+      "description": [
+        "A composite number can be factored many different ways.  ",
+        "For instance, not including multiplication by one, 24 can be factored in 7 distinct ways:",
+        "",
+        "24 = 2x2x2x3",
+        "24 = 2x3x4",
+        "24 = 2x2x6",
+        "24 = 4x6",
+        "24 = 3x8",
+        "24 = 2x12",
+        "24 = 24",
+        "",
+        "Recall that the digital root of a number, in base 10, is found by adding together the digits of that number, ",
+        "and repeating that process until a number is arrived at that is less than 10.  ",
+        "Thus the digital root of 467 is 8.",
+        "We shall call a Digital Root Sum (DRS) the sum of the digital roots of the individual factors of our number.",
+        " The chart below demonstrates all of the DRS values for 24.",
+        "FactorisationDigital Root Sum2x2x2x3",
+        "92x3x4",
+        "92x2x6",
+        "104x6",
+        "103x8",
+        "112x12",
+        "524",
+        "6The maximum Digital Root Sum  of 24 is 11.",
+        "The function mdrs(n) gives the maximum Digital Root Sum of n. So  mdrs(24)=11.",
+        "Find ∑mdrs(n) for 1 < n < 1,000,000."
+      ]
+    },
+    {
+      "_id": "5900f40d1000cf542c50ff1f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 160: Factorial trailing digits",
+      "tests": [
+        "assert.strictEqual(euler160(), 16576, 'message: <code>euler160()</code> should return 16576.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler160() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler160();"
+      ],
+      "description": [
+        "For any N, let f(N) be the last five digits before the trailing zeroes in N!.",
+        "For example,",
+        "9! = 362880 so f(9)=36288",
+        "10! = 3628800 so f(10)=36288",
+        "20! = 2432902008176640000 so f(20)=17664",
+        "Find f(1,000,000,000,000)"
+      ]
+    },
+    {
+      "_id": "5900f40d1000cf542c50ff20",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 161: Triominoes",
+      "tests": [
+        "assert.strictEqual(euler161(), 20574308184277972, 'message: <code>euler161()</code> should return 20574308184277972.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler161() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler161();"
+      ],
+      "description": [
+        "A triomino is a shape consisting of three squares joined via the edges.",
+        "There are two basic forms:",
+        "",
+        "",
+        "",
+        "If all possible orientations are taken into account there are six:",
+        "",
+        "",
+        "",
+        "Any n by m grid for which nxm is divisible by 3 can be tiled with triominoes.",
+        "If we consider tilings that can be obtained by reflection or rotation from another tiling as different there are 41 ways a 2 by 9 grid can be  tiled with triominoes:",
+        "",
+        "",
+        "",
+        "In how many ways can a 9 by 12 grid be tiled in this way by triominoes?"
+      ]
+    },
+    {
+      "_id": "5900f40e1000cf542c50ff21",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 162: Hexadecimal numbers",
+      "tests": [
+        "assert.strictEqual(euler162(), 3D58725572C62302, 'message: <code>euler162()</code> should return 3D58725572C62302.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler162() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler162();"
+      ],
+      "description": [
+        "In  the hexadecimal number system numbers are represented using 16 different digits:",
+        "0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F",
+        "The hexadecimal number AF when written in the decimal number system equals 10x16+15=175.",
+        "In the 3-digit hexadecimal numbers 10A, 1A0, A10, and A01 the digits 0,1 and A are all present.",
+        "Like numbers written in base ten we write hexadecimal numbers without leading zeroes.",
+        "How many hexadecimal numbers containing at most sixteen hexadecimal digits exist with all of the digits 0,1, and A present at least once?",
+        "Give your answer as a hexadecimal number.",
+        "(A,B,C,D,E and F in upper case, without any leading or trailing code that marks the number as hexadecimal and without leading zeroes , e.g. 1A3F and not: 1a3f and not 0x1a3f and not $1A3F and not #1A3F and not 0000001A3F)"
+      ]
+    },
+    {
+      "_id": "5900f40f1000cf542c50ff22",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 163: Cross-hatched triangles",
+      "tests": [
+        "assert.strictEqual(euler163(), 343047, 'message: <code>euler163()</code> should return 343047.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler163() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler163();"
+      ],
+      "description": [
+        "Consider an equilateral triangle in which straight lines are drawn from each vertex to the middle of the opposite side, such as in the size 1 triangle in the sketch below.",
+        "",
+        "Sixteen triangles of either different shape or size or orientation or location can now be observed in that triangle. Using size 1 triangles as building blocks, larger triangles can be formed, such as the size 2 triangle in the above sketch. One-hundred and four triangles of either different shape or size or orientation or location can now be observed in that size 2 triangle.",
+        "It can be observed that the size 2 triangle contains 4 size 1 triangle building blocks. A size 3 triangle would contain 9 size 1 triangle building blocks and a size n triangle would thus contain n2 size 1 triangle building blocks.",
+        "If we denote T(n) as the number of triangles present in a triangle of size n, then",
+        "T(1) = 16",
+        "T(2) = 104",
+        "Find T(36)."
+      ]
+    },
+    {
+      "_id": "5900f4111000cf542c50ff23",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 164: Numbers for which no three consecutive digits have a sum greater than a given value",
+      "tests": [
+        "assert.strictEqual(euler164(), 378158756814587, 'message: <code>euler164()</code> should return 378158756814587.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler164() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler164();"
+      ],
+      "description": [
+        "How many 20 digit numbers n (without any leading zero) exist such that no three consecutive digits of n have a sum greater than 9?"
+      ]
+    },
+    {
+      "_id": "5900f4111000cf542c50ff24",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 165: Intersections",
+      "tests": [
+        "assert.strictEqual(euler165(), 2868868, 'message: <code>euler165()</code> should return 2868868.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler165() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler165();"
+      ],
+      "description": [
+        "A segment is uniquely defined by its two endpoints. By considering two line segments in plane geometry there are three possibilities: ",
+        "the segments have zero points, one point, or infinitely many points in common.",
+        "Moreover when two segments have exactly one point in common it might be the case that that common point is an endpoint of either one of the segments or of both. If a common point of two segments is not an endpoint of either of the segments it is an interior point of both segments.",
+        "We will call a common point T of two segments L1 and L2 a true intersection point of L1 and L2  if T is the only common point of L1 and L2  and T is an interior point of both segments.",
+        "",
+        "Consider the three segments L1, L2, and L3:",
+        "L1: (27, 44) to (12, 32)",
+        "L2: (46, 53) to (17, 62)",
+        "L3: (46, 70) to (22, 40)",
+        "It can be verified that line segments L2 and L3 have a true intersection point. We note that as the one of the end points of L3: (22,40) lies on L1 this is not considered to be a true point of intersection. L1 and L2 have no common point. So among the three line segments, we find one true intersection point.",
+        "Now let us do the same for 5000 line segments. To this end, we generate 20000 numbers using the so-called \"Blum Blum Shub\" pseudo-random number generator.",
+        "s0 = 290797",
+        "sn+1 = sn×sn (modulo 50515093)",
+        "tn = sn (modulo 500)",
+        "To create each line segment, we use four consecutive numbers tn. That is, the first line segment is given by:",
+        "(t1, t2) to (t3, t4)",
+        "The first four numbers computed according to the above generator should be: 27, 144, 12 and 232. The first segment would thus be (27,144) to (12,232).",
+        "How many distinct true intersection points are found among the 5000 line segments?"
+      ]
+    },
+    {
+      "_id": "5900f4131000cf542c50ff25",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 166: Criss Cross",
+      "tests": [
+        "assert.strictEqual(euler166(), 7130034, 'message: <code>euler166()</code> should return 7130034.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler166() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler166();"
+      ],
+      "description": [
+        "A 4x4 grid is filled with digits d, 0 ≤ d ≤ 9.",
+        "",
+        "It can be seen that in the grid",
+        "",
+        "",
+        "6 3 3 0",
+        "5 0 4 3",
+        "0 7 1 4",
+        "1 2 4 5",
+        "",
+        "the sum of each row and each column has the value 12. Moreover the sum of each diagonal is also 12.",
+        "",
+        "In how many ways can you fill a 4x4 grid with the digits d, 0 ≤ d ≤ 9 so that each row, each column, and both diagonals have the same sum?"
+      ]
+    },
+    {
+      "_id": "5900f4141000cf542c50ff26",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 167: Investigating Ulam sequences",
+      "tests": [
+        "assert.strictEqual(euler167(), 3916160068885, 'message: <code>euler167()</code> should return 3916160068885.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler167() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler167();"
+      ],
+      "description": [
+        "For two positive integers a and b, the Ulam sequence U(a,b) is defined by U(a,b)1 = a, U(a,b)2 = b and for k > 2,",
+        "U(a,b)k is the smallest integer greater than U(a,b)(k-1) which can be written in exactly one way as the sum of two distinct previous members of U(a,b).",
+        "For example, the sequence U(1,2) begins with",
+        "1, 2, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 8 = 2 + 6, 11 = 3 + 8;",
+        "5 does not belong to it because 5 = 1 + 4 = 2 + 3 has two representations as the sum of two previous members, likewise 7 = 1 + 6 = 3 + 4.",
+        "Find ∑U(2,2n+1)k for 2 ≤ n ≤10, where k = 1011."
+      ]
+    },
+    {
+      "_id": "5900f4151000cf542c50ff27",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 168: Number Rotations",
+      "tests": [
+        "assert.strictEqual(euler168(), 59206, 'message: <code>euler168()</code> should return 59206.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler168() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler168();"
+      ],
+      "description": [
+        "Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.",
+        "It can be verified that 714285=5×142857.",
+        "This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.",
+        "Find the last 5 digits of the sum of all integers n, 10 < n < 10100, that have this property."
+      ]
+    },
+    {
+      "_id": "5900f4151000cf542c50ff28",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 169: Exploring the number of different ways a number can be expressed as a sum of powers of 2",
+      "tests": [
+        "assert.strictEqual(euler169(), 178653872807, 'message: <code>euler169()</code> should return 178653872807.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler169() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler169();"
+      ],
+      "description": [
+        "Define f(0)=1 and f(n) to be the number of different ways n can be expressed as a sum of integer powers of 2 using each power no more than twice.",
+        "For example, f(10)=5 since there are five different ways to express 10:",
+        "1 + 1 + 8",
+        "1 + 1 + 4 + 41 + 1 + 2 + 2 + 4",
+        "2 + 4 + 4",
+        "2 + 8",
+        "What is f(1025)?"
+      ]
+    },
+    {
+      "_id": "5900f4161000cf542c50ff29",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 170: Find the largest 0 to 9 pandigital that can be formed by concatenating products",
+      "tests": [
+        "assert.strictEqual(euler170(), 9857164023, 'message: <code>euler170()</code> should return 9857164023.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler170() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler170();"
+      ],
+      "description": [
+        "Take the number 6 and multiply it by each of 1273 and 9854:",
+        "",
+        "6 × 1273 =  7638",
+        "6 × 9854 = 59124",
+        "",
+        "By concatenating these products we get the 1 to 9 pandigital 763859124. We will call 763859124 the \"concatenated product of 6 and (1273,9854)\". Notice too, that the concatenation of the input numbers, 612739854, is also 1 to 9 pandigital.",
+        "",
+        "The same can be done for 0 to 9 pandigital numbers.",
+        "",
+        "What is the largest 0 to 9 pandigital 10-digit concatenated product of an integer with two or more other integers, such that the concatenation of the input numbers is also a 0 to 9 pandigital 10-digit number?"
+      ]
+    },
+    {
+      "_id": "5900f4181000cf542c50ff2a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 171: Finding numbers for which the sum of the squares of the digits is a square",
+      "tests": [
+        "assert.strictEqual(euler171(), 142989277, 'message: <code>euler171()</code> should return 142989277.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler171() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler171();"
+      ],
+      "description": [
+        "For a positive integer n, let f(n) be the sum of the squares of the digits (in base 10) of n, e.g.",
+        "f(3) = 32 = 9,",
+        "f(25) = 22 + 52 = 4 + 25 = 29,",
+        "f(442) = 42 + 42 + 22 = 16 + 16 + 4 = 36",
+        "Find the last nine digits of the sum of all n, 0 < n < 1020, such that f(n) is a perfect square."
+      ]
+    },
+    {
+      "_id": "5900f4181000cf542c50ff2b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 172: Investigating numbers with few repeated digits",
+      "tests": [
+        "assert.strictEqual(euler172(), 227485267000992000, 'message: <code>euler172()</code> should return 227485267000992000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler172() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler172();"
+      ],
+      "description": [
+        "How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?"
+      ]
+    },
+    {
+      "_id": "5900f41a1000cf542c50ff2c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 173: Using up to one million tiles how many different \"hollow\" square laminae can be formed?",
+      "tests": [
+        "assert.strictEqual(euler173(), 1572729, 'message: <code>euler173()</code> should return 1572729.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler173() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler173();"
+      ],
+      "description": [
+        "We shall define a square lamina to be a square outline with a square \"hole\" so that the shape possesses vertical and horizontal symmetry. For example, using exactly thirty-two square tiles we can form two different square laminae:",
+        "",
+        "",
+        "With one-hundred tiles, and not necessarily using all of the tiles at one time, it is possible to form forty-one different square laminae.",
+        "Using up to one million tiles how many different square laminae can be formed?"
+      ]
+    },
+    {
+      "_id": "5900f41a1000cf542c50ff2d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 174: Counting the number of \"hollow\" square laminae that can form one, two, three, ... distinct arrangements",
+      "tests": [
+        "assert.strictEqual(euler174(), 209566, 'message: <code>euler174()</code> should return 209566.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler174() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler174();"
+      ],
+      "description": [
+        "We shall define a square lamina to be a square outline with a square \"hole\" so that the shape possesses vertical and horizontal symmetry.",
+        "Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a 1x1 hole in the middle. However, using thirty-two tiles it is possible to form two distinct laminae.",
+        "",
+        "",
+        "If t represents the number of tiles used, we shall say that t = 8 is type L(1) and t = 32 is type L(2).",
+        "Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example, N(15) = 832.",
+        "What is ∑ N(n) for 1 ≤ n ≤ 10?"
+      ]
+    },
+    {
+      "_id": "5900f41c1000cf542c50ff2e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 175: Fractions involving the number of different ways a number can be expressed as a sum of powers of 2",
+      "tests": [
+        "assert.strictEqual(euler175(), 1, 13717420, 8, 'message: <code>euler175()</code> should return 1, 13717420, 8.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler175() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler175();"
+      ],
+      "description": [
+        "Define f(0)=1 and f(n) to be the number of ways to write n as a sum of powers of 2 where no power occurs more than twice. ",
+        "",
+        "For example, f(10)=5 since there are five different ways to express 10:10 = 8+2 = 8+1+1 = 4+4+2 = 4+2+2+1+1 = 4+4+1+1",
+        "",
+        "It can be shown that for every fraction p/q (p>0, q>0) there exists at least one integer n such that f(n)/f(n-1)=p/q.",
+        "For instance, the smallest n for which f(n)/f(n-1)=13/17 is 241.",
+        "The binary expansion of 241 is 11110001.",
+        "Reading this binary number from the most significant bit to the least significant bit there are 4 one's, 3 zeroes and 1 one. We shall call the string 4,3,1 the Shortened Binary Expansion of 241.",
+        "Find the Shortened Binary Expansion of the smallest n for which f(n)/f(n-1)=123456789/987654321.",
+        "Give your answer as comma separated integers, without any whitespaces."
+      ]
+    },
+    {
+      "_id": "5900f41c1000cf542c50ff2f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 176: Right-angled triangles that share a cathetus",
+      "tests": [
+        "assert.strictEqual(euler176(), 96818198400000, 'message: <code>euler176()</code> should return 96818198400000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler176() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler176();"
+      ],
+      "description": [
+        "The four right-angled triangles with sides (9,12,15), (12,16,20), (5,12,13) and (12,35,37) all have one of the shorter sides (catheti) equal to 12. It can be shown that no other integer sided right-angled triangle exists with one of the catheti equal to 12.",
+        "Find the smallest integer that can be the length of a cathetus of exactly 47547 different integer sided right-angled triangles."
+      ]
+    },
+    {
+      "_id": "5900f41e1000cf542c50ff30",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 177: Integer angled Quadrilaterals",
+      "tests": [
+        "assert.strictEqual(euler177(), 129325, 'message: <code>euler177()</code> should return 129325.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler177() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler177();"
+      ],
+      "description": [
+        "Let ABCD be a convex quadrilateral, with diagonals AC and BD. At each vertex the diagonal makes an angle with each of the two sides, creating eight corner angles.",
+        "",
+        "For example, at vertex A, the two angles are CAD, CAB.",
+        "We call such a quadrilateral for which all eight corner angles have integer values when measured in degrees an \"integer angled quadrilateral\". An example of an integer angled quadrilateral is a square, where all eight corner angles are 45°. Another example is given by DAC = 20°, BAC = 60°, ABD = 50°, CBD = 30°, BCA = 40°, DCA = 30°, CDB = 80°, ADB = 50°.",
+        "What is the total number of non-similar integer angled quadrilaterals?",
+        "Note: In your calculations you may assume that a calculated angle is integral if it is within a tolerance of 10-9 of an integer value."
+      ]
+    },
+    {
+      "_id": "5900f41e1000cf542c50ff31",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 178: Step Numbers",
+      "tests": [
+        "assert.strictEqual(euler178(), 126461847755, 'message: <code>euler178()</code> should return 126461847755.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler178() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler178();"
+      ],
+      "description": [
+        "Consider the number 45656. ",
+        "It can be seen that each pair of consecutive digits of 45656 has a difference of one.",
+        "A number for which every pair of consecutive digits has a difference of one is called a step number.",
+        "A pandigital number  contains every decimal digit from 0 to 9 at least once.",
+        "",
+        "How many pandigital step numbers less than 1040 are there?"
+      ]
+    },
+    {
+      "_id": "5900f41f1000cf542c50ff32",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 179: Consecutive positive divisors",
+      "tests": [
+        "assert.strictEqual(euler179(), 986262, 'message: <code>euler179()</code> should return 986262.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler179() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler179();"
+      ],
+      "description": [
+        "Find the number of integers 1 < n < 107, for which n and n + 1 have the same number of positive divisors. For example, 14 has the positive divisors 1, 2, 7, 14 while 15 has 1, 3, 5, 15."
+      ]
+    },
+    {
+      "_id": "5900f4201000cf542c50ff33",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 180: Rational zeros of a function of three variables",
+      "tests": [
+        "assert.strictEqual(euler180(), 285196020571078980, 'message: <code>euler180()</code> should return 285196020571078980.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler180() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler180();"
+      ],
+      "description": [
+        "For any integer n, consider the three functions",
+        "f1,n(x,y,z) = xn+1 + yn+1 − zn+1f2,n(x,y,z) = (xy + yz + zx)*(xn-1 + yn-1 − zn-1)f3,n(x,y,z) = xyz*(xn-2 + yn-2 − zn-2)",
+        "and their combination",
+        "fn(x,y,z) = f1,n(x,y,z) + f2,n(x,y,z) − f3,n(x,y,z)",
+        "We call (x,y,z) a golden triple of order k if x, y, and z are all rational numbers of the form a / b with",
+        "0 < a < b ≤ k and there is (at least) one integer n, so that fn(x,y,z) = 0.",
+        "Let s(x,y,z) = x + y + z.",
+        "Let t = u / v be the sum of all distinct s(x,y,z) for all golden triples (x,y,z) of order 35. All the s(x,y,z) and t  must be in reduced form.",
+        "Find u + v."
+      ]
+    },
+    {
+      "_id": "5900f4231000cf542c50ff34",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 181: Investigating in how many ways objects of two different colours can be grouped",
+      "tests": [
+        "assert.strictEqual(euler181(), 83735848679360670, 'message: <code>euler181()</code> should return 83735848679360670.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler181() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler181();"
+      ],
+      "description": [
+        "Having three black objects B and one white object W they can be grouped in 7 ways like this:",
+        "(BBBW)(B,BBW)(B,B,BW)(B,B,B,W)",
+        "(B,BB,W)(BBB,W)(BB,BW)",
+        "In how many ways can sixty black objects B and forty white objects W be  thus grouped?"
+      ]
+    },
+    {
+      "_id": "5900f4231000cf542c50ff35",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 182: RSA encryption",
+      "tests": [
+        "assert.strictEqual(euler182(), 399788195976, 'message: <code>euler182()</code> should return 399788195976.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler182() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler182();"
+      ],
+      "description": [
+        "The RSA encryption is based on the following procedure:",
+        "Generate two distinct primes p and q.Compute n=pq and φ=(p-1)(q-1).",
+        "Find an integer e, 1<e<φ, such that gcd(e,φ)=1.",
+        "A message in this system is a number in the interval [0,n-1].",
+        "A text to be encrypted is then somehow converted to messages (numbers in the interval [0,n-1]).",
+        "To encrypt the text,  for each message, m, c=me mod n is calculated.",
+        "To decrypt the text, the following procedure is needed: calculate d such that ed=1 mod φ, then for each encrypted message, c, calculate m=cd mod n.",
+        "There exist values of e and m  such that me mod n=m.We call messages m for which me mod n=m unconcealed messages.",
+        "An issue when choosing e is that there should not be too many unconcealed messages.  For instance, let p=19 and q=37.",
+        "Then n=19*37=703 and φ=18*36=648.",
+        "If we choose e=181, then, although gcd(181,648)=1 it turns out that all possible messagesm (0≤m≤n-1) are unconcealed when calculating me mod n.",
+        "For any valid choice of e there exist some unconcealed messages.",
+        "It's important that the number of unconcealed messages is at a minimum.",
+        "Choose p=1009 and q=3643.",
+        "Find the sum of all values of e, 1<e<φ(1009,3643) and gcd(e,φ)=1, so that the number of unconcealed messages for this value of e is at a minimum."
+      ]
+    },
+    {
+      "_id": "5900f4231000cf542c50ff36",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 183: Maximum product of parts",
+      "tests": [
+        "assert.strictEqual(euler183(), 48861552, 'message: <code>euler183()</code> should return 48861552.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler183() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler183();"
+      ],
+      "description": [
+        "Let N be a positive integer and let N be split into k equal parts, r = N/k, so that N = r + r + ... + r.",
+        "Let P be the product of these parts, P = r × r × ... × r = rk.",
+        "",
+        "For example, if 11 is split into five equal parts, 11 = 2.2 + 2.2 + 2.2 + 2.2 + 2.2, then P = 2.25 = 51.53632.",
+        "",
+        "Let M(N) = Pmax for a given value of N.",
+        "",
+        "It turns out that the maximum for N = 11 is found by splitting eleven into four equal parts which leads to Pmax = (11/4)4; that is, M(11) = 14641/256 = 57.19140625, which is a terminating decimal.",
+        "",
+        "However, for N = 8 the maximum is achieved by splitting it into three equal parts, so M(8) = 512/27, which is a non-terminating decimal.",
+        "",
+        "Let D(N) = N if M(N) is a non-terminating decimal and D(N) = -N if M(N) is a terminating decimal.",
+        "",
+        "For example, ΣD(N) for 5 ≤ N ≤ 100 is 2438.",
+        "",
+        "Find ΣD(N) for 5 ≤ N ≤ 10000."
+      ]
+    },
+    {
+      "_id": "5900f4241000cf542c50ff37",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 184: Triangles containing the origin",
+      "tests": [
+        "assert.strictEqual(euler184(), 1725323624056, 'message: <code>euler184()</code> should return 1725323624056.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler184() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler184();"
+      ],
+      "description": [
+        "Consider the set Ir of points (x,y) with integer co-ordinates in the interior of the circle with radius r, centered at the origin, i.e. x2 + y2 < r2.",
+        "For a radius of 2, I2 contains the nine points (0,0), (1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1) and (1,-1). There are eight triangles having all three vertices in I2 which contain the origin in the interior. Two of them are shown below, the others are obtained from these by rotation.",
+        "",
+        "",
+        "For a radius of 3, there are 360 triangles containing the origin in the interior and having all vertices in I3 and for I5 the number is 10600.",
+        "",
+        "How many triangles are there containing the origin in the interior and having all three vertices in I105?"
+      ]
+    },
+    {
+      "_id": "5900f4251000cf542c50ff38",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 185: Number Mind",
+      "tests": [
+        "assert.strictEqual(euler185(), 4640261571849533, 'message: <code>euler185()</code> should return 4640261571849533.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler185() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler185();"
+      ],
+      "description": [
+        "The game Number Mind is a variant of the well known game Master Mind.",
+        "Instead of coloured pegs, you have to guess a secret sequence of digits. After each guess you're only told in how many places you've guessed the correct digit. So, if the sequence was 1234 and you guessed 2036, you'd be told that you have one correct digit; however, you would NOT be told that you also have another digit in the wrong place.",
+        "",
+        "For instance, given the following guesses for a 5-digit secret sequence,",
+        "90342 ;2 correct",
+        "70794 ;0 correct",
+        "39458 ;2 correct",
+        "34109 ;1 correct",
+        "51545 ;2 correct",
+        "12531 ;1 correct",
+        "The correct sequence 39542 is unique.",
+        "",
+        "Based on the following guesses,",
+        "",
+        "5616185650518293 ;2 correct",
+        "3847439647293047 ;1 correct",
+        "5855462940810587 ;3 correct",
+        "9742855507068353 ;3 correct",
+        "4296849643607543 ;3 correct",
+        "3174248439465858 ;1 correct",
+        "4513559094146117 ;2 correct",
+        "7890971548908067 ;3 correct",
+        "8157356344118483 ;1 correct",
+        "2615250744386899 ;2 correct",
+        "8690095851526254 ;3 correct",
+        "6375711915077050 ;1 correct",
+        "6913859173121360 ;1 correct",
+        "6442889055042768 ;2 correct",
+        "2321386104303845 ;0 correct",
+        "2326509471271448 ;2 correct",
+        "5251583379644322 ;2 correct",
+        "1748270476758276 ;3 correct",
+        "4895722652190306 ;1 correct",
+        "3041631117224635 ;3 correct",
+        "1841236454324589 ;3 correct",
+        "2659862637316867 ;2 correct",
+        "",
+        "Find the unique 16-digit secret sequence."
+      ]
+    },
+    {
+      "_id": "5900f4281000cf542c50ff39",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 186: Connectedness of a network",
+      "tests": [
+        "assert.strictEqual(euler186(), 2325629, 'message: <code>euler186()</code> should return 2325629.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler186() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler186();"
+      ],
+      "description": [
+        "Here are the records from a busy telephone system with one million users:",
+        "",
+        "RecNrCallerCalled120000710005326001835004393600863701497.........",
+        "The telephone number of the caller and the called number in record n are Caller(n) = S2n-1 and Called(n) = S2n where S1,2,3,... come from the \"Lagged Fibonacci Generator\":",
+        "",
+        "For 1 ≤ k ≤ 55, Sk = [100003 - 200003k + 300007k3] (modulo 1000000)",
+        "For 56 ≤ k, Sk = [Sk-24 + Sk-55] (modulo 1000000)",
+        "",
+        "If Caller(n) = Called(n) then the user is assumed to have misdialled and the call fails; otherwise the call is successful.",
+        "",
+        "From the start of the records, we say that any pair of users X and Y are friends if X calls Y or vice-versa. Similarly, X is a friend of a friend of Z if X is a friend of Y and Y is a friend of Z; and so on for longer chains.",
+        "",
+        "The Prime Minister's phone number is 524287. After how many successful calls, not counting misdials, will 99% of the users (including the PM) be a friend, or a friend of a friend etc., of the Prime Minister?"
+      ]
+    },
+    {
+      "_id": "5900f4291000cf542c50ff3a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 187: Semiprimes",
+      "tests": [
+        "assert.strictEqual(euler187(), 17427258, 'message: <code>euler187()</code> should return 17427258.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler187() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler187();"
+      ],
+      "description": [
+        "A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.",
+        "",
+        "There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors:",
+        "4, 6, 9, 10, 14, 15, 21, 22, 25, 26.",
+        "",
+        "How many composite integers, n < 108, have precisely two, not necessarily distinct, prime factors?"
+      ]
+    },
+    {
+      "_id": "5900f4291000cf542c50ff3b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 188: The hyperexponentiation of a number",
+      "tests": [
+        "assert.strictEqual(euler188(), 95962097, 'message: <code>euler188()</code> should return 95962097.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler188() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler188();"
+      ],
+      "description": [
+        "The hyperexponentiation or tetration of a number a by a positive integer b, denoted by a↑↑b or ba, is recursively defined by:",
+        "a↑↑1 = a,",
+        "a↑↑(k+1) = a(a↑↑k).",
+        "",
+        "Thus we have e.g. 3↑↑2 = 33 = 27, hence 3↑↑3 = 327 = 7625597484987 and 3↑↑4 is roughly 103.6383346400240996*10^12.",
+        "Find the last 8 digits of 1777↑↑1855."
+      ]
+    },
+    {
+      "_id": "5900f4291000cf542c50ff3c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 189: Tri-colouring a triangular grid",
+      "tests": [
+        "assert.strictEqual(euler189(), 10834893628237824, 'message: <code>euler189()</code> should return 10834893628237824.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler189() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler189();"
+      ],
+      "description": [
+        "Consider the following configuration of 64 triangles:",
+        "",
+        "",
+        "",
+        "We wish to colour the interior of each triangle with one of three colours: red, green or blue, so that no two neighbouring triangles have the same colour. Such a colouring shall be called valid. Here, two triangles are said to be neighbouring if they share an edge.",
+        "Note: if they only share a vertex, then they are not neighbours. ",
+        "",
+        "For example, here is a valid colouring of the above grid:",
+        "",
+        "",
+        "A colouring C' which is obtained from a colouring C by rotation or reflection is considered distinct from C unless the two are identical.",
+        "",
+        "How many distinct valid colourings are there for the above configuration?"
+      ]
+    },
+    {
+      "_id": "5900f42b1000cf542c50ff3d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 190: Maximising a weighted product",
+      "tests": [
+        "assert.strictEqual(euler190(), 371048281, 'message: <code>euler190()</code> should return 371048281.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler190() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler190();"
+      ],
+      "description": [
+        "Let Sm = (x1, x2, ... , xm) be the m-tuple of positive real numbers with x1 + x2 + ... + xm = m for which Pm = x1 * x22 * ... * xmm is maximised.",
+        "",
+        "For example, it can be verified that [P10] = 4112 ([ ] is the integer part function).",
+        "",
+        "Find Σ[Pm] for 2 ≤ m ≤ 15."
+      ]
+    },
+    {
+      "_id": "5900f42b1000cf542c50ff3e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 191: Prize Strings",
+      "tests": [
+        "assert.strictEqual(euler191(), 1918080160, 'message: <code>euler191()</code> should return 1918080160.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler191() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler191();"
+      ],
+      "description": [
+        "A particular school offers cash rewards to children with good attendance and punctuality. If they are absent for three consecutive days or late on more than one occasion then they forfeit their prize.",
+        "",
+        "During an n-day period a trinary string is formed for each child consisting of L's (late), O's (on time), and A's (absent).",
+        "",
+        "Although there are eighty-one trinary strings for a 4-day period that can be formed, exactly forty-three strings would lead to a prize:",
+        "",
+        "OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA",
+        "OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO",
+        "AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL",
+        "AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA",
+        "LAOO LAOA LAAO",
+        "",
+        "How many \"prize\" strings exist over a 30-day period?"
+      ]
+    },
+    {
+      "_id": "5900f42c1000cf542c50ff3f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 192: Best Approximations",
+      "tests": [
+        "assert.strictEqual(euler192(), 57060635927998344, 'message: <code>euler192()</code> should return 57060635927998344.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler192() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler192();"
+      ],
+      "description": [
+        "Let x be a real number.",
+        "A best approximation to x for the denominator bound d is a rational number r/s in reduced form, with s ≤ d, such that any rational number which is closer to x than r/s has a denominator larger than d:",
+        "",
+        "|p/q-x| < |r/s-x| ⇒ q > d",
+        "",
+        "For example, the best approximation to √13 for the denominator bound 20 is 18/5 and the best approximation to √13 for the denominator bound 30 is 101/28.",
+        "",
+        "Find the sum of all denominators of the best approximations to √n for the denominator bound 1012, where n is not a perfect square and 1 < n ≤ 100000."
+      ]
+    },
+    {
+      "_id": "5900f42f1000cf542c50ff41",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 193: Squarefree Numbers",
+      "tests": [
+        "assert.strictEqual(euler193(), 684465067343069, 'message: <code>euler193()</code> should return 684465067343069.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler193() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler193();"
+      ],
+      "description": [
+        "A positive integer n is called squarefree, if no square of a prime divides n, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.",
+        "",
+        "How many squarefree numbers are there below 250?"
+      ]
+    },
+    {
+      "_id": "5900f42f1000cf542c50ff40",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 194: Coloured Configurations",
+      "tests": [
+        "assert.strictEqual(euler194(), 61190912, 'message: <code>euler194()</code> should return 61190912.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler194() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler194();"
+      ],
+      "description": [
+        "Consider graphs built with the units A: ",
+        "and B: , where the units are glued along",
+        "the vertical edges as in the graph .",
+        "",
+        "A configuration of type (a,b,c) is a graph thus built of a units A and b units B, where the graph's vertices are coloured using up to c colours, so that no two adjacent vertices have the same colour.",
+        "The compound graph above is an example of a configuration of type (2,2,6), in fact of type (2,2,c) for all c ≥ 4.",
+        "",
+        "Let N(a,b,c) be the number of configurations of type (a,b,c).",
+        "For example, N(1,0,3) = 24, N(0,2,4) = 92928 and N(2,2,3) = 20736.",
+        "",
+        "Find the last 8 digits of N(25,75,1984)."
+      ]
+    },
+    {
+      "_id": "5900f4311000cf542c50ff43",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 195: Inscribed circles of triangles with one angle of 60 degrees",
+      "tests": [
+        "assert.strictEqual(euler195(), 75085391, 'message: <code>euler195()</code> should return 75085391.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler195() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler195();"
+      ],
+      "description": [
+        "Let's call an integer sided triangle with exactly one angle of 60 degrees a 60-degree triangle.",
+        "Let r be the radius of the inscribed circle of such a 60-degree triangle.",
+        "There are 1234 60-degree triangles for which r ≤ 100.",
+        "Let T(n) be the number of 60-degree triangles for which r ≤ n, so",
+        " T(100) = 1234,  T(1000) = 22767, and  T(10000) = 359912.",
+        "",
+        "Find T(1053779)."
+      ]
+    },
+    {
+      "_id": "5900f4301000cf542c50ff42",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 196: Prime triplets",
+      "tests": [
+        "assert.strictEqual(euler196(), 322303240771079940, 'message: <code>euler196()</code> should return 322303240771079940.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler196() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler196();"
+      ],
+      "description": [
+        "Build a triangle from all positive integers in the following way:",
+        "",
+        " 1",
+        " 2  3",
+        " 4  5  6",
+        " 7  8  9 1011 12 13 14 15",
+        "16 17 18 19 20 21",
+        "22 23 24 25 26 27 2829 30 31 32 33 34 35 3637 38 39 40 41 42 43 44 45",
+        "46 47 48 49 50 51 52 53 54 55",
+        "56 57 58 59 60 61 62 63 64 65 66",
+        ". . .",
+        "",
+        "Each positive integer has up to eight neighbours in the triangle.",
+        "",
+        "A set of three primes is called a prime triplet if one of the three primes has the other two as neighbours in the triangle.",
+        "",
+        "For example, in the second row, the prime numbers 2 and 3 are elements of some prime triplet.",
+        "",
+        "If row 8 is considered, it contains two primes which are elements of some prime triplet, i.e. 29 and 31.",
+        "If row 9 is considered, it contains only one prime which is an element of some prime triplet: 37.",
+        "",
+        "Define S(n) as the sum of the primes in row n which are elements of any prime triplet.",
+        "Then S(8)=60 and S(9)=37.",
+        "",
+        "You are given that S(10000)=950007619.",
+        "",
+        "Find  S(5678027) + S(7208785)."
+      ]
+    },
+    {
+      "_id": "5900f4311000cf542c50ff44",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 197: Investigating the behaviour of a recursively defined sequence",
+      "tests": [
+        "assert.strictEqual(euler197(), 1.710637717, 'message: <code>euler197()</code> should return 1.710637717.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler197() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler197();"
+      ],
+      "description": [
+        "Given is the function f(x) = ⌊230.403243784-x2⌋ × 10-9 ( ⌊ ⌋ is the floor-function),",
+        "the sequence un is defined by u0 = -1 and un+1 = f(un).",
+        "",
+        "Find un + un+1 for n = 1012.",
+        "Give your answer with 9 digits after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4331000cf542c50ff45",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 198: Ambiguous Numbers",
+      "tests": [
+        "assert.strictEqual(euler198(), 52374425, 'message: <code>euler198()</code> should return 52374425.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler198() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler198();"
+      ],
+      "description": [
+        "A best approximation to a real number x for the denominator bound d is a rational number r/s (in reduced form) with s ≤ d, so that any rational number p/q which is closer to x than r/s has q > d.",
+        "",
+        "Usually the best approximation to a real number is uniquely determined for all denominator bounds. However, there are some exceptions, e.g. 9/40 has the two best approximations 1/4 and 1/5 for the denominator bound 6.",
+        "We shall call a real number x ambiguous, if there is at least one denominator bound for which x possesses two best approximations. Clearly, an ambiguous number is necessarily rational.",
+        "",
+        "How many ambiguous numbers x = p/q,",
+        "0 < x < 1/100, are there whose denominator q does not exceed 108?"
+      ]
+    },
+    {
+      "_id": "5900f4341000cf542c50ff46",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 199: Iterative Circle Packing",
+      "tests": [
+        "assert.strictEqual(euler199(), 0.00396087, 'message: <code>euler199()</code> should return 0.00396087.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler199() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler199();"
+      ],
+      "description": [
+        "Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered \"gaps\" which are to be filled iteratively with more tangent circles.",
+        "",
+        "",
+        "",
+        "At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.",
+        "",
+        "",
+        "What fraction of the area is not covered by circles after 10 iterations?",
+        "Give your answer rounded to eight decimal places using the format x.xxxxxxxx ."
+      ]
+    },
+    {
+      "_id": "5900f4351000cf542c50ff47",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string \"200\"",
+      "tests": [
+        "assert.strictEqual(euler200(), 229161792008, 'message: <code>euler200()</code> should return 229161792008.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler200() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler200();"
+      ],
+      "description": [
+        "We shall define a sqube to be a number of the form, p2q3, where p and q are distinct primes.",
+        "For example, 200 = 5223 or 120072949 = 232613.",
+        "",
+        "The first five squbes are 72, 108, 200, 392, and 500.",
+        "",
+        "Interestingly, 200 is also the first number for which you cannot change any single digit to make a prime; we shall call such numbers, prime-proof. The next prime-proof sqube which contains the contiguous sub-string \"200\" is 1992008.",
+        "",
+        "Find the 200th prime-proof sqube containing the contiguous sub-string \"200\"."
+      ]
+    },
+    {
+      "_id": "5900f4361000cf542c50ff48",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 201: Subsets with a unique sum",
+      "tests": [
+        "assert.strictEqual(euler201(), 115039000, 'message: <code>euler201()</code> should return 115039000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler201() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler201();"
+      ],
+      "description": [
+        "For any set A of numbers, let sum(A) be the sum of the elements of A.",
+        "Consider the set B = {1,3,6,8,10,11}. There are 20 subsets of B containing three elements, and their sums are:",
+        "",
+        "",
+        "sum({1,3,6}) = 10,",
+        "sum({1,3,8}) = 12,",
+        "sum({1,3,10}) = 14,",
+        "sum({1,3,11}) = 15,",
+        "sum({1,6,8}) = 15,",
+        "sum({1,6,10}) = 17,",
+        "sum({1,6,11}) = 18,",
+        "sum({1,8,10}) = 19,",
+        "sum({1,8,11}) = 20,",
+        "sum({1,10,11}) = 22,",
+        "sum({3,6,8}) = 17,",
+        "sum({3,6,10}) = 19,",
+        "sum({3,6,11}) = 20,",
+        "sum({3,8,10}) = 21,",
+        "sum({3,8,11}) = 22,",
+        "sum({3,10,11}) = 24,",
+        "sum({6,8,10}) = 24,",
+        "sum({6,8,11}) = 25,",
+        "sum({6,10,11}) = 27,",
+        "sum({8,10,11}) = 29.",
+        "",
+        "Some of these sums occur more than once, others are unique.",
+        "For a set A, let U(A,k) be the set of unique sums of k-element subsets of A, in our example we find U(B,3) = {10,12,14,18,21,25,27,29} and sum(U(B,3)) = 156.",
+        "",
+        "Now consider the 100-element set S = {12, 22, ... , 1002}.",
+        "S has 100891344545564193334812497256 50-element subsets.",
+        "",
+        "Determine the sum of all integers which are the sum of exactly one of the 50-element subsets of S, i.e. find sum(U(S,50))."
+      ]
+    },
+    {
+      "_id": "5900f4371000cf542c50ff49",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 202: Laserbeam",
+      "tests": [
+        "assert.strictEqual(euler202(), 1209002624, 'message: <code>euler202()</code> should return 1209002624.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler202() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler202();"
+      ],
+      "description": [
+        "Three mirrors are arranged in the shape of an equilateral triangle, with their reflective surfaces pointing inwards. There is an infinitesimal gap at each vertex of the triangle through which a laser beam may pass.",
+        "",
+        "Label the vertices A, B and C. There are 2 ways in which a laser beam may enter vertex C, bounce off 11 surfaces, then exit through the same vertex: one way is shown below; the other is the reverse of that.",
+        "",
+        "",
+        "  ",
+        "",
+        "There are 80840 ways in which a laser beam may enter vertex C, bounce off 1000001 surfaces, then exit through the same vertex.",
+        "",
+        "In how many ways can a laser beam enter at vertex C, bounce off 12017639147 surfaces, then exit through the same vertex?"
+      ]
+    },
+    {
+      "_id": "5900f4381000cf542c50ff4a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 203: Squarefree Binomial Coefficients",
+      "tests": [
+        "assert.strictEqual(euler203(), 34029210557338, 'message: <code>euler203()</code> should return 34029210557338.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler203() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler203();"
+      ],
+      "description": [
+        "The binomial coefficients nCk can be arranged in triangular form, Pascal's triangle, like this:",
+        "",
+        "",
+        "111121133114641151010511615201561172135352171",
+        ".........",
+        "",
+        "",
+        "It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.",
+        "",
+        "A positive integer n is called squarefree if no square of a prime divides n.",
+        "Of the twelve distinct numbers in the first eight rows of Pascal's triangle, all except 4 and 20 are squarefree.",
+        "The sum of the distinct squarefree numbers in the first eight rows is 105.",
+        "",
+        "Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's triangle."
+      ]
+    },
+    {
+      "_id": "5900f4381000cf542c50ff4b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 204: Generalised Hamming Numbers",
+      "tests": [
+        "assert.strictEqual(euler204(), 2944730, 'message: <code>euler204()</code> should return 2944730.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler204() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler204();"
+      ],
+      "description": [
+        "A Hamming number is a positive number which has no prime factor larger than 5.",
+        "So the first few Hamming numbers are 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15.",
+        "There are 1105 Hamming numbers not exceeding 108.",
+        "",
+        "We will call a positive number a generalised Hamming number of type n, if it has no prime factor larger than n.",
+        "Hence the Hamming numbers are the generalised Hamming numbers of type 5.",
+        "",
+        "How many generalised Hamming numbers of type 100 are there which don't exceed 109?"
+      ]
+    },
+    {
+      "_id": "5900f4391000cf542c50ff4c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 205: Dice Game",
+      "tests": [
+        "assert.strictEqual(euler205(), 0.5731441, 'message: <code>euler205()</code> should return 0.5731441.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler205() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler205();"
+      ],
+      "description": [
+        "Peter has nine four-sided (pyramidal) dice, each with faces numbered 1, 2, 3, 4.",
+        "Colin has six six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4, 5, 6.",
+        "",
+        "Peter and Colin roll their dice and compare totals: the highest total wins. The result is a draw if the totals are equal.",
+        "",
+        "What is the probability that Pyramidal Pete beats Cubic Colin? Give your answer rounded to seven decimal places in the form 0.abcdefg"
+      ]
+    },
+    {
+      "_id": "5900f43a1000cf542c50ff4d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 206: Concealed Square",
+      "tests": [
+        "assert.strictEqual(euler206(), 1389019170, 'message: <code>euler206()</code> should return 1389019170.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler206() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler206();"
+      ],
+      "description": [
+        "Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit."
+      ]
+    },
+    {
+      "_id": "5900f43c1000cf542c50ff4e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 207: Integer partition equations",
+      "tests": [
+        "assert.strictEqual(euler207(), 44043947822, 'message: <code>euler207()</code> should return 44043947822.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler207() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler207();"
+      ],
+      "description": [
+        "For some positive integers k, there exists an integer partition of the form   4t = 2t + k,",
+        "where 4t, 2t, and k are all positive integers and t is a real number.",
+        "",
+        "The first two such partitions are 41 = 21 + 2 and 41.5849625... = 21.5849625... + 6.",
+        "",
+        "Partitions where t is also an integer are called perfect. ",
+        "For any m ≥ 1 let P(m) be the proportion of such partitions that are perfect with k ≤ m.",
+        "Thus P(6) = 1/2.",
+        "",
+        "In the following table are listed some values of P(m)",
+        "   P(5) = 1/1",
+        "   P(10) = 1/2",
+        "   P(15) = 2/3",
+        "   P(20) = 1/2",
+        "   P(25) = 1/2",
+        "   P(30) = 2/5",
+        "   ...",
+        "   P(180) = 1/4",
+        "   P(185) = 3/13",
+        "",
+        "",
+        "Find the smallest m for which P(m) < 1/12345"
+      ]
+    },
+    {
+      "_id": "5900f43f1000cf542c50ff51",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 208: Robot Walks",
+      "tests": [
+        "assert.strictEqual(euler208(), 331951449665644800, 'message: <code>euler208()</code> should return 331951449665644800.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler208() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler208();"
+      ],
+      "description": [
+        "A robot moves in a series of one-fifth circular arcs (72°), with a free choice of a clockwise or an anticlockwise arc for each step, but no turning on the spot.",
+        "",
+        "One of 70932 possible closed paths of 25 arcs starting northward is",
+        "",
+        "",
+        "",
+        "Given that the robot starts facing North, how many journeys of 70 arcs in length can it take that return it, after the final arc, to its starting position?",
+        "(Any arc may be traversed multiple times.)"
+      ]
+    },
+    {
+      "_id": "5900f43e1000cf542c50ff4f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 209: Circular Logic",
+      "tests": [
+        "assert.strictEqual(euler209(), 15964587728784, 'message: <code>euler209()</code> should return 15964587728784.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler209() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler209();"
+      ],
+      "description": [
+        "A k-input binary truth table is a map from k input bits",
+        "(binary digits, 0 [false] or 1 [true]) to 1 output bit. For example, the 2-input binary truth tables for the logical AND and XOR functions are:",
+        "",
+        "x",
+        "y",
+        "x AND y000010100111x",
+        "y",
+        "x XOR y000011101110How many 6-input binary truth tables, τ, satisfy the formula",
+        "",
+        "τ(a, b, c, d, e, f) AND τ(b, c, d, e, f, a XOR (b AND c)) = 0",
+        "for all 6-bit inputs (a, b, c, d, e, f)?"
+      ]
+    },
+    {
+      "_id": "5900f43e1000cf542c50ff50",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 210: Obtuse Angled Triangles",
+      "tests": [
+        "assert.strictEqual(euler210(), 1598174770174689500, 'message: <code>euler210()</code> should return 1598174770174689500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler210() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler210();"
+      ],
+      "description": [
+        "Consider the set S(r) of points (x,y) with integer coordinates satisfying |x| + |y| ≤ r. ",
+        "Let O be the point (0,0) and C the point (r/4,r/4). ",
+        "Let N(r) be the number of points B in S(r), so that the triangle OBC has an obtuse angle, i.e. the largest angle α satisfies 90°<α<180°.",
+        "So, for example, N(4)=24 and N(8)=100.",
+        "",
+        "What is N(1,000,000,000)?"
+      ]
+    },
+    {
+      "_id": "5900f43f1000cf542c50ff52",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 211: Divisor Square Sum",
+      "tests": [
+        "assert.strictEqual(euler211(), 1922364685, 'message: <code>euler211()</code> should return 1922364685.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler211() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler211();"
+      ],
+      "description": [
+        "For a positive integer n, let σ2(n) be the sum of the squares of its divisors. For example,",
+        "σ2(10) = 1 + 4 + 25 + 100 = 130.",
+        "Find the sum of all n, 0 < n < 64,000,000 such that σ2(n) is a perfect square."
+      ]
+    },
+    {
+      "_id": "5900f4411000cf542c50ff53",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 212: Combined Volume of Cuboids",
+      "tests": [
+        "assert.strictEqual(euler212(), 328968937309, 'message: <code>euler212()</code> should return 328968937309.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler212() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler212();"
+      ],
+      "description": [
+        "An axis-aligned cuboid, specified by parameters { (x0,y0,z0), (dx,dy,dz) }, consists of all points (X,Y,Z) such that x0 ≤ X ≤ x0+dx, y0 ≤ Y ≤ y0+dy and z0 ≤ Z ≤ z0+dz.  The volume of the cuboid is the product, dx × dy × dz.  The combined volume of a collection of cuboids is the volume of their union and will be less than the sum of the individual volumes if any cuboids overlap.",
+        "",
+        "Let C1,...,C50000 be a collection of 50000 axis-aligned cuboids such that Cn has parameters",
+        "",
+        "x0 = S6n-5 modulo 10000y0 = S6n-4 modulo 10000z0 = S6n-3 modulo 10000dx = 1 + (S6n-2 modulo 399)dy = 1 + (S6n-1 modulo 399)dz = 1 + (S6n modulo 399)",
+        "",
+        "where S1,...,S300000 come from the \"Lagged Fibonacci Generator\":",
+        "",
+        "For 1 ≤ k ≤ 55, Sk = [100003 - 200003k + 300007k3]   (modulo 1000000)For 56 ≤ k, Sk = [Sk-24 + Sk-55]   (modulo 1000000)",
+        "",
+        "Thus, C1 has parameters {(7,53,183),(94,369,56)}, C2 has parameters {(2383,3563,5079),(42,212,344)}, and so on.",
+        "",
+        "The combined volume of the first 100 cuboids, C1,...,C100, is 723581599.",
+        "",
+        "What is the combined volume of all 50000 cuboids, C1,...,C50000 ?"
+      ]
+    },
+    {
+      "_id": "5900f4411000cf542c50ff54",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 213: Flea Circus",
+      "tests": [
+        "assert.strictEqual(euler213(), 330.721154, 'message: <code>euler213()</code> should return 330.721154.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler213() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler213();"
+      ],
+      "description": [
+        "A 30×30 grid of squares contains 900 fleas, initially one flea per square.",
+        "When a bell is rung, each flea jumps to an adjacent square at random (usually 4 possibilities, except for fleas on the edge of the grid or at the corners).",
+        "",
+        "What is the expected number of unoccupied squares after 50 rings of the bell? Give your answer rounded to six decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4421000cf542c50ff55",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 214: Totient Chains",
+      "tests": [
+        "assert.strictEqual(euler214(), 1677366278943, 'message: <code>euler214()</code> should return 1677366278943.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler214() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler214();"
+      ],
+      "description": [
+        "Let φ be Euler's totient function, i.e. for a natural number n,",
+        "φ(n) is the number of k, 1 ≤ k ≤ n, for which gcd(k,n) = 1.",
+        "",
+        "By iterating φ, each positive integer generates a decreasing chain of numbers ending in 1.",
+        "E.g. if we start with 5 the sequence 5,4,2,1 is generated.",
+        "Here is a listing of all chains with length 4:",
+        "",
+        "",
+        "5,4,2,1",
+        "7,6,2,1",
+        "8,4,2,1",
+        "9,6,2,1",
+        "10,4,2,1",
+        "12,4,2,1",
+        "14,6,2,1",
+        "18,6,2,1",
+        "",
+        "Only two of these chains start with a prime, their sum is 12.",
+        "",
+        "What is the sum of all primes less than 40000000 which generate a chain of length 25?"
+      ]
+    },
+    {
+      "_id": "5900f4431000cf542c50ff56",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 215: Crack-free Walls",
+      "tests": [
+        "assert.strictEqual(euler215(), 806844323190414, 'message: <code>euler215()</code> should return 806844323190414.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler215() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler215();"
+      ],
+      "description": [
+        "Consider the problem of building a wall out of 2×1 and 3×1 bricks (horizontal×vertical dimensions) such that, for extra strength, the gaps between horizontally-adjacent bricks never line up in consecutive layers, i.e. never form a \"running crack\".",
+        "",
+        "For example, the following 9×3 wall is not acceptable due to the running crack shown in red:",
+        "",
+        "",
+        "",
+        "",
+        "There are eight ways of forming a crack-free 9×3 wall, written W(9,3) = 8.",
+        "",
+        "Calculate W(32,10)."
+      ]
+    },
+    {
+      "_id": "5900f4451000cf542c50ff57",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 216: Investigating the primality of numbers of the form 2n2-1",
+      "tests": [
+        "assert.strictEqual(euler216(), 5437849, 'message: <code>euler216()</code> should return 5437849.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler216() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler216();"
+      ],
+      "description": [
+        "Consider numbers t(n) of the form t(n) = 2n2-1 with n > 1.",
+        "The first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.",
+        "It turns out that only 49 = 7*7 and 161 = 7*23 are not prime.",
+        "For n ≤ 10000 there are 2202 numbers t(n)  that are prime.",
+        "",
+        "How many numbers t(n) are prime for n ≤ 50,000,000 ?"
+      ]
+    },
+    {
+      "_id": "5900f4461000cf542c50ff58",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 217: Balanced Numbers",
+      "tests": [
+        "assert.strictEqual(euler217(), 6273134, 'message: <code>euler217()</code> should return 6273134.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler217() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler217();"
+      ],
+      "description": [
+        "A positive integer with k (decimal) digits is called balanced if its first ⌈k/2⌉ digits sum to the same value as its last ⌈k/2⌉ digits, where ⌈x⌉, pronounced ceiling of x, is the smallest integer ≥ x, thus ⌈π⌉ = 4 and ⌈5⌉ = 5.",
+        "So, for example, all palindromes are balanced, as is 13722.",
+        "Let T(n) be the sum of all balanced numbers less than 10n. ",
+        "Thus: T(1) = 45, T(2) = 540 and T(5) = 334795890. ",
+        "Find T(47) mod 315"
+      ]
+    },
+    {
+      "_id": "5900f4461000cf542c50ff59",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 218: Perfect right-angled triangles",
+      "tests": [
+        "assert.strictEqual(euler218(), 0, 'message: <code>euler218()</code> should return 0.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler218() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler218();"
+      ],
+      "description": [
+        "Consider the right angled triangle with sides a=7, b=24 and c=25.",
+        "The area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.",
+        "Moreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.",
+        "Also c is a perfect square.",
+        "",
+        "We will call a right angled triangle perfect if",
+        "-it is a primitive right angled triangle",
+        "-its hypotenuse is a perfect square",
+        "",
+        "We will call a right angled triangle super-perfect if",
+        "-it is a perfect right angled triangle and",
+        "-its area is a multiple of the perfect numbers 6 and 28.",
+        "",
+        "",
+        "How many perfect right-angled triangles with c≤1016 exist that are not super-perfect?"
+      ]
+    },
+    {
+      "_id": "5900f4481000cf542c50ff5a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 219: Skew-cost coding",
+      "tests": [
+        "assert.strictEqual(euler219(), 64564225042, 'message: <code>euler219()</code> should return 64564225042.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler219() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler219();"
+      ],
+      "description": [
+        "Let A and B be bit strings (sequences of 0's and 1's).",
+        "If A is equal to the leftmost length(A) bits of B, then A is said to be a prefix of B.",
+        "For example, 00110 is a prefix of 001101001, but not of 00111 or 100110.",
+        "",
+        "A prefix-free code of size n is a collection of n distinct bit strings such that no string is a prefix of any other.  For example, this is a prefix-free code of size 6:",
+        "",
+        "0000, 0001, 001, 01, 10, 11",
+        "",
+        "Now suppose that it costs one penny to transmit a '0' bit, but four pence to transmit a '1'.",
+        "Then the total cost of the prefix-free code shown above is 35 pence, which happens to be the cheapest possible for the skewed pricing scheme in question.",
+        "In short, we write Cost(6) = 35.",
+        "",
+        "What is Cost(109) ?"
+      ]
+    },
+    {
+      "_id": "5900f4481000cf542c50ff5b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 220: Heighway Dragon",
+      "tests": [
+        "assert.strictEqual(euler220(), 139776, 963904, 'message: <code>euler220()</code> should return 139776, 963904.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler220() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler220();"
+      ],
+      "description": [
+        "Let D0 be the two-letter string \"Fa\".  For n≥1, derive Dn from Dn-1 by the string-rewriting rules:",
+        "",
+        "\"a\" → \"aRbFR\"",
+        "\"b\" → \"LFaLb\"",
+        "",
+        "Thus, D0 = \"Fa\", D1 = \"FaRbFR\", D2 = \"FaRbFRRLFaLbFR\", and so on.",
+        "",
+        "These strings can be interpreted as instructions to a computer graphics program, with \"F\" meaning \"draw forward one unit\", \"L\" meaning \"turn left 90 degrees\", \"R\" meaning \"turn right 90 degrees\", and \"a\" and \"b\" being ignored.  The initial position of the computer cursor is (0,0), pointing up towards (0,1).",
+        "",
+        "Then Dn is an exotic drawing known as the Heighway Dragon of order n.  For example, D10 is shown below; counting each \"F\" as one step, the highlighted spot at (18,16) is the position reached after 500 steps.",
+        "",
+        "",
+        "",
+        "",
+        "What is the position of the cursor after 1012 steps in D50 ?",
+        "Give your answer in the form x,y with no spaces."
+      ]
+    },
+    {
+      "_id": "5900f4491000cf542c50ff5c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 221: Alexandrian Integers",
+      "tests": [
+        "assert.strictEqual(euler221(), 1884161251122450, 'message: <code>euler221()</code> should return 1884161251122450.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler221() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler221();"
+      ],
+      "description": [
+        "We shall call a positive integer A an \"Alexandrian integer\", if there exist integers p, q, r such that:",
+        "",
+        "",
+        "      A = p · q · r    and  ",
+        "   ",
+        "   ",
+        "      1A",
+        "   =",
+        "   ",
+        "      1p",
+        "   +",
+        "   ",
+        "      1q",
+        "   +",
+        "   ",
+        "      1r",
+        "For example, 630 is an Alexandrian integer (p = 5, q = −7, r = −18).",
+        "In fact, 630 is the 6th Alexandrian integer,  the first 6 Alexandrian integers being: 6, 42, 120, 156, 420 and 630.",
+        "",
+        "Find the 150000th Alexandrian integer."
+      ]
+    },
+    {
+      "_id": "5900f44b1000cf542c50ff5d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 222: Sphere Packing",
+      "tests": [
+        "assert.strictEqual(euler222(), 1590933, 'message: <code>euler222()</code> should return 1590933.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler222() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler222();"
+      ],
+      "description": [
+        "What is the length of the shortest pipe, of internal radius 50mm, that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?",
+        "",
+        "Give your answer in micrometres (10-6 m) rounded to the nearest integer."
+      ]
+    },
+    {
+      "_id": "5900f44b1000cf542c50ff5e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 223: Almost right-angled triangles I",
+      "tests": [
+        "assert.strictEqual(euler223(), 61614848, 'message: <code>euler223()</code> should return 61614848.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler223() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler223();"
+      ],
+      "description": [
+        "Let us call an integer sided triangle with sides a ≤ b ≤ c barely acute if the sides satisfy a2 + b2 = c2 + 1.",
+        "",
+        "How many barely acute triangles are there with perimeter ≤ 25,000,000?"
+      ]
+    },
+    {
+      "_id": "5900f44e1000cf542c50ff5f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 224: Almost right-angled triangles II",
+      "tests": [
+        "assert.strictEqual(euler224(), 4137330, 'message: <code>euler224()</code> should return 4137330.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler224() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler224();"
+      ],
+      "description": [
+        "Let us call an integer sided triangle with sides a ≤ b ≤ c barely obtuse if the sides satisfy a2 + b2 = c2 - 1.",
+        "",
+        "How many barely obtuse triangles are there with perimeter ≤ 75,000,000?"
+      ]
+    },
+    {
+      "_id": "5900f44e1000cf542c50ff60",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 225: Tribonacci non-divisors",
+      "tests": [
+        "assert.strictEqual(euler225(), 2009, 'message: <code>euler225()</code> should return 2009.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler225() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler225();"
+      ],
+      "description": [
+        "The sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653, 1201 ...",
+        "is defined by T1 = T2 = T3 = 1 and Tn = Tn-1 + Tn-2 + Tn-3.",
+        "",
+        "",
+        "It can be shown that 27 does not divide any terms of this sequence.In fact, 27 is the first odd number with this property.",
+        "",
+        "Find the 124th odd number that does not divide any terms of the above sequence."
+      ]
+    },
+    {
+      "_id": "5900f4511000cf542c50ff62",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 226: A Scoop of Blancmange",
+      "tests": [
+        "assert.strictEqual(euler226(), 0.11316017, 'message: <code>euler226()</code> should return 0.11316017.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler226() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler226();"
+      ],
+      "description": [
+        "The blancmange curve is the set of points (x,y) such that 0 ≤ x ≤ 1 and  ,where s(x) = the distance from x to the nearest integer.",
+        "",
+        "The area under the blancmange curve is equal to ½, shown in pink in the diagram below.",
+        "",
+        "",
+        "",
+        "",
+        "Let C be the circle with centre (¼,½) and radius ¼, shown in black in the diagram.",
+        "",
+        "What area under the blancmange curve is enclosed by C?Give your answer rounded to eight decimal places in the form 0.abcdefgh"
+      ]
+    },
+    {
+      "_id": "5900f44f1000cf542c50ff61",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 227: The Chase",
+      "tests": [
+        "assert.strictEqual(euler227(), 3780.618622, 'message: <code>euler227()</code> should return 3780.618622.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler227() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler227();"
+      ],
+      "description": [
+        "\"The Chase\" is a game played with two dice and an even number of players.",
+        "",
+        "The players sit around a table; the game begins with two opposite players having one die each. On each turn, the two players with a die roll it.",
+        "If a player rolls a 1, he passes the die to his neighbour on the left; if he rolls a 6, he passes the die to his neighbour on the right; otherwise, he keeps the die for the next turn.",
+        "The game ends when one player has both dice after they have been rolled and passed; that player has then lost.",
+        "",
+        "In a game with 100 players, what is the expected number of turns the game lasts?",
+        "Give your answer rounded to ten significant digits."
+      ]
+    },
+    {
+      "_id": "5900f4511000cf542c50ff63",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 228: Minkowski Sums",
+      "tests": [
+        "assert.strictEqual(euler228(), 86226, 'message: <code>euler228()</code> should return 86226.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler228() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler228();"
+      ],
+      "description": [
+        "Let Sn be the regular n-sided polygon – or shape – whose vertices ",
+        "",
+        "vk (k = 1,2,…,n) have coordinates:",
+        "",
+        "    xk   =  ",
+        "        cos( 2k-1/n ×180° )",
+        "  ",
+        "    yk   =  ",
+        "        sin( 2k-1/n ×180° )",
+        "  Each Sn is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.",
+        "",
+        "The Minkowski sum, S+T, of two shapes S and T is the result of ",
+        "",
+        "adding every point in S to every point in T, where point addition is performed coordinate-wise: ",
+        "",
+        "(u, v) + (x, y) = (u+x, v+y).",
+        "",
+        "For example, the sum of S3 and S4 is the six-sided shape shown in pink below:",
+        "",
+        "",
+        "",
+        "",
+        "How many sides does S1864 + S1865 + … + S1909 have?"
+      ]
+    },
+    {
+      "_id": "5900f4521000cf542c50ff64",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 229: Four Representations using Squares",
+      "tests": [
+        "assert.strictEqual(euler229(), 11325263, 'message: <code>euler229()</code> should return 11325263.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler229() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler229();"
+      ],
+      "description": [
+        "Consider the number 3600. It is very special, because",
+        "",
+        "3600 = 482 +     362",
+        "3600 = 202 + 2×402",
+        "3600 = 302 + 3×302",
+        "3600 = 452 + 7×152",
+        "",
+        "Similarly, we find that 88201 = 992 + 2802 = 2872 + 2×542 = 2832 + 3×522 = 1972 + 7×842.",
+        "",
+        "In 1747, Euler proved which numbers are representable as a sum of two squares.",
+        "We are interested in the numbers n which admit representations of all of the following four types:",
+        "",
+        "n = a12 +   b12n = a22 + 2 b22n = a32 + 3 b32n = a72 + 7 b72,",
+        "",
+        "where the ak and bk are positive integers.",
+        "",
+        "There are 75373 such numbers that do not exceed 107.",
+        "",
+        "How many such numbers are there that do not exceed 2×109?"
+      ]
+    },
+    {
+      "_id": "5900f4531000cf542c50ff65",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 230: Fibonacci Words",
+      "tests": [
+        "assert.strictEqual(euler230(), 850481152593119200, 'message: <code>euler230()</code> should return 850481152593119200.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler230() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler230();"
+      ],
+      "description": [
+        "For any two strings of digits, A and B, we define FA,B to be the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation of the previous two.",
+        "",
+        "Further, we define DA,B(n) to be the nth digit in the first term of FA,B that contains at least n digits.",
+        "",
+        "Example:",
+        "",
+        "Let A=1415926535, B=8979323846. We wish to find DA,B(35), say.",
+        "",
+        "The first few terms of FA,B are:",
+        "1415926535",
+        "8979323846",
+        "14159265358979323846",
+        "897932384614159265358979323846",
+        "14159265358979323846897932384614159265358979323846",
+        "",
+        "Then DA,B(35) is the 35th digit in the fifth term, which is 9.",
+        "",
+        "Now we use for A the first 100 digits of π behind the decimal point:",
+        "14159265358979323846264338327950288419716939937510 ",
+        "58209749445923078164062862089986280348253421170679 ",
+        "",
+        "and for B the next hundred digits:",
+        "",
+        "82148086513282306647093844609550582231725359408128 ",
+        "48111745028410270193852110555964462294895493038196 .",
+        "",
+        "Find ∑n = 0,1,...,17   10n× DA,B((127+19n)×7n) ."
+      ]
+    },
+    {
+      "_id": "5900f4531000cf542c50ff66",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 231: The prime factorisation of binomial coefficients",
+      "tests": [
+        "assert.strictEqual(euler231(), 7526965179680, 'message: <code>euler231()</code> should return 7526965179680.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler231() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler231();"
+      ],
+      "description": [
+        "The binomial coefficient 10C3 = 120.",
+        "120 = 23 × 3 × 5 = 2 × 2 × 2 × 3 × 5, and 2 + 2 + 2 + 3 + 5 = 14.",
+        "So the sum of the terms in the prime factorisation of 10C3 is 14.",
+        "",
+        "Find the sum of the terms in the prime factorisation of 20000000C15000000."
+      ]
+    },
+    {
+      "_id": "5900f4551000cf542c50ff67",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 232: The Race",
+      "tests": [
+        "assert.strictEqual(euler232(), 0.83648556, 'message: <code>euler232()</code> should return 0.83648556.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler232() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler232();"
+      ],
+      "description": [
+        "Two players share an unbiased coin and take it in turns to play \"The Race\". On Player 1's turn, he tosses the coin once: if it comes up Heads, he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn, she chooses a positive integer T and tosses the coin T times: if it comes up all Heads, she scores 2T-1 points; otherwise, she scores nothing. Player 1 goes first. The winner is the first to 100 or more points.",
+        "",
+        "On each turn Player 2 selects the number, T, of coin tosses that maximises the probability of her winning.",
+        "",
+        "What is the probability that Player 2 wins?",
+        "",
+        "Give your answer rounded to eight decimal places in the form 0.abcdefgh ."
+      ]
+    },
+    {
+      "_id": "5900f4551000cf542c50ff68",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 233: Lattice points on a circle",
+      "tests": [
+        "assert.strictEqual(euler233(), 271204031455541300, 'message: <code>euler233()</code> should return 271204031455541300.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler233() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler233();"
+      ],
+      "description": [
+        "Let f(N) be the number of points with integer coordinates that are on a circle passing through (0,0), (N,0),(0,N), and (N,N).",
+        "It can be shown that f(10000) = 36.",
+        "",
+        "What is the sum of all positive integers N ≤ 1011 such that f(N) = 420 ?"
+      ]
+    },
+    {
+      "_id": "5900f4571000cf542c50ff69",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 234: Semidivisible numbers",
+      "tests": [
+        "assert.strictEqual(euler234(), 1259187438574927000, 'message: <code>euler234()</code> should return 1259187438574927000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler234() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler234();"
+      ],
+      "description": [
+        "For an integer n ≥ 4, we define the lower prime square root of n, denoted by lps(n), as the largest prime ≤ √n and the upper prime square root of n, ups(n), as the smallest prime ≥ √n.",
+        "So, for example, lps(4) = 2 = ups(4), lps(1000) = 31, ups(1000) = 37.",
+        "Let us call an integer n ≥ 4 semidivisible, if one of lps(n) and ups(n) divides n, but not both.",
+        "",
+        "The sum of the semidivisible numbers not exceeding 15 is 30, the numbers are 8, 10 and 12. 15 is not semidivisible because it is a multiple of both lps(15) = 3 and ups(15) = 5.",
+        "As a further example, the sum of the 92 semidivisible numbers up to 1000 is 34825.",
+        "",
+        "What is the sum of all semidivisible numbers not exceeding 999966663333 ?"
+      ]
+    },
+    {
+      "_id": "5900f4571000cf542c50ff6a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 235: An Arithmetic Geometric sequence",
+      "tests": [
+        "assert.strictEqual(euler235(), 1.002322108633, 'message: <code>euler235()</code> should return 1.002322108633.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler235() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler235();"
+      ],
+      "description": [
+        "Given is the arithmetic-geometric sequence u(k) = (900-3k)rk-1.",
+        "Let s(n) = Σk=1...nu(k).",
+        "",
+        "",
+        "Find the value of r for which s(5000) = -600,000,000,000.",
+        "",
+        "",
+        "Give your answer rounded to 12 places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4591000cf542c50ff6b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 236: Luxury Hampers",
+      "tests": [
+        "assert.strictEqual(euler236(), 123 / 59, 'message: <code>euler236()</code> should return 123 / 59.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler236() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler236();"
+      ],
+      "description": [
+        "Suppliers 'A' and 'B' provided the following numbers of products for the luxury hamper market:",
+        "",
+        "Product'A''B'Beluga Caviar5248640Christmas Cake13121888Gammon Joint26243776Vintage Port57603776Champagne Truffles39365664",
+        "",
+        "Although the suppliers try very hard to ship their goods in perfect condition, there is inevitably some spoilage - i.e. products gone bad.",
+        "",
+        "The suppliers compare their performance using two types of statistic:The five per-product spoilage rates for each supplier are equal to the number of products gone bad divided by the number of products supplied, for each of the five products in turn.",
+        "  The overall spoilage rate for each supplier is equal to the total number of products gone bad divided by the total number of products provided by that supplier.To their surprise, the suppliers found that each of the five per-product spoilage rates was worse (higher) for 'B' than for 'A' by the same factor (ratio of spoilage rates), m>1; and yet, paradoxically, the overall spoilage rate was worse for 'A' than for 'B', also by a factor of m.",
+        "",
+        "There are thirty-five m>1 for which this surprising result could have occurred, the smallest of which is 1476/1475.",
+        "",
+        "What's the largest possible value of m?",
+        "Give your answer as a fraction reduced to its lowest terms, in the form u/v."
+      ]
+    },
+    {
+      "_id": "5900f4591000cf542c50ff6c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 237: Tours on a 4 x n playing board",
+      "tests": [
+        "assert.strictEqual(euler237(), 15836928, 'message: <code>euler237()</code> should return 15836928.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler237() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler237();"
+      ],
+      "description": [
+        "Let T(n) be the number of tours over a 4 × n playing board such that:",
+        "The tour starts in the top left corner.",
+        "The tour consists of moves that are up, down, left, or right one square.",
+        "The tour visits each square exactly once.",
+        "The tour ends in the bottom left corner.",
+        "The diagram shows one tour over a 4 × 10 board:",
+        "",
+        "",
+        "",
+        "",
+        "T(10) is 2329. What is T(1012) modulo 108?"
+      ]
+    },
+    {
+      "_id": "5900f45b1000cf542c50ff6d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 238: Infinite string tour",
+      "tests": [
+        "assert.strictEqual(euler238(), 9922545104535660, 'message: <code>euler238()</code> should return 9922545104535660.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler238() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler238();"
+      ],
+      "description": [
+        "Create a sequence of numbers using the \"Blum Blum Shub\" pseudo-random number generator:",
+        "",
+        "s0",
+        "    =",
+        "    14025256",
+        "  sn+1",
+        "    =",
+        "    sn2 mod 20300713",
+        "  ",
+        "",
+        "Concatenate these numbers  s0s1s2… to create a string w of infinite length.",
+        "Then, w = 14025256741014958470038053646…",
+        "",
+        "For a positive integer k, if no substring of w exists with a sum of digits equal to k, p(k) is defined to be zero. If at least one substring of w exists with a sum of digits equal to k, we define p(k) = z, where z is the starting position of the earliest such substring.",
+        "",
+        "For instance:",
+        "",
+        "The substrings 1, 14, 1402, … ",
+        "with respective sums of digits equal to 1, 5, 7, …",
+        "start at position 1, hence p(1) = p(5) = p(7) = … = 1.",
+        "",
+        "The substrings 4, 402, 4025, …",
+        "with respective sums of digits equal to 4, 6, 11, …",
+        "start at position 2, hence p(4) = p(6) = p(11) = … = 2.",
+        "",
+        "The substrings 02, 0252, …",
+        "with respective sums of digits equal to 2, 9, …",
+        "start at position 3, hence p(2) = p(9) = … = 3.",
+        "",
+        "Note that substring 025 starting at position 3, has a sum of digits equal to 7, but there was an earlier substring (starting at position 1) with a sum of digits equal to 7, so p(7) = 1, not 3.",
+        "",
+        "We can verify that, for 0 < k ≤ 103, ∑ p(k) = 4742.",
+        "",
+        "Find ∑ p(k), for 0 < k ≤ 2·1015."
+      ]
+    },
+    {
+      "_id": "5900f45c1000cf542c50ff6e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 239: Twenty-two Foolish Primes",
+      "tests": [
+        "assert.strictEqual(euler239(), 0.001887854841, 'message: <code>euler239()</code> should return 0.001887854841.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler239() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler239();"
+      ],
+      "description": [
+        "A set of disks numbered 1 through 100 are placed in a line in random order.",
+        "",
+        "What is the probability that we have a partial derangement such that exactly 22 prime number discs are found away from their natural positions?",
+        "(Any number of non-prime disks may also be found in or out of their natural positions.)",
+        "",
+        "Give your answer rounded to 12 places behind the decimal point in the form 0.abcdefghijkl."
+      ]
+    },
+    {
+      "_id": "5900f45d1000cf542c50ff6f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 240: Top Dice",
+      "tests": [
+        "assert.strictEqual(euler240(), 7448717393364182000, 'message: <code>euler240()</code> should return 7448717393364182000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler240() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler240();"
+      ],
+      "description": [
+        "There are 1111 ways in which five 6-sided dice (sides numbered 1 to 6) can be rolled so that the top three sum to 15. Some examples are:",
+        "",
+        "",
+        "D1,D2,D3,D4,D5 = 4,3,6,3,5",
+        "",
+        "D1,D2,D3,D4,D5 = 4,3,3,5,6",
+        "",
+        "D1,D2,D3,D4,D5 = 3,3,3,6,6",
+        "",
+        "D1,D2,D3,D4,D5 = 6,6,3,3,3",
+        "",
+        "In how many ways can twenty 12-sided dice (sides numbered 1 to 12) be rolled so that the top ten sum to 70?"
+      ]
+    },
+    {
+      "_id": "5900f45d1000cf542c50ff70",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 241: Perfection Quotients",
+      "tests": [
+        "assert.strictEqual(euler241(), 482316491800641150, 'message: <code>euler241()</code> should return 482316491800641150.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler241() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler241();"
+      ],
+      "description": [
+        "For a positive integer n, let σ(n) be the sum of all divisors of n, so e.g. σ(6) = 1 + 2 + 3 + 6 = 12.",
+        "",
+        "",
+        "A perfect number, as you probably know, is a number with σ(n) = 2n.",
+        "",
+        "Let us define the perfection quotient of a positive integer asp(n)= ",
+        "σ(n)n",
+        ".",
+        "Find the sum of all positive integers n ≤ 1018 for which p(n) has the form k + 1⁄2, where k is an integer."
+      ]
+    },
+    {
+      "_id": "5900f45f1000cf542c50ff71",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 242: Odd Triplets",
+      "tests": [
+        "assert.strictEqual(euler242(), 997104142249036700, 'message: <code>euler242()</code> should return 997104142249036700.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler242() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler242();"
+      ],
+      "description": [
+        "Given the set {1,2,...,n}, we define f(n,k) as the number of its k-element subsets with an odd sum of elements. For example, f(5,3) = 4, since the set {1,2,3,4,5} has four 3-element subsets having an odd sum of elements, i.e.: {1,2,4}, {1,3,5}, {2,3,4} and {2,4,5}.",
+        "",
+        "When all three values n, k and f(n,k) are odd, we say that they make ",
+        "an odd-triplet [n,k,f(n,k)].",
+        "",
+        "There are exactly five odd-triplets with n ≤ 10, namely:",
+        "[1,1,f(1,1) = 1], [5,1,f(5,1) = 3], [5,5,f(5,5) = 1], [9,1,f(9,1) = 5] and [9,9,f(9,9) = 1].",
+        "",
+        "How many odd-triplets are there with n ≤ 1012 ?"
+      ]
+    },
+    {
+      "_id": "5900f4601000cf542c50ff73",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 243: Resilience",
+      "tests": [
+        "assert.strictEqual(euler243(), 892371480, 'message: <code>euler243()</code> should return 892371480.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler243() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler243();"
+      ],
+      "description": [
+        "A positive fraction whose numerator is less than its denominator is called a proper fraction.",
+        "For any denominator, d, there will be d−1 proper fractions; for example, with d = 12:1/12 , 2/12 , 3/12 , 4/12 , 5/12 , 6/12 , 7/12 , 8/12 , 9/12 , 10/12 , 11/12 .",
+        "",
+        "",
+        "We shall call a fraction that cannot be cancelled down a resilient fraction.",
+        "Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4/11 .",
+        "In fact, d = 12 is the smallest denominator having a resilience R(d) < 4/10 .",
+        "",
+        "Find the smallest denominator d, having a resilience R(d) < 15499/94744 ."
+      ]
+    },
+    {
+      "_id": "5900f4601000cf542c50ff72",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 244: Sliders",
+      "tests": [
+        "assert.strictEqual(euler244(), 96356848, 'message: <code>euler244()</code> should return 96356848.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler244() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler244();"
+      ],
+      "description": [
+        "You probably know the game Fifteen Puzzle. Here, instead of numbered tiles, we have seven red tiles and eight blue tiles.",
+        "A move is denoted by the uppercase initial of the direction (Left, Right, Up, Down) in which the tile is slid, e.g. starting from configuration (S), by the sequence LULUR we reach the configuration (E):",
+        "",
+        "(S), (E)",
+        "",
+        "",
+        "For each path, its checksum is calculated by (pseudocode):",
+        "",
+        "checksum = 0",
+        "checksum = (checksum × 243 + m1) mod 100 000 007",
+        "checksum = (checksum × 243 + m2) mod 100 000 007",
+        "   …",
+        "checksum = (checksum × 243 + mn) mod 100 000 007",
+        "where mk is the ASCII value of the kth letter in the move sequence and the ASCII values for the moves are:",
+        "",
+        "",
+        "L76R82U85D68",
+        "",
+        "For the sequence LULUR given above, the checksum would be 19761398.",
+        "Now, starting from configuration (S),",
+        "find all shortest ways to reach configuration (T).",
+        "",
+        "(S), (T)",
+        "",
+        "",
+        "What is the sum of all checksums for the paths having the minimal length?"
+      ]
+    },
+    {
+      "_id": "5900f4621000cf542c50ff74",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 245: Coresilience",
+      "tests": [
+        "assert.strictEqual(euler245(), 288084712410001, 'message: <code>euler245()</code> should return 288084712410001.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler245() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler245();"
+      ],
+      "description": [
+        "We shall call a fraction that cannot be cancelled down a resilient fraction. Furthermore we shall define the resilience of a denominator, R(d), to be the ratio of its proper fractions that are resilient; for example, R(12) = 4⁄11.",
+        "",
+        "The resilience of a number d > 1 is then",
+        "φ(d)d − 1",
+        ", where φ is Euler's totient function.",
+        "We further define the coresilience of a number n > 1 as C(n)= ",
+        "n − φ(n)n − 1.",
+        "The coresilience of a prime p is C(p)",
+        "= ",
+        "1p − 1.",
+        "Find the sum of all composite integers 1 < n ≤ 2×1011, for which C(n) is a unit fraction."
+      ]
+    },
+    {
+      "_id": "5900f4621000cf542c50ff75",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 246: Tangents to an ellipse",
+      "tests": [
+        "assert.strictEqual(euler246(), 810834388, 'message: <code>euler246()</code> should return 810834388.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler246() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler246();"
+      ],
+      "description": [
+        "A definition for an ellipse is:",
+        "Given a circle c with centre M and radius r and a point G such that d(G,M)<r, the locus of the points that are equidistant from c and G form an ellipse.",
+        "",
+        "The construction of the points of the ellipse is shown below.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "Given are the points M(-2000,1500) and G(8000,1500). ",
+        "Given is also the circle c with centre M and radius 15000.",
+        "The locus of the points that are equidistant from G and c form an ellipse e.",
+        "From a point P outside e the two tangents t1 and t2 to the ellipse are drawn.",
+        "Let the points where t1 and t2 touch the ellipse be R and S.",
+        "",
+        "",
+        "",
+        "",
+        "For how many lattice points P is angle RPS greater than 45 degrees?"
+      ]
+    },
+    {
+      "_id": "5900f4641000cf542c50ff76",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 247: Squares under a hyperbola",
+      "tests": [
+        "assert.strictEqual(euler247(), 782252, 'message: <code>euler247()</code> should return 782252.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler247() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler247();"
+      ],
+      "description": [
+        "Consider the region constrained by 1 ≤ x and 0 ≤ y ≤ 1/x.",
+        "",
+        "Let S1 be the largest square that can fit under the curve.",
+        "Let S2 be the largest square that fits in the remaining area, and so on. ",
+        "Let the index of Sn be the pair (left, below) indicating the number of squares to the left of Sn and the number of squares below Sn.",
+        "",
+        "",
+        "",
+        "",
+        "The diagram shows some such squares labelled by number. ",
+        "S2 has one square to its left and none below, so the index of S2 is (1,0).",
+        "It can be seen that the index of S32 is (1,1) as is the index of S50. ",
+        "50 is the largest n for which the index of Sn is (1,1).",
+        "",
+        "",
+        "What is the largest n for which the index of Sn is (3,3)?"
+      ]
+    },
+    {
+      "_id": "5900f4651000cf542c50ff77",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 248: Numbers for which Euler’s totient function equals 13!",
+      "tests": [
+        "assert.strictEqual(euler248(), 23507044290, 'message: <code>euler248()</code> should return 23507044290.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler248() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler248();"
+      ],
+      "description": [
+        "The first number n for which φ(n)=13! is 6227180929.",
+        "Find the 150,000th such number."
+      ]
+    },
+    {
+      "_id": "5900f4671000cf542c50ff79",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 249: Prime Subset Sums",
+      "tests": [
+        "assert.strictEqual(euler249(), 9275262564250418, 'message: <code>euler249()</code> should return 9275262564250418.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler249() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler249();"
+      ],
+      "description": [
+        "Let S = {2, 3, 5, ..., 4999} be the set of prime numbers less than 5000.",
+        "Find the number of subsets of S, the sum of whose elements is a prime number.",
+        "Enter the rightmost 16 digits as your answer."
+      ]
+    },
+    {
+      "_id": "5900f4661000cf542c50ff78",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 250: 250250",
+      "tests": [
+        "assert.strictEqual(euler250(), 1425480602091519, 'message: <code>euler250()</code> should return 1425480602091519.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler250() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler250();"
+      ],
+      "description": [
+        "Find the number of non-empty subsets of {11, 22, 33,..., 250250250250}, the sum of whose elements is divisible by 250. Enter the rightmost 16 digits as your answer."
+      ]
+    },
+    {
+      "_id": "5900f4671000cf542c50ff7a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 251: Cardano Triplets",
+      "tests": [
+        "assert.strictEqual(euler251(), 18946051, 'message: <code>euler251()</code> should return 18946051.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler251() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler251();"
+      ],
+      "description": [
+        "A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:",
+        "",
+        "",
+        "",
+        "For example, (2,1,5) is a Cardano Triplet.",
+        "",
+        "",
+        "There exist 149 Cardano Triplets for which a+b+c ≤ 1000.",
+        "",
+        "",
+        "Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000."
+      ]
+    },
+    {
+      "_id": "5900f4691000cf542c50ff7b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 252: Convex Holes",
+      "tests": [
+        "assert.strictEqual(euler252(), 104924, 'message: <code>euler252()</code> should return 104924.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler252() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler252();"
+      ],
+      "description": [
+        "Given a set of points on a plane, we define a convex hole to be a convex polygon having as vertices any of the given points and not containing any of the given points in its interior (in addition to the vertices, other given points may lie on the perimeter of the polygon). ",
+        "",
+        "",
+        "As an example, the image below shows a set of twenty points and a few such convex holes. ",
+        "The convex hole shown as a red heptagon has an area equal to 1049694.5 square units, which is the highest possible area for a convex hole on the given set of points.",
+        "",
+        "",
+        "",
+        "",
+        "For our example, we used the first 20 points (T2k−1, T2k), for k = 1,2,…,20, produced with the pseudo-random number generator:",
+        "",
+        "S0",
+        "    = ",
+        "    290797 ",
+        "  Sn+1",
+        "    = ",
+        "    Sn2 mod 50515093",
+        "  Tn",
+        "    = ",
+        "    ( Sn mod 2000 ) − 1000 ",
+        "  ",
+        "",
+        "",
+        "i.e. (527, 144), (−488, 732), (−454, −947), …",
+        "",
+        "",
+        "What is the maximum area for a convex hole on the set containing the first 500 points in the pseudo-random sequence? Specify your answer including one digit after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4691000cf542c50ff7c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 253: Tidying up",
+      "tests": [
+        "assert.strictEqual(euler253(), 11.492847, 'message: <code>euler253()</code> should return 11.492847.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler253() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler253();"
+      ],
+      "description": [
+        "A small child has a “number caterpillar” consisting of forty jigsaw pieces, each with one number on it, which, when connected together in a line, reveal the numbers 1 to 40 in order.",
+        "",
+        "Every night, the child's father has to pick up the pieces of the caterpillar that have been scattered across the play room. He picks up the pieces at random and places them in the correct order. As the caterpillar is built up in this way, it forms distinct segments that gradually merge together. The number of segments starts at zero (no pieces placed), generally increases up to about eleven or twelve, then tends to drop again before finishing at a single segment (all pieces placed).",
+        "",
+        "For example:",
+        "",
+        "Piece Placed",
+        "Segments So Far121422936434554354……",
+        "",
+        "Let M be the maximum number of segments encountered during a random tidy-up of the caterpillar.",
+        "For a caterpillar of ten pieces, the number of possibilities for each M is",
+        "",
+        "M",
+        "Possibilities1512      2250912      31815264      41418112      5144000      ",
+        "",
+        "so the most likely value of M is 3 and the average value is 385643⁄113400 = 3.400732, rounded to six decimal places.",
+        "",
+        "The most likely value of M for a forty-piece caterpillar is 11; but what is the average value of M?",
+        "Give your answer rounded to six decimal places."
+      ]
+    },
+    {
+      "_id": "5900f46b1000cf542c50ff7d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 254: Sums of Digit Factorials",
+      "tests": [
+        "assert.strictEqual(euler254(), 8184523820510, 'message: <code>euler254()</code> should return 8184523820510.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler254() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler254();"
+      ],
+      "description": [
+        "Define f(n) as the sum of the factorials of the digits of n. For example, f(342) = 3! + 4! + 2! = 32.",
+        "",
+        "Define sf(n) as the sum of the digits of f(n). So sf(342) = 3 + 2 = 5.",
+        "",
+        "Define g(i) to be the smallest positive integer n such that sf(n) = i. Though sf(342) is 5, sf(25) is also 5, and it can be verified that g(5) is 25.",
+        "",
+        "Define sg(i) as the sum of the digits of g(i). So sg(5) = 2 + 5 = 7.",
+        "",
+        "Further, it can be verified that g(20) is 267 and ∑ sg(i) for 1 ≤ i ≤ 20 is 156.",
+        "",
+        "What is ∑ sg(i) for 1 ≤ i ≤ 150?"
+      ]
+    },
+    {
+      "_id": "5900f46d1000cf542c50ff7f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 255: Rounded Square Roots",
+      "tests": [
+        "assert.strictEqual(euler255(), 4.447401118, 'message: <code>euler255()</code> should return 4.447401118.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler255() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler255();"
+      ],
+      "description": [
+        "We define the rounded-square-root of a positive integer n as the square root of n rounded to the nearest integer.",
+        "",
+        "The following procedure (essentially Heron's method adapted to integer arithmetic) finds the rounded-square-root of n:",
+        "Let d be the number of digits of the number n.",
+        "If d is odd, set x0 = 2×10(d-1)⁄2.",
+        "If d is even, set x0 = 7×10(d-2)⁄2.",
+        "Repeat:",
+        "",
+        "",
+        "",
+        "",
+        "until xk+1 = xk.",
+        "",
+        "As an example, let us find the rounded-square-root of n = 4321.n has 4 digits, so x0 = 7×10(4-2)⁄2 = 70.",
+        "Since x2 = x1, we stop here.",
+        "So, after just two iterations, we have found that the rounded-square-root of 4321 is 66 (the actual square root is 65.7343137…).",
+        "",
+        "The number of iterations required when using this method is surprisingly low.",
+        "For example, we can find the rounded-square-root of a 5-digit integer (10,000 ≤ n ≤ 99,999) with an average of 3.2102888889 iterations (the average value was rounded to 10 decimal places).",
+        "",
+        "Using the procedure described above, what is the average number of iterations required to find the rounded-square-root of a 14-digit number (1013 ≤ n < 1014)?",
+        "Give your answer rounded to 10 decimal places.",
+        "",
+        "Note: The symbols ⌊x⌋ and ⌈x⌉ represent the floor function and ceiling function respectively."
+      ]
+    },
+    {
+      "_id": "5900f46c1000cf542c50ff7e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 256: Tatami-Free Rooms",
+      "tests": [
+        "assert.strictEqual(euler256(), 85765680, 'message: <code>euler256()</code> should return 85765680.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler256() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler256();"
+      ],
+      "description": [
+        "Tatami are rectangular mats, used to completely cover the floor of a room, without overlap.",
+        "",
+        "Assuming that the only type of available tatami has dimensions 1×2, there are obviously some limitations for the shape and size of the rooms that can be covered.",
+        "",
+        "For this problem, we consider only rectangular rooms with integer dimensions a, b and even size s = a·b.",
+        "We use the term 'size' to denote the floor surface area of the room, and — without loss of generality — we add the condition a ≤ b.",
+        "",
+        "There is one rule to follow when laying out tatami: there must be no points where corners of four different mats meet.",
+        "For example, consider the two arrangements below for a 4×4 room:",
+        "",
+        "",
+        "",
+        "The arrangement on the left is acceptable, whereas the one on the right is not: a red \"X\" in the middle, marks the point where four tatami meet.",
+        "",
+        "Because of this rule, certain even-sized rooms cannot be covered with tatami: we call them tatami-free rooms.",
+        "Further, we define T(s) as the number of tatami-free rooms of size s.",
+        "",
+        "The smallest tatami-free room has size s = 70 and dimensions 7×10.",
+        "All the other rooms of size s = 70 can be covered with tatami; they are: 1×70, 2×35 and 5×14.",
+        "Hence, T(70) = 1.",
+        "",
+        "Similarly, we can verify that T(1320) = 5 because there are exactly 5 tatami-free rooms of size s = 1320:",
+        "20×66, 22×60, 24×55, 30×44 and 33×40.",
+        "In fact, s = 1320 is the smallest room-size s for which T(s) = 5.",
+        "",
+        "Find the smallest room-size s for which T(s) = 200."
+      ]
+    },
+    {
+      "_id": "5900f46e1000cf542c50ff80",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 257: Angular Bisectors",
+      "tests": [
+        "assert.strictEqual(euler257(), 139012411, 'message: <code>euler257()</code> should return 139012411.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler257() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler257();"
+      ],
+      "description": [
+        "Given is an integer sided triangle ABC with sides a ≤ b ≤ c. ",
+        "(AB = c, BC = a and AC = b).",
+        "The angular bisectors of the triangle intersect the sides at points E, F and G (see picture below).",
+        "",
+        "",
+        "",
+        "",
+        "The segments EF, EG and FG partition the triangle ABC into four smaller triangles: AEG, BFE, CGF and EFG.",
+        "It can be proven that for each of these four triangles the ratio area(ABC)/area(subtriangle) is rational.",
+        "However, there exist triangles for which some or all of these ratios are integral.",
+        "",
+        "",
+        "How many triangles ABC with perimeter≤100,000,000 exist so that the ratio area(ABC)/area(AEG) is integral?"
+      ]
+    },
+    {
+      "_id": "5900f46e1000cf542c50ff81",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 258: A lagged Fibonacci sequence",
+      "tests": [
+        "assert.strictEqual(euler258(), 12747994, 'message: <code>euler258()</code> should return 12747994.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler258() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler258();"
+      ],
+      "description": [
+        "A sequence is defined as:",
+        "",
+        "gk = 1, for 0 ≤ k ≤ 1999",
+        "gk = gk-2000 + gk-1999, for k ≥ 2000.",
+        "Find gk mod 20092010 for k = 1018."
+      ]
+    },
+    {
+      "_id": "5900f4701000cf542c50ff82",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 259: Reachable Numbers",
+      "tests": [
+        "assert.strictEqual(euler259(), 20101196798, 'message: <code>euler259()</code> should return 20101196798.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler259() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler259();"
+      ],
+      "description": [
+        "A positive integer will be called reachable if it can result from an arithmetic expression obeying the following rules:",
+        "",
+        "Uses the digits 1 through 9, in that order and exactly once each.",
+        "Any successive digits can be concatenated (for example, using the digits 2, 3 and 4 we obtain the number 234).",
+        "Only the four usual binary arithmetic operations (addition, subtraction, multiplication and division) are allowed.",
+        "Each operation can be used any number of times, or not at all.",
+        "Unary minus is not allowed.",
+        "Any number of (possibly nested) parentheses may be used to define the order of operations.",
+        "For example, 42 is reachable, since (1/23) * ((4*5)-6) * (78-9) = 42.",
+        "",
+        "What is the sum of all positive reachable integers?"
+      ]
+    },
+    {
+      "_id": "5900f4701000cf542c50ff83",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 260: Stone Game",
+      "tests": [
+        "assert.strictEqual(euler260(), 167542057, 'message: <code>euler260()</code> should return 167542057.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler260() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler260();"
+      ],
+      "description": [
+        "A game is played with three piles of stones and two players.",
+        "At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile, she must remove the same number of stones from each of the selected piles.",
+        "",
+        "In other words, the player chooses some N>0 and removes:",
+        "N stones from any single pile; or",
+        "N stones from each of any two piles (2N total); or",
+        "N stones from each of the three piles (3N total).",
+        "The player taking the last stone(s) wins the game.",
+        "",
+        "A winning configuration is one where the first player can force a win.",
+        "For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.",
+        "",
+        "A losing configuration is one where the second player can force a win, no matter what the first player does. ",
+        "For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.",
+        "",
+        "Consider all  losing configurations (xi,yi,zi) where xi ≤ yi ≤ zi ≤ 100.",
+        "We can verify that Σ(xi+yi+zi) = 173895 for these.",
+        "",
+        "Find Σ(xi+yi+zi) where (xi,yi,zi) ranges over the losing configurations",
+        "with xi ≤ yi ≤ zi ≤ 1000."
+      ]
+    },
+    {
+      "_id": "5900f4711000cf542c50ff84",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 261: Pivotal Square Sums",
+      "tests": [
+        "assert.strictEqual(euler261(), 238890850232021, 'message: <code>euler261()</code> should return 238890850232021.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler261() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler261();"
+      ],
+      "description": [
+        "Let us call a positive integer k a square-pivot, if there is a pair of integers m > 0 and n ≥ k, such that the sum of the (m+1) consecutive squares up to k equals the sum of the m consecutive squares from (n+1) on:",
+        "",
+        "(k-m)2 + ... + k2 = (n+1)2 + ... + (n+m)2.",
+        "",
+        "Some small square-pivots are",
+        "4: 32 + 42",
+        " = 52",
+        "21: 202 + 212 = 292",
+        "24: 212 + 222 + 232 + 242 = 252 + 262 + 272",
+        "110: 1082 + 1092 + 1102 = 1332 + 1342Find the sum of all distinct square-pivots ≤ 1010."
+      ]
+    },
+    {
+      "_id": "5900f4731000cf542c50ff85",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 262: Mountain Range",
+      "tests": [
+        "assert.strictEqual(euler262(), 2531.205, 'message: <code>euler262()</code> should return 2531.205.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler262() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler262();"
+      ],
+      "description": [
+        "The following equation represents the continuous topography of a mountainous region, giving the elevation h at any point (x,y):",
+        "",
+        "",
+        "",
+        "",
+        "A mosquito intends to fly from A(200,200) to B(1400,1400), without leaving the area given by 0 ≤ x, y ≤ 1600.",
+        "",
+        "Because of the intervening mountains, it first rises straight up to a point A', having elevation f. Then, while remaining at the same elevation f, it flies around any obstacles until it arrives at a point B' directly above B.",
+        "",
+        "First, determine fmin which is the minimum constant elevation allowing such a trip from A to B, while remaining in the specified area.",
+        "Then, find the length of the shortest path between A' and B', while flying at that constant elevation fmin.",
+        "",
+        "Give that length as your answer, rounded to three decimal places.",
+        "",
+        "Note: For convenience, the elevation function shown above is repeated below, in a form suitable for most programming languages:",
+        "h=( 5000-0.005*(x*x+y*y+x*y)+12.5*(x+y) ) * exp( -abs(0.000001*(x*x+y*y)-0.0015*(x+y)+0.7) )"
+      ]
+    },
+    {
+      "_id": "5900f4741000cf542c50ff86",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 263: An engineers' dream come true",
+      "tests": [
+        "assert.strictEqual(euler263(), 2039506520, 'message: <code>euler263()</code> should return 2039506520.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler263() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler263();"
+      ],
+      "description": [
+        "Consider the number 6. The divisors of 6 are: 1,2,3 and 6.",
+        "Every number from 1 up to and including 6 can be written as a sum of distinct divisors of 6:",
+        "1=1, 2=2, 3=1+2, 4=1+3, 5=2+3, 6=6.",
+        "A number n is called a practical number if every number from 1 up to and including n can be expressed as a sum of distinct divisors of n.",
+        "",
+        "",
+        "A pair of consecutive prime numbers with a difference of six is called a sexy pair (since \"sex\" is the Latin word for \"six\"). The first sexy pair is (23, 29).",
+        "",
+        "",
+        "We may occasionally find a triple-pair, which means three consecutive sexy prime pairs, such that the second member of each pair is the first member of the next pair.",
+        "",
+        "",
+        "We shall call a number n such that :",
+        "(n-9, n-3), (n-3,n+3), (n+3, n+9) form a triple-pair, and ",
+        "the numbers n-8, n-4, n, n+4 and n+8 are all practical,",
+        " ",
+        "an engineers’ paradise.",
+        "",
+        "",
+        "Find the sum of the first four engineers’ paradises."
+      ]
+    },
+    {
+      "_id": "5900f4751000cf542c50ff87",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 264: Triangle Centres",
+      "tests": [
+        "assert.strictEqual(euler264(), 2816417.1055, 'message: <code>euler264()</code> should return 2816417.1055.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler264() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler264();"
+      ],
+      "description": [
+        "Consider all the triangles having:",
+        "All their vertices on lattice points.",
+        "Circumcentre at the origin O.",
+        "Orthocentre at the point H(5, 0).",
+        "There are nine such triangles having a perimeter ≤ 50.",
+        "Listed and shown in ascending order of their perimeter, they are:",
+        "",
+        "A(-4, 3), B(5, 0), C(4, -3)",
+        "A(4, 3), B(5, 0), C(-4, -3)",
+        "A(-3, 4), B(5, 0), C(3, -4)",
+        "A(3, 4), B(5, 0), C(-3, -4)",
+        "A(0, 5), B(5, 0), C(0, -5)",
+        "A(1, 8), B(8, -1), C(-4, -7)",
+        "A(8, 1), B(1, -8), C(-4, 7)",
+        "A(2, 9), B(9, -2), C(-6, -7)",
+        "A(9, 2), B(2, -9), C(-6, 7)",
+        "",
+        "The sum of their perimeters, rounded to four decimal places, is 291.0089.",
+        "",
+        "Find all such triangles with a perimeter ≤ 105.",
+        "Enter as your answer the sum of their perimeters rounded to four decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4761000cf542c50ff88",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 265: Binary Circles",
+      "tests": [
+        "assert.strictEqual(euler265(), 209110240768, 'message: <code>euler265()</code> should return 209110240768.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler265() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler265();"
+      ],
+      "description": [
+        "2N binary digits can be placed in a circle so that all the N-digit clockwise subsequences are distinct.",
+        "",
+        "For N=3, two such circular arrangements are possible, ignoring rotations:",
+        "",
+        "",
+        "For the first arrangement, the 3-digit subsequences, in clockwise order, are: 000, 001, 010, 101, 011, 111, 110 and 100.",
+        "",
+        "Each circular arrangement can be encoded as a number by concatenating the binary digits starting with the subsequence of all zeros as the most significant bits and proceeding clockwise. The two arrangements for N=3 are thus represented as 23 and 29:",
+        "00010111 2 = 23",
+        "00011101 2 = 29",
+        "",
+        "Calling S(N) the sum of the unique numeric representations, we can see that S(3) = 23 + 29 = 52.",
+        "",
+        "Find S(5)."
+      ]
+    },
+    {
+      "_id": "5900f4771000cf542c50ff89",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 266: Pseudo Square Root",
+      "tests": [
+        "assert.strictEqual(euler266(), 1096883702440585, 'message: <code>euler266()</code> should return 1096883702440585.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler266() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler266();"
+      ],
+      "description": [
+        "The divisors of 12 are: 1,2,3,4,6 and 12.",
+        "The largest divisor of 12 that does not exceed the square root of 12 is 3.",
+        "We shall call the largest divisor of an integer n that does not exceed the square root of n the pseudo square root (PSR) of n.",
+        "It can be seen that PSR(3102)=47.",
+        "",
+        "",
+        "Let p be the product of the primes below 190.",
+        "Find PSR(p) mod 1016."
+      ]
+    },
+    {
+      "_id": "5900f4771000cf542c50ff8a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 267: Billionaire",
+      "tests": [
+        "assert.strictEqual(euler267(), 0.999992836187, 'message: <code>euler267()</code> should return 0.999992836187.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler267() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler267();"
+      ],
+      "description": [
+        "You are given a unique investment opportunity.",
+        "Starting with £1 of capital, you can choose a fixed proportion, f, of your capital to bet on a fair coin toss repeatedly for 1000 tosses.",
+        "Your return is double your bet for heads and you lose your bet for tails.",
+        "For example, if f = 1/4,  for the first toss you bet £0.25, and if heads comes up you win £0.5 and so then have £1.5. You then bet £0.375 and if the second toss is tails, you have £1.125.",
+        "Choosing f to maximize your chances of having at least £1,000,000,000 after 1,000 flips, what is the chance that you become a billionaire?",
+        "All computations are assumed to be exact (no rounding), but give your answer rounded to 12 digits behind the decimal point in the form 0.abcdefghijkl."
+      ]
+    },
+    {
+      "_id": "5900f4791000cf542c50ff8b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 268: Counting numbers with at least four distinct prime factors less than 100",
+      "tests": [
+        "assert.strictEqual(euler268(), 785478606870985, 'message: <code>euler268()</code> should return 785478606870985.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler268() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler268();"
+      ],
+      "description": [
+        "It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.",
+        "",
+        "Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100."
+      ]
+    },
+    {
+      "_id": "5900f4791000cf542c50ff8c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 269: Polynomials with at least one integer root",
+      "tests": [
+        "assert.strictEqual(euler269(), 1311109198529286, 'message: <code>euler269()</code> should return 1311109198529286.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler269() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler269();"
+      ],
+      "description": [
+        "A root or zero of a polynomial P(x) is a solution to the equation P(x) = 0. ",
+        "Define Pn as the polynomial whose coefficients are the digits of n.",
+        "For example, P5703(x) = 5x3 + 7x2 + 3.",
+        "",
+        "We can see that:Pn(0) is the last digit of n,",
+        "Pn(1) is the sum of the digits of n,",
+        "Pn(10) is n itself.Define Z(k) as the number of positive integers, n, not exceeding k for which the polynomial Pn has at least one integer root.",
+        "",
+        "It can be verified that Z(100 000) is 14696.",
+        "",
+        "What is Z(1016)?"
+      ]
+    },
+    {
+      "_id": "5900f47c1000cf542c50ff8e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 270: Cutting Squares",
+      "tests": [
+        "assert.strictEqual(euler270(), 82282080, 'message: <code>euler270()</code> should return 82282080.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler270() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler270();"
+      ],
+      "description": [
+        "A square piece of paper with integer dimensions N×N is placed with a corner at the origin and two of its sides along the x- and y-axes. Then, we cut it up respecting the following rules:",
+        "We only make straight cuts between two points lying on different sides of the square, and having integer coordinates.",
+        "Two cuts cannot cross, but several cuts can meet at the same border point.",
+        "Proceed until no more legal cuts can be made.",
+        "Counting any reflections or rotations as distinct, we call C(N) the number of ways to cut an N×N square. For example, C(1) = 2 and C(2) = 30 (shown below).",
+        "",
+        "",
+        "What is C(30) mod 108 ?"
+      ]
+    },
+    {
+      "_id": "5900f47b1000cf542c50ff8d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 271: Modular Cubes, part 1",
+      "tests": [
+        "assert.strictEqual(euler271(), 4617456485273130000, 'message: <code>euler271()</code> should return 4617456485273130000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler271() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler271();"
+      ],
+      "description": [
+        "For a positive number n, define S(n) as the sum of the integers x, for which 1<x<n andx3≡1 mod n.",
+        "",
+        "",
+        "When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81.",
+        "Thus, S(91)=9+16+22+29+53+74+79+81=363.",
+        "",
+        "Find S(13082761331670030)."
+      ]
+    },
+    {
+      "_id": "5900f47d1000cf542c50ff8f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 272: Modular Cubes, part 2",
+      "tests": [
+        "assert.strictEqual(euler272(), 8495585919506151000, 'message: <code>euler272()</code> should return 8495585919506151000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler272() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler272();"
+      ],
+      "description": [
+        "For a positive number n, define C(n) as the number of the integers x, for which 1<x<n andx3≡1 mod n.",
+        "",
+        "",
+        "When n=91, there are 8 possible values for x, namely : 9, 16, 22, 29, 53, 74, 79, 81.",
+        "Thus, C(91)=8.",
+        "",
+        "Find the sum of the positive numbers n≤1011 for which C(n)=242."
+      ]
+    },
+    {
+      "_id": "5900f47e1000cf542c50ff90",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 273: Sum of Squares",
+      "tests": [
+        "assert.strictEqual(euler273(), 2032447591196869000, 'message: <code>euler273()</code> should return 2032447591196869000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler273() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler273();"
+      ],
+      "description": [
+        "Consider equations of the form: a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.",
+        "",
+        "For N=65 there are two solutions:",
+        "a=1, b=8 and a=4, b=7.",
+        "We call S(N) the sum of the values of a of all solutions of a2 + b2 = N, 0 ≤ a ≤ b, a, b and N integer.",
+        "Thus S(65) = 1 + 4 = 5.",
+        "Find ∑S(N), for all squarefree N only divisible by primes of the form 4k+1 with 4k+1 < 150."
+      ]
+    },
+    {
+      "_id": "5900f47f1000cf542c50ff91",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 274: Divisibility Multipliers",
+      "tests": [
+        "assert.strictEqual(euler274(), 1601912348822, 'message: <code>euler274()</code> should return 1601912348822.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler274() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler274();"
+      ],
+      "description": [
+        "For each integer p > 1 coprime to 10 there is a positive divisibility multiplier m < p which preserves divisibility by p for the following function on any positive integer, n:",
+        "",
+        "f(n) = (all but the last digit of n) + (the last digit of n) * m",
+        "",
+        "That is, if m is the divisibility multiplier for p, then f(n) is divisible by p if and only if n is divisible by p.",
+        "",
+        "(When n is much larger than p, f(n) will be less than n and repeated application of f provides a multiplicative divisibility test for p.)",
+        "",
+        "For example, the divisibility multiplier for 113 is 34.",
+        "",
+        "f(76275) = 7627 + 5 * 34 = 7797 : 76275 and 7797 are both divisible by 113f(12345) = 1234 + 5 * 34 = 1404 : 12345 and 1404 are both not divisible by 113",
+        "",
+        "The sum of the divisibility multipliers for the primes that are coprime to 10 and less than 1000 is 39517. What is the sum of the divisibility multipliers for the primes that are coprime to 10 and less than 107?"
+      ]
+    },
+    {
+      "_id": "5900f4801000cf542c50ff92",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 275: Balanced Sculptures",
+      "tests": [
+        "assert.strictEqual(euler275(), 15030564, 'message: <code>euler275()</code> should return 15030564.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler275() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler275();"
+      ],
+      "description": [
+        "Let us define a balanced sculpture of order n as follows:",
+        "A polyomino made up of n+1 tiles known as the blocks (n tiles) and the plinth (remaining tile);",
+        "the plinth has its centre at position (x = 0, y = 0);",
+        "the blocks have y-coordinates greater than zero (so the plinth is the unique lowest tile);",
+        "the centre of mass of all the blocks, combined, has x-coordinate equal to zero.",
+        "When counting the sculptures, any arrangements which are simply reflections about the y-axis, are not counted as distinct. For example, the 18 balanced sculptures of order 6 are shown below; note that each pair of mirror images (about the y-axis) is counted as one sculpture:",
+        "",
+        "",
+        "There are 964 balanced sculptures of order 10 and 360505 of order 15.How many balanced sculptures are there of order 18?"
+      ]
+    },
+    {
+      "_id": "5900f4801000cf542c50ff93",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 276: Primitive Triangles",
+      "tests": [
+        "assert.strictEqual(euler276(), 5777137137739633000, 'message: <code>euler276()</code> should return 5777137137739633000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler276() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler276();"
+      ],
+      "description": [
+        "Consider the triangles with integer sides a, b and c with a ≤ b ≤ c.",
+        "An integer sided triangle (a,b,c) is called primitive if  gcd(a,b,c)=1. ",
+        "How many primitive integer sided triangles exist with a perimeter not exceeding 10 000 000?"
+      ]
+    },
+    {
+      "_id": "5900f4811000cf542c50ff94",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 277: A Modified Collatz sequence",
+      "tests": [
+        "assert.strictEqual(euler277(), 1125977393124310, 'message: <code>euler277()</code> should return 1125977393124310.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler277() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler277();"
+      ],
+      "description": [
+        "A modified Collatz sequence of integers is obtained from a starting value a1 in the following way:",
+        "",
+        "an+1 = an/3 if an is divisible by 3. We shall denote this as a large downward step, \"D\".",
+        "",
+        "an+1 = (4an + 2)/3 if an divided by 3 gives a remainder of 1. We shall denote this as an upward step, \"U\".",
+        "",
+        "",
+        "an+1 = (2an - 1)/3 if an divided by 3 gives a remainder of 2. We shall denote this as a small downward step, \"d\".",
+        "",
+        "",
+        "",
+        "",
+        "The sequence terminates when some an = 1.",
+        "",
+        "",
+        "Given any integer, we can list out the sequence of steps.",
+        "For instance if a1=231, then the sequence {an}={231,77,51,17,11,7,10,14,9,3,1} corresponds to the steps \"DdDddUUdDD\".",
+        "",
+        "",
+        "Of course, there are other sequences that begin with that same sequence \"DdDddUUdDD....\".",
+        "For instance, if a1=1004064, then the sequence is DdDddUUdDDDdUDUUUdDdUUDDDUdDD.",
+        "In fact, 1004064 is the smallest possible a1 > 106 that begins with the sequence DdDddUUdDD.",
+        "",
+        "",
+        "What is the smallest a1 > 1015 that begins with the sequence \"UDDDUdddDDUDDddDdDddDDUDDdUUDd\"?"
+      ]
+    },
+    {
+      "_id": "5900f4831000cf542c50ff95",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 278: Linear Combinations of Semiprimes",
+      "tests": [
+        "assert.strictEqual(euler278(), 1228215747273908500, 'message: <code>euler278()</code> should return 1228215747273908500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler278() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler278();"
+      ],
+      "description": [
+        "Given the values of integers 1 < a1 < a2 <... < an, consider the linear combinationq1a1 + q2a2 + ... + qnan = b, using only integer values qk ≥ 0. ",
+        "",
+        "",
+        "Note that for a given set of ak, it may be that not all values of b are possible.",
+        "For instance, if a1 = 5 and a2 = 7, there are no q1 ≥ 0 and q2 ≥ 0 such that b could be ",
+        "1, 2, 3, 4, 6, 8, 9, 11, 13, 16, 18 or 23.",
+        "",
+        "In fact, 23 is the largest impossible value of b for a1 = 5 and a2 = 7. We therefore call f(5, 7) = 23. Similarly, it can be shown that f(6, 10, 15)=29 and f(14, 22, 77) = 195.",
+        "",
+        "",
+        "Find ∑ f(p*q,p*r,q*r), where p, q and r are prime numbers and p < q < r < 5000."
+      ]
+    },
+    {
+      "_id": "5900f4841000cf542c50ff96",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 279: Triangles with integral sides and an integral angle",
+      "tests": [
+        "assert.strictEqual(euler279(), 416577688, 'message: <code>euler279()</code> should return 416577688.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler279() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler279();"
+      ],
+      "description": [
+        "How many triangles are there with integral sides, at least one integral angle (measured in degrees), and a perimeter that does not exceed 108?"
+      ]
+    },
+    {
+      "_id": "5900f4841000cf542c50ff97",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 280: Ant and seeds",
+      "tests": [
+        "assert.strictEqual(euler280(), 430.088247, 'message: <code>euler280()</code> should return 430.088247.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler280() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler280();"
+      ],
+      "description": [
+        "A laborious ant walks randomly on a 5x5 grid. The walk starts from the central square. At each step, the ant moves to an adjacent square at random, without leaving the grid; thus there are 2, 3 or 4 possible moves at each step depending on the ant's position.",
+        "",
+        "At the start of the walk, a seed is placed on each square of the lower row. When the ant isn't carrying a seed and reaches a square of the lower row containing a seed, it will start to carry the seed. The ant will drop the seed on the first empty square of the upper row it eventually reaches.",
+        "",
+        "What's the expected number of steps until all seeds have been dropped in the top row? ",
+        "Give your answer rounded to 6 decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4861000cf542c50ff98",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 281: Pizza Toppings",
+      "tests": [
+        "assert.strictEqual(euler281(), 1485776387445623, 'message: <code>euler281()</code> should return 1485776387445623.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler281() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler281();"
+      ],
+      "description": [
+        "You are given a pizza (perfect circle) that has been cut into m·n equal pieces and you want to have exactly one topping on each slice.",
+        "",
+        "Let f(m,n) denote the number of ways you can have toppings on the pizza with m different toppings (m ≥ 2), using each topping on exactly n slices (n ≥ 1). Reflections are considered distinct, rotations are not. ",
+        "",
+        "Thus, for instance, f(2,1) = 1, f(2,2) = f(3,1) = 2 and f(3,2) = 16. f(3,2) is shown below:",
+        "",
+        "",
+        "",
+        "Find the sum of all f(m,n) such that f(m,n) ≤ 1015."
+      ]
+    },
+    {
+      "_id": "5900f4861000cf542c50ff99",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 282: The Ackermann function",
+      "tests": [
+        "assert.strictEqual(euler282(), 1098988351, 'message: <code>euler282()</code> should return 1098988351.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler282() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler282();"
+      ],
+      "description": [
+        "For non-negative integers m, n, the Ackermann function A(m, n) is defined as follows:",
+        "",
+        "",
+        "",
+        "For example A(1, 0) = 2, A(2, 2) = 7 and A(3, 4) = 125.",
+        "",
+        "",
+        "Find A(n, n) and give your answer mod 148."
+      ]
+    },
+    {
+      "_id": "5900f4881000cf542c50ff9a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 283: Integer sided triangles for which the  area/perimeter ratio is integral",
+      "tests": [
+        "assert.strictEqual(euler283(), 28038042525570324, 'message: <code>euler283()</code> should return 28038042525570324.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler283() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler283();"
+      ],
+      "description": [
+        "Consider the triangle with sides 6, 8 and 10. It can be seen that the perimeter and the area are both equal to 24. ",
+        "So the area/perimeter ratio is equal to 1.",
+        "Consider also the triangle with sides 13, 14 and 15. The perimeter equals 42 while the area is equal to 84. ",
+        "So for this triangle the area/perimeter ratio is equal to 2.",
+        "",
+        "",
+        "Find the sum of the perimeters of all integer sided triangles for which the area/perimeter ratios are equal to positive integers not exceeding 1000."
+      ]
+    },
+    {
+      "_id": "5900f4891000cf542c50ff9b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 284: Steady Squares",
+      "tests": [
+        "assert.strictEqual(euler284(), 5a411d7b, 'message: <code>euler284()</code> should return 5a411d7b.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler284() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler284();"
+      ],
+      "description": [
+        "The 3-digit number 376 in the decimal numbering system is an example of numbers with the special property that its square ends with the same digits: 3762 = 141376. Let's call a number with this property a steady square.",
+        "",
+        "Steady squares can also be observed in other numbering systems. In the base 14 numbering system, the 3-digit number c37 is also a steady square: c372 = aa0c37, and the sum of its digits is c+3+7=18 in the same numbering system. The letters a, b, c and d are used for the 10, 11, 12 and 13 digits respectively, in a manner similar to the hexadecimal numbering system.",
+        "",
+        "For 1 ≤ n ≤ 9, the sum of the digits of all the n-digit steady squares in the base 14 numbering system is 2d8 (582 decimal). Steady squares with leading 0's are not allowed.",
+        "",
+        "Find the sum of the digits of all the n-digit steady squares in the base 14 numbering system for",
+        "1 ≤ n ≤ 10000 (decimal) and give your answer in the base 14 system using lower case letters where necessary."
+      ]
+    },
+    {
+      "_id": "5900f48a1000cf542c50ff9c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 285: Pythagorean odds",
+      "tests": [
+        "assert.strictEqual(euler285(), 157055.80999, 'message: <code>euler285()</code> should return 157055.80999.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler285() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler285();"
+      ],
+      "description": [
+        "Albert chooses a positive integer k, then two real numbers a, b are randomly chosen in the interval [0,1] with uniform distribution.",
+        "The square root of the sum (k·a+1)2 + (k·b+1)2 is then computed and rounded to the nearest integer. If the result is equal to k, he scores k points; otherwise he scores nothing.",
+        "",
+        "For example, if k = 6, a = 0.2 and b = 0.85, then (k·a+1)2 + (k·b+1)2 = 42.05.",
+        "The square root of 42.05 is 6.484... and when rounded to the nearest integer, it becomes 6.",
+        "This is equal to k, so he scores 6 points.",
+        "",
+        "It can be shown that if he plays 10 turns with k = 1, k = 2, ..., k = 10, the expected value of his total score, rounded to five decimal places, is 10.20914.",
+        "",
+        "If he plays 105 turns with k = 1, k = 2, k = 3, ..., k = 105, what is the expected value of his total score, rounded to five decimal places?"
+      ]
+    },
+    {
+      "_id": "5900f48a1000cf542c50ff9d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 286: Scoring probabilities",
+      "tests": [
+        "assert.strictEqual(euler286(), 52.6494571953, 'message: <code>euler286()</code> should return 52.6494571953.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler286() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler286();"
+      ],
+      "description": [
+        "Barbara is a mathematician and a basketball player. She has found that the probability of scoring a point when shooting from a distance x is exactly (1 - x/q), where q is a real constant greater than 50.",
+        "",
+        "During each practice run, she takes shots from distances x = 1, x = 2, ..., x = 50 and, according to her records, she has precisely a 2 % chance to score a total of exactly 20 points.",
+        "",
+        "Find q and give your answer rounded to 10 decimal places."
+      ]
+    },
+    {
+      "_id": "5900f48b1000cf542c50ff9e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 287: Quadtree encoding (a simple compression algorithm)",
+      "tests": [
+        "assert.strictEqual(euler287(), 313135496, 'message: <code>euler287()</code> should return 313135496.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler287() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler287();"
+      ],
+      "description": [
+        "The quadtree encoding allows us to describe a 2N×2N  black and white image as a sequence of bits (0 and 1). Those sequences are to be read from left to right like this:",
+        "the first bit deals with the complete 2N×2N region;",
+        "\"0\" denotes a split:",
+        "the current 2n×2n region is divided into 4 sub-regions of dimension 2n-1×2n-1,",
+        "the next bits contains the description of the top left, top right, bottom left and bottom right sub-regions - in that order;",
+        "\"10\" indicates that the current region contains only black pixels;",
+        "\"11\" indicates that the current region contains only white pixels.Consider the following 4×4 image (colored marks denote places where a split can occur):",
+        "",
+        "This image can be described by several sequences, for example :",
+        "\"001010101001011111011010101010\", of length 30, or",
+        "\"0100101111101110\", of length 16, which is the minimal sequence for this image.",
+        "",
+        "For a positive integer N, define DN as the 2N×2N image with the following coloring scheme:",
+        "the pixel with coordinates x = 0, y = 0 corresponds to the bottom left pixel,",
+        "if (x - 2N-1)2 + (y - 2N-1)2 ≤ 22N-2 then the pixel is black,",
+        "otherwise the pixel is white.What is the length of the minimal sequence describing D24 ?"
+      ]
+    },
+    {
+      "_id": "5900f48d1000cf542c50ff9f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 288: An enormous factorial",
+      "tests": [
+        "assert.strictEqual(euler288(), 605857431263982000, 'message: <code>euler288()</code> should return 605857431263982000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler288() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler288();"
+      ],
+      "description": [
+        "For any prime p the number N(p,q) is defined by",
+        "N(p,q) = ∑n=0 to q Tn*pn with Tn generated by the following random number generator:",
+        "",
+        "S0 = 290797",
+        "Sn+1 = Sn2 mod 50515093",
+        "Tn = Sn mod p",
+        "",
+        "",
+        "Let Nfac(p,q) be the factorial of N(p,q).",
+        "Let NF(p,q) be the number of factors p in Nfac(p,q).",
+        "",
+        "",
+        "You are given that NF(3,10000) mod 320=624955285.",
+        "",
+        "",
+        "Find NF(61,107) mod 6110"
+      ]
+    },
+    {
+      "_id": "5900f48d1000cf542c50ffa0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 289: Eulerian Cycles",
+      "tests": [
+        "assert.strictEqual(euler289(), 6567944538, 'message: <code>euler289()</code> should return 6567944538.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler289() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler289();"
+      ],
+      "description": [
+        "Let C(x,y) be a circle passing through the points (x, y), (x, y+1), (x+1, y) and (x+1, y+1).",
+        "",
+        "For positive integers m and n, let E(m,n) be a configuration which consists of the m·n circles:",
+        "{ C(x,y): 0 ≤ x < m, 0 ≤ y < n, x and y are integers }",
+        "",
+        "An Eulerian cycle on E(m,n) is a closed path that passes through each arc exactly once.",
+        "Many such paths are possible on E(m,n), but we are only interested in those which are not self-crossing: ",
+        "A non-crossing path just touches itself at lattice points, but it never crosses itself.",
+        "",
+        "The image below shows E(3,3) and an example of an Eulerian non-crossing path.",
+        "",
+        "Let L(m,n) be the number of Eulerian non-crossing paths on E(m,n).",
+        "For example, L(1,2) = 2, L(2,2) = 37 and L(3,3) = 104290.",
+        "",
+        "Find L(6,10) mod 1010."
+      ]
+    },
+    {
+      "_id": "5900f48f1000cf542c50ffa1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 290: Digital Signature",
+      "tests": [
+        "assert.strictEqual(euler290(), 20444710234716470, 'message: <code>euler290()</code> should return 20444710234716470.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler290() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler290();"
+      ],
+      "description": [
+        "How many integers 0 ≤ n < 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?"
+      ]
+    },
+    {
+      "_id": "5900f48f1000cf542c50ffa2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 291: Panaitopol Primes",
+      "tests": [
+        "assert.strictEqual(euler291(), 4037526, 'message: <code>euler291()</code> should return 4037526.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler291() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler291();"
+      ],
+      "description": [
+        "A prime number p is called a Panaitopol prime if  for some positive integersx and y.",
+        "",
+        "",
+        "Find how many Panaitopol primes are less than 5×1015."
+      ]
+    },
+    {
+      "_id": "5900f4911000cf542c50ffa3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 292: Pythagorean Polygons",
+      "tests": [
+        "assert.strictEqual(euler292(), 3600060866, 'message: <code>euler292()</code> should return 3600060866.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler292() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler292();"
+      ],
+      "description": [
+        "We shall define a pythagorean polygon  to be a convex polygon with the following properties:there are at least three vertices,",
+        "no three vertices are aligned,",
+        "each vertex has integer coordinates,",
+        "each edge has integer length.For a given integer n, define P(n) as the number of distinct pythagorean polygons for which the perimeter is ≤ n.",
+        "Pythagorean polygons should be considered distinct as long as none is a translation of another.",
+        "",
+        "You are given that P(4) = 1, P(30) = 3655 and P(60) = 891045.",
+        "Find P(120)."
+      ]
+    },
+    {
+      "_id": "5900f4931000cf542c50ffa4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 293: Pseudo-Fortunate Numbers",
+      "tests": [
+        "assert.strictEqual(euler293(), 2209, 'message: <code>euler293()</code> should return 2209.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler293() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler293();"
+      ],
+      "description": [
+        "An even positive integer N will be called admissible, if it is a power of 2 or its distinct prime factors are consecutive primes.",
+        "The first twelve admissible numbers are 2,4,6,8,12,16,18,24,30,32,36,48.",
+        "",
+        "",
+        "If N is admissible, the smallest integer M > 1 such that N+M is prime, will be called the pseudo-Fortunate number for N.",
+        "",
+        "",
+        "For example, N=630 is admissible since it is even and its distinct prime factors are the consecutive primes 2,3,5 and 7. ",
+        "The next prime number after 631 is 641; hence, the pseudo-Fortunate number for 630 is M=11.",
+        "It can also be seen that the pseudo-Fortunate number for 16 is 3.",
+        "",
+        "",
+        "Find the sum of all distinct pseudo-Fortunate numbers for admissible numbers N less than 109."
+      ]
+    },
+    {
+      "_id": "5900f4931000cf542c50ffa5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 294: Sum of digits - experience #23",
+      "tests": [
+        "assert.strictEqual(euler294(), 789184709, 'message: <code>euler294()</code> should return 789184709.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler294() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler294();"
+      ],
+      "description": [
+        "For a positive integer k, define d(k) as the sum of the digits of k in its usual decimal representation.",
+        "Thus d(42) = 4+2 = 6.",
+        "",
+        "",
+        "For a positive integer n, define S(n) as the number of positive integers k < 10n with the following properties :",
+        "k is divisible by 23 and",
+        "d(k) = 23.",
+        "",
+        "You are given that S(9) = 263626 and S(42) = 6377168878570056.",
+        "",
+        "",
+        "Find S(1112) and give your answer mod 109."
+      ]
+    },
+    {
+      "_id": "5900f4931000cf542c50ffa6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 295: Lenticular holes",
+      "tests": [
+        "assert.strictEqual(euler295(), 4884650818, 'message: <code>euler295()</code> should return 4884650818.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler295() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler295();"
+      ],
+      "description": [
+        "We call the convex area enclosed by two circles a lenticular hole if:",
+        "The centres of both circles are on lattice points.",
+        "The two circles intersect at two distinct lattice points.",
+        "The interior of the convex area enclosed by both circles does not contain any lattice points.",
+        "",
+        "Consider the circles:",
+        "C0: x2+y2=25",
+        "C1: (x+4)2+(y-4)2=1",
+        "C2: (x-12)2+(y-4)2=65",
+        "",
+        "",
+        "The circles C0, C1 and C2 are drawn in the picture below.",
+        "",
+        "",
+        "C0 and C1 form a lenticular hole, as well as C0 and C2.",
+        "",
+        "We call an ordered pair of positive real numbers (r1, r2) a lenticular pair if there exist two circles with radii r1 and r2 that form a lenticular hole.",
+        "We can verify that (1, 5) and (5, √65) are the lenticular pairs of the example above.",
+        "",
+        "Let L(N) be the number of distinct lenticular pairs (r1, r2) for which 0 < r1 ≤ r2 ≤ N.",
+        "We can verify that L(10) = 30 and L(100) = 3442.",
+        "",
+        "Find L(100 000)."
+      ]
+    },
+    {
+      "_id": "5900f4941000cf542c50ffa7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 296: Angular Bisector and Tangent",
+      "tests": [
+        "assert.strictEqual(euler296(), 1137208419, 'message: <code>euler296()</code> should return 1137208419.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler296() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler296();"
+      ],
+      "description": [
+        "Given is an integer sided triangle ABC with BC ≤ AC ≤ AB.k is the angular bisector of angle ACB.m is the tangent at C to the circumscribed circle of ABC.n is a line parallel to m through B.",
+        "The intersection of n and k is called E.",
+        "",
+        "",
+        "",
+        "How many triangles ABC with a perimeter not exceeding 100 000 exist such that BE has integral length?"
+      ]
+    },
+    {
+      "_id": "5900f4951000cf542c50ffa8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 297: Zeckendorf Representation",
+      "tests": [
+        "assert.strictEqual(euler297(), 2252639041804718000, 'message: <code>euler297()</code> should return 2252639041804718000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler297() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler297();"
+      ],
+      "description": [
+        "Each new term in the Fibonacci sequence is generated by adding the previous two terms.",
+        "Starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89.",
+        "",
+        "Every positive integer can be uniquely written as a sum of nonconsecutive terms of the Fibonacci sequence. For example, 100 = 3 + 8 + 89.",
+        "Such a sum is called the Zeckendorf representation of the number.",
+        "",
+        "For any integer n>0, let z(n) be the number of terms in the Zeckendorf representation of n.",
+        "Thus, z(5) = 1, z(14) = 2, z(100) = 3 etc.",
+        "Also, for 0<n<106, ∑ z(n) = 7894453.",
+        "",
+        "Find ∑ z(n) for 0<n<1017."
+      ]
+    },
+    {
+      "_id": "5900f4971000cf542c50ffa9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 298: Selective Amnesia",
+      "tests": [
+        "assert.strictEqual(euler298(), 1.76882294, 'message: <code>euler298()</code> should return 1.76882294.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler298() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler298();"
+      ],
+      "description": [
+        "Larry and Robin play a memory game involving of a sequence of random numbers between 1 and 10, inclusive, that are called out one at a time. Each player can remember up to 5 previous numbers. When the called number is in a player's memory, that player is awarded a point. If it's not, the player adds the called number to his memory, removing another number if his memory is full.",
+        "",
+        "Both players start with empty memories. Both players always add new missed numbers to their memory but use a different strategy in deciding which number to remove:",
+        "Larry's strategy is to remove the number that hasn't been called in the longest time.",
+        "Robin's strategy is to remove the number that's been in the memory the longest time.",
+        "",
+        "Example game:Turn",
+        "  Callednumber",
+        "  Larry'smemory",
+        "  Larry'sscore",
+        "  Robin'smemory",
+        "  Robin'sscore",
+        "1",
+        "  1",
+        "  1",
+        "  0",
+        "  1",
+        "  0",
+        "2",
+        "  2",
+        "  1,2",
+        "  0",
+        "  1,2",
+        "  0",
+        "3",
+        "  4",
+        "  1,2,4",
+        "  0",
+        "  1,2,4",
+        "  0",
+        "4",
+        "  6",
+        "  1,2,4,6",
+        "  0",
+        "  1,2,4,6",
+        "  0",
+        "5",
+        "  1",
+        "  1,2,4,6",
+        "  1",
+        "  1,2,4,6",
+        "  1",
+        "6",
+        "  8",
+        "  1,2,4,6,8",
+        "  1",
+        "  1,2,4,6,8",
+        "  1",
+        "7",
+        "  10",
+        "  1,4,6,8,10",
+        "  1",
+        "  2,4,6,8,10",
+        "  1",
+        "8",
+        "  2",
+        "  1,2,6,8,10",
+        "  1",
+        "  2,4,6,8,10",
+        "  2",
+        "9",
+        "  4",
+        "  1,2,4,8,10",
+        "  1",
+        "  2,4,6,8,10",
+        "  3",
+        "10",
+        "  1",
+        "  1,2,4,8,10",
+        "  2",
+        "  1,4,6,8,10",
+        "  3",
+        "",
+        "",
+        "Denoting Larry's score by L and Robin's score by R, what is the expected value of |L-R| after 50 turns? Give your answer rounded to eight decimal places using the format x.xxxxxxxx ."
+      ]
+    },
+    {
+      "_id": "5900f4971000cf542c50ffaa",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 299: Three similar triangles",
+      "tests": [
+        "assert.strictEqual(euler299(), 549936643, 'message: <code>euler299()</code> should return 549936643.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler299() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler299();"
+      ],
+      "description": [
+        "Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d), ",
+        "with 0 < a < b and 0 < c < d.",
+        "Point P, also with integer coordinates, is chosen on the line AC so that the three triangles ABP, CDP and BDP are all similar.",
+        "",
+        "It is easy to prove that the three triangles can be similar, only if a=c.",
+        "",
+        "So, given that a=c, we are looking for triplets (a,b,d) such that at least one point P (with integer coordinates) exists on AC, making the three triangles ABP, CDP and BDP all similar.",
+        "",
+        "For example, if (a,b,d)=(2,3,4), it can be easily verified that point P(1,1) satisfies the above condition. ",
+        "Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point P(1,1) is common for both.",
+        "",
+        "If b+d < 100, there are 92 distinct triplets (a,b,d) such that point P exists.",
+        "If b+d < 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists.",
+        "If b+d < 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?"
+      ]
+    },
+    {
+      "_id": "5900f49a1000cf542c50ffac",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 300: Protein folding",
+      "tests": [
+        "assert.strictEqual(euler300(), 8.0540771484375, 'message: <code>euler300()</code> should return 8.0540771484375.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler300() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler300();"
+      ],
+      "description": [
+        "In a very simplified form, we can consider proteins as strings consisting of hydrophobic (H) and polar (P) elements, e.g. HHPPHHHPHHPH. ",
+        "For this problem, the orientation of a protein is important; e.g. HPP is considered distinct from PPH. Thus, there are 2n distinct proteins consisting of n elements.",
+        "",
+        "When one encounters these strings in nature, they are always folded in such a way that the number of H-H contact points is as large as possible, since this is energetically advantageous.",
+        "As a result, the H-elements tend to accumulate in the inner part, with the P-elements on the outside.",
+        "Natural proteins are folded in three dimensions of course, but we will only consider protein folding in two dimensions.",
+        "",
+        "The figure below shows two possible ways that our example protein could be folded (H-H contact points are shown with red dots).",
+        "",
+        "",
+        "",
+        "The folding on the left has only six H-H contact points, thus it would never occur naturally.",
+        "On the other hand, the folding on the right has nine H-H contact points, which is optimal for this string.",
+        "",
+        "Assuming that H and P elements are equally likely to occur in any position along the string, the average number of H-H contact points in an optimal folding of a random protein string of length 8 turns out to be 850 / 28=3.3203125.",
+        "",
+        "What is the average number of H-H contact points in an optimal folding of a random protein string of length 15?",
+        "Give your answer using as many decimal places as necessary for an exact result."
+      ]
+    },
+    {
+      "_id": "5900f4991000cf542c50ffab",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 301: Nim",
+      "tests": [
+        "assert.strictEqual(euler301(), 2178309, 'message: <code>euler301()</code> should return 2178309.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler301() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler301();"
+      ],
+      "description": [
+        "Nim is a game played with heaps of stones, where two players take it in turn to remove any number of stones from any heap until no stones remain.",
+        "",
+        "We'll consider the three-heap normal-play version of Nim, which works as follows:",
+        "- At the start of the game there are three heaps of stones.",
+        "- On his turn the player removes any positive number of stones from any single heap.",
+        "- The first player unable to move (because no stones remain) loses.",
+        "",
+        " If (n1,n2,n3) indicates a Nim position consisting of heaps of size n1, n2 and n3 then there is a simple function X(n1,n2,n3) — that you may look up or attempt to deduce for yourself — that returns:",
+        "zero if, with perfect strategy, the player about to move will eventually lose; or",
+        "non-zero if, with perfect strategy, the player about to move will eventually win.For example X(1,2,3) = 0 because, no matter what the current player does, his opponent can respond with a move that leaves two heaps of equal size, at which point every move by the current player can be mirrored by his opponent until no stones remain; so the current player loses. To illustrate:",
+        "- current player moves to (1,2,1)",
+        "- opponent moves to (1,0,1)",
+        "- current player moves to (0,0,1)",
+        "- opponent moves to (0,0,0), and so wins.",
+        "",
+        "For how many positive integers n ≤ 230 does X(n,2n,3n) = 0 ?"
+      ]
+    },
+    {
+      "_id": "5900f49b1000cf542c50ffad",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 302: Strong Achilles Numbers",
+      "tests": [
+        "assert.strictEqual(euler302(), 1170060, 'message: <code>euler302()</code> should return 1170060.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler302() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler302();"
+      ],
+      "description": [
+        "A positive integer n is powerful if p2 is a divisor of n for every prime factor p in n.",
+        "",
+        "",
+        "A positive integer n is a perfect power if n can be expressed as a power of another positive integer.",
+        "",
+        "",
+        "A positive integer n is an Achilles number if n is powerful but not a perfect power. For example, 864 and 1800 are Achilles numbers: 864 = 25·33 and 1800 = 23·32·52.",
+        "",
+        "",
+        "We shall call a positive integer S a Strong Achilles number if both S and φ(S) are Achilles numbers.1",
+        "For example, 864 is a Strong Achilles number: φ(864) = 288 = 25·32. However, 1800 isn't a Strong Achilles number because: φ(1800) = 480 = 25·31·51.",
+        "",
+        "There are 7 Strong Achilles numbers below 104 and 656 below 108.",
+        "",
+        "",
+        "How many Strong Achilles numbers are there below 1018?",
+        "",
+        "",
+        "1 φ denotes Euler's totient function."
+      ]
+    },
+    {
+      "_id": "5900f49b1000cf542c50ffae",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 303: Multiples with small digits",
+      "tests": [
+        "assert.strictEqual(euler303(), 1111981904675169, 'message: <code>euler303()</code> should return 1111981904675169.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler303() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler303();"
+      ],
+      "description": [
+        "For a positive integer n, define f(n) as the least positive multiple of n that, written in base 10, uses only digits ≤ 2.",
+        "Thus f(2)=2, f(3)=12, f(7)=21, f(42)=210, f(89)=1121222.",
+        "Also, .",
+        "",
+        "Find ."
+      ]
+    },
+    {
+      "_id": "5900f49d1000cf542c50ffaf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 304: Primonacci",
+      "tests": [
+        "assert.strictEqual(euler304(), 283988410192, 'message: <code>euler304()</code> should return 283988410192.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler304() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler304();"
+      ],
+      "description": [
+        "For any positive integer n the function next_prime(n) returns the smallest prime p  such that p>n.",
+        "",
+        "",
+        "The sequence a(n) is defined by:",
+        "a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.",
+        "",
+        "",
+        "The fibonacci sequence f(n) is defined by:",
+        "f(0)=0, f(1)=1 and f(n)=f(n-1)+f(n-2) for n>1.",
+        "",
+        "",
+        "The sequence b(n) is defined as f(a(n)).",
+        "",
+        "",
+        "Find ∑b(n) for 1≤n≤100 000. ",
+        "Give your answer mod 1234567891011."
+      ]
+    },
+    {
+      "_id": "5900f49d1000cf542c50ffb0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 305: Reflexive Position",
+      "tests": [
+        "assert.strictEqual(euler305(), 18174995535140, 'message: <code>euler305()</code> should return 18174995535140.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler305() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler305();"
+      ],
+      "description": [
+        "Let's call S the (infinite) string that is made by concatenating the consecutive positive integers (starting from 1)  written down in base 10. ",
+        "Thus, S = 1234567891011121314151617181920212223242...",
+        "",
+        "",
+        "It's easy to see that any number will show up an infinite number of times in S.",
+        "",
+        "",
+        "Let's call f(n) the starting position of the nth occurrence of n in S. ",
+        "For example, f(1)=1, f(5)=81, f(12)=271 and f(7780)=111111365.",
+        "",
+        "",
+        "Find ∑f(3k) for 1≤k≤13."
+      ]
+    },
+    {
+      "_id": "5900f49f1000cf542c50ffb1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 306: Paper-strip Game",
+      "tests": [
+        "assert.strictEqual(euler306(), 852938, 'message: <code>euler306()</code> should return 852938.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler306() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler306();"
+      ],
+      "description": [
+        "The following game is a classic example of Combinatorial Game Theory:",
+        "",
+        "Two players start with a strip of n white squares and they take alternate turns.",
+        "On each turn, a player picks two contiguous white squares and paints them black.",
+        "The first player who cannot make a move loses.",
+        "",
+        "If n = 1, there are no valid moves, so the first player loses automatically.",
+        "If n = 2, there is only one valid move, after which the second player loses.",
+        "If n = 3, there are two valid moves, but both leave a situation where the second player loses.",
+        "If n = 4, there are three valid moves for the first player; she can win the game by painting the two middle squares.",
+        "If n = 5, there are four valid moves for the first player (shown below in red); but no matter what she does, the second player (blue) wins.",
+        "",
+        "",
+        "",
+        "So, for 1 ≤ n ≤ 5, there are 3 values of n for which the first player can force a win.",
+        "Similarly, for 1 ≤ n ≤ 50, there are 40 values of n for which the first player can force a win.",
+        "",
+        "For 1 ≤ n ≤ 1 000 000, how many values of n are there for which the first player can force a win?"
+      ]
+    },
+    {
+      "_id": "5900f4a01000cf542c50ffb2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 307: Chip Defects",
+      "tests": [
+        "assert.strictEqual(euler307(), 0.7311720251, 'message: <code>euler307()</code> should return 0.7311720251.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler307() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler307();"
+      ],
+      "description": [
+        "k defects are randomly distributed amongst n integrated-circuit chips produced by a factory (any number of defects may be found on a chip and each defect is independent of the other defects).",
+        "",
+        "",
+        "Let p(k,n) represent the probability that there is a chip with at least 3 defects.",
+        "For instance p(3,7) ≈ 0.0204081633.",
+        "",
+        "",
+        "Find p(20 000, 1 000 000) and give your answer rounded to 10 decimal places in the form 0.abcdefghij"
+      ]
+    },
+    {
+      "_id": "5900f4a11000cf542c50ffb3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 308: An amazing Prime-generating Automaton",
+      "tests": [
+        "assert.strictEqual(euler308(), 1539669807660924, 'message: <code>euler308()</code> should return 1539669807660924.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler308() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler308();"
+      ],
+      "description": [
+        "A program written in the programming language Fractran consists of a list of fractions.",
+        "",
+        "The internal state of the Fractran Virtual Machine is a positive integer, which is initially set to a seed value. Each iteration of a Fractran program multiplies the state integer by the first fraction in the list which will leave it an integer.",
+        "",
+        "For example, one of the Fractran programs that John Horton Conway wrote for prime-generation consists of the following 14 fractions:1791",
+        ",",
+        "7885",
+        ",",
+        "1951",
+        ",",
+        "2338",
+        ",",
+        "2933",
+        ",",
+        "7729",
+        ",",
+        "9523",
+        ",",
+        "7719",
+        ",",
+        "117",
+        ",",
+        "1113",
+        ",",
+        "1311",
+        ",",
+        "152",
+        ",",
+        "17",
+        ",",
+        "551",
+        ".",
+        "Starting with the seed integer 2, successive iterations of the program produce the sequence:",
+        "15, 825, 725, 1925, 2275, 425, ..., 68, 4, 30, ..., 136, 8, 60, ..., 544, 32, 240, ...",
+        "",
+        "The powers of 2 that appear in this sequence are 22, 23, 25, ...",
+        "It can be shown that all the powers of 2 in this sequence have prime exponents and that all the primes appear as exponents of powers of 2, in proper order!",
+        "",
+        "If someone uses the above Fractran program to solve Project Euler Problem 7 (find the 10001st prime), how many iterations would be needed until the program produces 210001st prime ?"
+      ]
+    },
+    {
+      "_id": "5900f4a11000cf542c50ffb4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 309: Integer Ladders",
+      "tests": [
+        "assert.strictEqual(euler309(), 210139, 'message: <code>euler309()</code> should return 210139.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler309() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler309();"
+      ],
+      "description": [
+        "In the classic \"Crossing Ladders\" problem, we are given the lengths x and y of two ladders resting on the opposite walls of a narrow, level street. We are also given the height h above the street where the two ladders cross and we are asked to find the width of the street (w).",
+        "",
+        "",
+        "",
+        "Here, we are only concerned with instances where all four variables are positive integers.",
+        "For example, if x = 70, y = 119 and h = 30, we can calculate that w = 56.",
+        "",
+        "In fact, for integer values x, y, h and 0 < x < y < 200, there are only five triplets (x,y,h) producing integer solutions for w:",
+        "(70, 119, 30), (74, 182, 21), (87, 105, 35), (100, 116, 35) and (119, 175, 40).",
+        "",
+        "For integer values x, y, h and 0 < x < y < 1 000 000, how many triplets (x,y,h) produce integer solutions for w?"
+      ]
+    },
+    {
+      "_id": "5900f4a21000cf542c50ffb5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 310: Nim Square",
+      "tests": [
+        "assert.strictEqual(euler310(), 2586528661783, 'message: <code>euler310()</code> should return 2586528661783.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler310() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler310();"
+      ],
+      "description": [
+        "Alice and Bob play the game Nim Square.",
+        "Nim Square is just like ordinary three-heap normal play Nim, but the players may only remove a square number of stones from a heap.",
+        "The number of stones in the three heaps is represented by the ordered triple (a,b,c).",
+        "If 0≤a≤b≤c≤29 then the number of losing positions for the next player is 1160.",
+        "",
+        "",
+        "Find the number of losing positions for the next player if 0≤a≤b≤c≤100 000."
+      ]
+    },
+    {
+      "_id": "5900f4a31000cf542c50ffb6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 311: Biclinic Integral Quadrilaterals",
+      "tests": [
+        "assert.strictEqual(euler311(), 2466018557, 'message: <code>euler311()</code> should return 2466018557.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler311() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler311();"
+      ],
+      "description": [
+        "ABCD is a convex, integer sided quadrilateral with 1 ≤ AB < BC < CD < AD.",
+        "BD has integer length. O is the midpoint of BD. AO has integer length.",
+        "We'll call ABCD a biclinic integral quadrilateral if AO = CO ≤ BO = DO.",
+        "",
+        "For example, the following quadrilateral is a biclinic integral quadrilateral:",
+        "AB = 19, BC = 29, CD = 37, AD = 43, BD = 48 and AO = CO = 23.",
+        "",
+        "",
+        "",
+        "",
+        "Let B(N) be the number of distinct biclinic integral quadrilaterals ABCD that satisfy AB2+BC2+CD2+AD2 ≤ N.",
+        "We can verify that B(10 000) = 49 and B(1 000 000) = 38239.",
+        "",
+        "",
+        "Find B(10 000 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f4a51000cf542c50ffb7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 312: Cyclic paths on Sierpiński graphs",
+      "tests": [
+        "assert.strictEqual(euler312(), 324681947, 'message: <code>euler312()</code> should return 324681947.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler312() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler312();"
+      ],
+      "description": [
+        "- A Sierpiński graph of order-1 (S1) is an equilateral triangle.",
+        "- Sn+1 is obtained from Sn by positioning three copies of Sn so that every pair of copies has one common corner.",
+        "",
+        "",
+        "",
+        "",
+        "Let C(n) be the number of cycles that pass exactly once through all the vertices of Sn.",
+        "For example, C(3) = 8 because eight such cycles can be drawn on S3, as shown below:",
+        "",
+        "",
+        "",
+        "",
+        "It can also be verified that :",
+        "C(1) = C(2) = 1",
+        "C(5) = 71328803586048",
+        "C(10 000) mod 108 = 37652224",
+        "C(10 000) mod 138 = 617720485",
+        "",
+        "Find C(C(C(10 000))) mod 138."
+      ]
+    },
+    {
+      "_id": "5900f4a61000cf542c50ffb8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 313: Sliding game",
+      "tests": [
+        "assert.strictEqual(euler313(), 2057774861813004, 'message: <code>euler313()</code> should return 2057774861813004.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler313() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler313();"
+      ],
+      "description": [
+        "In a sliding game a counter may slide horizontally or vertically into an empty space. The objective of the game is to move the red counter from the top left corner of a grid to the bottom right corner; the space always starts in the bottom right corner. For example, the following sequence of pictures show how the game can be completed in five moves on a 2 by 2 grid.",
+        "",
+        "",
+        "",
+        "Let S(m,n) represent the minimum number of moves to complete the game on an m by n grid. For example, it can be verified that S(5,4) = 25.",
+        "",
+        "",
+        "",
+        "There are exactly 5482 grids for which S(m,n) = p2, where p < 100 is prime.",
+        "",
+        "How many grids does S(m,n) = p2, where p < 106 is prime?"
+      ]
+    },
+    {
+      "_id": "5900f4a71000cf542c50ffb9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 314: The Mouse on the Moon",
+      "tests": [
+        "assert.strictEqual(euler314(), 132.52756426, 'message: <code>euler314()</code> should return 132.52756426.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler314() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler314();"
+      ],
+      "description": [
+        "The moon has been opened up, and land can be obtained for free, but there is a catch. You have to build a wall around the land that you stake out, and building a wall on the moon is expensive. Every country has been allotted a 500 m by 500 m square area, but they will possess only that area which they wall in. 251001 posts have been placed in a rectangular grid with 1 meter spacing. The wall must be a closed series of straight lines, each line running from post to post.",
+        "",
+        "",
+        "The bigger countries of course have built a 2000 m wall enclosing the entire 250 000 m2 area. The Duchy of Grand Fenwick, has a tighter budget, and has asked you (their Royal Programmer) to compute what shape would get best maximum enclosed-area/wall-length ratio.",
+        "",
+        "",
+        "You have done some preliminary calculations on a sheet of paper.",
+        "For a 2000 meter wall enclosing the 250 000 m2 area the",
+        "enclosed-area/wall-length ratio is 125.",
+        "Although not allowed , but to get an idea if this is anything better:  if you place a circle inside the square area touching the four sides the area will be equal to π*2502 m2 and the perimeter will be π*500 m, so the enclosed-area/wall-length ratio will also be 125.",
+        "",
+        "",
+        "However, if you cut off from the square four triangles with sides 75 m, 75 m and 75√2 m the total area becomes 238750 m2 and the perimeter becomes 1400+300√2 m. So this gives an enclosed-area/wall-length ratio of 130.87, which is significantly better.",
+        "",
+        "",
+        "",
+        "Find the maximum enclosed-area/wall-length ratio.",
+        "Give your answer rounded to 8 places behind the decimal point in the form abc.defghijk."
+      ]
+    },
+    {
+      "_id": "5900f4a71000cf542c50ffba",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 315: Digital root clocks",
+      "tests": [
+        "assert.strictEqual(euler315(), 13625242, 'message: <code>euler315()</code> should return 13625242.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler315() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler315();"
+      ],
+      "description": [
+        "Sam and Max are asked to transform two digital clocks into two \"digital root\" clocks.",
+        "A digital root clock is a digital clock that calculates digital roots step by step.",
+        "",
+        "When a clock is fed a number, it will show it and then it will start the calculation, showing all the intermediate values until it gets to the result.",
+        "For example, if the clock is fed the number 137, it will show: \"137\" → \"11\" → \"2\" and then it will go black, waiting for the next number.",
+        "",
+        "Every digital number consists of some light segments: three horizontal (top, middle, bottom) and four vertical (top-left, top-right, bottom-left, bottom-right).",
+        "Number \"1\" is made of vertical top-right and bottom-right, number \"4\" is made by middle horizontal and vertical top-left, top-right and bottom-right. Number \"8\" lights them all.",
+        "",
+        "The clocks consume energy only when segments are turned on/off.",
+        "To turn on a \"2\" will cost 5 transitions, while a \"7\" will cost only 4 transitions.",
+        "",
+        "Sam and Max built two different clocks.",
+        "",
+        "Sam's clock is fed e.g. number 137: the clock shows \"137\", then the panel is turned off, then the next number (\"11\") is turned on, then the panel is turned off again and finally the last number (\"2\") is turned on and, after some time, off.",
+        "For the example, with number 137, Sam's clock requires:\"137\"",
+        ":",
+        "(2 + 5 + 4) × 2 = 22 transitions (\"137\" on/off).",
+        "\"11\"",
+        ":",
+        "(2 + 2) × 2 = 8 transitions (\"11\" on/off).",
+        "\"2\"",
+        ":",
+        "(5) × 2 = 10 transitions (\"2\" on/off).",
+        "",
+        "For a grand total of 40 transitions.",
+        "",
+        "Max's clock works differently. Instead of turning off the whole panel, it is smart enough to turn off only those segments that won't be needed for the next number.",
+        "For number 137, Max's clock requires:\"137\"",
+        ":",
+        "2 + 5 + 4 = 11 transitions (\"137\" on)",
+        "7 transitions (to turn off the segments that are not needed for number \"11\").",
+        "\"11\"",
+        ":",
+        "0 transitions (number \"11\" is already turned on correctly)",
+        "3 transitions (to turn off the first \"1\" and the bottom part of the second \"1\"; ",
+        "the top part is common with number \"2\").",
+        "\"2\"",
+        ":",
+        "4 transitions (to turn on the remaining segments in order to get a \"2\")",
+        "5 transitions (to turn off number \"2\").",
+        "",
+        "For a grand total of 30 transitions.",
+        "",
+        "Of course, Max's clock consumes less power than Sam's one.",
+        "The two clocks are fed all the prime numbers between A = 107 and B = 2×107. ",
+        "Find the difference between the total number of transitions needed by Sam's clock and that needed by Max's one."
+      ]
+    },
+    {
+      "_id": "5900f4a81000cf542c50ffbb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 316: Numbers in decimal expansions",
+      "tests": [
+        "assert.strictEqual(euler316(), 542934735751917760, 'message: <code>euler316()</code> should return 542934735751917760.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler316() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler316();"
+      ],
+      "description": [
+        "Let p = p1 p2 p3 ... be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.",
+        "It can be seen that p corresponds to the real number 0.p1 p2 p3 .... ",
+        "It can also be seen that choosing a random real number from the interval [0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.",
+        "",
+        "For any positive integer n with d decimal digits, let k be the smallest index such that pk, pk+1, ...pk+d-1 are the decimal digits of n, in the same order.",
+        "Also, let g(n) be the expected value of k; it can be proven that g(n) is always finite and, interestingly, always an integer number.",
+        "",
+        "For example, if n = 535, then",
+        "for p = 31415926535897...., we get k = 9",
+        "for p = 355287143650049560000490848764084685354..., we get k = 36",
+        "etc and we find that g(535) = 1008.",
+        "",
+        "Given that , find ",
+        "",
+        "Note:  represents the floor function."
+      ]
+    },
+    {
+      "_id": "5900f4aa1000cf542c50ffbc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 317: Firecracker",
+      "tests": [
+        "assert.strictEqual(euler317(), 1856532.8455, 'message: <code>euler317()</code> should return 1856532.8455.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler317() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler317();"
+      ],
+      "description": [
+        "A firecracker explodes at a height of 100 m above level ground. It breaks into a large number of very small fragments, which move in every direction; all of them have the same initial velocity of 20 m/s.",
+        "",
+        "",
+        "We assume that the fragments move without air resistance, in a uniform gravitational field with g=9.81 m/s2.",
+        "",
+        "",
+        "Find the volume (in m3) of the region through which the fragments move before reaching the ground. ",
+        "Give your answer rounded to four decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4ab1000cf542c50ffbd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 318: 2011 nines",
+      "tests": [
+        "assert.strictEqual(euler318(), 709313889, 'message: <code>euler318()</code> should return 709313889.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler318() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler318();"
+      ],
+      "description": [
+        "Consider the real number √2+√3.",
+        "When we calculate the even powers of √2+√3",
+        "we get:",
+        "(√2+√3)2 = 9.898979485566356...",
+        "(√2+√3)4 = 97.98979485566356...",
+        "(√2+√3)6 = 969.998969071069263...",
+        "(√2+√3)8 = 9601.99989585502907...",
+        "(√2+√3)10 = 95049.999989479221...",
+        "(√2+√3)12 = 940897.9999989371855...",
+        "(√2+√3)14 = 9313929.99999989263...",
+        "(√2+√3)16 = 92198401.99999998915...",
+        "",
+        "It looks like that the number of consecutive nines at the beginning of the fractional part of these powers is non-decreasing.",
+        "In fact it can be proven that the fractional part of (√2+√3)2n approaches 1 for large n.",
+        "",
+        "",
+        "Consider all real numbers of the form √p+√q with p and q positive integers and p<q, such that the fractional part ",
+        "of (√p+√q)2n approaches 1 for large n.",
+        "",
+        "",
+        "Let C(p,q,n) be the number of consecutive nines at the beginning of the fractional part of  (√p+√q)2n.",
+        "",
+        "",
+        "Let N(p,q) be the minimal value of n such that C(p,q,n) ≥ 2011.",
+        "",
+        "",
+        "Find ∑N(p,q) for p+q ≤ 2011."
+      ]
+    },
+    {
+      "_id": "5900f4ab1000cf542c50ffbe",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 319: Bounded Sequences",
+      "tests": [
+        "assert.strictEqual(euler319(), 268457129, 'message: <code>euler319()</code> should return 268457129.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler319() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler319();"
+      ],
+      "description": [
+        "Let x1, x2,..., xn be a sequence of length n such that:",
+        "x1 = 2",
+        "for all 1 < i ≤ n : xi-1 < xi",
+        "for all i and j with 1 ≤ i, j ≤ n : (xi) j < (xj + 1)i",
+        "",
+        "There are only five such sequences of length 2, namely:",
+        "{2,4}, {2,5}, {2,6}, {2,7} and {2,8}.",
+        "There are 293 such sequences of length 5; three examples are given below:",
+        "{2,5,11,25,55}, {2,6,14,36,88}, {2,8,22,64,181}.",
+        "",
+        "",
+        "Let t(n) denote the number of such sequences of length n.",
+        "You are given that t(10) = 86195 and t(20) = 5227991891.",
+        "",
+        "",
+        "Find t(1010) and give your answer modulo 109."
+      ]
+    },
+    {
+      "_id": "5900f4ae1000cf542c50ffbf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 320: Factorials divisible by a huge integer",
+      "tests": [
+        "assert.strictEqual(euler320(), 278157919195482660, 'message: <code>euler320()</code> should return 278157919195482660.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler320() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler320();"
+      ],
+      "description": [
+        "Let N(i) be the smallest integer n such that n! is divisible by (i!)1234567890",
+        "",
+        "Let S(u)=∑N(i) for 10 ≤ i ≤ u.",
+        "",
+        "",
+        "S(1000)=614538266565663.",
+        "",
+        "",
+        "Find S(1 000 000) mod 1018."
+      ]
+    },
+    {
+      "_id": "5900f4ae1000cf542c50ffc0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 321: Swapping Counters",
+      "tests": [
+        "assert.strictEqual(euler321(), 2470433131948040, 'message: <code>euler321()</code> should return 2470433131948040.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler321() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler321();"
+      ],
+      "description": [
+        "A horizontal row comprising of 2n + 1 squares has n red counters placed at one end and n blue counters at the other end, being separated by a single empty square in the centre. For example, when n = 3.",
+        "",
+        "",
+        "",
+        "A counter can move from one square to the next (slide) or can jump over another counter (hop) as long as the square next to that counter is unoccupied.",
+        "",
+        "",
+        "",
+        "Let M(n) represent the minimum number of moves/actions to completely reverse the positions of the coloured counters; that is, move all the red counters to the right and all the blue counters to the left.",
+        "It can be verified M(3) = 15, which also happens to be a triangle number.",
+        "",
+        "If we create a sequence based on the values of n for which M(n) is a triangle number then the first five terms would be:",
+        "1, 3, 10, 22, and 63, and their sum would be 99.",
+        "",
+        "Find the sum of the first forty terms of this sequence."
+      ]
+    },
+    {
+      "_id": "5900f4af1000cf542c50ffc1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 322: Binomial coefficients divisible by 10",
+      "tests": [
+        "assert.strictEqual(euler322(), 999998760323314000, 'message: <code>euler322()</code> should return 999998760323314000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler322() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler322();"
+      ],
+      "description": [
+        "Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i < m(i, m and n are positive integers).",
+        "You are given that T(109, 107-10) = 989697000.",
+        "",
+        "",
+        "Find T(1018, 1012-10)."
+      ]
+    },
+    {
+      "_id": "5900f4b01000cf542c50ffc2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 323: Bitwise-OR operations on random integers",
+      "tests": [
+        "assert.strictEqual(euler323(), 6.3551758451, 'message: <code>euler323()</code> should return 6.3551758451.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler323() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler323();"
+      ],
+      "description": [
+        "Let y0, y1, y2,... be a sequence of random unsigned 32 bit integers",
+        "(i.e. 0 ≤ yi < 232, every value equally likely).",
+        "For the sequence xi the following recursion is given:x0 = 0 and",
+        "xi = xi-1| yi-1, for i > 0. ( | is the bitwise-OR operator)",
+        "It can be seen that eventually there will be an index N such that xi = 232 -1 (a bit-pattern of all ones) for all i ≥ N.",
+        "",
+        "Find the expected value of N. ",
+        "Give your answer rounded to 10 digits after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4b11000cf542c50ffc3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 324: Building a tower",
+      "tests": [
+        "assert.strictEqual(euler324(), 96972774, 'message: <code>euler324()</code> should return 96972774.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler324() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler324();"
+      ],
+      "description": [
+        "Let f(n) represent the number of ways one can fill a 3×3×n tower with blocks of 2×1×1. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.",
+        "For example (with q = 100000007) :f(2) = 229,f(4) = 117805,f(10) mod q = 96149360,f(103) mod q = 24806056,f(106) mod q = 30808124.",
+        "",
+        "Find f(1010000) mod 100000007."
+      ]
+    },
+    {
+      "_id": "5900f4b11000cf542c50ffc4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 325: Stone Game II",
+      "tests": [
+        "assert.strictEqual(euler325(), 54672965, 'message: <code>euler325()</code> should return 54672965.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler325() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler325();"
+      ],
+      "description": [
+        "A game is played with two piles of stones and two players. At her turn, a player removes a number of stones from the larger pile. The number of stones she removes must be a positive multiple of the number of stones in the smaller pile.",
+        "",
+        "",
+        "",
+        "E.g., let the ordered pair(6,14) describe a configuration with 6 stones in the smaller pile and 14 stones in the larger pile, then the first player can remove 6 or 12 stones from the larger pile.",
+        "",
+        "",
+        "",
+        "The player taking all the stones from a pile wins the game.",
+        "",
+        "",
+        "",
+        "A winning configuration is one where the first player can force a win. For example, (1,5), (2,6) and (3,12) are winning configurations because the first player can immediately remove all stones in the second pile.",
+        "",
+        "",
+        "",
+        "A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (2,3) and (3,4) are losing configurations: any legal move leaves a winning configuration for the second player.",
+        "",
+        "",
+        "",
+        "Define S(N) as the sum of (xi+yi) for all losing configurations (xi,yi), 0 < xi < yi ≤ N. We can verify that S(10) = 211 and S(104) = 230312207313.",
+        "",
+        "",
+        "",
+        "Find S(1016) mod 710."
+      ]
+    },
+    {
+      "_id": "5900f4b21000cf542c50ffc5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 326: Modulo Summations",
+      "tests": [
+        "assert.strictEqual(euler326(), 1966666166408794400, 'message: <code>euler326()</code> should return 1966666166408794400.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler326() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler326();"
+      ],
+      "description": [
+        "Let an be a sequence recursively defined by: . ",
+        "",
+        "",
+        "So the first 10 elements of an are: 1,1,0,3,0,3,5,4,1,9.",
+        "",
+        "Let f(N,M) represent the number of pairs (p,q) such that: ",
+        "",
+        "",
+        "It can be seen that f(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).",
+        "",
+        "",
+        "You are also given that f(104,103)=97158.",
+        "",
+        "Find f(1012,106)."
+      ]
+    },
+    {
+      "_id": "5900f4b31000cf542c50ffc6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 327: Rooms of Doom",
+      "tests": [
+        "assert.strictEqual(euler327(), 34315549139516, 'message: <code>euler327()</code> should return 34315549139516.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler327() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler327();"
+      ],
+      "description": [
+        "A series of three rooms are connected to each other by automatic doors.",
+        "",
+        "",
+        "",
+        "Each door is operated by a security card. Once you enter a room the door automatically closes and that security card cannot be used again. A machine at the start will dispense an unlimited number of cards, but each room (including the starting room) contains scanners and if they detect that you are holding more than three security cards or if they detect an unattended security card on the floor, then all the doors will become permanently locked. However, each room contains a box where you may safely store any number of security cards for use at a later stage.",
+        "",
+        "If you simply tried to travel through the rooms one at a time then as you entered room 3 you would have used all three cards and would be trapped in that room forever!",
+        "",
+        "However, if you make use of the storage boxes, then escape is possible. For example, you could enter room 1 using your first card, place one card in the storage box, and use your third card to exit the room back to the start. Then after collecting three more cards from the dispensing machine you could use one to enter room 1 and collect the card you placed in the box a moment ago. You now have three cards again and will be able to travel through the remaining three doors. This method allows you to travel through all three rooms using six security cards in total.",
+        "",
+        "It is possible to travel through six rooms using a total of 123 security cards while carrying a maximum of 3 cards.",
+        "",
+        "Let C be the maximum number of cards which can be carried at any time.",
+        "Let R be the number of rooms to travel through.",
+        "Let M(C,R) be the minimum number of cards required from the dispensing machine to travel through R rooms carrying up to a maximum of C cards at any time.",
+        "",
+        "For example, M(3,6)=123 and M(4,6)=23.And, ΣM(C,6)=146 for 3 ≤ C ≤ 4.",
+        "",
+        "",
+        "You are given that ΣM(C,10)=10382 for 3 ≤ C ≤ 10.",
+        "",
+        "Find ΣM(C,30) for 3 ≤ C ≤ 40."
+      ]
+    },
+    {
+      "_id": "5900f4b41000cf542c50ffc7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 328: Lowest-cost Search",
+      "tests": [
+        "assert.strictEqual(euler328(), 260511850222, 'message: <code>euler328()</code> should return 260511850222.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler328() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler328();"
+      ],
+      "description": [
+        "We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions. ",
+        "Each number (question) we ask, has a cost equal to the number asked and we get one of three possible answers: \"Your guess is lower than the hidden number\", or",
+        " \"Yes, that's it!\", or",
+        " \"Your guess is higher than the hidden number\".",
+        "Given the value of n, an optimal strategy minimizes the total cost (i.e. the sum of all the questions asked) for the worst possible case. E.g.",
+        "",
+        "If n=3, the best we can do is obviously to ask the number \"2\". The answer will immediately lead us to find the hidden number (at a total cost = 2).",
+        "",
+        "If n=8, we might decide to use a \"binary search\" type of strategy: Our first question would be \"4\" and if the hidden number is higher than 4 we will need one or two additional questions.",
+        "Let our second question be \"6\". If the hidden number is still higher than 6, we will need a third question in order to discriminate between 7 and 8.",
+        "Thus, our third question will be \"7\" and the total cost for this worst-case scenario will be 4+6+7=17.",
+        "",
+        "We can improve considerably the worst-case cost for n=8, by asking \"5\" as our first question.",
+        "If we are told that the hidden number is higher than 5, our second question will be \"7\", then we'll know for certain what the hidden number is (for a total cost of 5+7=12).",
+        "If we are told that the hidden number is lower than 5, our second question will be \"3\" and if the hidden number is lower than 3 our third question will be \"1\", giving a total cost of 5+3+1=9.",
+        "Since 12>9, the worst-case cost for this strategy is 12. That's better than what we achieved previously with the \"binary search\" strategy; it is also better than or equal to any other strategy.",
+        "So, in fact, we have just described an optimal strategy for n=8.",
+        "",
+        "Let C(n) be the worst-case cost achieved by an optimal strategy for n, as described above.",
+        "Thus C(1) = 0, C(2) = 1, C(3) = 2 and C(8) = 12.",
+        "Similarly, C(100) = 400 and C(n) = 17575.",
+        "",
+        "Find C(n)."
+      ]
+    },
+    {
+      "_id": "5900f4b51000cf542c50ffc8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 329: Prime Frog",
+      "tests": [
+        "assert.strictEqual(euler329(), 199740353 / 29386561536000, 'message: <code>euler329()</code> should return 199740353 / 29386561536000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler329() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler329();"
+      ],
+      "description": [
+        "Susan has a prime frog.",
+        "Her frog is jumping around over 500 squares numbered 1 to 500.",
+        "He can only jump one square to the left or to the right, with equal probability, and he cannot jump outside the range [1;500].(if it lands at either end, it automatically jumps to the only available square on the next move.)",
+        "",
+        "",
+        "When he is on a square with a prime number on it, he croaks 'P' (PRIME) with probability 2/3 or 'N' (NOT PRIME) with probability 1/3 just before jumping to the next square.",
+        "When he is on a square with a number on it that is not a prime he croaks 'P' with probability 1/3 or 'N' with probability 2/3 just before jumping to the next square.",
+        "",
+        "",
+        "Given that the frog's starting position is random with the same probability for every square, and given that she listens to his first 15 croaks, what is the probability that she hears the sequence PPPPNNPPPNPPNPN?",
+        "",
+        "Give your answer as a fraction p/q in reduced form."
+      ]
+    },
+    {
+      "_id": "5900f4b71000cf542c50ffc9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 330: Euler's Number",
+      "tests": [
+        "assert.strictEqual(euler330(), 15955822, 'message: <code>euler330()</code> should return 15955822.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler330() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler330();"
+      ],
+      "description": [
+        "An infinite sequence of real numbers a(n) is defined for all integers n as follows:",
+        "",
+        "",
+        "For example,a(0) = ",
+        "    11!",
+        "    +",
+        "    12!",
+        "    +",
+        "    13!",
+        "    + ... = e − 1 ",
+        "a(1) = ",
+        "    e − 11!",
+        "    +",
+        "    12!",
+        "    +",
+        "    13!",
+        "    + ... = 2e − 3 ",
+        "a(2) = ",
+        "    2e − 31!",
+        "    +",
+        "    e − 12!",
+        "    +",
+        "    13!",
+        "    + ... =",
+        "    72",
+        "    e − 6 ",
+        "",
+        "with e = 2.7182818... being Euler's constant.",
+        "",
+        "",
+        "It can be shown that a(n) is of the form ",
+        "    ",
+        "    A(n) e + B(n)n!",
+        "    for integers A(n) and B(n). ",
+        "    ",
+        "For example a(10) = ",
+        "    ",
+        "    328161643 e − 65269448610!",
+        "    .",
+        "",
+        "Find A(109) + B(109) and give your answer mod 77 777 777."
+      ]
+    },
+    {
+      "_id": "5900f4b71000cf542c50ffca",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 331: Cross flips",
+      "tests": [
+        "assert.strictEqual(euler331(), 467178235146843500, 'message: <code>euler331()</code> should return 467178235146843500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler331() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler331();"
+      ],
+      "description": [
+        "N×N disks are placed on a square game board. Each disk has a black side and white side.",
+        "",
+        "At each turn, you may choose a disk and flip all the disks in the same row and the same column as this disk: thus 2×N-1 disks are flipped. The game ends when all disks show their white side. The following example shows a game on a 5×5 board.",
+        "",
+        "",
+        "",
+        "It can be proven that 3 is the minimal number of turns to finish this game.",
+        "",
+        "The bottom left disk on the N×N board has coordinates (0,0);",
+        "the bottom right disk has coordinates (N-1,0) and the top left disk has coordinates (0,N-1). ",
+        "",
+        "Let CN be the following configuration of a board with N×N disks:",
+        "A disk at (x,y) satisfying , shows its black side; otherwise, it shows its white side. C5 is shown above.",
+        "",
+        "Let T(N) be the minimal number of turns to finish a game starting from configuration CN or 0 if configuration CN is unsolvable.",
+        "We have shown that T(5)=3. You are also given that T(10)=29 and T(1 000)=395253.",
+        "",
+        "Find ."
+      ]
+    },
+    {
+      "_id": "5900f4b91000cf542c50ffcb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 332: Spherical triangles",
+      "tests": [
+        "assert.strictEqual(euler332(), 2717.751525, 'message: <code>euler332()</code> should return 2717.751525.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler332() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler332();"
+      ],
+      "description": [
+        "A spherical triangle is a figure formed on the surface of a sphere by three great circular arcs intersecting pairwise in three vertices.",
+        "",
+        "",
+        "",
+        "",
+        "Let C(r) be the sphere with the centre (0,0,0) and radius r.",
+        "Let Z(r) be the set of points on the surface of C(r) with integer coordinates.",
+        "Let T(r) be the set of spherical triangles with vertices in Z(r).",
+        "Degenerate spherical triangles, formed by three points on the same great arc, are not included in T(r).",
+        "Let A(r) be the area of the smallest spherical triangle in T(r).",
+        "",
+        "For example A(14) is 3.294040 rounded to six decimal places.",
+        "",
+        "Find  A(r). Give your answer rounded to six decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4b91000cf542c50ffcc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 333: Special partitions",
+      "tests": [
+        "assert.strictEqual(euler333(), 3053105, 'message: <code>euler333()</code> should return 3053105.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler333() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler333();"
+      ],
+      "description": [
+        "All positive integers can be partitioned in such a way that each and every term of the partition can be expressed as 2ix3j, where i,j ≥ 0.",
+        "",
+        "Let's consider only those such partitions where none of the terms can divide any of the other terms.",
+        "For example, the partition of 17 = 2 + 6 + 9 = (21x30 + 21x31 + 20x32) would not be valid since 2 can divide 6. Neither would the partition 17 = 16 + 1 = (24x30 + 20x30) since 1 can divide 16. The only valid partition of 17 would be 8 + 9 = (23x30 + 20x32).",
+        "",
+        "Many integers have more than one valid partition, the first being 11 having the following two partitions.",
+        "11 = 2 + 9 = (21x30 + 20x32)",
+        "11 = 8 + 3 = (23x30 + 20x31)",
+        "",
+        "Let's define P(n) as the number of valid partitions of n. For example, P(11) = 2.",
+        "",
+        "Let's consider only the prime integers q which would have a single valid partition such as P(17).",
+        "",
+        "The sum of the primes q <100 such that P(q)=1 equals 233.",
+        "",
+        "Find the sum of the primes q <1000000 such that P(q)=1."
+      ]
+    },
+    {
+      "_id": "5900f4ba1000cf542c50ffcd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 334: Spilling the beans",
+      "tests": [
+        "assert.strictEqual(euler334(), 150320021261690850, 'message: <code>euler334()</code> should return 150320021261690850.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler334() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler334();"
+      ],
+      "description": [
+        "In Plato's heaven, there exist an infinite number of bowls in a straight line.",
+        "Each bowl either contains some or none of a finite number of beans.",
+        "A child plays a game, which allows only one kind of move: removing two beans from any bowl, and putting one in each of the two adjacent bowls. The game ends when each bowl contains either one or no beans.",
+        "",
+        "For example, consider two adjacent bowls containing 2 and 3 beans respectively, all other bowls being empty. The following eight moves will finish the game:",
+        "",
+        "",
+        "",
+        "You are given the following sequences:",
+        "      t0 = 123456.",
+        "   ",
+        "",
+        "      ti = ",
+        "   ",
+        "   ",
+        "   ",
+        "   ",
+        "      ",
+        "         ti-12",
+        "      ",
+        "         ,",
+        "      ",
+        "      ",
+        "      ",
+        "         if ti-1 is even",
+        "      ",
+        "      ",
+        "      ",
+        "         ti-12",
+        "      ",
+        "         ",
+        "      ",
+        "         926252, ",
+        "      ",
+        "      ",
+        "         if ti-1 is odd",
+        "      ",
+        "      ",
+        "",
+        "   ",
+        "   ",
+        "      where ⌊x⌋ is the floor function",
+        "   ",
+        "",
+        "   ",
+        "   ",
+        "      and  is the bitwise XOR operator.",
+        "   ",
+        "",
+        "      bi = ( ti mod 211) + 1.",
+        "   ",
+        "The first two terms of the last sequence are b1 = 289 and b2 = 145.",
+        "If we start with b1 and b2 beans in two adjacent bowls, 3419100 moves would be required to finish the game.",
+        "",
+        "Consider now 1500 adjacent bowls containing b1, b2,..., b1500 beans respectively, all other bowls being empty. Find how many moves it takes before the game ends."
+      ]
+    },
+    {
+      "_id": "5900f4bd1000cf542c50ffce",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 335: Gathering the beans",
+      "tests": [
+        "assert.strictEqual(euler335(), 5032316, 'message: <code>euler335()</code> should return 5032316.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler335() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler335();"
+      ],
+      "description": [
+        "Whenever Peter feels bored, he places some bowls, containing one bean each, in a circle. After this, he takes all the beans out of a certain bowl and drops them one by one in the bowls going clockwise. He repeats this, starting from the bowl he dropped the last bean in, until the initial situation appears again. For example with 5 bowls he acts as follows:",
+        "",
+        "",
+        "",
+        "So with 5 bowls it takes Peter 15 moves to return to the initial situation.",
+        "",
+        "Let M(x) represent the number of moves required to return to the initial situation, starting with x bowls. Thus, M(5) = 15. It can also be verified that M(100) = 10920.",
+        "",
+        "Find M(2k+1). Give your answer modulo 79."
+      ]
+    },
+    {
+      "_id": "5900f4bd1000cf542c50ffcf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 336: Maximix Arrangements",
+      "tests": [
+        "assert.strictEqual(euler336(), CAGBIHEFJDK, 'message: <code>euler336()</code> should return CAGBIHEFJDK.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler336() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler336();"
+      ],
+      "description": [
+        "A train is used to transport four carriages in the order: ABCD. However, sometimes when the train arrives to collect the carriages they are not in the correct order. ",
+        "To rearrange the carriages they are all shunted on to a large rotating turntable. After the carriages are uncoupled at a specific point the train moves off the turntable pulling the carriages still attached with it. The remaining carriages are rotated 180 degrees. All of the carriages are then rejoined and this process is repeated as often as necessary in order to obtain the least number of uses of the turntable.",
+        "Some arrangements, such as ADCB, can be solved easily: the carriages are separated between A and D, and after DCB are rotated the correct order has been achieved.",
+        "",
+        "However, Simple Simon, the train driver, is not known for his efficiency, so he always solves the problem by initially getting carriage A in the correct place, then carriage B, and so on.",
+        "",
+        "Using four carriages, the worst possible arrangements for Simon, which we shall call maximix arrangements, are DACB and DBAC; each requiring him five rotations (although, using the most efficient approach, they could be solved using just three rotations). The process he uses for DACB is shown below.",
+        "",
+        "",
+        "",
+        "",
+        "It can be verified that there are 24 maximix arrangements for six carriages, of which the tenth lexicographic maximix arrangement is DFAECB.",
+        "",
+        "Find the 2011th lexicographic maximix arrangement for eleven carriages."
+      ]
+    },
+    {
+      "_id": "5900f4be1000cf542c50ffd0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 337: Totient Stairstep Sequences",
+      "tests": [
+        "assert.strictEqual(euler337(), 85068035, 'message: <code>euler337()</code> should return 85068035.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler337() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler337();"
+      ],
+      "description": [
+        "Let {a1, a2,..., an} be an integer sequence of length n such that:",
+        "a1 = 6",
+        "for all 1 ≤ i < n : φ(ai) < φ(ai+1) < ai < ai+11",
+        "Let S(N) be the number of such sequences with an ≤ N.",
+        "For example, S(10) = 4: {6}, {6, 8}, {6, 8, 9} and {6, 10}.",
+        "We can verify that S(100) = 482073668 and S(10 000) mod 108 = 73808307.",
+        "",
+        "Find S(20 000 000) mod 108.",
+        "",
+        "1 φ denotes Euler's totient function."
+      ]
+    },
+    {
+      "_id": "5900f4be1000cf542c50ffd1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 338: Cutting Rectangular Grid Paper",
+      "tests": [
+        "assert.strictEqual(euler338(), 15614292, 'message: <code>euler338()</code> should return 15614292.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler338() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler338();"
+      ],
+      "description": [
+        "A rectangular sheet of grid paper with integer dimensions w × h is given. Its grid spacing is 1.",
+        "When we cut the sheet along the grid lines into two pieces and rearrange those pieces without overlap, we can make new rectangles with different dimensions.",
+        "For example, from a sheet with dimensions 9 × 4 , we can make rectangles with dimensions 18 × 2, 12 × 3 and 6 × 6 by cutting and rearranging as below:",
+        "",
+        "",
+        "",
+        "",
+        "Similarly, from a sheet with dimensions 9 × 8 , we can make rectangles with dimensions 18 × 4 and 12 × 6 .",
+        "",
+        "For a pair w and h, let F(w,h) be the number of distinct rectangles that can be made from a sheet with dimensions w × h .",
+        "For example, F(2,1) = 0, F(2,2) = 1, F(9,4) = 3 and F(9,8) = 2. ",
+        "Note that rectangles congruent to the initial one are not counted in F(w,h).",
+        "Note also that rectangles with dimensions w × h and dimensions h × w are not considered distinct.",
+        "",
+        "For an integer N, let G(N) be the sum of F(w,h) for all pairs w and h which satisfy 0 < h ≤ w ≤ N.",
+        "We can verify that G(10) = 55, G(103) = 971745 and G(105) = 9992617687.",
+        "",
+        "Find G(1012). Give your answer modulo 108."
+      ]
+    },
+    {
+      "_id": "5900f4c01000cf542c50ffd2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 339: Peredur fab Efrawg",
+      "tests": [
+        "assert.strictEqual(euler339(), 19823.542204, 'message: <code>euler339()</code> should return 19823.542204.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler339() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler339();"
+      ],
+      "description": [
+        "\"And he came towards a valley, through which ran a river; and the borders of the valley were wooded, and on each side of the river were level meadows. And on one side of the river he saw a flock of white sheep, and on the other a flock of black sheep. And whenever one of the white sheep bleated, one of the black sheep would cross over and become white; and when one of the black sheep bleated, one of the white sheep would cross over and become black.\"en.wikisource.org",
+        "",
+        "",
+        "",
+        "Initially each flock consists of n sheep. Each sheep (regardless of colour) is equally likely to be the next sheep to bleat. After a sheep has bleated and a sheep from the other flock has crossed over, Peredur may remove a number of white sheep in order to maximize the expected final number of black sheep. Let E(n) be the expected final number of black sheep if Peredur uses an optimal strategy.",
+        "",
+        "",
+        "",
+        "You are given that E(5) = 6.871346 rounded to 6 places behind the decimal point.",
+        "Find E(10 000) and give your answer rounded to 6 places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4c21000cf542c50ffd4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 340: Crazy Function",
+      "tests": [
+        "assert.strictEqual(euler340(), 291504964, 'message: <code>euler340()</code> should return 291504964.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler340() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler340();"
+      ],
+      "description": [
+        "For fixed integers a, b, c, define the crazy function F(n) as follows:",
+        "F(n) = n - c for all n > b ",
+        "F(n) = F(a + F(a + F(a + F(a + n)))) for all n ≤ b.",
+        "",
+        "",
+        "Also, define S(a, b, c) = .",
+        "",
+        "",
+        "For example, if a = 50, b = 2000 and c = 40, then F(0) = 3240 and F(2000) = 2040.",
+        "Also, S(50, 2000, 40) = 5204240.",
+        "",
+        "",
+        "Find the last 9 digits of S(217, 721, 127)."
+      ]
+    },
+    {
+      "_id": "5900f4c11000cf542c50ffd3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 341: Golomb's self-describing sequence",
+      "tests": [
+        "assert.strictEqual(euler341(), 56098610614277016, 'message: <code>euler341()</code> should return 56098610614277016.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler341() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler341();"
+      ],
+      "description": [
+        "The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are",
+        "",
+        "",
+        "n123456789101112131415…G(n)122334445556666…",
+        "",
+        "You are given that G(103) = 86, G(106) = 6137.",
+        "You are also given that ΣG(n3) = 153506976 for 1 ≤ n < 103.",
+        "",
+        "Find ΣG(n3) for 1 ≤ n < 106."
+      ]
+    },
+    {
+      "_id": "5900f4c31000cf542c50ffd5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 342: The totient of a square is a cube",
+      "tests": [
+        "assert.strictEqual(euler342(), 5943040885644, 'message: <code>euler342()</code> should return 5943040885644.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler342() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler342();"
+      ],
+      "description": [
+        "Consider the number 50.",
+        "502 = 2500 = 22 × 54, so φ(2500) = 2 × 4 × 53 = 8 × 53 = 23 × 53. 1",
+        "So 2500 is a square and  φ(2500) is a cube.",
+        "",
+        "",
+        "Find the sum of all numbers n, 1 &lt n < 1010 such that φ(n2) is a cube.",
+        "",
+        "",
+        "1 φ denotes Euler's totient function."
+      ]
+    },
+    {
+      "_id": "5900f4c41000cf542c50ffd6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 343: Fractional Sequences",
+      "tests": [
+        "assert.strictEqual(euler343(), 269533451410884200, 'message: <code>euler343()</code> should return 269533451410884200.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler343() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler343();"
+      ],
+      "description": [
+        "For any positive integer k, a finite sequence ai of fractions xi/yi is defined by:",
+        "a1 = 1/k and",
+        "ai = (xi-1+1)/(yi-1-1) reduced to lowest terms for i>1.",
+        "When ai reaches some integer n, the sequence stops. (That is, when yi=1.)",
+        "Define f(k) = n. ",
+        "For example, for k = 20:",
+        "",
+        "",
+        "",
+        "1/20 → 2/19 → 3/18 = 1/6 → 2/5 → 3/4 → 4/3 → 5/2 → 6/1 = 6",
+        "",
+        "",
+        "",
+        "So f(20) = 6.",
+        "",
+        "",
+        "",
+        "Also f(1) = 1, f(2) = 2, f(3) = 1 and Σf(k3) = 118937 for 1 ≤ k ≤ 100.",
+        "",
+        "",
+        "",
+        "Find Σf(k3) for 1 ≤ k ≤ 2×106."
+      ]
+    },
+    {
+      "_id": "5900f4c51000cf542c50ffd7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 344: Silver dollar game",
+      "tests": [
+        "assert.strictEqual(euler344(), 65579304332, 'message: <code>euler344()</code> should return 65579304332.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler344() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler344();"
+      ],
+      "description": [
+        "One variant of N.G. de Bruijn's silver dollar game can be described as follows:",
+        "",
+        "On a strip of squares a number of coins are placed, at most one coin per square. Only one coin, called the silver dollar, has any value. Two players take turns making moves. At each turn a player must make either a regular or a special move.",
+        "",
+        "A regular move consists of selecting one coin and moving it one or more squares to the left. The coin cannot move out of the strip or jump on or over another coin.",
+        "",
+        "Alternatively, the player can choose to make the special move of pocketing the leftmost coin rather than making a regular move. If no regular moves are possible, the player is forced to pocket the leftmost coin.",
+        "",
+        "The winner is the player who pockets the silver dollar.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "A winning configuration is an arrangement of coins on the strip where the first player can force a win no matter what the second player does.",
+        "",
+        "Let W(n,c) be the number of winning configurations for a strip of n squares, c worthless coins and one silver dollar.",
+        "",
+        "You are given that W(10,2) = 324 and W(100,10) = 1514704946113500.",
+        "",
+        "Find W(1 000 000, 100) modulo the semiprime 1000 036 000 099 (= 1 000 003 · 1 000 033)."
+      ]
+    },
+    {
+      "_id": "5900f4c81000cf542c50ffda",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 345: Matrix Sum",
+      "tests": [
+        "assert.strictEqual(euler345(), 13938, 'message: <code>euler345()</code> should return 13938.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler345() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler345();"
+      ],
+      "description": [
+        "We define the Matrix Sum of a matrix as the maximum sum of matrix elements with each element being the only one in his row and column. For example, the Matrix Sum of the matrix below equals 3315 ( = 863 + 383 + 343 + 959 + 767):",
+        "",
+        "",
+        "  7  53 183 439 863",
+        "497 383 563  79 973",
+        "287  63 343 169 583",
+        "627 343 773 959 943767 473 103 699 303",
+        "",
+        "",
+        "Find the Matrix Sum of:",
+        "",
+        "  7  53 183 439 863 497 383 563  79 973 287  63 343 169 583",
+        "627 343 773 959 943 767 473 103 699 303 957 703 583 639 913",
+        "447 283 463  29  23 487 463 993 119 883 327 493 423 159 743",
+        "217 623   3 399 853 407 103 983  89 463 290 516 212 462 350",
+        "960 376 682 962 300 780 486 502 912 800 250 346 172 812 350",
+        "870 456 192 162 593 473 915  45 989 873 823 965 425 329 803",
+        "973 965 905 919 133 673 665 235 509 613 673 815 165 992 326",
+        "322 148 972 962 286 255 941 541 265 323 925 281 601  95 973",
+        "445 721  11 525 473  65 511 164 138 672  18 428 154 448 848",
+        "414 456 310 312 798 104 566 520 302 248 694 976 430 392 198",
+        "184 829 373 181 631 101 969 613 840 740 778 458 284 760 390",
+        "821 461 843 513  17 901 711 993 293 157 274  94 192 156 574",
+        " 34 124   4 878 450 476 712 914 838 669 875 299 823 329 699",
+        "815 559 813 459 522 788 168 586 966 232 308 833 251 631 107",
+        "813 883 451 509 615  77 281 613 459 205 380 274 302  35 805"
+      ]
+    },
+    {
+      "_id": "5900f4c71000cf542c50ffd8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 346: Strong Repunits",
+      "tests": [
+        "assert.strictEqual(euler346(), 336108797689259260, 'message: <code>euler346()</code> should return 336108797689259260.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler346() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler346();"
+      ],
+      "description": [
+        "The number 7 is special, because 7 is 111 written in base 2, and 11 written in base 6 (i.e. 710 = 116 = 1112). In other words, 7 is a repunit in at least two bases b > 1. ",
+        "",
+        "",
+        "We shall call a positive integer with this property a strong repunit. It can be verified that there are 8 strong repunits below 50:  {1,7,13,15,21,31,40,43}. Furthermore, the sum of all strong repunits below 1000 equals 15864.",
+        "",
+        "Find the sum of all strong repunits below 1012."
+      ]
+    },
+    {
+      "_id": "5900f4c81000cf542c50ffd9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 347: Largest integer divisible by two primes",
+      "tests": [
+        "assert.strictEqual(euler347(), 11109800204052, 'message: <code>euler347()</code> should return 11109800204052.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler347() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler347();"
+      ],
+      "description": [
+        "The largest integer ≤ 100 that is only divisible by both the primes 2 and 3 is 96, as 96=32*3=25*3.",
+        "For two distinct primes p and q let M(p,q,N) be the largest positive integer ≤N only divisible",
+        "by both p and q and M(p,q,N)=0 if such a positive integer does not exist.",
+        "",
+        "",
+        "E.g. M(2,3,100)=96. ",
+        "M(3,5,100)=75 and not 90 because 90 is divisible by 2 ,3 and 5.",
+        "Also M(2,73,100)=0 because there does not exist a positive integer ≤ 100 that is divisible by both 2 and 73.",
+        "",
+        "",
+        "Let S(N) be the sum of all distinct M(p,q,N).",
+        "S(100)=2262.",
+        "",
+        "",
+        "Find S(10 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f4c81000cf542c50ffdb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 348: Sum of a square and a cube",
+      "tests": [
+        "assert.strictEqual(euler348(), 1004195061, 'message: <code>euler348()</code> should return 1004195061.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler348() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler348();"
+      ],
+      "description": [
+        "Many numbers can be expressed as the sum of a square and a cube. Some of them in more than one way.",
+        "",
+        "Consider the palindromic numbers that can be expressed as the sum of a square and a cube, both greater than 1, in exactly 4 different ways.",
+        "For example, 5229225 is a palindromic number and it can be expressed in exactly 4 different ways:",
+        "22852 + 203",
+        "22232 + 663",
+        "18102 + 1253",
+        "11972 + 1563",
+        " ",
+        "Find the sum of the five smallest such palindromic numbers."
+      ]
+    },
+    {
+      "_id": "5900f4ca1000cf542c50ffdc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 349: Langton's ant",
+      "tests": [
+        "assert.strictEqual(euler349(), 115384615384614940, 'message: <code>euler349()</code> should return 115384615384614940.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler349() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler349();"
+      ],
+      "description": [
+        "An ant moves on a regular grid of squares that are coloured either black or white. ",
+        "The ant is always oriented in one of the cardinal directions (left, right, up or down) and moves from square to adjacent square according to the following rules:",
+        "- if it is on a black square, it flips the color of the square to white, rotates 90 degrees counterclockwise and moves forward one square.",
+        "- if it is on a white square, it flips the color of the square to black, rotates 90 degrees clockwise and moves forward one square.",
+        "",
+        "Starting with a grid that is entirely white, how many squares are black after 1018 moves of the ant?"
+      ]
+    },
+    {
+      "_id": "5900f4cb1000cf542c50ffdd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 350: Constraining the least greatest and the greatest least",
+      "tests": [
+        "assert.strictEqual(euler350(), 84664213, 'message: <code>euler350()</code> should return 84664213.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler350() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler350();"
+      ],
+      "description": [
+        "A list of size n is a sequence of n natural numbers. Examples are (2,4,6), (2,6,4), (10,6,15,6), and (11).",
+        "",
+        "The greatest common divisor, or gcd, of a list is the largest natural number that divides all entries of the list. Examples: gcd(2,6,4) = 2, gcd(10,6,15,6) = 1 and gcd(11) = 11.",
+        "",
+        "The least common multiple, or lcm, of a list is the smallest natural number divisible by each entry of the list. Examples: lcm(2,6,4) = 12, lcm(10,6,15,6) = 30 and lcm(11) = 11.",
+        "",
+        "Let f(G, L, N) be the number of lists of size N with gcd ≥ G and lcm ≤ L. For example:",
+        "",
+        "f(10, 100, 1) = 91.",
+        "f(10, 100, 2) = 327.",
+        "f(10, 100, 3) = 1135.",
+        "f(10, 100, 1000) mod 1014 = 3286053.",
+        "",
+        "Find f(106, 1012, 1018) mod 1014."
+      ]
+    },
+    {
+      "_id": "5900f4cb1000cf542c50ffde",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 351: Hexagonal orchards",
+      "tests": [
+        "assert.strictEqual(euler351(), 11762187201804552, 'message: <code>euler351()</code> should return 11762187201804552.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler351() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler351();"
+      ],
+      "description": [
+        "A hexagonal orchard of order n is a triangular lattice made up of points within a regular hexagon with side n. The following is an example of a hexagonal orchard of order 5:",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center.",
+        "",
+        "",
+        "",
+        "Let H(n) be the number of points hidden from the center in a hexagonal orchard of order n.",
+        "",
+        "",
+        "",
+        "H(5) = 30. H(10) = 138. H(1 000) = 1177848.",
+        "",
+        "",
+        "",
+        "Find H(100 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f4cd1000cf542c50ffdf",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 352: Blood tests",
+      "tests": [
+        "assert.strictEqual(euler352(), 378563.260589, 'message: <code>euler352()</code> should return 378563.260589.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler352() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler352();"
+      ],
+      "description": [
+        "Each one of the 25 sheep in a flock must be tested for a rare virus, known to affect 2% of the sheep population.",
+        "An accurate and extremely sensitive PCR test exists for blood samples, producing a clear positive / negative result, but it is very time-consuming and expensive.",
+        "",
+        "",
+        "",
+        "Because of the high cost, the vet-in-charge suggests that instead of performing 25 separate tests, the following procedure can be used instead:",
+        "The sheep are split into 5 groups of 5 sheep in each group. ",
+        "For each group, the 5 samples are mixed together and a single test is performed. Then,",
+        "If the result is negative, all the sheep in that group are deemed to be virus-free.",
+        "If the result is positive, 5 additional tests will be performed (a separate test for each animal) to determine the affected individual(s).",
+        "",
+        "Since the probability of infection for any specific animal is only 0.02, the first test (on the pooled samples) for each group will be:",
+        "Negative (and no more tests needed) with probability 0.985 = 0.9039207968.",
+        "Positive (5 additional tests needed) with probability 1 - 0.9039207968 = 0.0960792032.",
+        "",
+        "Thus, the expected number of tests for each group is 1 + 0.0960792032 × 5 = 1.480396016.",
+        "Consequently, all 5 groups can be screened using an average of only 1.480396016 × 5 = 7.40198008 tests, which represents a huge saving of more than 70% !",
+        "",
+        "",
+        "",
+        "Although the scheme we have just described seems to be very efficient, it can still be improved considerably (always assuming that the test is sufficiently sensitive and that there are no adverse effects caused by mixing different samples). E.g.:",
+        "We may start by running a test on a mixture of all the 25 samples. It can be verified that in about 60.35% of the cases this test will be negative, thus no more tests will be needed. Further testing will only be required for the remaining 39.65% of the cases.",
+        "If we know that at least one animal in a group of 5 is infected and the first 4 individual tests come out negative, there is no need to run a test on the fifth animal (we know that it must be infected).",
+        "We can try a different number of groups / different number of animals in each group, adjusting those numbers at each level so that the total expected number of tests will be minimised.",
+        "",
+        "To simplify the very wide range of possibilities, there is one restriction we place when devising the most cost-efficient testing scheme: whenever we start with a mixed sample, all the sheep contributing to that sample must be fully screened (i.e. a verdict of infected / virus-free must be reached for all of them) before we start examining any other animals.",
+        "",
+        "For the current example, it turns out that the most cost-efficient testing scheme (we'll call it the optimal strategy) requires an average of just 4.155452 tests!",
+        "",
+        "",
+        "",
+        "Using the optimal strategy, let T(s,p) represent the average number of tests needed to screen a flock of s sheep for a virus having probability p to be present in any individual.",
+        "Thus, rounded to six decimal places, T(25, 0.02) = 4.155452 and T(25, 0.10) = 12.702124.",
+        "",
+        "",
+        "",
+        "Find ΣT(10000, p) for p=0.01, 0.02, 0.03, ... 0.50.",
+        "Give your answer rounded to six decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4cd1000cf542c50ffe0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 353: Risky moon",
+      "tests": [
+        "assert.strictEqual(euler353(), 1.2759860331, 'message: <code>euler353()</code> should return 1.2759860331.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler353() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler353();"
+      ],
+      "description": [
+        "A moon could be described by the sphere C(r) with centre (0,0,0) and radius r. ",
+        "",
+        "",
+        "",
+        "There are stations on the moon at the points on the surface of C(r) with integer coordinates. The station at (0,0,r) is called North Pole station, the station at (0,0,-r) is called South Pole station.",
+        "",
+        "",
+        "",
+        "All stations are connected with each other via the shortest road on the great arc through the stations. A journey between two stations is risky. If d is the length of the road between two stations, (d/(π r))2 is a measure for the risk of the journey (let us call it the risk of the road). If the journey includes more than two stations, the risk of the journey is the sum of risks of the used roads.",
+        "",
+        "",
+        "",
+        "A direct journey from  the North Pole station to the South Pole station has the length πr and risk 1. The journey from the North Pole station to the South Pole station via (0,r,0) has the same length, but a smaller risk: (½πr/(πr))2+(½πr/(πr))2=0.5.",
+        "",
+        "",
+        "",
+        "The minimal risk of a journey from the North Pole station to the South Pole station on C(r) is M(r).",
+        "",
+        "",
+        "",
+        "You are given that M(7)=0.1784943998  rounded to 10 digits behind the decimal point. ",
+        "",
+        "",
+        "",
+        "Find ∑M(2n-1) for 1≤n≤15.",
+        "",
+        "",
+        "",
+        "Give your answer rounded to 10 digits behind the decimal point in the form a.bcdefghijk."
+      ]
+    },
+    {
+      "_id": "5900f4cf1000cf542c50ffe1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 354: Distances in a bee's honeycomb",
+      "tests": [
+        "assert.strictEqual(euler354(), 58065134, 'message: <code>euler354()</code> should return 58065134.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler354() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler354();"
+      ],
+      "description": [
+        "Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "One particular cell is occupied by the queen bee.",
+        "For a positive real number L, let B(L) count the cells with distance L from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider. ",
+        "For example, B(√3) = 6, B(√21) = 12 and B(111 111 111) = 54.",
+        "",
+        "Find the number of L ≤ 5·1011 such that B(L) = 450."
+      ]
+    },
+    {
+      "_id": "5900f4d01000cf542c50ffe2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 355: Maximal coprime subset",
+      "tests": [
+        "assert.strictEqual(euler355(), 1726545007, 'message: <code>euler355()</code> should return 1726545007.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler355() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler355();"
+      ],
+      "description": [
+        "Define Co(n) to be the maximal possible sum of a set of mutually co-prime elements from {1, 2, ..., n}. For example Co(10) is 30 and hits that maximum on the subset {1, 5, 7, 8, 9}.",
+        "",
+        "",
+        "",
+        "You are given that Co(30) = 193 and Co(100) = 1356. ",
+        "",
+        "",
+        "Find Co(200000)."
+      ]
+    },
+    {
+      "_id": "5900f4d01000cf542c50ffe3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 356: Largest roots of cubic polynomials",
+      "tests": [
+        "assert.strictEqual(euler356(), 28010159, 'message: <code>euler356()</code> should return 28010159.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler356() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler356();"
+      ],
+      "description": [
+        "Let an be the largest real root of a polynomial g(x) = x3 - 2n·x2 + n.",
+        "For example, a2 = 3.86619826...",
+        "",
+        "",
+        "Find the last eight digits of.",
+        "",
+        "",
+        "Note:  represents the floor function."
+      ]
+    },
+    {
+      "_id": "5900f4d11000cf542c50ffe4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 357: Prime generating integers",
+      "tests": [
+        "assert.strictEqual(euler357(), 1739023853137, 'message: <code>euler357()</code> should return 1739023853137.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler357() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler357();"
+      ],
+      "description": [
+        "Consider the divisors of 30: 1,2,3,5,6,10,15,30.",
+        "It can be seen that for every divisor d of 30, d+30/d is prime.",
+        "",
+        "",
+        "Find the sum of all positive integers n not exceeding 100 000 000such that",
+        "for every divisor d of n, d+n/d is prime."
+      ]
+    },
+    {
+      "_id": "5900f4d21000cf542c50ffe5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 358: Cyclic numbers",
+      "tests": [
+        "assert.strictEqual(euler358(), 3284144505, 'message: <code>euler358()</code> should return 3284144505.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler358() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler358();"
+      ],
+      "description": [
+        "A cyclic number with n digits has a very interesting property:",
+        "When it is multiplied by 1, 2, 3, 4, ... n, all the products have exactly the same digits, in the same order, but rotated in a circular fashion!",
+        "",
+        "",
+        "",
+        "The smallest cyclic number is the 6-digit number 142857 :",
+        "142857 × 1 = 142857",
+        "142857 × 2 = 285714",
+        "142857 × 3 = 428571",
+        "142857 × 4 = 571428",
+        "142857 × 5 = 714285",
+        "142857 × 6 = 857142  ",
+        "",
+        "",
+        "",
+        "The next cyclic number is 0588235294117647 with 16 digits :",
+        "0588235294117647 × 1 = 0588235294117647",
+        "0588235294117647 × 2 = 1176470588235294",
+        "0588235294117647 × 3 = 1764705882352941",
+        "...",
+        "0588235294117647 × 16 = 9411764705882352",
+        "",
+        "",
+        "",
+        "Note that for cyclic numbers, leading zeros are important.",
+        "",
+        "",
+        "",
+        "There is only one cyclic number for which, the eleven leftmost digits are 00000000137 and the five rightmost digits are 56789 (i.e., it has the form 00000000137...56789 with an unknown number of digits in the middle). Find the sum of all its digits."
+      ]
+    },
+    {
+      "_id": "5900f4d31000cf542c50ffe6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 359: Hilbert's New Hotel",
+      "tests": [
+        "assert.strictEqual(euler359(), 40632119, 'message: <code>euler359()</code> should return 40632119.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler359() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler359();"
+      ],
+      "description": [
+        "An infinite number of people (numbered 1, 2, 3, etc.) are lined up to get a room at Hilbert's newest infinite hotel. The hotel contains an infinite number of floors (numbered 1, 2, 3, etc.), and each floor contains an infinite number of rooms (numbered 1, 2, 3, etc.). ",
+        "",
+        "",
+        "",
+        "Initially the hotel is empty. Hilbert declares a rule on how the nth person is assigned a room: person n gets the first vacant room in the lowest numbered floor satisfying either of the following:",
+        "the floor is empty",
+        "the floor is not empty, and if the latest person taking a room in that floor is person m, then m + n is a perfect square",
+        "",
+        "Person 1 gets room 1 in floor 1 since floor 1 is empty.",
+        "Person 2 does not get room 2 in floor 1 since 1 + 2 = 3 is not a perfect square.",
+        "Person 2 instead gets room 1 in floor 2 since floor 2 is empty.",
+        "Person 3 gets room 2 in floor 1 since 1 + 3 = 4 is a perfect square.",
+        "",
+        "",
+        "",
+        "Eventually, every person in the line gets a room in the hotel.",
+        "",
+        "",
+        "",
+        "Define P(f, r) to be n if person n occupies room r in floor f, and 0 if no person occupies the room. Here are a few examples:",
+        "P(1, 1) = 1",
+        "P(1, 2) = 3",
+        "P(2, 1) = 2",
+        "P(10, 20) = 440",
+        "P(25, 75) = 4863",
+        "P(99, 100) = 19454",
+        "",
+        "",
+        "",
+        "Find the sum of all P(f, r) for all positive f and r such that f × r = 71328803586048 and give the last 8 digits as your answer."
+      ]
+    },
+    {
+      "_id": "5900f4d41000cf542c50ffe7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 360: Scary Sphere",
+      "tests": [
+        "assert.strictEqual(euler360(), 878825614395267100, 'message: <code>euler360()</code> should return 878825614395267100.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler360() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler360();"
+      ],
+      "description": [
+        "Given two points (x1,y1,z1) and (x2,y2,z2) in three dimensional space, the Manhattan distance  between those points is defined as  |x1-x2|+|y1-y2|+|z1-z2|.",
+        "",
+        "",
+        "Let C(r) be a sphere with radius r and center in the origin O(0,0,0).",
+        "Let I(r) be the set of all points with integer coordinates on the surface of C(r).",
+        "Let S(r) be the sum of the Manhattan distances of all elements of I(r) to the origin O.",
+        "",
+        "",
+        "E.g. S(45)=34518.",
+        "",
+        "",
+        "Find S(1010)."
+      ]
+    },
+    {
+      "_id": "5900f4d51000cf542c50ffe8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 361: Subsequence of Thue-Morse sequence",
+      "tests": [
+        "assert.strictEqual(euler361(), 178476944, 'message: <code>euler361()</code> should return 178476944.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler361() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler361();"
+      ],
+      "description": [
+        "The Thue-Morse sequence {Tn} is a binary sequence satisfying:",
+        "T0 = 0",
+        "T2n = Tn",
+        "T2n+1 = 1 - Tn",
+        "",
+        "The first several terms of {Tn} are given as follows:",
+        "01101001100101101001011001101001....",
+        "",
+        "",
+        "",
+        "We define {An} as the sorted sequence of integers such that the binary expression of each element appears as a subsequence in {Tn}.",
+        "For example, the decimal number 18 is expressed as 10010 in binary. 10010 appears in {Tn} (T8 to T12), so 18 is an element of {An}.",
+        "The decimal number 14 is expressed as 1110 in binary. 1110 never appears in {Tn}, so 14 is not an element of {An}.",
+        "",
+        "",
+        "",
+        "The first several terms of An are given as follows:",
+        "n0123456789101112…An012345691011121318…",
+        "",
+        "",
+        "",
+        "We can also verify that A100 = 3251 and A1000 = 80852364498.",
+        "",
+        "",
+        "",
+        "Find the last 9 digits of ."
+      ]
+    },
+    {
+      "_id": "5900f4d61000cf542c50ffe9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 362: Squarefree factors",
+      "tests": [
+        "assert.strictEqual(euler362(), 457895958010, 'message: <code>euler362()</code> should return 457895958010.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler362() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler362();"
+      ],
+      "description": [
+        "Consider the number 54.",
+        "54 can be factored in 7 distinct ways into one or more factors larger than 1:",
+        "54, 2×27, 3×18, 6×9, 3×3×6, 2×3×9 and 2×3×3×3.",
+        "If we require that the factors are all squarefree only two ways remain: 3×3×6 and 2×3×3×3.",
+        "",
+        "",
+        "Let's call Fsf(n) the number of ways n can be factored into one or more squarefree factors larger than 1, so",
+        "Fsf(54)=2.",
+        "",
+        "",
+        "Let S(n) be ∑Fsf(k) for k=2 to n.",
+        "",
+        "",
+        "S(100)=193.",
+        "",
+        "",
+        "Find S(10 000 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f4d91000cf542c50ffeb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 363: Bézier Curves",
+      "tests": [
+        "assert.strictEqual(euler363(), 0.0000372091, 'message: <code>euler363()</code> should return 0.0000372091.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler363() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler363();"
+      ],
+      "description": [
+        "A cubic Bézier curve is defined by four points: P0, P1, P2 and P3.",
+        "",
+        "",
+        "",
+        "The curve is constructed as follows:",
+        "On the segments P0P1, P1P2 and P2P3 the points Q0,Q1 and Q2 are drawn such that",
+        "P0Q0 / P0P1 = P1Q1 / P1P2 = P2Q2 / P2P3 = t (t in [0,1]).",
+        "On the segments Q0Q1 and Q1Q2 the points R0 and R1 are drawn such that",
+        "Q0R0  / Q0Q1 = Q1R1 / Q1Q2 = t for the same value of t.",
+        "On the segment R0R1 the point B is drawn such that R0B / R0R1 = t for the same value of t.",
+        "The Bézier curve defined by the points P0, P1, P2, P3 is the locus of B as Q0 takes all possible positions on the segment P0P1.",
+        "(Please note that for all points the value of t is the same.)",
+        "",
+        "At this (external) web address you will find an applet that allows you to drag the points P0, P1, P2 and P3 to see what the Bézier curve (green curve) defined by those points looks like. You can also drag the point Q0 along the segment P0P1.",
+        "",
+        "From the construction it is clear that the Bézier curve will be tangent to the segments P0P1 in P0 and P2P3 in P3.",
+        "",
+        "A cubic Bézier curve with P0=(1,0), P1=(1,v), P2=(v,1) and P3=(0,1) is used to approximate a quarter circle.",
+        "The value v > 0 is chosen such that the area enclosed by the lines OP0, OP3 and the curve is equal to π/4 (the area of the quarter circle).",
+        "",
+        "By how many percent does the length of the curve differ from the length of the quarter circle?",
+        "That is, if L is the length of the curve, calculate  100 × L − π/2π/2Give your answer rounded to 10 digits behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4d91000cf542c50ffea",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 364: Comfortable distance",
+      "tests": [
+        "assert.strictEqual(euler364(), 44855254, 'message: <code>euler364()</code> should return 44855254.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler364() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler364();"
+      ],
+      "description": [
+        "There are N seats in a row. N people come after each other to fill the seats according to the following rules:",
+        "If there is any seat whose adjacent seat(s) are not occupied take such a seat.",
+        "If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.",
+        "Otherwise take one of the remaining available seats. ",
+        "",
+        "Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094.",
+        "Find T(1 000 000) mod 100 000 007."
+      ]
+    },
+    {
+      "_id": "5900f4da1000cf542c50ffec",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 365: A huge binomial coefficient",
+      "tests": [
+        "assert.strictEqual(euler365(), 162619462356610300, 'message: <code>euler365()</code> should return 162619462356610300.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler365() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler365();"
+      ],
+      "description": [
+        "The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.",
+        "",
+        "",
+        "Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.",
+        "",
+        "",
+        "Calculate ∑M(1018,109,p*q*r) for 1000<p<q<r<5000 and p,q,r prime."
+      ]
+    },
+    {
+      "_id": "5900f4da1000cf542c50ffed",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 366: Stone Game III",
+      "tests": [
+        "assert.strictEqual(euler366(), 88351299, 'message: <code>euler366()</code> should return 88351299.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler366() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler366();"
+      ],
+      "description": [
+        "Two players, Anton and Bernhard, are playing the following game.",
+        "There is one pile of n stones.",
+        "The first player may remove any positive number of stones, but not the whole pile.",
+        "Thereafter, each player may remove at most twice the number of stones his opponent took on the previous move.",
+        "The player who removes the last stone wins.",
+        "",
+        "",
+        "E.g. n=5",
+        "If the first player takes anything more than one stone the next player will be able to take all remaining stones.",
+        "If the first player takes one stone, leaving four, his opponent will take also one stone, leaving three stones.",
+        "The first player cannot take all three because he may take at most 2x1=2 stones. So let's say he takes also one stone, leaving 2. The second player can take the two remaining stones and wins.",
+        "So 5 is a losing position for the first player.",
+        "For some winning positions there is more than one possible move for the first player.",
+        "E.g. when n=17 the first player can remove one or four stones.",
+        "",
+        "",
+        "Let M(n) be the maximum number of stones the first player can take from a winning position at his first turn and M(n)=0 for any other position.",
+        "",
+        "",
+        "∑M(n) for n≤100 is 728.",
+        "",
+        "",
+        "Find  ∑M(n) for n≤1018.",
+        "Give your answer modulo 108."
+      ]
+    },
+    {
+      "_id": "5900f4db1000cf542c50ffee",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 367: Bozo sort",
+      "tests": [
+        "assert.strictEqual(euler367(), 48271207, 'message: <code>euler367()</code> should return 48271207.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler367() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler367();"
+      ],
+      "description": [
+        "Bozo sort, not to be confused with the slightly less efficient bogo sort, consists out of checking if the input sequence is sorted and if not swapping randomly two elements. This is repeated until eventually the sequence is sorted.",
+        "",
+        "",
+        "If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of swaps, averaged over all 4! input sequences is 24.75.",
+        "The already sorted sequence takes 0 steps. ",
+        "",
+        "",
+        "In this problem we consider the following variant on bozo sort.",
+        "If the sequence is not in order we pick three elements at random and shuffle these three elements randomly.",
+        "All 3!=6 permutations of those three elements are equally likely. ",
+        "The already sorted sequence will take 0 steps.",
+        "If we consider all permutations of the first 4 natural numbers as input the expectation value of the number of shuffles, averaged over all 4! input sequences is 27.5. ",
+        "Consider as input sequences the permutations of the first 11 natural numbers.",
+        "Averaged over all 11! input sequences, what is the expected number of shuffles this sorting algorithm will perform?",
+        "",
+        "",
+        "Give your answer rounded to the nearest integer."
+      ]
+    },
+    {
+      "_id": "5900f4dd1000cf542c50ffef",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 368: A Kempner-like series",
+      "tests": [
+        "assert.strictEqual(euler368(), 253.6135092068, 'message: <code>euler368()</code> should return 253.6135092068.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler368() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler368();"
+      ],
+      "description": [
+        "The  harmonic series  $1 + \\dfrac{1}{2} + \\dfrac{1}{3} + \\dfrac{1}{4} + ...$ is well known to be divergent.",
+        "",
+        "If we however omit from this series every term where the denominator has a 9 in it, the series remarkably enough converges to approximately 22.9206766193.",
+        "This modified harmonic series is called the Kempner series.",
+        "",
+        "Let us now consider another modified harmonic series by omitting from the harmonic series every term where the denominator has 3 or more equal consecutive digits.",
+        "One can verify that out of the first 1200 terms of the harmonic series, only 20 terms will be omitted.",
+        "These 20 omitted terms are:",
+        "$$\\dfrac{1}{111}, \\dfrac{1}{222}, \\dfrac{1}{333}, \\dfrac{1}{444}, \\dfrac{1}{555}, \\dfrac{1}{666}, \\dfrac{1}{777}, \\dfrac{1}{888}, \\dfrac{1}{999}, \\dfrac{1}{1000}, \\dfrac{1}{1110}, \\\\\\ \\dfrac{1}{1111}, \\dfrac{1}{1112}, \\dfrac{1}{1113}, \\dfrac{1}{1114}, \\dfrac{1}{1115}, \\dfrac{1}{1116}, \\dfrac{1}{1117}, \\dfrac{1}{1118}, \\dfrac{1}{1119}$$",
+        "",
+        "This series converges as well.",
+        "",
+        "Find the value the series converges to.",
+        "Give your answer rounded to 10 digits behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4de1000cf542c50fff0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 369: Badugi",
+      "tests": [
+        "assert.strictEqual(euler369(), 862400558448, 'message: <code>euler369()</code> should return 862400558448.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler369() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler369();"
+      ],
+      "description": [
+        "In a standard 52 card deck of playing cards, a set of 4 cards is a Badugi if it contains 4 cards with no pairs and no two cards of the same suit.",
+        "",
+        "Let f(n) be the number of ways to choose n cards with a 4 card subset that is a Badugi.  For example, there are 2598960 ways to choose five cards from a standard 52 card deck, of which 514800 contain a 4 card subset that is a Badugi, so f(5) = 514800.",
+        "",
+        "Find ∑f(n)  for 4 ≤ n ≤ 13."
+      ]
+    },
+    {
+      "_id": "5900f4de1000cf542c50fff1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 370: Geometric triangles",
+      "tests": [
+        "assert.strictEqual(euler370(), 41791929448408, 'message: <code>euler370()</code> should return 41791929448408.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler370() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler370();"
+      ],
+      "description": [
+        "Let us define a geometric triangle as an integer sided triangle with sides a ≤ b ≤ c so that its sides form a geometric progression, i.e. b2 = a · c .  ",
+        "",
+        "An example of such a geometric triangle is the triangle with sides a = 144, b = 156 and c = 169.",
+        "",
+        "There are 861805 geometric triangles with perimeter ≤ 106 .",
+        "",
+        "How many geometric triangles exist with perimeter ≤ 2.5·1013 ?"
+      ]
+    },
+    {
+      "_id": "5900f4e01000cf542c50fff2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 371: Licence plates",
+      "tests": [
+        "assert.strictEqual(euler371(), 40.66368097, 'message: <code>euler371()</code> should return 40.66368097.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler371() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler371();"
+      ],
+      "description": [
+        "Oregon licence plates consist of three letters followed by a three digit number (each digit can be from [0..9]).",
+        "While driving to work Seth plays the following game:",
+        "Whenever the numbers of two licence plates seen on his trip add to 1000 that's a win.",
+        "",
+        "",
+        "E.g. MIC-012 and HAN-988 is a win and RYU-500 and SET-500 too. (as long as he sees them in the same trip). ",
+        "",
+        "",
+        "Find the expected number of plates he needs to see for a win.",
+        "Give your answer rounded to 8 decimal places behind the decimal point.",
+        "",
+        "",
+        "Note: We assume that each licence plate seen is equally likely to have any three digit number on it."
+      ]
+    },
+    {
+      "_id": "5900f4e11000cf542c50fff3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 372: Pencils of rays",
+      "tests": [
+        "assert.strictEqual(euler372(), 301450082318807040, 'message: <code>euler372()</code> should return 301450082318807040.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler372() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler372();"
+      ],
+      "description": [
+        "Let R(M, N) be the number of lattice points (x, y) which satisfy M<x≤N, M<y≤N and  is odd.",
+        "We can verify that R(0, 100) = 3019 and R(100, 10000) = 29750422.",
+        "Find R(2·106, 109).",
+        "",
+        "",
+        "",
+        "Note:  represents the floor function."
+      ]
+    },
+    {
+      "_id": "5900f4e11000cf542c50fff4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 373: Circumscribed Circles",
+      "tests": [
+        "assert.strictEqual(euler373(), 727227472448913, 'message: <code>euler373()</code> should return 727227472448913.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler373() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler373();"
+      ],
+      "description": [
+        "Every triangle has a circumscribed circle that goes through the three vertices.",
+        "Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.",
+        "",
+        "",
+        "Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.",
+        "",
+        "S(100)=4950 and S(1200)=1653605.",
+        "",
+        "",
+        "Find S(107)."
+      ]
+    },
+    {
+      "_id": "5900f4e51000cf542c50fff6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 374: Maximum Integer Partition Product",
+      "tests": [
+        "assert.strictEqual(euler374(), 334420941, 'message: <code>euler374()</code> should return 334420941.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler374() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler374();"
+      ],
+      "description": [
+        "An integer partition of a number n is a way of writing n as a sum of positive integers.",
+        "",
+        "Partitions that differ only in the order of their summands are considered the same.",
+        "A partition of n into distinct parts is a partition of n in which every part occurs at most once.",
+        "",
+        "The partitions of 5 into distinct parts are:",
+        "5, 4+1 and 3+2.",
+        "",
+        "Let f(n) be the maximum product of the parts of any such partition of n into distinct parts and let m(n) be the number of elements of any such partition of n with that product.",
+        "",
+        "So f(5)=6 and m(5)=2.",
+        "",
+        "For n=10 the partition with the largest product is 10=2+3+5, which gives f(10)=30 and m(10)=3.",
+        "And their product, f(10)·m(10) = 30·3 = 90",
+        "",
+        "It can be verified that",
+        "∑f(n)·m(n) for 1 ≤ n ≤ 100 = 1683550844462.",
+        "",
+        "Find ∑f(n)·m(n) for 1 ≤ n ≤ 1014.",
+        "Give your answer modulo 982451653, the 50 millionth prime."
+      ]
+    },
+    {
+      "_id": "5900f4e41000cf542c50fff5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 375: Minimum of subsequences",
+      "tests": [
+        "assert.strictEqual(euler375(), 7435327983715286000, 'message: <code>euler375()</code> should return 7435327983715286000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler375() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler375();"
+      ],
+      "description": [
+        "Let Sn be an integer sequence produced with the following pseudo-random number generator:",
+        "S0",
+        "    = ",
+        "    290797 ",
+        "  Sn+1",
+        "    = ",
+        "    Sn2 mod 50515093",
+        "  ",
+        "",
+        "",
+        "Let A(i, j) be the minimum of the numbers Si, Si+1, ... , Sj for i ≤ j.",
+        "Let M(N) = ΣA(i, j) for 1 ≤ i ≤ j ≤ N.",
+        "We can verify that M(10) = 432256955 and M(10 000) = 3264567774119.",
+        "",
+        "",
+        "Find M(2 000 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f4e51000cf542c50fff7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 376: Nontransitive sets of dice",
+      "tests": [
+        "assert.strictEqual(euler376(), 973059630185670, 'message: <code>euler376()</code> should return 973059630185670.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler376() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler376();"
+      ],
+      "description": [
+        "Consider the following set of dice with nonstandard pips:",
+        "",
+        "",
+        "",
+        "Die A: 1 4 4 4 4 4",
+        "Die B: 2 2 2 5 5 5",
+        "Die C: 3 3 3 3 3 6",
+        "",
+        "",
+        "A game is played by two players picking a die in turn and rolling it. The player who rolls the highest value wins.",
+        "",
+        "",
+        "",
+        "If the first player picks die A and the second player picks die B we get",
+        "P(second player wins) = 7/12 > 1/2",
+        "",
+        "",
+        "If the first player picks die B and the second player picks die C we get",
+        "P(second player wins) = 7/12 > 1/2",
+        "",
+        "",
+        "If the first player picks die C and the second player picks die A we get",
+        "P(second player wins) = 25/36 > 1/2",
+        "",
+        "",
+        "So whatever die the first player picks, the second player can pick another die and have a larger than 50% chance of winning.",
+        "A set of dice having this property is called a nontransitive set of dice.",
+        "",
+        "",
+        "",
+        "We wish to investigate how many sets of nontransitive dice exist. We will assume the following conditions:There are three six-sided dice with each side having between 1 and N pips, inclusive.",
+        "Dice with the same set of pips are equal, regardless of which side on the die the pips are located.",
+        "The same pip value may appear on multiple dice; if both players roll the same value neither player wins.",
+        "The sets of dice {A,B,C}, {B,C,A} and {C,A,B} are the same set.",
+        "",
+        "For N = 7 we find there are 9780 such sets.",
+        "How many are there for N = 30 ?"
+      ]
+    },
+    {
+      "_id": "5900f4e51000cf542c50fff8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 377: Sum of digits, experience 13",
+      "tests": [
+        "assert.strictEqual(euler377(), 732385277, 'message: <code>euler377()</code> should return 732385277.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler377() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler377();"
+      ],
+      "description": [
+        "There are 16 positive integers that do not have a zero in their digits and that have a digital sum equal to 5, namely: ",
+        "5, 14, 23, 32, 41, 113, 122, 131, 212, 221, 311, 1112, 1121, 1211, 2111 and 11111.",
+        "Their sum is 17891.",
+        "",
+        "",
+        "Let f(n) be the sum of all positive integers that do not have a zero in their digits and have a digital sum equal to n.",
+        "",
+        "",
+        "Find $\\displaystyle \\sum_{i=1}^{17} f(13^i)$.",
+        "Give the last 9 digits as your answer."
+      ]
+    },
+    {
+      "_id": "5900f4e61000cf542c50fff9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 378: Triangle Triples",
+      "tests": [
+        "assert.strictEqual(euler378(), 147534623725724700, 'message: <code>euler378()</code> should return 147534623725724700.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler378() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler378();"
+      ],
+      "description": [
+        "Let T(n) be the nth triangle number, so T(n) =",
+        "",
+        "",
+        "n (n+1)2",
+        "",
+        ".",
+        "",
+        "",
+        "Let dT(n) be the number of divisors of T(n).",
+        "E.g.:",
+        "T(7) = 28 and dT(7) = 6.",
+        "",
+        "",
+        "Let Tr(n) be the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and dT(i) > dT(j) > dT(k).",
+        "Tr(20) = 14, Tr(100) = 5772 and Tr(1000) = 11174776.",
+        "",
+        "",
+        "Find Tr(60 000 000). ",
+        "Give the last 18 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900f4e81000cf542c50fffa",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 379: Least common multiple count",
+      "tests": [
+        "assert.strictEqual(euler379(), 132314136838185, 'message: <code>euler379()</code> should return 132314136838185.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler379() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler379();"
+      ],
+      "description": [
+        "Let f(n) be the number of couples (x,y) with x and y positive integers, x ≤ y and the least common multiple of x and y equal to n.",
+        "",
+        "",
+        "Let g be the summatory function of f, i.e.: ",
+        "g(n) = ∑ f(i)  for 1 ≤ i ≤ n.",
+        "",
+        "",
+        "You are given that g(106) = 37429395.",
+        "",
+        "",
+        "Find g(1012)."
+      ]
+    },
+    {
+      "_id": "5900f4e81000cf542c50fffb",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 380: Amazing Mazes!",
+      "tests": [
+        "assert.strictEqual(euler380(), Infinity, 'message: <code>euler380()</code> should return Infinity.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler380() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler380();"
+      ],
+      "description": [
+        "An m×n maze is an m×n rectangular grid with walls placed between grid cells such that there is exactly one path from the top-left square to any other square. The following are examples of a 9×12 maze and a 15×20 maze:",
+        "",
+        "",
+        "",
+        "",
+        "Let C(m,n) be the number of distinct m×n mazes. Mazes which can be formed by rotation and reflection from another maze are considered distinct.",
+        "",
+        "",
+        "It can be verified that C(1,1) = 1, C(2,2) = 4, C(3,4) = 2415, and C(9,12) = 2.5720e46 (in scientific notation rounded to 5 significant digits).",
+        "Find C(100,500) and write your answer in scientific notation rounded to 5 significant digits.",
+        "",
+        "",
+        "When giving your answer, use a lowercase e to separate mantissa and exponent.",
+        "E.g. if the answer is 1234567891011 then the answer format would be 1.2346e12."
+      ]
+    },
+    {
+      "_id": "5900f4ea1000cf542c50fffc",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 381: (prime-k) factorial",
+      "tests": [
+        "assert.strictEqual(euler381(), 139602943319822, 'message: <code>euler381()</code> should return 139602943319822.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler381() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler381();"
+      ],
+      "description": [
+        "For a prime p let S(p) = (∑(p-k)!) mod(p) for 1 ≤ k ≤ 5.",
+        "",
+        "",
+        "For example, if p=7,",
+        "(7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720+120+24+6+2 = 872. ",
+        "As 872 mod(7) = 4, S(7) = 4.",
+        "",
+        "",
+        "It can be verified that ∑S(p) = 480 for 5 ≤ p < 100.",
+        "",
+        "",
+        "Find ∑S(p) for 5 ≤ p < 108."
+      ]
+    },
+    {
+      "_id": "5900f4eb1000cf542c50fffd",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 382: Generating polygons",
+      "tests": [
+        "assert.strictEqual(euler382(), 697003956, 'message: <code>euler382()</code> should return 697003956.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler382() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler382();"
+      ],
+      "description": [
+        "A polygon is a flat shape consisting of straight line segments that are joined to form a closed chain or circuit. A polygon consists of at least three sides and does not self-intersect.",
+        "",
+        "",
+        "",
+        "A set S of positive numbers is said to generate a polygon P if: no two sides of P are the same length,",
+        " the length of every side of P is in S, and",
+        " S contains no other value.",
+        "",
+        "For example:",
+        "The set {3, 4, 5} generates a polygon with sides 3, 4, and 5 (a triangle).",
+        "The set {6, 9, 11, 24} generates a polygon with sides 6, 9, 11, and 24 (a quadrilateral).",
+        "The sets {1, 2, 3} and {2, 3, 4, 9} do not generate any polygon at all.",
+        "",
+        "",
+        "Consider the sequence s, defined as follows:s1 = 1, s2 = 2, s3 = 3",
+        "sn = sn-1 + sn-3 for n > 3.",
+        "",
+        "Let Un be the set {s1, s2, ..., sn}. For example, U10 = {1, 2, 3, 4, 6, 9, 13, 19, 28, 41}.",
+        "Let f(n) be the number of subsets of Un which generate at least one polygon.",
+        "For example, f(5) = 7, f(10) = 501 and f(25) = 18635853.",
+        "",
+        "",
+        "",
+        "Find the last 9 digits of f(1018)."
+      ]
+    },
+    {
+      "_id": "5900f4ed1000cf542c50ffff",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 383: Divisibility comparison between factorials",
+      "tests": [
+        "assert.strictEqual(euler383(), 22173624649806, 'message: <code>euler383()</code> should return 22173624649806.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler383() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler383();"
+      ],
+      "description": [
+        "Let f5(n) be the largest integer x for which 5x divides n.",
+        "For example, f5(625000) = 7.",
+        "",
+        "",
+        "",
+        "Let T5(n) be the number of integers i which satisfy f5((2·i-1)!) < 2·f5(i!) and 1 ≤ i ≤ n.",
+        "It can be verified that T5(103) = 68 and T5(109) = 2408210.",
+        "",
+        "",
+        "",
+        "Find T5(1018)."
+      ]
+    },
+    {
+      "_id": "5900f4ed1000cf542c50fffe",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 384: Rudin-Shapiro sequence",
+      "tests": [
+        "assert.strictEqual(euler384(), 3354706415856333000, 'message: <code>euler384()</code> should return 3354706415856333000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler384() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler384();"
+      ],
+      "description": [
+        "Define the sequence a(n) as the number of adjacent pairs of ones in the binary expansion of n (possibly overlapping).",
+        "E.g.: a(5) = a(1012) = 0, a(6) = a(1102) = 1, a(7) = a(1112) = 2",
+        "",
+        "Define the sequence b(n) = (-1)a(n).",
+        "This sequence is called the Rudin-Shapiro sequence.",
+        "Also consider the summatory sequence of b(n): .",
+        "",
+        "The first couple of values of these sequences are:",
+        "n        0     1     2     3     4     5     6     7",
+        "a(n)     0     0     0     1     0     0     1     2",
+        "b(n)     1     1     1    -1     1     1    -1     1",
+        "s(n)     1     2     3     2     3     4     3     4",
+        "",
+        "The sequence s(n) has the remarkable property that all elements are positive and every positive integer k occurs exactly k times.",
+        "",
+        "Define g(t,c), with 1 ≤ c ≤ t, as the index in s(n) for which t occurs for the c'th time in s(n).",
+        "E.g.: g(3,3) = 6, g(4,2) = 7 and g(54321,12345) = 1220847710.",
+        "",
+        "Let F(n) be the fibonacci sequence defined by:",
+        "F(0)=F(1)=1 and",
+        "F(n)=F(n-1)+F(n-2) for n>1.",
+        "",
+        "Define GF(t)=g(F(t),F(t-1)).",
+        "",
+        "Find ΣGF(t) for 2≤t≤45."
+      ]
+    },
+    {
+      "_id": "5900f4ee1000cf542c510000",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 385: Ellipses inside triangles",
+      "tests": [
+        "assert.strictEqual(euler385(), 3776957309612154000, 'message: <code>euler385()</code> should return 3776957309612154000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler385() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler385();"
+      ],
+      "description": [
+        "For any triangle T in the plane, it can be shown that there is a unique ellipse with largest area that is completely inside T.",
+        "",
+        "",
+        "",
+        "For a given n, consider triangles T such that:",
+        "- the vertices of T have integer coordinates with absolute value ≤ n, and ",
+        "- the foci1 of the largest-area ellipse inside T are (√13,0) and (-√13,0).",
+        "Let A(n) be the sum of the areas of all such triangles.",
+        "",
+        "",
+        "For example, if n = 8, there are two such triangles. Their vertices are (-4,-3),(-4,3),(8,0) and (4,3),(4,-3),(-8,0), and the area of each triangle is 36. Thus A(8) = 36 + 36 = 72.",
+        "",
+        "",
+        "It can be verified that A(10) = 252, A(100) = 34632 and A(1000) = 3529008.",
+        "",
+        "",
+        "Find A(1 000 000 000).",
+        "",
+        "",
+        "",
+        "1The foci (plural of focus) of an ellipse are two points A and B such that for every point P on the boundary of the ellipse, AP + PB is constant."
+      ]
+    },
+    {
+      "_id": "5900f4ef1000cf542c510001",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 386: Maximum length of an antichain",
+      "tests": [
+        "assert.strictEqual(euler386(), 528755790, 'message: <code>euler386()</code> should return 528755790.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler386() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler386();"
+      ],
+      "description": [
+        "Let n be an integer and S(n) be the set of factors of n.",
+        "",
+        "A subset A of S(n) is called an antichain of S(n) if A contains only one element or if none of the elements of A divides any of the other elements of A.",
+        "",
+        "For example: S(30) = {1, 2, 3, 5, 6, 10, 15, 30}",
+        "{2, 5, 6} is not an antichain of S(30).",
+        "{2, 3, 5} is an antichain of S(30).",
+        "",
+        "Let N(n) be the maximum length of an antichain of S(n).",
+        "",
+        "Find ΣN(n) for 1 ≤ n ≤ 108"
+      ]
+    },
+    {
+      "_id": "5900f4f11000cf542c510003",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 387: Harshad Numbers",
+      "tests": [
+        "assert.strictEqual(euler387(), 696067597313468, 'message: <code>euler387()</code> should return 696067597313468.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler387() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler387();"
+      ],
+      "description": [
+        "A Harshad or Niven number is a number that is divisible by the sum of its digits.",
+        "201 is a Harshad number because it is divisible by 3 (the sum of its digits.)",
+        "When we truncate the last digit from 201, we get 20, which is a Harshad number.",
+        "When we truncate the last digit from 20, we get 2, which is also a Harshad number.",
+        "Let's call a Harshad number that, while recursively truncating the last digit, always results in a Harshad number a right truncatable Harshad number.  ",
+        "",
+        "Also:",
+        "201/3=67 which is prime.",
+        "Let's call a Harshad number that, when divided by the sum of its digits, results in a prime a strong Harshad number.",
+        "",
+        "Now take the number 2011 which is prime.",
+        "When we truncate the last digit from it we get 201, a strong Harshad number that is also right truncatable.",
+        "Let's call such primes strong, right truncatable Harshad primes.",
+        "",
+        "You are given that the sum of the strong, right truncatable Harshad primes less than 10000 is 90619.",
+        "",
+        "Find the sum of the strong, right truncatable Harshad primes less than 1014."
+      ]
+    },
+    {
+      "_id": "5900f4f11000cf542c510002",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 388: Distinct Lines",
+      "tests": [
+        "assert.strictEqual(euler388(), 831907372805130000, 'message: <code>euler388()</code> should return 831907372805130000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler388() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler388();"
+      ],
+      "description": [
+        "Consider all lattice points (a,b,c) with 0 ≤ a,b,c ≤ N.",
+        "",
+        "",
+        "From the origin O(0,0,0) all lines are drawn to the other lattice points.",
+        "Let D(N) be the number of distinct such lines.",
+        "",
+        "",
+        "You are given that D(1 000 000) = 831909254469114121.",
+        "",
+        "Find D(1010). Give as your answer the first nine digits followed by the last nine digits."
+      ]
+    },
+    {
+      "_id": "5900f4f21000cf542c510004",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 389: Platonic Dice",
+      "tests": [
+        "assert.strictEqual(euler389(), 2406376.3623, 'message: <code>euler389()</code> should return 2406376.3623.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler389() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler389();"
+      ],
+      "description": [
+        "An unbiased single 4-sided die is thrown and its value, T, is noted.T unbiased 6-sided dice are thrown and their scores are added together. The sum, C, is noted.C unbiased 8-sided dice are thrown and their scores are added together. The sum, O, is noted.O unbiased 12-sided dice are thrown and their scores are added together. The sum, D, is noted.D unbiased 20-sided dice are thrown and their scores are added together. The sum, I, is noted.",
+        "Find the variance of I, and give your answer rounded to 4 decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4f21000cf542c510005",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 390: Triangles with non rational sides and integral area",
+      "tests": [
+        "assert.strictEqual(euler390(), 2919133642971, 'message: <code>euler390()</code> should return 2919133642971.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler390() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler390();"
+      ],
+      "description": [
+        "Consider the triangle with sides √5, √65 and √68.",
+        "It can be shown that this triangle has area 9.",
+        "",
+        "S(n) is the sum of the areas of  all triangles with sides √(1+b2), √(1+c2) and √(b2+c2) (for positive integers b and c ) that have an integral area not exceeding n.",
+        "",
+        "The example triangle has b=2 and c=8.",
+        "",
+        "S(106)=18018206.",
+        "",
+        "Find S(1010)."
+      ]
+    },
+    {
+      "_id": "5900f4f31000cf542c510006",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 391: Hopping Game",
+      "tests": [
+        "assert.strictEqual(euler391(), 61029882288, 'message: <code>euler391()</code> should return 61029882288.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler391() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler391();"
+      ],
+      "description": [
+        "Let sk be the number of 1’s when writing the numbers from 0 to k in binary.",
+        "For example, writing 0 to 5 in binary, we have 0, 1, 10, 11, 100, 101. There are seven 1’s, so s5 = 7.",
+        "The sequence S = {sk : k ≥ 0} starts {0, 1, 2, 4, 5, 7, 9, 12, ...}.",
+        "",
+        "",
+        "A game is played by two players. Before the game starts, a number n is chosen. A counter c starts at 0. At each turn, the player chooses a number from 1 to n (inclusive) and increases c by that number. The resulting value of c must be a member of S. If there are no more valid moves, the player loses.",
+        "",
+        "",
+        "",
+        "For example:",
+        "Let n = 5. c starts at 0.",
+        "Player 1 chooses 4, so c becomes 0 + 4 = 4.",
+        "Player 2 chooses 5, so c becomes 4 + 5 = 9.",
+        "Player 1 chooses 3, so c becomes 9 + 3 = 12.",
+        "etc.",
+        "Note that c must always belong to S, and each player can increase c by at most n.",
+        "",
+        "",
+        "",
+        "Let M(n) be the highest number the first player can choose at her first turn to force a win, and M(n) = 0 if there is no such move. For example, M(2) = 2, M(7) = 1 and M(20) = 4.",
+        "",
+        "",
+        "",
+        "Given Σ(M(n))3 = 8150 for 1 ≤ n ≤ 20.",
+        "",
+        "",
+        "",
+        "Find Σ(M(n))3 for 1 ≤ n ≤ 1000."
+      ]
+    },
+    {
+      "_id": "5900f4f41000cf542c510007",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 392: Enmeshed unit circle",
+      "tests": [
+        "assert.strictEqual(euler392(), 3.1486734435, 'message: <code>euler392()</code> should return 3.1486734435.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler392() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler392();"
+      ],
+      "description": [
+        "A rectilinear grid is an orthogonal grid where the spacing between the gridlines does not have to be equidistant.",
+        "An example of such grid is logarithmic graph paper.",
+        "",
+        "",
+        "Consider rectilinear grids in the Cartesian coordinate system with the following properties:The gridlines are parallel to the axes of the Cartesian coordinate system.There are N+2 vertical and N+2 horizontal gridlines. Hence there are (N+1) x (N+1) rectangular cells.The equations of the two outer vertical gridlines are x = -1 and x = 1.The equations of the two outer horizontal gridlines are y = -1 and y = 1.The grid cells are colored red if they overlap with the unit circle, black otherwise.For this problem we would like you to find the positions of the remaining N inner horizontal and N inner vertical gridlines so that the area occupied by the red cells is minimized.",
+        "",
+        "",
+        "E.g. here is a picture of the solution for N = 10:",
+        "",
+        "",
+        "",
+        "",
+        "The area occupied by the red cells for N = 10 rounded to 10 digits behind the decimal point is 3.3469640797.",
+        "",
+        "",
+        "Find the positions for N = 400. ",
+        "Give as your answer the area occupied by the red cells rounded to 10 digits behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4f61000cf542c510008",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 393: Migrating ants",
+      "tests": [
+        "assert.strictEqual(euler393(), 112398351350823100, 'message: <code>euler393()</code> should return 112398351350823100.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler393() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler393();"
+      ],
+      "description": [
+        "An  n×n grid of squares contains  n2 ants, one ant per square.",
+        "All ants decide to move simultaneously to an adjacent square (usually 4 possibilities, except for ants on the edge of the grid or at the corners).",
+        "We define f(n) to be the number of ways this can happen without any ants ending on the same square and without any two ants crossing the same edge between two squares.",
+        "",
+        "",
+        "You are given that f(4) = 88.",
+        "Find  f(10)."
+      ]
+    },
+    {
+      "_id": "5900f4f71000cf542c510009",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 394: Eating pie",
+      "tests": [
+        "assert.strictEqual(euler394(), 3.2370342194, 'message: <code>euler394()</code> should return 3.2370342194.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler394() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler394();"
+      ],
+      "description": [
+        "Jeff eats a pie in an unusual way.",
+        "The pie is circular. He starts with slicing an initial cut in the pie along a radius.",
+        "While there is at least a given fraction F of pie left, he performs the following procedure:",
+        "- He makes two slices from the pie centre to any point of what is remaining of the pie border, any point on the remaining pie border equally likely. This will divide the remaining pie into three pieces. ",
+        "- Going counterclockwise from the initial cut, he takes the first two pie pieces and eats them.",
+        "When less than a fraction F of pie remains, he does not repeat this procedure. Instead, he eats all of the remaining pie.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "For x ≥ 1, let E(x) be the expected number of times Jeff repeats the procedure above with F = 1/x.",
+        "It can be verified that  E(1) = 1, E(2) ≈ 1.2676536759, and E(7.5) ≈ 2.1215732071.",
+        "",
+        "",
+        "Find E(40) rounded to 10 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4f71000cf542c51000a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 395: Pythagorean tree",
+      "tests": [
+        "assert.strictEqual(euler395(), 28.2453753155, 'message: <code>euler395()</code> should return 28.2453753155.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler395() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler395();"
+      ],
+      "description": [
+        "The Pythagorean tree is a fractal generated by the following procedure:",
+        "",
+        "",
+        "",
+        "Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base):",
+        " Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation).",
+        " Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg.",
+        " Repeat this procedure for both squares, considering as their bases the sides touching the triangle.",
+        "",
+        "The resulting figure, after an infinite number of iterations, is the Pythagorean tree.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.",
+        "",
+        "",
+        "Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places."
+      ]
+    },
+    {
+      "_id": "5900f4f81000cf542c51000b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 396: Weak Goodstein sequence",
+      "tests": [
+        "assert.strictEqual(euler396(), 173214653, 'message: <code>euler396()</code> should return 173214653.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler396() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler396();"
+      ],
+      "description": [
+        "For any positive integer n, the nth weak Goodstein sequence {g1, g2, g3, ...} is defined as:",
+        " g1 = n",
+        " for k > 1, gk is obtained by writing gk-1 in base k, interpreting it as a base k + 1 number, and subtracting 1.",
+        "",
+        "The sequence terminates when gk becomes 0.",
+        "",
+        "",
+        "For example, the 6th weak Goodstein sequence is {6, 11, 17, 25, ...}:",
+        " g1 = 6.",
+        " g2 = 11 since 6 = 1102, 1103 = 12, and 12 - 1 = 11.",
+        " g3 = 17 since 11 = 1023, 1024 = 18, and 18 - 1 = 17.",
+        " g4 = 25 since 17 = 1014, 1015 = 26, and 26 - 1 = 25.",
+        "",
+        "and so on.",
+        "",
+        "",
+        "It can be shown that every weak Goodstein sequence terminates.",
+        "",
+        "",
+        "Let G(n) be the number of nonzero elements in the nth weak Goodstein sequence.",
+        "It can be verified that G(2) = 3, G(4) = 21 and G(6) = 381.",
+        "It can also be verified that ΣG(n) = 2517 for 1 ≤ n < 8.",
+        "",
+        "",
+        "Find the last 9 digits of ΣG(n) for 1 ≤ n < 16."
+      ]
+    },
+    {
+      "_id": "5900f4f91000cf542c51000c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 397: Triangle on parabola",
+      "tests": [
+        "assert.strictEqual(euler397(), 141630459461893730, 'message: <code>euler397()</code> should return 141630459461893730.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler397() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler397();"
+      ],
+      "description": [
+        "On the parabola y = x2/k, three points A(a, a2/k), B(b, b2/k) and C(c, c2/k) are chosen.",
+        "",
+        "",
+        "Let F(K, X) be the number of the integer quadruplets (k, a, b, c) such that at least one angle of the triangle ABC is 45-degree, with 1 ≤ k ≤ K and -X ≤ a < b < c ≤ X.",
+        "",
+        "",
+        "For example, F(1, 10) = 41 and F(10, 100) = 12492.",
+        "Find F(106, 109)."
+      ]
+    },
+    {
+      "_id": "5900f4fa1000cf542c51000d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 398: Cutting rope",
+      "tests": [
+        "assert.strictEqual(euler398(), 2010.59096, 'message: <code>euler398()</code> should return 2010.59096.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler398() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler398();"
+      ],
+      "description": [
+        "Inside a rope of length n, n-1 points are placed with distance 1 from each other and from the endpoints. Among these points, we choose m-1 points at random and cut the rope at these points to create m segments.",
+        "",
+        "",
+        "Let E(n, m) be the expected length of the second-shortest segment.",
+        "For example, E(3, 2) = 2 and E(8, 3) = 16/7.",
+        "Note that if multiple segments have the same shortest length the length of the second-shortest segment is defined as the same as the shortest length.",
+        "",
+        "",
+        "Find E(107, 100).",
+        "Give your answer rounded to 5 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f4fc1000cf542c51000e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 399: Squarefree Fibonacci Numbers",
+      "tests": [
+        "assert.strictEqual(euler399(), 1508395636674243, 6.5e27330467, 'message: <code>euler399()</code> should return 1508395636674243, 6.5e27330467.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler399() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler399();"
+      ],
+      "description": [
+        "The first 15 fibonacci numbers are:",
+        "1,1,2,3,5,8,13,21,34,55,89,144,233,377,610.",
+        "It can be seen that 8 and 144 are not squarefree: 8 is divisible by 4 and 144 is divisible by 4 and by 9. ",
+        "So the first 13 squarefree fibonacci numbers are:",
+        "1,1,2,3,5,13,21,34,55,89,233,377 and 610.",
+        "",
+        "",
+        "The 200th squarefree fibonacci number is:",
+        "971183874599339129547649988289594072811608739584170445.",
+        "The last sixteen digits of this number are: 1608739584170445 and in scientific notation this number can be written as 9.7e53.",
+        "",
+        "",
+        "Find the 100 000 000th squarefree fibonacci number.",
+        "Give as your answer its last sixteen digits followed by a comma followed by the number in scientific notation (rounded to one digit after the decimal point).",
+        "For the 200th squarefree number the answer would have been: 1608739584170445,9.7e53",
+        "",
+        "",
+        "",
+        "Note: ",
+        "For this problem, assume that for every prime p, the first fibonacci number divisible by p is not divisible by p2 (this is part of Wall's conjecture). This has been verified for primes ≤ 3·1015, but has not been proven in general.",
+        "",
+        "If it happens that the conjecture is false, then the accepted answer to this problem isn't guaranteed to be the 100 000 000th squarefree fibonacci number, rather it represents only a lower bound for that number."
+      ]
+    },
+    {
+      "_id": "5900f4fe1000cf542c510010",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 400: Fibonacci tree game",
+      "tests": [
+        "assert.strictEqual(euler400(), 438505383468410600, 'message: <code>euler400()</code> should return 438505383468410600.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler400() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler400();"
+      ],
+      "description": [
+        "A Fibonacci tree is a binary tree recursively defined as:T(0) is the empty tree.",
+        "T(1) is the binary tree with only one node.",
+        "T(k) consists of a root node that has T(k-1) and T(k-2) as children.",
+        "",
+        "On such a tree two players play a take-away game. On each turn a player selects a node and removes that node along with the subtree rooted at that node.",
+        "The player who is forced to take the root node of the entire tree loses.",
+        "",
+        "",
+        "Here are the winning moves of the first player on the first turn for T(k) from k=1 to k=6.",
+        "",
+        "",
+        "",
+        "",
+        "Let f(k) be the number of winning moves of the first player (i.e. the moves for which the second player has no winning strategy) on the first turn of the game when this game is played on T(k).",
+        "",
+        "",
+        "",
+        "For example, f(5) = 1 and f(10) = 17.",
+        "",
+        "",
+        "",
+        "Find f(10000). Give the last 18 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900f4fd1000cf542c51000f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 401: Sum of squares of divisors",
+      "tests": [
+        "assert.strictEqual(euler401(), 281632621, 'message: <code>euler401()</code> should return 281632621.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler401() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler401();"
+      ],
+      "description": [
+        "The divisors of 6 are 1,2,3 and 6.",
+        "The sum of the squares of these numbers is 1+4+9+36=50.",
+        "",
+        "",
+        "Let sigma2(n) represent the sum of the squares of the divisors of n.",
+        "Thus sigma2(6)=50.",
+        "",
+        "Let SIGMA2 represent the summatory function of sigma2, that is SIGMA2(n)=∑sigma2(i) for i=1 to n.",
+        "The first 6 values of SIGMA2 are: 1,6,16,37,63 and 113.",
+        "",
+        "",
+        "Find SIGMA2(1015) modulo 109."
+      ]
+    },
+    {
+      "_id": "5900f4ff1000cf542c510011",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 402: Integer-valued polynomials",
+      "tests": [
+        "assert.strictEqual(euler402(), 356019862, 'message: <code>euler402()</code> should return 356019862.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler402() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler402();"
+      ],
+      "description": [
+        "It can be shown that the polynomial n4 + 4n3 + 2n2 + 5n is a multiple of 6 for every integer n. It can also be shown that 6 is the largest integer satisfying this property.",
+        "",
+        "",
+        "Define M(a, b, c) as the maximum m such that n4 + an3 + bn2 + cn is a multiple of m for all integers n. For example, M(4, 2, 5) = 6.",
+        "",
+        "",
+        "Also, define S(N) as the sum of M(a, b, c) for all 0 < a, b, c ≤ N.",
+        "",
+        "",
+        "We can verify that S(10) = 1972 and S(10000) = 2024258331114.",
+        "",
+        "",
+        "Let Fk be the Fibonacci sequence:",
+        "F0 = 0, F1 = 1 and",
+        "Fk = Fk-1 + Fk-2 for k ≥ 2.",
+        "",
+        "",
+        "Find the last 9 digits of Σ S(Fk) for 2 ≤ k ≤ 1234567890123."
+      ]
+    },
+    {
+      "_id": "5900f5001000cf542c510013",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 403: Lattice points enclosed by parabola and line",
+      "tests": [
+        "assert.strictEqual(euler403(), 18224771, 'message: <code>euler403()</code> should return 18224771.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler403() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler403();"
+      ],
+      "description": [
+        "For integers a and b, we define D(a, b) as the domain enclosed by the parabola y = x2 and the line y = a·x + b:D(a, b) = { (x, y) | x2 ≤ y ≤ a·x + b }.",
+        "",
+        "",
+        "L(a, b) is defined as the number of lattice points contained in D(a, b).",
+        "For example, L(1, 2) = 8 and L(2, -1) = 1.",
+        "",
+        "",
+        "We also define S(N) as the sum of L(a, b) for all the pairs (a, b) such that the area of D(a, b) is a rational number and |a|,|b| ≤ N.",
+        "We can verify that S(5) = 344 and S(100) = 26709528.",
+        "",
+        "",
+        "Find S(1012). Give your answer mod 108."
+      ]
+    },
+    {
+      "_id": "5900f5001000cf542c510012",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 404: Crisscross Ellipses",
+      "tests": [
+        "assert.strictEqual(euler404(), 1199215615081353, 'message: <code>euler404()</code> should return 1199215615081353.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler404() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler404();"
+      ],
+      "description": [
+        "Ea is an ellipse with an equation of the form x2 + 4y2 = 4a2.",
+        "Ea' is the rotated image of Ea by θ degrees counterclockwise around the origin O(0, 0) for 0° < θ < 90°.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "b is the distance to the origin of the two intersection points closest to the origin and c is the distance of the two other intersection points.",
+        "We call an ordered triplet (a, b, c) a canonical ellipsoidal triplet if a, b and c are positive integers.",
+        "For example, (209, 247, 286) is a canonical ellipsoidal triplet.",
+        "",
+        "",
+        "",
+        "Let C(N) be the number of distinct canonical ellipsoidal triplets (a, b, c) for a ≤ N.",
+        "It can be verified that C(103) = 7, C(104) = 106 and C(106) = 11845.",
+        "",
+        "",
+        "",
+        "Find C(1017)."
+      ]
+    },
+    {
+      "_id": "5900f5021000cf542c510014",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 405: A rectangular tiling",
+      "tests": [
+        "assert.strictEqual(euler405(), 237696125, 'message: <code>euler405()</code> should return 237696125.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler405() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler405();"
+      ],
+      "description": [
+        "We wish to tile a rectangle whose length is twice its width.",
+        "Let T(0) be the tiling consisting of a single rectangle.",
+        "For n > 0, let T(n) be obtained from T(n-1) by replacing all tiles in the following manner:",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "The following animation demonstrates the tilings T(n) for n from 0 to 5:",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "Let f(n) be the number of points where four tiles meet in T(n).",
+        "For example, f(1) = 0, f(4) = 82 and f(109) mod 177 = 126897180.",
+        "",
+        "",
+        "",
+        "Find f(10k) for k = 1018, give your answer modulo 177."
+      ]
+    },
+    {
+      "_id": "5900f5021000cf542c510015",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 406: Guessing Game",
+      "tests": [
+        "assert.strictEqual(euler406(), 36813.12757207, 'message: <code>euler406()</code> should return 36813.12757207.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler406() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler406();"
+      ],
+      "description": [
+        "We are trying to find a hidden number selected from the set of integers {1, 2, ..., n} by asking questions. ",
+        "Each number (question) we ask, we get one of three possible answers: \"Your guess is lower than the hidden number\" (and you incur a cost of a), or",
+        " \"Your guess is higher than the hidden number\" (and you incur a cost of b), or",
+        " \"Yes, that's it!\" (and the game ends).",
+        "Given the value of n, a, and b, an optimal strategy minimizes the total cost for the worst possible case.",
+        "",
+        "For example, if n = 5, a = 2, and b = 3, then we may begin by asking \"2\" as our first question.",
+        "",
+        "If we are told that 2 is higher than the hidden number (for a cost of b=3), then we are sure that \"1\" is the hidden number (for a total cost of 3).",
+        "If we are told that 2 is lower than the hidden number (for a cost of a=2), then our next question will be \"4\".",
+        "If we are told that 4 is higher than the hidden number (for a cost of b=3), then we are sure that \"3\" is the hidden number (for a total cost of 2+3=5).",
+        "If we are told that 4 is lower than the hidden number (for a cost of a=2), then we are sure that \"5\" is the hidden number (for a total cost of 2+2=4).",
+        "Thus, the worst-case cost achieved by this strategy is 5. It can also be shown that this is the lowest worst-case cost that can be achieved. ",
+        "So, in fact, we have just described an optimal strategy for the given values of n, a, and b.",
+        "",
+        "Let C(n, a, b) be the worst-case cost achieved by an optimal strategy for the given values of n, a, and b.",
+        "",
+        "Here are a few examples:",
+        "C(5, 2, 3) = 5",
+        "C(500, √2, √3) = 13.22073197...",
+        "C(20000, 5, 7) = 82",
+        "C(2000000, √5, √7) = 49.63755955...",
+        "",
+        "Let Fk be the Fibonacci numbers: Fk = Fk-1 + Fk-2 with base cases F1 = F2 = 1.Find ∑1≤k≤30 C(1012, √k, √Fk), and give your answer rounded to 8 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f5041000cf542c510016",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 407: Idempotents",
+      "tests": [
+        "assert.strictEqual(euler407(), 39782849136421, 'message: <code>euler407()</code> should return 39782849136421.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler407() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler407();"
+      ],
+      "description": [
+        "If we calculate a2 mod 6 for 0 ≤ a ≤ 5 we get: 0,1,4,3,4,1.",
+        "",
+        "",
+        "The largest value of a such that a2 ≡ a mod 6 is 4.",
+        "Let's call M(n) the largest value of a < n such that a2 ≡ a (mod n).",
+        "So M(6) = 4.",
+        "",
+        "",
+        "Find ∑M(n) for 1 ≤ n ≤ 107."
+      ]
+    },
+    {
+      "_id": "5900f5091000cf542c51001b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 408: Admissible paths through a grid",
+      "tests": [
+        "assert.strictEqual(euler408(), 299742733, 'message: <code>euler408()</code> should return 299742733.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler408() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler408();"
+      ],
+      "description": [
+        "Let's call a lattice point (x, y) inadmissible if x, y and x + y are all positive perfect squares.",
+        "For example, (9, 16) is inadmissible, while (0, 4), (3, 1) and (9, 4) are not.",
+        "",
+        "Consider a path from point (x1, y1) to point (x2, y2) using only unit steps north or east.",
+        "Let's call such a path admissible if none of its intermediate points are inadmissible.",
+        "",
+        "Let P(n) be the number of admissible paths from (0, 0) to (n, n).",
+        "It can be verified that P(5) = 252, P(16) = 596994440 and P(1000) mod 1 000 000 007 = 341920854.",
+        "",
+        "Find P(10 000 000) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f5061000cf542c510017",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 409: Nim Extreme",
+      "tests": [
+        "assert.strictEqual(euler409(), 253223948, 'message: <code>euler409()</code> should return 253223948.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler409() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler409();"
+      ],
+      "description": [
+        "Let n be a positive integer. Consider nim positions where:There are n non-empty piles.",
+        "Each pile has size less than 2n.",
+        "No two piles have the same size.",
+        "Let W(n) be the number of winning nim positions satisfying the above",
+        "conditions (a position is winning if the first player has a winning strategy). For example, W(1) = 1, W(2) = 6, W(3) = 168, W(5) = 19764360 and W(100) mod 1 000 000 007 = 384777056.",
+        "",
+        "Find W(10 000 000) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f5071000cf542c510018",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 410: Circle and tangent line",
+      "tests": [
+        "assert.strictEqual(euler410(), 799999783589946600, 'message: <code>euler410()</code> should return 799999783589946600.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler410() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler410();"
+      ],
+      "description": [
+        "Let C be the circle with radius r, x2 + y2 = r2. We choose two points P(a, b) and Q(-a, c) so that the line passing through P and Q is tangent to C.",
+        "",
+        "For example, the quadruplet (r, a, b, c) = (2, 6, 2, -7) satisfies this property.",
+        "",
+        "Let F(R, X) be the number of the integer quadruplets (r, a, b, c) with this property, and with 0 < r ≤ R and 0 < a ≤ X.",
+        "",
+        "We can verify that F(1, 5) = 10, F(2, 10) = 52 and F(10, 100) = 3384.",
+        "Find F(108, 109) + F(109, 108)."
+      ]
+    },
+    {
+      "_id": "5900f5081000cf542c510019",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 411: Uphill paths",
+      "tests": [
+        "assert.strictEqual(euler411(), 9936352, 'message: <code>euler411()</code> should return 9936352.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler411() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler411();"
+      ],
+      "description": [
+        "Let n be a positive integer. Suppose there are stations at the coordinates (x, y) = (2i mod n, 3i mod n) for 0 ≤ i ≤ 2n. We will consider stations with the same coordinates as the same station.",
+        "",
+        "We wish to form a path from (0, 0) to (n, n) such that the x and y coordinates never decrease.",
+        "Let S(n) be the maximum number of stations such a path can pass through.",
+        "",
+        "For example, if n = 22, there are 11 distinct stations, and a valid path can pass through at most 5 stations. Therefore, S(22) = 5.",
+        "The case is illustrated below, with an example of an optimal path:",
+        "",
+        "",
+        "",
+        "It can also be verified that S(123) = 14 and S(10000) = 48.",
+        "",
+        "Find ∑ S(k5) for 1 ≤ k ≤ 30."
+      ]
+    },
+    {
+      "_id": "5900f5081000cf542c51001a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 412: Gnomon numbering",
+      "tests": [
+        "assert.strictEqual(euler412(), 38788800, 'message: <code>euler412()</code> should return 38788800.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler412() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler412();"
+      ],
+      "description": [
+        "For integers m, n (0 ≤ n < m), let L(m, n) be an m×m grid with the top-right n×n grid removed.",
+        "",
+        "For example, L(5, 3) looks like this:",
+        "",
+        "",
+        "",
+        "We want to number each cell of L(m, n) with consecutive integers 1, 2, 3, ... such that the number in every cell is smaller than the number below it and to the left of it.",
+        "",
+        "For example, here are two valid numberings of L(5, 3):",
+        "",
+        "",
+        "Let LC(m, n) be the number of valid numberings of L(m, n).",
+        "It can be verified that LC(3, 0) = 42, LC(5, 3) = 250250, LC(6, 3) = 406029023400 and LC(10, 5) mod 76543217 = 61251715.",
+        "",
+        "Find LC(10000, 5000) mod 76543217."
+      ]
+    },
+    {
+      "_id": "5900f50a1000cf542c51001c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 413: One-child Numbers",
+      "tests": [
+        "assert.strictEqual(euler413(), 3079418648040719, 'message: <code>euler413()</code> should return 3079418648040719.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler413() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler413();"
+      ],
+      "description": [
+        "We say that a d-digit positive number (no leading zeros) is a one-child number if exactly one of its sub-strings is divisible by d.",
+        "",
+        "For example, 5671 is a 4-digit one-child number. Among all its sub-strings 5, 6, 7, 1, 56, 67, 71, 567, 671 and 5671, only 56 is divisible by 4.",
+        "Similarly, 104 is a 3-digit one-child number because only 0 is divisible by 3.",
+        "1132451 is a 7-digit one-child number because only 245 is divisible by 7.",
+        "",
+        "Let F(N) be the number of the one-child numbers less than N.",
+        "We can verify that F(10) = 9, F(103) = 389 and F(107) = 277674.",
+        "",
+        "Find F(1019)."
+      ]
+    },
+    {
+      "_id": "5900f50b1000cf542c51001d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 414: Kaprekar constant",
+      "tests": [
+        "assert.strictEqual(euler414(), 552506775824935500, 'message: <code>euler414()</code> should return 552506775824935500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler414() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler414();"
+      ],
+      "description": [
+        "6174 is a remarkable number; if we sort its digits in increasing order and subtract that number from the number you get when you sort the digits in decreasing order, we get 7641-1467=6174.",
+        "Even more remarkable is that if we start from any 4 digit number and repeat this process of sorting and subtracting, we'll eventually end up with 6174 or immediately with 0 if all digits are equal. ",
+        "This also works with numbers that have less than 4 digits if we pad the number with leading zeroes until we have 4 digits.",
+        "E.g. let's start with the number 0837:",
+        "8730-0378=8352",
+        "8532-2358=6174",
+        "",
+        "",
+        "6174 is called the Kaprekar constant. The process of sorting and subtracting and repeating this until either 0 or the Kaprekar constant is reached is called the Kaprekar routine.",
+        "",
+        "",
+        "We can consider the Kaprekar routine for other bases and number of digits. ",
+        "Unfortunately, it is not guaranteed a Kaprekar constant exists in all cases; either the routine can end up in a cycle for some input numbers or the constant the routine arrives at can be different for different input numbers.",
+        "However, it can be shown that for 5 digits and a base b = 6t+3≠9, a Kaprekar constant exists.",
+        "E.g. base 15: (10,4,14,9,5)15",
+        "base 21: (14,6,20,13,7)21",
+        "",
+        "Define Cb to be the Kaprekar constant in base b for 5 digits.",
+        "Define the function sb(i) to be",
+        " 0 if i = Cb or if i written in base b consists of 5 identical digits",
+        " the number of iterations it takes the Kaprekar routine in base b to arrive at Cb, otherwise",
+        "",
+        "Note that we can define sb(i) for all integers i < b5. If i written in base b takes less than 5 digits, the number is padded with leading zero digits until we have 5 digits before applying the Kaprekar routine.",
+        "",
+        "",
+        "Define S(b) as the sum of sb(i) for 0 < i < b5.",
+        "E.g. S(15) = 5274369 ",
+        "S(111) = 400668930299",
+        "",
+        "",
+        "Find the sum of S(6k+3) for 2 ≤ k ≤ 300.",
+        "Give the last 18 digits as your answer."
+      ]
+    },
+    {
+      "_id": "5900f50c1000cf542c51001e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 415: Titanic sets",
+      "tests": [
+        "assert.strictEqual(euler415(), 55859742, 'message: <code>euler415()</code> should return 55859742.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler415() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler415();"
+      ],
+      "description": [
+        "A set of lattice points S is called a titanic set if there exists a line passing through exactly two points in S.",
+        "",
+        "An example of a titanic set is S = {(0, 0), (0, 1), (0, 2), (1, 1), (2, 0), (1, 0)}, where the line passing through (0, 1) and (2, 0) does not pass through any other point in S.",
+        "",
+        "On the other hand, the set {(0, 0), (1, 1), (2, 2), (4, 4)} is not a titanic set since the line passing through any two points in the set also passes through the other two.",
+        "",
+        "For any positive integer N, let T(N) be the number of titanic sets S whose every point (x, y) satisfies 0 ≤ x, y ≤ N.",
+        "It can be verified that T(1) = 11, T(2) = 494, T(4) = 33554178, T(111) mod 108 = 13500401 and T(105) mod 108 = 63259062.",
+        "",
+        "Find T(1011) mod 108."
+      ]
+    },
+    {
+      "_id": "5900f50e1000cf542c510020",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 416: A frog's trip",
+      "tests": [
+        "assert.strictEqual(euler416(), 898082747, 'message: <code>euler416()</code> should return 898082747.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler416() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler416();"
+      ],
+      "description": [
+        "A row of n squares contains a frog in the leftmost square. By successive jumps the frog goes to the rightmost square and then back to the leftmost square. On the outward trip he jumps one, two or three squares to the right, and on the homeward trip he jumps to the left in a similar manner. He cannot jump outside the squares. He repeats the round-trip travel m times.",
+        "",
+        "Let F(m, n) be the number of the ways the frog can travel so that at most one square remains unvisited.",
+        "For example, F(1, 3) = 4, F(1, 4) = 15, F(1, 5) = 46, F(2, 3) = 16 and F(2, 100) mod 109 = 429619151.",
+        "",
+        "Find the last 9 digits of F(10, 1012)."
+      ]
+    },
+    {
+      "_id": "5900f50d1000cf542c51001f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 417: Reciprocal cycles II",
+      "tests": [
+        "assert.strictEqual(euler417(), 446572970925740, 'message: <code>euler417()</code> should return 446572970925740.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler417() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler417();"
+      ],
+      "description": [
+        "A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:",
+        "",
+        "1/2= 0.5",
+        "1/3= 0.(3)",
+        "1/4= 0.25",
+        "1/5= 0.2",
+        "1/6= 0.1(6)",
+        "1/7= 0.(142857)",
+        "1/8= 0.125",
+        "1/9= 0.(1)",
+        "1/10= 0.1",
+        "",
+        "Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.",
+        "",
+        "Unit fractions whose denominator has no other prime factors than 2 and/or 5 are not considered to have a recurring cycle.",
+        "We define the length of the recurring cycle of those unit fractions as 0. ",
+        "",
+        "",
+        "Let L(n) denote the length of the recurring cycle of 1/n.",
+        "You are given that ∑L(n) for 3 ≤ n ≤ 1 000 000 equals 55535191115.",
+        "",
+        "",
+        "Find ∑L(n) for 3 ≤ n ≤ 100 000 000"
+      ]
+    },
+    {
+      "_id": "5900f50f1000cf542c510021",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 418: Factorisation triples",
+      "tests": [
+        "assert.strictEqual(euler418(), 1177163565297340400, 'message: <code>euler418()</code> should return 1177163565297340400.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler418() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler418();"
+      ],
+      "description": [
+        "Let n be a positive integer. An integer triple (a, b, c) is called a factorisation triple of n if: 1 ≤ a ≤ b ≤ c",
+        " a·b·c = n.",
+        "",
+        "Define f(n) to be a + b + c for the factorisation triple (a, b, c) of n which minimises c / a. One can show that this triple is unique.",
+        "",
+        "",
+        "For example, f(165) = 19, f(100100) = 142 and f(20!) = 4034872.",
+        "",
+        "",
+        "Find f(43!)."
+      ]
+    },
+    {
+      "_id": "5900f5101000cf542c510022",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 419: Look and say sequence",
+      "tests": [
+        "assert.strictEqual(euler419(), 998567458, 1046245404, 43363922, 'message: <code>euler419()</code> should return 998567458, 1046245404, 43363922.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler419() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler419();"
+      ],
+      "description": [
+        "The look and say sequence goes 1, 11, 21, 1211, 111221, 312211, 13112221, 1113213211, ...",
+        "The sequence starts with 1 and all other members are obtained by describing the previous member in terms of consecutive digits.",
+        "It helps to do this out loud:",
+        "1 is 'one one' → 11",
+        "11 is 'two ones' → 21",
+        "21 is 'one two and one one' → 1211 ",
+        "1211 is 'one one, one two and two ones' → 111221",
+        "111221 is 'three ones, two twos and one one' → 312211",
+        "...",
+        "",
+        "",
+        "Define A(n), B(n) and C(n) as the number of ones, twos and threes in the n'th element of the sequence respectively.",
+        "One can verify that A(40) = 31254, B(40) = 20259 and C(40) = 11625.",
+        "",
+        "",
+        "Find A(n), B(n) and C(n) for n = 1012. ",
+        "Give your answer modulo 230 and separate your values for A, B and C by a comma. ",
+        "E.g. for n = 40 the answer would be 31254,20259,11625"
+      ]
+    },
+    {
+      "_id": "5900f5111000cf542c510023",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 420: 2x2 positive integer matrix",
+      "tests": [
+        "assert.strictEqual(euler420(), 145159332, 'message: <code>euler420()</code> should return 145159332.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler420() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler420();"
+      ],
+      "description": [
+        "A positive integer matrix is a matrix whose elements are all positive integers.",
+        "Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example:",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "We define F(N) as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways.",
+        "We can verify that F(50) = 7 and F(1000) = 1019.",
+        "",
+        "",
+        "",
+        "Find F(107)."
+      ]
+    },
+    {
+      "_id": "5900f5131000cf542c510024",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 421: Prime factors of n15+1",
+      "tests": [
+        "assert.strictEqual(euler421(), 2304215802083466200, 'message: <code>euler421()</code> should return 2304215802083466200.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler421() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler421();"
+      ],
+      "description": [
+        "Numbers of the form n15+1 are composite for every integer n > 1.",
+        "For positive integers n and m let s(n,m) be defined as the sum of the distinct prime factors of n15+1 not exceeding m.",
+        "",
+        "E.g. 215+1 = 3×3×11×331.",
+        "So s(2,10) = 3 and s(2,1000) = 3+11+331 = 345.",
+        "",
+        "Also 1015+1 = 7×11×13×211×241×2161×9091.",
+        "So s(10,100) = 31 and s(10,1000) = 483.",
+        "Find ∑ s(n,108) for 1 ≤ n ≤ 1011."
+      ]
+    },
+    {
+      "_id": "5900f5131000cf542c510025",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 422: Sequence of points on a hyperbola",
+      "tests": [
+        "assert.strictEqual(euler422(), 92060460, 'message: <code>euler422()</code> should return 92060460.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler422() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler422();"
+      ],
+      "description": [
+        "Let H be the hyperbola defined by the equation 12x2 + 7xy - 12y2 = 625.",
+        "",
+        "Next, define X as the point (7, 1). It can be seen that X is in H.",
+        "",
+        "Now we define a sequence of points in H, {Pi : i ≥ 1}, as:",
+        " P1 = (13, 61/4).",
+        " P2 = (-43/6, -4).",
+        " For i > 2, Pi is the unique point in H that is different from Pi-1 and such that line PiPi-1 is parallel to line Pi-2X. It can be shown that Pi is well-defined, and that its coordinates are always rational.",
+        "You are given that P3  = (-19/2, -229/24), P4 = (1267/144, -37/12) and P7 = (17194218091/143327232, 274748766781/1719926784).",
+        "",
+        "Find Pn for n = 1114 in the following format:If Pn = (a/b, c/d) where the fractions are in lowest terms and the denominators are positive, then the answer is (a + b + c + d) mod 1 000 000 007.",
+        "",
+        "For n = 7, the answer would have been: 806236837."
+      ]
+    },
+    {
+      "_id": "5900f5141000cf542c510027",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 423: Consecutive die throws",
+      "tests": [
+        "assert.strictEqual(euler423(), 653972374, 'message: <code>euler423()</code> should return 653972374.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler423() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler423();"
+      ],
+      "description": [
+        "Let n be a positive integer.",
+        "A 6-sided die is thrown n times. Let c be the number of pairs of consecutive throws that give the same value.",
+        "",
+        "For example, if n = 7 and the values of the die throws are (1,1,5,6,6,6,3), then the following pairs of consecutive throws give the same value:",
+        "(1,1,5,6,6,6,3)",
+        "(1,1,5,6,6,6,3)",
+        "(1,1,5,6,6,6,3)",
+        "Therefore, c = 3 for (1,1,5,6,6,6,3).",
+        "",
+        "Define C(n) as the number of outcomes of throwing a 6-sided die n times such that c does not exceed π(n).1",
+        "For example, C(3) = 216, C(4) = 1290, C(11) = 361912500 and C(24) = 4727547363281250000.",
+        "",
+        "Define S(L) as ∑ C(n) for 1 ≤ n ≤ L.",
+        "For example, S(50) mod 1 000 000 007 = 832833871.",
+        "",
+        "Find S(50 000 000) mod 1 000 000 007.",
+        "",
+        "1 π denotes the prime-counting function, i.e. π(n) is the number of primes ≤ n."
+      ]
+    },
+    {
+      "_id": "5900f5141000cf542c510026",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 424: Kakuro",
+      "tests": [
+        "assert.strictEqual(euler424(), 1059760019628, 'message: <code>euler424()</code> should return 1059760019628.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler424() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler424();"
+      ],
+      "description": [
+        "The above is an example of a cryptic kakuro (also known as cross sums, or even sums cross) puzzle, with its final solution on the right. (The common rules of kakuro puzzles can be found easily on numerous internet sites. Other related information can also be currently found at krazydad.com whose author has provided the puzzle data for this challenge.)",
+        "",
+        "The downloadable text file (kakuro200.txt) contains the description of 200 such puzzles, a mix of 5x5 and 6x6 types. The first puzzle in the file is the above example which is coded as follows:",
+        "",
+        "6,X,X,(vCC),(vI),X,X,X,(hH),B,O,(vCA),(vJE),X,(hFE,vD),O,O,O,O,(hA),O,I,(hJC,vB),O,O,(hJC),H,O,O,O,X,X,X,(hJE),O,O,X",
+        "",
+        "The first character is a numerical digit indicating the size of the information grid. It would be either a 6 (for a 5x5 kakuro puzzle) or a 7 (for a 6x6 puzzle) followed by a comma (,). The extra top line and left column are needed to insert information.",
+        "",
+        "The content of each cell is then described and followed by a comma, going left to right and starting with the top line.",
+        "X = Gray cell, not required to be filled by a digit.",
+        "O (upper case letter)= White empty cell to be filled by a digit.",
+        "A = Or any one of the upper case letters from A to J to be replaced by its equivalent digit in the solved puzzle.",
+        "( ) = Location of the encrypted sums. Horizontal sums are preceded by a lower case \"h\" and vertical sums are preceded by a lower case \"v\". Those are followed by one or two upper case letters depending if the sum is a single digit or double digit one. For double digit sums, the first letter would be for the \"tens\" and the second one for the \"units\". When the cell must contain information for both a horizontal and a vertical sum, the first one is always for the horizontal sum and the two are separated by a comma within the same set of brackets, ex.: (hFE,vD). Each set of brackets is also immediately followed by a comma.",
+        "",
+        "The description of the last cell is followed by a Carriage Return/Line Feed (CRLF) instead of a comma.",
+        "",
+        "The required answer to each puzzle is based on the value of each letter necessary to arrive at the solution and according to the alphabetical order. As indicated under the example puzzle, its answer would be 8426039571. At least 9 out of the 10 encrypting letters are always part of the problem description. When only 9 are given, the missing one must be assigned the remaining digit.",
+        "",
+        "You are given that the sum of the answers for the first 10 puzzles in the file is 64414157580.",
+        "",
+        "Find the sum of the answers for the 200 puzzles."
+      ]
+    },
+    {
+      "_id": "5900f5151000cf542c510028",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 425: Prime connection",
+      "tests": [
+        "assert.strictEqual(euler425(), 46479497324, 'message: <code>euler425()</code> should return 46479497324.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler425() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler425();"
+      ],
+      "description": [
+        "Two positive numbers A and B are said to be connected (denoted by \"A ↔ B\") if one of these conditions holds:",
+        "(1) A and B have the same length and differ in exactly one digit; for example, 123 ↔ 173.",
+        "(2) Adding one digit to the left of A (or B) makes B (or A); for example, 23 ↔ 223 and 123 ↔ 23.",
+        "",
+        "",
+        "We call a prime P a 2's relative if there exists a chain of connected primes between 2 and P and no prime in the chain exceeds P.",
+        "",
+        "",
+        "For example, 127 is a 2's relative. One of the possible chains is shown below:",
+        "2 ↔ 3 ↔ 13 ↔ 113 ↔ 103 ↔ 107 ↔ 127",
+        "However, 11 and 103 are not 2's relatives.",
+        "",
+        "",
+        "Let F(N) be the sum of the primes ≤ N which are not 2's relatives.",
+        "We can verify that F(103) = 431 and F(104) = 78728.",
+        "",
+        "",
+        "Find F(107)."
+      ]
+    },
+    {
+      "_id": "5900f5171000cf542c510029",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 426: Box-ball system",
+      "tests": [
+        "assert.strictEqual(euler426(), 31591886008, 'message: <code>euler426()</code> should return 31591886008.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler426() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler426();"
+      ],
+      "description": [
+        "Consider an infinite row of boxes. Some of the boxes contain a ball. For example, an initial configuration of 2 consecutive occupied boxes followed by 2 empty boxes, 2 occupied boxes, 1 empty box, and 2 occupied boxes can be denoted by the sequence (2, 2, 2, 1, 2), in which the number of consecutive occupied and empty boxes appear alternately.",
+        "",
+        "",
+        "A turn consists of moving each ball exactly once according to the following rule: Transfer the leftmost ball which has not been moved to the nearest empty box to its right.",
+        "",
+        "",
+        "After one turn the sequence (2, 2, 2, 1, 2) becomes (2, 2, 1, 2, 3) as can be seen below; note that we begin the new sequence starting at the first occupied box.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "A system like this is called a Box-Ball System or BBS for short.",
+        "",
+        "",
+        "It can be shown that after a sufficient number of turns, the system evolves to a state where the consecutive numbers of occupied boxes is invariant. In the example below, the consecutive numbers of occupied boxes evolves to [1, 2, 3]; we shall call this the final state.",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "We define the sequence {ti}:s0 = 290797",
+        "sk+1 = sk2 mod 50515093",
+        "tk = (sk mod 64) + 1",
+        "",
+        "Starting from the initial configuration (t0, t1, …, t10), the final state becomes [1, 3, 10, 24, 51, 75].",
+        "Starting from the initial configuration (t0, t1, …, t10 000 000), find the final state.",
+        "Give as your answer the sum of the squares of the elements of the final state. For example, if the final state is [1, 2, 3] then 14 ( = 12 + 22 + 32) is your answer."
+      ]
+    },
+    {
+      "_id": "5900f5181000cf542c51002a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 427: n-sequences",
+      "tests": [
+        "assert.strictEqual(euler427(), 97138867, 'message: <code>euler427()</code> should return 97138867.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler427() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler427();"
+      ],
+      "description": [
+        "A sequence of integers S = {si} is called an n-sequence if it has n elements and each element si satisfies 1 ≤ si ≤ n. Thus there are nn distinct n-sequences in total.",
+        "For example, the sequence S = {1, 5, 5, 10, 7, 7, 7, 2, 3, 7} is a 10-sequence.",
+        "",
+        "For any sequence S, let L(S) be the length of the longest contiguous subsequence of S with the same value.",
+        "For example, for the given sequence S above, L(S) = 3, because of the three consecutive 7's.",
+        "",
+        "Let f(n) = ∑ L(S) for all n-sequences S.",
+        "",
+        "For example, f(3) = 45, f(7) = 1403689 and f(11) = 481496895121.",
+        "",
+        "Find f(7 500 000) mod 1 000 000 009."
+      ]
+    },
+    {
+      "_id": "5900f5191000cf542c51002b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 428: About Project Euler",
+      "tests": [
+        "assert.strictEqual(euler428(), 747215561862, 'message: <code>euler428()</code> should return 747215561862.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler428() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler428();"
+      ],
+      "description": [
+        ""
+      ]
+    },
+    {
+      "_id": "5900f5191000cf542c51002c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 429: Sum of squares of unitary divisors",
+      "tests": [
+        "assert.strictEqual(euler429(), 98792821, 'message: <code>euler429()</code> should return 98792821.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler429() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler429();"
+      ],
+      "description": [
+        "A unitary divisor d of a number n is a divisor of n that has the property gcd(d, n/d) = 1.",
+        "The unitary divisors of 4! = 24 are 1, 3, 8 and 24.",
+        "The sum of their squares is 12 + 32 + 82 + 242 = 650.",
+        "",
+        "",
+        "Let S(n) represent the sum of the squares of the unitary divisors of n. Thus S(4!)=650.",
+        "",
+        "",
+        "Find S(100 000 000!) modulo 1 000 000 009."
+      ]
+    },
+    {
+      "_id": "5900f51a1000cf542c51002d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 430: Range flips",
+      "tests": [
+        "assert.strictEqual(euler430(), 5000624921.38, 'message: <code>euler430()</code> should return 5000624921.38.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler430() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler430();"
+      ],
+      "description": [
+        "N disks are placed in a row, indexed 1 to N from left to right.",
+        "Each disk has a black side and white side. Initially all disks show their white side.",
+        "",
+        "At each turn, two, not necessarily distinct, integers A and B between 1 and N (inclusive) are chosen uniformly at random.",
+        "All disks with an index from A to B (inclusive) are flipped.",
+        "",
+        "The following example shows the case N = 8. At the first turn A = 5 and B = 2, and at the second turn A = 4 and B = 6.",
+        "",
+        "",
+        "",
+        "Let E(N, M) be the expected number of disks that show their white side after M turns.",
+        "We can verify that E(3, 1) = 10/9, E(3, 2) = 5/3, E(10, 4) ≈ 5.157 and E(100, 10) ≈ 51.893.",
+        "",
+        "Find E(1010, 4000).",
+        "Give your answer rounded to 2 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f51b1000cf542c51002e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 431: Square Space Silo",
+      "tests": [
+        "assert.strictEqual(euler431(), 23.386029052, 'message: <code>euler431()</code> should return 23.386029052.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler431() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler431();"
+      ],
+      "description": [
+        "Fred the farmer arranges to have a new storage silo installed on his farm and having an obsession for all things square he is absolutely devastated when he discovers that it is circular. Quentin, the representative from the company that installed the silo, explains that they only manufacture cylindrical silos, but he points out that it is resting on a square base. Fred is not amused and insists that it is removed from his property.",
+        "",
+        "Quick thinking Quentin explains that when granular materials are delivered from above a conical slope is formed and the natural angle made with the horizontal is called the angle of repose. For example if the angle of repose, $\\alpha = 30$ degrees, and grain is delivered at the centre of the silo then a perfect cone will form towards the top of the cylinder. In the case of this silo, which has a diameter of 6m, the amount of space wasted would be approximately 32.648388556 m3. However, if grain is delivered at a point on the top which has a horizontal distance of $x$ metres from the centre then a cone with a strangely curved and sloping base is formed. He shows Fred a picture.",
+        "",
+        "",
+        "   ",
+        "",
+        "We shall let the amount of space wasted in cubic metres be given by $V(x)$. If $x = 1.114785284$, which happens to have three squared decimal places, then the amount of space wasted, $V(1.114785284) \\approx 36$. Given the range of possible solutions to this problem there is exactly one other option: $V(2.511167869) \\approx 49$. It would be like knowing that the square is king of the silo, sitting in splendid glory on top of your grain.",
+        "",
+        "Fred's eyes light up with delight at this elegant resolution, but on closer inspection of Quentin's drawings and calculations his happiness turns to despondency once more. Fred points out to Quentin that it's the radius of the silo that is 6 metres, not the diameter, and the angle of repose for his grain is 40 degrees. However, if Quentin can find a set of solutions for this particular silo then he will be more than happy to keep it.",
+        "",
+        "If Quick thinking Quentin is to satisfy frustratingly fussy Fred the farmer's appetite for all things square then determine the values of $x$ for all possible square space wastage options and calculate $\\sum x$ correct to 9 decimal places."
+      ]
+    },
+    {
+      "_id": "5900f51e1000cf542c510030",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 432: Totient sum",
+      "tests": [
+        "assert.strictEqual(euler432(), 754862080, 'message: <code>euler432()</code> should return 754862080.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler432() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler432();"
+      ],
+      "description": [
+        "Let S(n,m) = ∑φ(n × i) for 1 ≤ i ≤ m. (φ is Euler's totient function)",
+        "You are given that S(510510,106 )= 45480596821125120. ",
+        "",
+        "",
+        "Find S(510510,1011).",
+        "Give the last 9 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900f51d1000cf542c51002f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 433: Steps in Euclid's algorithm",
+      "tests": [
+        "assert.strictEqual(euler433(), 326624372659664, 'message: <code>euler433()</code> should return 326624372659664.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler433() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler433();"
+      ],
+      "description": [
+        "Let E(x0, y0) be the number of steps it takes to determine the greatest common divisor of x0 and y0 with Euclid's algorithm. More formally:x1 = y0, y1 = x0 mod y0xn = yn-1, yn = xn-1 mod yn-1",
+        "E(x0, y0) is the smallest n such that yn = 0.",
+        "",
+        "",
+        "We have E(1,1) = 1, E(10,6) = 3 and E(6,10) = 4.",
+        "",
+        "",
+        "Define S(N) as the sum of E(x,y) for 1 ≤ x,y ≤ N.",
+        "We have S(1) = 1, S(10) = 221 and S(100) = 39826.",
+        "",
+        "",
+        "Find S(5·106)."
+      ]
+    },
+    {
+      "_id": "5900f51f1000cf542c510031",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 434: Rigid graphs",
+      "tests": [
+        "assert.strictEqual(euler434(), 863253606, 'message: <code>euler434()</code> should return 863253606.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler434() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler434();"
+      ],
+      "description": [
+        "Recall that a graph is a collection of vertices and edges connecting the vertices, and that two vertices connected by an edge are called adjacent.",
+        "Graphs can be embedded in Euclidean space by associating each vertex with a point in the Euclidean space.",
+        "A flexible graph is an embedding of a graph where it is possible to move one or more vertices continuously so that the distance between at least two nonadjacent vertices is altered while the distances between each pair of adjacent vertices is kept constant.",
+        "A rigid graph is an embedding of a graph which is not flexible.",
+        "Informally, a graph is rigid if by replacing the vertices with fully rotating hinges and the edges with rods that are unbending and inelastic, no parts of the graph can be moved independently from the rest of the graph.",
+        "",
+        "The grid graphs embedded in the Euclidean plane are not rigid, as the following animation demonstrates:",
+        "However, one can make them rigid by adding diagonal edges to the cells. For example, for the 2x3 grid graph, there are 19 ways to make the graph rigid:",
+        "Note that for the purposes of this problem, we do not consider changing the orientation of a diagonal edge or adding both diagonal edges to a cell as a different way of making a grid graph rigid.",
+        "",
+        "Let R(m,n) be the number of ways to make the m × n grid graph rigid. ",
+        "E.g. R(2,3) = 19 and R(5,5) = 23679901",
+        "",
+        "Define S(N) as ∑R(i,j) for 1 ≤ i, j ≤ N.",
+        "E.g. S(5) = 25021721.",
+        "Find S(100), give your answer modulo 1000000033"
+      ]
+    },
+    {
+      "_id": "5900f5201000cf542c510032",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 435: Polynomials of Fibonacci numbers",
+      "tests": [
+        "assert.strictEqual(euler435(), 252541322550, 'message: <code>euler435()</code> should return 252541322550.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler435() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler435();"
+      ],
+      "description": [
+        "The Fibonacci numbers {fn, n ≥ 0} are defined recursively as fn = fn-1 + fn-2 with base cases f0 = 0 and f1 = 1.",
+        "Define the polynomials {Fn, n ≥ 0} as Fn(x) = ∑fixi for 0 ≤ i ≤ n.",
+        "For example, F7(x) = x + x2 + 2x3 + 3x4 + 5x5 + 8x6 + 13x7, and F7(11) = 268357683.",
+        "Let n = 1015. Find the sum [∑0≤x≤100 Fn(x)] mod 1307674368000 (= 15!)."
+      ]
+    },
+    {
+      "_id": "5900f5221000cf542c510033",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 436: Unfair wager",
+      "tests": [
+        "assert.strictEqual(euler436(), 0.5276662759, 'message: <code>euler436()</code> should return 0.5276662759.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler436() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler436();"
+      ],
+      "description": [
+        "Julie proposes the following wager to her sister Louise.",
+        "She suggests they play a game of chance to determine who will wash the dishes.",
+        "For this game, they shall use a generator of independent random numbers uniformly distributed between 0 and 1.",
+        "The game starts with S = 0.",
+        "The first player, Louise, adds to S different random numbers from the generator until S > 1 and records her last random number 'x'.",
+        "The second player, Julie, continues adding to S different random numbers from the generator until S > 2 and records her last random number 'y'.",
+        "The player with the highest number wins and the loser washes the dishes, i.e. if y > x the second player wins.",
+        "",
+        "For example, if the first player draws 0.62 and 0.44, the first player turn ends since 0.62+0.44 > 1 and x = 0.44.",
+        "If the second players draws 0.1, 0.27 and 0.91, the second player turn ends since 0.62+0.44+0.1+0.27+0.91 > 2 and y = 0.91.",
+        "Since y > x, the second player wins.",
+        "",
+        "Louise thinks about it for a second, and objects: \"That's not fair\".",
+        "What is the probability that the second player wins?",
+        "Give your answer rounded to 10 places behind the decimal point in the form 0.abcdefghij"
+      ]
+    },
+    {
+      "_id": "5900f5241000cf542c510036",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 437: Fibonacci primitive roots",
+      "tests": [
+        "assert.strictEqual(euler437(), 74204709657207, 'message: <code>euler437()</code> should return 74204709657207.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler437() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler437();"
+      ],
+      "description": [
+        "When we calculate 8n modulo 11 for n=0 to 9 we get: 1, 8, 9, 6, 4, 10, 3, 2, 5, 7.",
+        "As we see all possible values from 1 to 10 occur. So 8 is a primitive root of 11.",
+        "But there is more:",
+        "If we take a closer look we see:",
+        "1+8=9",
+        "8+9=17≡6 mod 11",
+        "9+6=15≡4 mod 11",
+        "6+4=10",
+        "4+10=14≡3 mod 11",
+        "10+3=13≡2 mod 11",
+        "3+2=5",
+        "2+5=7",
+        "5+7=12≡1 mod 11.",
+        "",
+        "So the powers of 8 mod 11 are cyclic with period 10, and 8n + 8n+1 ≡ 8n+2 (mod 11).",
+        "8 is called a Fibonacci primitive root of 11.",
+        "Not every prime has a Fibonacci primitive root.",
+        "There are 323 primes less than 10000 with one or more Fibonacci primitive roots and the sum of these primes is 1480491.",
+        "Find the sum of the primes less than 100,000,000 with at least one Fibonacci primitive root."
+      ]
+    },
+    {
+      "_id": "5900f5231000cf542c510034",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 438: Integer part of polynomial equation's solutions",
+      "tests": [
+        "assert.strictEqual(euler438(), 2046409616809, 'message: <code>euler438()</code> should return 2046409616809.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler438() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler438();"
+      ],
+      "description": [
+        "For an n-tuple of integers t = (a1, ..., an), let (x1, ..., xn) be the solutions of the polynomial equation xn + a1xn-1 + a2xn-2 + ... + an-1x + an = 0.",
+        "",
+        "",
+        "Consider the following two conditions:",
+        "x1, ..., xn are all real.",
+        "If x1, ..., xn are sorted, ⌊xi⌋ = i for 1 ≤ i ≤ n. (⌊·⌋: floor function.)",
+        "",
+        "In the case of n = 4, there are 12 n-tuples of integers which satisfy both conditions.",
+        "We define S(t) as the sum of the absolute values of the integers in t.",
+        "For n = 4 we can verify that ∑S(t) = 2087 for all n-tuples t which satisfy both conditions.",
+        "",
+        "",
+        "Find ∑S(t) for n = 7."
+      ]
+    },
+    {
+      "_id": "5900f5231000cf542c510035",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 439: Sum of sum of divisors",
+      "tests": [
+        "assert.strictEqual(euler439(), 968697378, 'message: <code>euler439()</code> should return 968697378.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler439() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler439();"
+      ],
+      "description": [
+        "Let d(k) be the sum of all divisors of k.",
+        "We define the function S(N) = ∑1≤i≤N ∑1≤j≤Nd(i·j).",
+        "For example, S(3) = d(1) + d(2) + d(3) + d(2) + d(4) + d(6) + d(3) + d(6) + d(9) = 59.",
+        "",
+        "You are given that S(103) = 563576517282 and S(105) mod 109 = 215766508.",
+        "Find S(1011) mod 109."
+      ]
+    },
+    {
+      "_id": "5900f5241000cf542c510037",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 440: GCD and Tiling",
+      "tests": [
+        "assert.strictEqual(euler440(), 970746056, 'message: <code>euler440()</code> should return 970746056.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler440() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler440();"
+      ],
+      "description": [
+        "We want to tile a board of length n and height 1 completely, with either 1 × 2 blocks or 1 × 1 blocks with a single decimal digit on top:",
+        "",
+        "For example, here are some of the ways to tile a board of length n = 8:",
+        "",
+        "Let T(n) be the number of ways to tile a board of length n as described above.",
+        "",
+        "For example, T(1) = 10 and T(2) = 101.",
+        "",
+        "Let S(L) be the triple sum ∑a,b,c gcd(T(ca), T(cb)) for 1 ≤ a, b, c ≤ L.",
+        "For example:",
+        "S(2) = 10444",
+        "S(3) = 1292115238446807016106539989",
+        "S(4) mod 987 898 789 = 670616280.",
+        "",
+        "Find S(2000) mod 987 898 789."
+      ]
+    },
+    {
+      "_id": "5900f5261000cf542c510038",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 441: The inverse summation of coprime couples",
+      "tests": [
+        "assert.strictEqual(euler441(), 5000088.8395, 'message: <code>euler441()</code> should return 5000088.8395.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler441() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler441();"
+      ],
+      "description": [
+        "For an integer M, we define R(M) as the sum of 1/(p·q) for all the integer pairs p and q which satisfy all of these conditions:",
+        "",
+        " 1 ≤ p < q ≤ M",
+        " p + q ≥ M",
+        " p and q are coprime.",
+        "",
+        "We also define S(N) as the sum of R(i) for 2 ≤ i ≤ N.",
+        "We can verify that S(2) = R(2) = 1/2, S(10) ≈ 6.9147 and S(100) ≈ 58.2962.",
+        "",
+        "",
+        "Find S(107). Give your answer rounded to four decimal places."
+      ]
+    },
+    {
+      "_id": "5900f5271000cf542c510039",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 442: Eleven-free integers",
+      "tests": [
+        "assert.strictEqual(euler442(), 1295552661530920200, 'message: <code>euler442()</code> should return 1295552661530920200.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler442() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler442();"
+      ],
+      "description": [
+        "An integer is called eleven-free if its decimal expansion does not contain any substring representing a power of 11 except 1.",
+        "",
+        "For example, 2404 and 13431 are eleven-free, while 911 and 4121331 are not.",
+        "",
+        "Let E(n) be the nth positive eleven-free integer. For example, E(3) = 3, E(200) = 213 and E(500 000) = 531563.",
+        "",
+        "Find E(1018)."
+      ]
+    },
+    {
+      "_id": "5900f5271000cf542c51003a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 443: GCD sequence",
+      "tests": [
+        "assert.strictEqual(euler443(), 2744233049300770, 'message: <code>euler443()</code> should return 2744233049300770.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler443() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler443();"
+      ],
+      "description": [
+        "Let g(n) be a sequence defined as follows:",
+        "g(4) = 13,",
+        "g(n) = g(n-1) + gcd(n, g(n-1)) for n > 4.",
+        "",
+        "The first few values are:",
+        "",
+        "    n4567891011121314151617181920...",
+        "    g(n)1314161718272829303132333451545560...",
+        "    ",
+        "",
+        "You are given that g(1 000) = 2524 and g(1 000 000) = 2624152.",
+        "",
+        "Find g(1015)."
+      ]
+    },
+    {
+      "_id": "5900f52a1000cf542c51003b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 444: The Roundtable Lottery",
+      "tests": [
+        "assert.strictEqual(euler444(), 1.200856722e+263, 'message: <code>euler444()</code> should return 1.200856722e+263.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler444() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler444();"
+      ],
+      "description": [
+        "A group of p people decide to sit down at a round table and play a lottery-ticket trading game. Each person starts off with a randomly-assigned, unscratched lottery ticket. Each ticket, when scratched, reveals a whole-pound prize ranging anywhere from £1 to £p, with no two tickets alike. The goal of the game is for each person to maximize his ticket winnings upon leaving the game.",
+        "",
+        "An arbitrary person is chosen to be the first player. Going around the table, each player has only one of two options:",
+        "",
+        "1. The player can scratch his ticket and reveal its worth to everyone at the table.",
+        "2. The player can trade his unscratched ticket for a previous player's scratched ticket, and then leave the game with that ticket. The previous player then scratches his newly-acquired ticket and reveals its worth to everyone at the table.",
+        "",
+        "The game ends once all tickets have been scratched. All players still remaining at the table must leave with their currently-held tickets.",
+        "",
+        "Assume that each player uses the optimal strategy for maximizing the expected value of his ticket winnings. ",
+        "",
+        "Let E(p) represent the expected number of players left at the table when the game ends in a game consisting of p players (e.g. E(111) = 5.2912 when rounded to 5 significant digits).",
+        "",
+        "Let S1(N) =  E(p)",
+        "Let Sk(N) =  Sk-1(p) for k > 1",
+        "",
+        "Find S20(1014) and write the answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent (e.g. S3(100) = 5.983679014e5)."
+      ]
+    },
+    {
+      "_id": "5900f52a1000cf542c51003c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 445: Retractions A",
+      "tests": [
+        "assert.strictEqual(euler445(), 659104042, 'message: <code>euler445()</code> should return 659104042.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler445() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler445();"
+      ],
+      "description": [
+        "For every integer n>1, the family of functions fn,a,b  is defined ",
+        "by fn,a,b(x)≡ax+b mod n for a,b,x integer and  0<a<n, 0≤b<n, 0≤x<n.",
+        "We will call fn,a,b a retraction if fn,a,b(fn,a,b(x))≡fn,a,b(x) mod n for every 0≤x<n.",
+        "Let R(n) be the number of retractions for n.",
+        "",
+        "",
+        "You are given that",
+        "∑ R(c) for c=C(100 000,k), and 1 ≤ k ≤99 999 ≡628701600 (mod 1 000 000 007).",
+        "(C(n,k) is the binomial coefficient).",
+        " ",
+        "Find ∑ R(c) for c=C(10 000 000,k), and 1 ≤k≤ 9 999 999.",
+        "Give your answer modulo 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f52c1000cf542c51003d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 446: Retractions B",
+      "tests": [
+        "assert.strictEqual(euler446(), 907803852, 'message: <code>euler446()</code> should return 907803852.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler446() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler446();"
+      ],
+      "description": [
+        "For every integer n>1, the family of functions fn,a,b  is defined ",
+        "by fn,a,b(x)≡ax+b mod n for a,b,x integer and  0<a<n, 0≤b<n, 0≤x<n.",
+        "We will call fn,a,b a retraction if fn,a,b(fn,a,b(x))≡fn,a,b(x) mod n for every 0≤x<n.",
+        "Let R(n) be the number of retractions for n.",
+        "",
+        "",
+        "F(N)=∑R(n4+4) for 1≤n≤N.  ",
+        "F(1024)=77532377300600.",
+        "",
+        "Find F(107) (mod 1 000 000 007)"
+      ]
+    },
+    {
+      "_id": "5900f52c1000cf542c51003e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 447: Retractions C",
+      "tests": [
+        "assert.strictEqual(euler447(), 530553372, 'message: <code>euler447()</code> should return 530553372.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler447() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler447();"
+      ],
+      "description": [
+        "For every integer n>1, the family of functions fn,a,b  is defined ",
+        "by fn,a,b(x)≡ax+b mod n for a,b,x integer and  0<a<n, 0≤b<n, 0≤x<n.",
+        "We will call fn,a,b a retraction if fn,a,b(fn,a,b(x))≡fn,a,b(x) mod n for every 0≤x<n.",
+        "Let R(n) be the number of retractions for n.",
+        "",
+        "",
+        "F(N)=∑R(n) for 2≤n≤N.",
+        "F(107)≡638042271 (mod 1 000 000 007).",
+        "",
+        " ",
+        "Find F(1014) (mod 1 000 000 007)."
+      ]
+    },
+    {
+      "_id": "5900f52c1000cf542c51003f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 448: Average least common multiple",
+      "tests": [
+        "assert.strictEqual(euler448(), 106467648, 'message: <code>euler448()</code> should return 106467648.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler448() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler448();"
+      ],
+      "description": [
+        "The function lcm(a,b) denotes the least common multiple of a and b.",
+        "Let A(n) be the average of the values of lcm(n,i) for 1≤i≤n.",
+        "E.g: A(2)=(2+2)/2=2 and A(10)=(10+10+30+20+10+30+70+40+90+10)/10=32. ",
+        "",
+        "Let S(n)=∑A(k) for 1≤k≤n.",
+        "S(100)=122726.",
+        "",
+        "",
+        "Find S(99999999019) mod 999999017."
+      ]
+    },
+    {
+      "_id": "5900f52d1000cf542c510040",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 449: Chocolate covered candy",
+      "tests": [
+        "assert.strictEqual(euler449(), 103.37870096, 'message: <code>euler449()</code> should return 103.37870096.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler449() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler449();"
+      ],
+      "description": [
+        "Phil the confectioner is making a new batch of chocolate covered candy. Each candy centre is shaped like an ellipsoid of revolution defined by the equation: b2x2 + b2y2 + a2z2 = a2b2.",
+        "",
+        "",
+        "Phil wants to know how much chocolate is needed to cover one candy centre with a uniform coat of chocolate one millimeter thick.",
+        "If a=1 mm and b=1 mm, the amount of chocolate required is ",
+        "    ",
+        "    283",
+        "    π mm3",
+        "",
+        "If a=2 mm and b=1 mm, the amount of chocolate required is approximately 60.35475635 mm3.",
+        "",
+        "",
+        "Find the amount of chocolate in mm3 required if a=3 mm and b=1 mm. Give your answer as the number rounded to 8 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f52e1000cf542c510041",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 450: Hypocycloid and Lattice points",
+      "tests": [
+        "assert.strictEqual(euler450(), 583333163984220900, 'message: <code>euler450()</code> should return 583333163984220900.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler450() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler450();"
+      ],
+      "description": [
+        "A hypocycloid is the curve drawn by a point on a small circle rolling inside a larger circle. The parametric equations of a hypocycloid centered at the origin, and starting at the right most point is given by:",
+        "$x(t) = (R - r) \\cos(t) + r \\cos(\\frac {R - r} r t)$",
+        "$y(t) = (R - r) \\sin(t) - r \\sin(\\frac {R - r} r t)$",
+        "Where R is the radius of the large circle and r the radius of the small circle.",
+        "",
+        "",
+        "Let $C(R, r)$ be the set of distinct points with integer coordinates on the hypocycloid with radius R and r and for which there is a corresponding value of t such that $\\sin(t)$ and $\\cos(t)$ are rational numbers.",
+        "",
+        "Let $S(R, r) = \\sum_{(x,y) \\in C(R, r)} |x| + |y|$ be the sum of the absolute values of the x and y coordinates of the points in $C(R, r)$.",
+        "",
+        "",
+        "Let $T(N) = \\sum_{R = 3}^N \\sum_{r=1}^{\\lfloor \\frac {R - 1} 2 \\rfloor} S(R, r)$ be the sum of $S(R, r)$ for R and r positive integers, $R\\leq N$  and $2r < R$.",
+        "",
+        "",
+        "You are given:C(3, 1) =",
+        "{(3, 0), (-1, 2), (-1,0), (-1,-2)}",
+        "C(2500, 1000) =",
+        "{(2500, 0), (772, 2376), (772, -2376), (516, 1792),",
+        " (516, -1792), (500, 0), (68, 504), (68, -504),(-1356, 1088), (-1356, -1088), (-1500, 1000), (-1500, -1000)}",
+        "",
+        "Note: (-625, 0) is not an element of C(2500, 1000) because $\\sin(t)$ is not a rational number for the corresponding values of t.",
+        "",
+        "",
+        "S(3, 1) = (|3| + |0|) + (|-1| + |2|) + (|-1| + |0|) + (|-1| + |-2|) = 10",
+        "",
+        "T(3) = 10; T(10) = 524 ;T(100) = 580442; T(103) = 583108600.",
+        "",
+        "",
+        "Find T(106)."
+      ]
+    },
+    {
+      "_id": "5900f5311000cf542c510042",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 451: Modular inverses",
+      "tests": [
+        "assert.strictEqual(euler451(), 153651073760956, 'message: <code>euler451()</code> should return 153651073760956.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler451() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler451();"
+      ],
+      "description": [
+        "Consider the number 15.",
+        "There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14.",
+        "The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14  ",
+        "because",
+        "1*1 mod 15=1",
+        "2*8=16 mod 15=1",
+        "4*4=16 mod 15=1",
+        "7*13=91 mod 15=1",
+        "11*11=121 mod 15=1",
+        "14*14=196 mod 15=1",
+        "",
+        "Let I(n) be the largest positive number m smaller than n-1 such that the modular inverse of m modulo n equals m itself.",
+        "So I(15)=11.",
+        "Also I(100)=51 and I(7)=1.",
+        "",
+        "Find ∑I(n) for 3≤n≤2·107"
+      ]
+    },
+    {
+      "_id": "5900f5311000cf542c510043",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 452: Long Products",
+      "tests": [
+        "assert.strictEqual(euler452(), 345558983, 'message: <code>euler452()</code> should return 345558983.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler452() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler452();"
+      ],
+      "description": [
+        "Define F(m,n) as the number of n-tuples of positive integers for which the product of the elements doesn't exceed m.",
+        "F(10, 10) = 571.",
+        "F(106, 106) mod 1 234 567 891 = 252903833.",
+        "Find F(109, 109) mod 1 234 567 891."
+      ]
+    },
+    {
+      "_id": "5900f5311000cf542c510044",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 453: Lattice Quadrilaterals",
+      "tests": [
+        "assert.strictEqual(euler453(), 104354107, 'message: <code>euler453()</code> should return 104354107.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler453() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler453();"
+      ],
+      "description": [
+        "A simple quadrilateral is a polygon that has four distinct vertices, has no straight angles and does not self-intersect.",
+        "",
+        "Let Q(m, n) be the number of simple quadrilaterals whose vertices are lattice points with coordinates (x,y) satisfying 0 ≤ x ≤ m and 0 ≤ y ≤ n.",
+        "",
+        "For example, Q(2, 2) = 94 as can be seen below:",
+        "",
+        "It can also be verified that Q(3, 7) = 39590, Q(12, 3) = 309000 and Q(123, 45) = 70542215894646.",
+        "",
+        "Find Q(12345, 6789) mod 135707531."
+      ]
+    },
+    {
+      "_id": "5900f5331000cf542c510045",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 454: Diophantine reciprocals III",
+      "tests": [
+        "assert.strictEqual(euler454(), 5435004633092, 'message: <code>euler454()</code> should return 5435004633092.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler454() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler454();"
+      ],
+      "description": [
+        "In the following equation x, y, and n are positive integers.",
+        "",
+        "1x",
+        " + ",
+        "1y",
+        " = ",
+        "1n",
+        "",
+        "For a limit L we define F(L) as the number of solutions which satisfy x < y ≤ L.",
+        "",
+        "We can verify that F(15) = 4 and F(1000) = 1069.",
+        "Find F(1012)."
+      ]
+    },
+    {
+      "_id": "5900f5331000cf542c510046",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 455: Powers With Trailing Digits",
+      "tests": [
+        "assert.strictEqual(euler455(), 450186511399999, 'message: <code>euler455()</code> should return 450186511399999.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler455() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler455();"
+      ],
+      "description": [
+        "Let f(n) be the largest positive integer x less than 109 such that the last 9 digits of nx form the number x (including leading zeros), or zero if no such integer exists.",
+        "",
+        "For example:",
+        "",
+        "f(4) = 411728896 (4411728896 = ...490411728896) ",
+        "f(10) = 0",
+        "f(157) = 743757 (157743757 = ...567000743757)",
+        "Σf(n), 2 ≤ n ≤ 103 = 442530011399",
+        "Find Σf(n), 2 ≤ n ≤ 106."
+      ]
+    },
+    {
+      "_id": "5900f5351000cf542c510047",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 456: Triangles containing the origin II",
+      "tests": [
+        "assert.strictEqual(euler456(), 333333208685971500, 'message: <code>euler456()</code> should return 333333208685971500.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler456() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler456();"
+      ],
+      "description": [
+        "Define:xn = (1248n mod 32323) - 16161yn = (8421n mod 30103) - 15051",
+        "Pn = {(x1, y1), (x2, y2), ..., (xn, yn)}",
+        "",
+        "",
+        "For example, P8 = {(-14913, -6630), (-10161, 5625), (5226, 11896), (8340, -10778), (15852, -5203), (-15165, 11295), (-1427, -14495), (12407, 1060)}.",
+        "",
+        "Let C(n) be the number of triangles whose vertices are in Pn which contain the origin in the interior.",
+        "",
+        "",
+        "Examples:",
+        "C(8) = 20",
+        "C(600) = 8950634",
+        "C(40 000) = 2666610948988",
+        "",
+        "",
+        "Find C(2 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f5361000cf542c510048",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 457: A polynomial modulo the square of a prime",
+      "tests": [
+        "assert.strictEqual(euler457(), 2647787126797397000, 'message: <code>euler457()</code> should return 2647787126797397000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler457() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler457();"
+      ],
+      "description": [
+        "Let f(n) = n2 - 3n - 1.",
+        "Let p be a prime.",
+        "Let R(p) be the smallest positive integer n such that f(n) mod p2 = 0 if such an integer n exists, otherwise R(p) = 0.",
+        "",
+        "",
+        "Let SR(L) be ∑R(p) for all primes not exceeding L.",
+        "",
+        "",
+        "Find SR(107)."
+      ]
+    },
+    {
+      "_id": "5900f5361000cf542c510049",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 458: Permutations of Project",
+      "tests": [
+        "assert.strictEqual(euler458(), 423341841, 'message: <code>euler458()</code> should return 423341841.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler458() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler458();"
+      ],
+      "description": [
+        "Consider the alphabet A made out of the letters of the word \"project\": A={c,e,j,o,p,r,t}.",
+        "Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of \"project\".",
+        "",
+        "T(7)=77-7!=818503.",
+        "",
+        "",
+        "Find T(1012). Give the last 9 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900f5371000cf542c51004a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 459: Flipping game",
+      "tests": [
+        "assert.strictEqual(euler459(), 3996390106631, 'message: <code>euler459()</code> should return 3996390106631.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler459() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler459();"
+      ],
+      "description": [
+        "The flipping game is a two player game played on a N by N square board.",
+        "Each square contains a disk with one side white and one side black.",
+        "The game starts with all disks showing their white side.",
+        "",
+        "A turn consists of flipping all disks in a rectangle with the following properties:",
+        "the upper right corner of the rectangle contains a white disk",
+        "the rectangle width is a perfect square (1, 4, 9, 16, ...)",
+        "the rectangle height is a triangular number (1, 3, 6, 10, ...)",
+        "",
+        "",
+        "Players alternate turns. A player wins by turning the grid all black.",
+        "",
+        "Let W(N) be the number of winning moves for the first player on a N by N board with all disks white, assuming perfect play.",
+        "W(1) = 1, W(2) = 0, W(5) = 8 and W(102) = 31395.",
+        "",
+        "For N=5, the first player's eight winning first moves are:",
+        "",
+        "",
+        "",
+        "",
+        "Find W(106)."
+      ]
+    },
+    {
+      "_id": "5900f5381000cf542c51004b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 460: An ant on the move",
+      "tests": [
+        "assert.strictEqual(euler460(), 18.420738199, 'message: <code>euler460()</code> should return 18.420738199.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler460() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler460();"
+      ],
+      "description": [
+        "On the Euclidean plane, an ant travels from point A(0, 1) to point B(d, 1) for an integer d.",
+        "",
+        "",
+        "In each step, the ant at point (x0, y0) chooses one of the lattice points (x1, y1) which satisfy x1 ≥ 0 and y1 ≥ 1 and goes straight to (x1, y1) at a constant velocity v. The value of v depends on y0 and y1 as follows:",
+        " If y0 = y1, the value of v equals y0.",
+        " If y0 ≠ y1, the value of v equals (y1 - y0) / (ln(y1) - ln(y0)).",
+        "",
+        "The left image is one of the possible paths for d = 4. First the ant goes from A(0, 1) to P1(1, 3) at velocity (3 - 1) / (ln(3) - ln(1)) ≈ 1.8205. Then the required time is sqrt(5) / 1.8205 ≈ 1.2283.",
+        "From P1(1, 3) to P2(3, 3) the ant travels at velocity 3 so the required time is 2 / 3 ≈ 0.6667. From P2(3, 3) to B(4, 1) the ant travels at velocity (1 - 3) / (ln(1) - ln(3)) ≈ 1.8205 so the required time is sqrt(5) / 1.8205 ≈ 1.2283.",
+        "Thus the total required time is 1.2283 + 0.6667 + 1.2283 = 3.1233.",
+        "",
+        "",
+        "The right image is another path. The total required time is calculated as 0.98026 + 1 + 0.98026 = 2.96052. It can be shown that this is the quickest path for d = 4.",
+        "",
+        "",
+        "",
+        "Let F(d) be the total required time if the ant chooses the quickest path. For example, F(4) ≈ 2.960516287.",
+        "We can verify that F(10) ≈ 4.668187834 and F(100) ≈ 9.217221972.",
+        "",
+        "",
+        "Find F(10000). Give your answer rounded to nine decimal places."
+      ]
+    },
+    {
+      "_id": "5900f53a1000cf542c51004c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 461: Almost Pi",
+      "tests": [
+        "assert.strictEqual(euler461(), 159820276, 'message: <code>euler461()</code> should return 159820276.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler461() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler461();"
+      ],
+      "description": [
+        "Let fn(k) = ek/n - 1, for all non-negative integers k.",
+        "Remarkably, f200(6) + f200(75) + f200(89) + f200(226) = 3.141592644529… ≈ π.",
+        "In fact, it is the best approximation of π of the form fn(a) + fn(b) + fn(c) + fn(d) for n = 200.",
+        "Let g(n) = a2 + b2 + c2 + d 2 for a, b, c, d that minimize the error: | fn(a) + fn(b) + fn(c) + fn(d) - π|",
+        "(where |x| denotes the absolute value of x).",
+        "You are given g(200) = 62 + 752 + 892 + 2262 = 64658.",
+        "Find g(10000)."
+      ]
+    },
+    {
+      "_id": "5900f53b1000cf542c51004d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 462: Permutation of 3-smooth numbers",
+      "tests": [
+        "assert.strictEqual(euler462(), Infinity, 'message: <code>euler462()</code> should return Infinity.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler462() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler462();"
+      ],
+      "description": [
+        "A 3-smooth number is an integer which has no prime factor larger than 3. For an integer N, we define S(N) as the set of 3-smooth numbers less than or equal to N . For example, S(20) = { 1, 2, 3, 4, 6, 8, 9, 12, 16, 18 }.",
+        "",
+        "",
+        "We define F(N) as the number of permutations of S(N) in which each element comes after all of its proper divisors.",
+        "",
+        "",
+        "This is one of the possible permutations for N = 20.",
+        "- 1, 2, 4, 3, 9, 8, 16, 6, 18, 12.",
+        "This is not a valid permutation because 12 comes before its divisor 6.",
+        "- 1, 2, 4, 3, 9, 8, 12, 16, 6, 18.",
+        "",
+        "",
+        "We can verify that F(6) = 5, F(8) = 9, F(20) = 450 and F(1000) ≈ 8.8521816557e21.",
+        "Find F(1018). Give as your answer its scientific notation rounded to ten digits after the decimal point.",
+        "When giving your answer, use a lowercase e to separate mantissa and exponent. E.g. if the answer is 112,233,445,566,778,899 then the answer format would be 1.1223344557e17."
+      ]
+    },
+    {
+      "_id": "5900f53c1000cf542c51004e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 463: A weird recurrence relation",
+      "tests": [
+        "assert.strictEqual(euler463(), 808981553, 'message: <code>euler463()</code> should return 808981553.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler463() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler463();"
+      ],
+      "description": [
+        "The function $f$ is defined for all positive integers as follows:",
+        "$f(1)=1$",
+        "$f(3)=3$",
+        "$f(2n)=f(n)$",
+        "$f(4n + 1)=2f(2n + 1) - f(n)$",
+        "$f(4n + 3)=3f(2n + 1) - 2f(n)$",
+        "",
+        "The function $S(n)$ is defined as $\\sum_{i=1}^{n}f(i)$.",
+        "$S(8)=22$ and $S(100)=3604$.",
+        "Find $S(3^{37})$. Give the last 9 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900f53d1000cf542c51004f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 464: Möbius function and intervals",
+      "tests": [
+        "assert.strictEqual(euler464(), 198775297232878, 'message: <code>euler464()</code> should return 198775297232878.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler464() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler464();"
+      ],
+      "description": [
+        "The Möbius function, denoted μ(n), is defined as:",
+        "μ(n) = (-1)ω(n) if n is squarefree (where ω(n) is the number of distinct prime factors of n)",
+        "μ(n) = 0 if n is not squarefree.",
+        "",
+        "Let P(a,b) be the number of integers n in the interval [a,b] such that μ(n) = 1.",
+        "Let N(a,b) be the number of integers n in the interval [a,b] such that μ(n) = -1.",
+        "For example, P(2,10) = 2 and N(2,10) = 4.",
+        "",
+        "",
+        "",
+        "Let C(n) be the number of integer pairs (a,b) such that:",
+        " 1 ≤ a ≤ b ≤ n,",
+        " 99·N(a,b) ≤ 100·P(a,b), and",
+        " 99·P(a,b) ≤ 100·N(a,b).",
+        "",
+        "For example, C(10) = 13, C(500) = 16676 and C(10 000) = 20155319.",
+        "",
+        "",
+        "",
+        "Find C(20 000 000)."
+      ]
+    },
+    {
+      "_id": "5900f53d1000cf542c510050",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 465: Polar polygons",
+      "tests": [
+        "assert.strictEqual(euler465(), 585965659, 'message: <code>euler465()</code> should return 585965659.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler465() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler465();"
+      ],
+      "description": [
+        "The kernel of a polygon is defined by the set of points from which the entire polygon's boundary is visible. We define a polar polygon as a polygon for which the origin is strictly contained inside its kernel.",
+        "",
+        "For this problem, a polygon can have collinear consecutive vertices. However, a polygon still cannot have self-intersection and cannot have zero area.",
+        "",
+        "For example, only the first of the following is a polar polygon (the kernels of the second, third, and fourth do not strictly contain the origin, and the fifth does not have a kernel at all):",
+        "",
+        "",
+        "",
+        "Notice that the first polygon has three consecutive collinear vertices.",
+        "",
+        "Let P(n) be the number of polar polygons such that the vertices (x, y) have integer coordinates whose absolute values are not greater than n.",
+        "",
+        "Note that polygons should be counted as different if they have different set of edges, even if they enclose the same area. For example, the polygon with vertices [(0,0),(0,3),(1,1),(3,0)] is distinct from the polygon with vertices [(0,0),(0,3),(1,1),(3,0),(1,0)].",
+        "",
+        "For example, P(1) = 131, P(2) = 1648531, P(3) = 1099461296175 and P(343) mod 1 000 000 007 = 937293740.",
+        "",
+        "Find P(713) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f53e1000cf542c510051",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 466: Distinct terms in a multiplication table",
+      "tests": [
+        "assert.strictEqual(euler466(), 258381958195474750, 'message: <code>euler466()</code> should return 258381958195474750.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler466() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler466();"
+      ],
+      "description": [
+        "Let P(m,n) be the number of distinct terms in an m×n multiplication table.",
+        "",
+        "For example, a 3×4 multiplication table looks like this:",
+        "",
+        "× 12341 12342 24683 36912",
+        "",
+        "",
+        "",
+        "There are 8 distinct terms {1,2,3,4,6,8,9,12}, therefore P(3,4) = 8.",
+        "",
+        "You are given that:",
+        "P(64,64) = 1263,",
+        "P(12,345) = 1998, and",
+        "P(32,1015) = 13826382602124302.",
+        "",
+        "Find P(64,1016)."
+      ]
+    },
+    {
+      "_id": "5900f5411000cf542c510052",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 467: Superinteger",
+      "tests": [
+        "assert.strictEqual(euler467(), 775181359, 'message: <code>euler467()</code> should return 775181359.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler467() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler467();"
+      ],
+      "description": [
+        "An integer s is called a superinteger of another integer n if the digits of n form a subsequence of the digits of s.",
+        "For example, 2718281828 is a superinteger of 18828, while 314159 is not a superinteger of 151.",
+        "",
+        "",
+        "Let p(n) be the nth prime number, and let c(n) be the nth composite number. For example, p(1) = 2, p(10) = 29, c(1) = 4 and c(10) = 18.",
+        "{p(i) : i ≥ 1} = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ...}",
+        "{c(i) : i ≥ 1} = {4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ...}",
+        "",
+        "Let PD the sequence of the digital roots of {p(i)} (CD is defined similarly for {c(i)}):",
+        "PD = {2, 3, 5, 7, 2, 4, 8, 1, 5, 2, ...}",
+        "CD = {4, 6, 8, 9, 1, 3, 5, 6, 7, 9, ...}",
+        "",
+        "Let Pn be the integer formed by concatenating the first n elements of PD (Cn is defined similarly for CD).",
+        "P10 = 2357248152",
+        "C10 = 4689135679",
+        "",
+        "Let f(n) be the smallest positive integer that is a common superinteger of Pn and Cn. For example, f(10) = 2357246891352679, and f(100) mod 1 000 000 007 = 771661825.",
+        "",
+        "Find f(10 000) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f5411000cf542c510054",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 468: Smooth divisors of binomial coefficients",
+      "tests": [
+        "assert.strictEqual(euler468(), 852950321, 'message: <code>euler468()</code> should return 852950321.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler468() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler468();"
+      ],
+      "description": [
+        "An integer is called B-smooth if none of its prime factors is greater than B.",
+        "",
+        "Let SB(n) be the largest B-smooth divisor of n.",
+        "Examples:",
+        "S1(10) = 1",
+        "S4(2100) = 12",
+        "S17(2496144) = 5712",
+        "",
+        "Define F(n) = ∑1≤B≤n ∑0≤r≤n SB(C(n,r)). Here, C(n,r) denotes the binomial coefficient.",
+        "Examples:",
+        "F(11) = 3132",
+        "F(1 111) mod 1 000 000 993 = 706036312",
+        "F(111 111) mod 1 000 000 993 = 22156169",
+        "",
+        "Find F(11 111 111) mod 1 000 000 993."
+      ]
+    },
+    {
+      "_id": "5900f5411000cf542c510053",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 469: Empty chairs",
+      "tests": [
+        "assert.strictEqual(euler469(), 0.56766764161831, 'message: <code>euler469()</code> should return 0.56766764161831.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler469() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler469();"
+      ],
+      "description": [
+        "In a room N chairs are placed around a round table.",
+        "Knights enter the room one by one and choose at random an available empty chair.",
+        "To have enough elbow room the knights always leave at least one empty chair between each other.",
+        "",
+        "",
+        "When there aren't any suitable chairs left, the fraction C of empty chairs is determined.",
+        "We also define E(N) as the expected value of C.",
+        "We can verify that E(4) = 1/2 and E(6) = 5/9.",
+        "",
+        "",
+        "Find E(1018). Give your answer rounded to fourteen decimal places in the form 0.abcdefghijklmn."
+      ]
+    },
+    {
+      "_id": "5900f5431000cf542c510055",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 470: Super Ramvok",
+      "tests": [
+        "assert.strictEqual(euler470(), 147668794, 'message: <code>euler470()</code> should return 147668794.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler470() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler470();"
+      ],
+      "description": [
+        "Consider a single game of Ramvok:",
+        "",
+        "Let t represent the maximum number of turns the game lasts. If t = 0, then the game ends immediately. Otherwise, on each turn i, the player rolls a die. After rolling, if i < t the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If i = t, then the roll cannot be discarded and the prize must be accepted. Before the game begins, t is chosen by the player, who must then pay an up-front cost ct for some constant c. For c = 0, t can be chosen to be infinite (with an up-front cost of 0). Let R(d, c) be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair d-sided die and cost constant c. For example, R(4, 0.2) = 2.65. Assume that the player has sufficient funds for paying any/all up-front costs.",
+        "",
+        "Now consider a game of Super Ramvok:",
+        "",
+        "In Super Ramvok, the game of Ramvok is played repeatedly, but with a slight modification. After each game, the die is altered. The alteration process is as follows: The die is rolled once, and if the resulting face has its pips visible, then that face is altered to be blank instead. If the face is already blank, then it is changed back to its original value. After the alteration is made, another game of Ramvok can begin (and during such a game, at each turn, the die is rolled until a face with a value on it appears). The player knows which faces are blank and which are not at all times. The game of Super Ramvok ends once all faces of the die are blank.",
+        "",
+        "Let S(d, c) be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair d-sided die to start (with all sides visible), and cost constant c. For example, S(6, 1) = 208.3.",
+        "",
+        "Let F(n) = ∑4≤d≤n ∑0≤c≤n S(d, c).",
+        "",
+        "Calculate F(20), rounded to the nearest integer."
+      ]
+    },
+    {
+      "_id": "5900f5431000cf542c510056",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 471: Triangle inscribed in ellipse",
+      "tests": [
+        "assert.strictEqual(euler471(), 1.895093981e+31, 'message: <code>euler471()</code> should return 1.895093981e+31.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler471() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler471();"
+      ],
+      "description": [
+        "The triangle ΔABC is inscribed in an ellipse with equation $\\frac {x^2} {a^2} + \\frac {y^2} {b^2} = 1$, 0 < 2b < a, a and b integers.",
+        "Let r(a,b) be the radius of the incircle of ΔABC when the incircle has center (2b, 0) and A has coordinates $\\left( \\frac a 2, \\frac {\\sqrt 3} 2 b\\right)$.",
+        "For example, r(3,1) = ½, r(6,2) = 1, r(12,3) = 2.",
+        "",
+        "",
+        "Let $G(n) = \\sum_{a=3}^n \\sum_{b=1}^{\\lfloor \\frac {a - 1} 2 \\rfloor} r(a, b)$",
+        "You are given G(10) = 20.59722222, G(100) = 19223.60980 (rounded to 10 significant digits).",
+        "Find G(1011).",
+        "Give your answer in scientific notation rounded to 10 significant digits. Use a lowercase e to separate mantissa and exponent.",
+        "For G(10) the answer would have been 2.059722222e1."
+      ]
+    },
+    {
+      "_id": "5900f5451000cf542c510057",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 472: Comfortable Distance II",
+      "tests": [
+        "assert.strictEqual(euler472(), 73811586, 'message: <code>euler472()</code> should return 73811586.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler472() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler472();"
+      ],
+      "description": [
+        "There are N seats in a row. N people come one after another to fill the seats according to the following rules:",
+        "No person sits beside another.",
+        "The first person chooses any seat.",
+        "Each subsequent person chooses the seat furthest from anyone else already seated, as long as it does not violate rule 1. If there is more than one choice satisfying this condition, then the person chooses the leftmost choice.",
+        "Note that due to rule 1, some seats will surely be left unoccupied, and the maximum number of people that can be seated is less than N (for N > 1).",
+        "",
+        "Here are the possible seating arrangements for N = 15:",
+        "",
+        "",
+        "",
+        "We see that if the first person chooses correctly, the 15 seats can seat up to 7 people.",
+        "We can also see that the first person has 9 choices to maximize the number of people that may be seated.",
+        "",
+        "Let f(N) be the number of choices the first person has to maximize the number of occupants for N seats in a row. Thus, f(1) = 1, f(15) = 9, f(20) = 6, and f(500) = 16.",
+        "",
+        "Also, ∑f(N) = 83 for 1 ≤ N ≤ 20 and  ∑f(N) = 13343 for 1 ≤ N ≤ 500.",
+        "",
+        "Find ∑f(N) for 1 ≤ N ≤ 1012. Give the last 8 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900f5461000cf542c510058",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 473: Phigital number base",
+      "tests": [
+        "assert.strictEqual(euler473(), 35856681704365, 'message: <code>euler473()</code> should return 35856681704365.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler473() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler473();"
+      ],
+      "description": [
+        "Let $\\varphi$ be the golden ratio: $\\varphi=\\frac{1+\\sqrt{5}}{2}.$",
+        "Remarkably it is possible to write every positive integer as a sum of powers of $\\varphi$ even if we require that every power of $\\varphi$ is used at most once in this sum.",
+        "Even then this representation is not unique.",
+        "We can make it unique by requiring that no powers with consecutive exponents are used and that the representation is finite.",
+        "E.g: ",
+        "$2=\\varphi+\\varphi^{-2}$ and $3=\\varphi^{2}+\\varphi^{-2}$",
+        "",
+        "",
+        "To represent this sum of powers of $\\varphi$ we use a string of 0's and 1's with a point to indicate where the negative exponents start.",
+        "We call this the representation in the phigital numberbase.",
+        "So $1=1_{\\varphi}$, $2=10.01_{\\varphi}$, $3=100.01_{\\varphi}$ and $14=100100.001001_{\\varphi}$. ",
+        "The strings representing 1, 2 and 14 in the phigital number base are palindromic, while the string representing 3 is not. (the phigital point is not the middle character).",
+        "",
+        "",
+        "The sum of the positive integers not exceeding 1000 whose phigital representation is palindromic is 4345.",
+        "",
+        "",
+        "Find the sum of the positive integers not exceeding $10^{10}$ whose phigital representation is palindromic."
+      ]
+    },
+    {
+      "_id": "5900f5471000cf542c510059",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 474: Last digits of divisors",
+      "tests": [
+        "assert.strictEqual(euler474(), 9690646731515010, 'message: <code>euler474()</code> should return 9690646731515010.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler474() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler474();"
+      ],
+      "description": [
+        "For a positive integer n and digits d, we define F(n, d) as the number of the divisors of n whose last digits equal d.",
+        "For example, F(84, 4) = 3. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.",
+        "",
+        "",
+        "We can also verify that F(12!, 12) = 11 and F(50!, 123) = 17888.",
+        "",
+        "",
+        "Find F(106!, 65432) modulo (1016 + 61)."
+      ]
+    },
+    {
+      "_id": "5900f5481000cf542c51005a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 475: Music festival",
+      "tests": [
+        "assert.strictEqual(euler475(), 75780067, 'message: <code>euler475()</code> should return 75780067.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler475() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler475();"
+      ],
+      "description": [
+        "12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day.",
+        "It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet.",
+        "On the second day, they form 4n trios, each musician avoiding his previous quartet partners.",
+        "",
+        "Let f(12n) be the number of ways to organize the trios amongst the 12n musicians.",
+        "You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.",
+        "",
+        "Find f(600) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f5481000cf542c51005b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 476: Circle Packing II",
+      "tests": [
+        "assert.strictEqual(euler476(), 110242.87794, 'message: <code>euler476()</code> should return 110242.87794.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler476() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler476();"
+      ],
+      "description": [
+        "Let R(a, b, c) be the maximum area covered by three non-overlapping circles inside a triangle with edge lengths a, b and c.",
+        "Let S(n) be the average value of R(a, b, c) over all integer triplets (a, b, c) such that 1 ≤ a ≤ b ≤ c < a + b ≤ n",
+        "You are given S(2) = R(1, 1, 1) ≈ 0.31998, S(5) ≈ 1.25899.",
+        "Find S(1803) rounded to 5 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f54a1000cf542c51005c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 477: Number Sequence Game",
+      "tests": [
+        "assert.strictEqual(euler477(), 25044905874565164, 'message: <code>euler477()</code> should return 25044905874565164.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler477() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler477();"
+      ],
+      "description": [
+        "The number sequence game starts with a sequence S of N numbers written on a line.",
+        "Two players alternate turns. At his turn, a player must select and remove either the first or the last number remaining in the sequence.",
+        "The player score is the sum of all the numbers he has taken. Each player attempts to maximize his own sum.",
+        "If N = 4 and S = {1, 2, 10, 3}, then each player maximizes his score as follows:",
+        "Player 1: removes the first number (1)",
+        "Player 2: removes the last number from the remaining sequence (3)",
+        "Player 1: removes the last number from the remaining sequence (10)",
+        "Player 2: removes the remaining number (2)",
+        "Player 1 score is 1 + 10 = 11.",
+        "Let F(N) be the score of player 1 if both players follow the optimal strategy for the sequence S = {s1, s2, ..., sN} defined as:",
+        "s1 = 0",
+        "si+1 = (si2 + 45) modulo 1 000 000 007",
+        "The sequence begins with S = {0, 45, 2070, 4284945, 753524550, 478107844, 894218625, ...}.",
+        "You are given F(2) = 45, F(4) = 4284990, F(100) = 26365463243, F(104) = 2495838522951.",
+        "Find F(108)."
+      ]
+    },
+    {
+      "_id": "5900f54c1000cf542c51005e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 478: Mixtures",
+      "tests": [
+        "assert.strictEqual(euler478(), 59510340, 'message: <code>euler478()</code> should return 59510340.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler478() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler478();"
+      ],
+      "description": [
+        "Let us consider mixtures of three substances: A, B and C. A mixture can be described by a ratio of the amounts of A, B, and C in it, i.e., (a : b : c). For example, a mixture described by the ratio (2 : 3 : 5) contains 20% A, 30% B and 50% C.",
+        "",
+        "For the purposes of this problem, we cannot separate the individual components from a mixture. However, we can combine different amounts of different mixtures to form mixtures with new ratios.",
+        "",
+        "For example, say we have three mixtures with ratios (3 : 0 : 2), (3 : 6 : 11) and (3 : 3 : 4). By mixing 10 units of the first, 20 units of the second and 30 units of the third, we get a new mixture with ratio (6 : 5 : 9), since:",
+        "(10·3/5 + 20·3/20 + 30·3/10 : 10·0/5 + 20·6/20 + 30·3/10 : 10·2/5 + 20·11/20 + 30·4/10)",
+        "= (18 : 15 : 27) = (6 : 5 : 9)",
+        "",
+        "However, with the same three mixtures, it is impossible to form the ratio (3 : 2 : 1), since the amount of B is always less than the amount of C.",
+        "",
+        "Let n be a positive integer. Suppose that for every triple of integers (a, b, c) with 0 ≤ a, b, c ≤ n and gcd(a, b, c) = 1, we have a mixture with ratio (a : b : c). Let M(n) be the set of all such mixtures.",
+        "",
+        "For example, M(2) contains the 19 mixtures with the following ratios:",
+        "{(0 : 0 : 1), (0 : 1 : 0), (0 : 1 : 1), (0 : 1 : 2), (0 : 2 : 1), ",
+        "(1 : 0 : 0), (1 : 0 : 1), (1 : 0 : 2), (1 : 1 : 0), (1 : 1 : 1), ",
+        "(1 : 1 : 2), (1 : 2 : 0), (1 : 2 : 1), (1 : 2 : 2), (2 : 0 : 1), ",
+        "(2 : 1 : 0), (2 : 1 : 1), (2 : 1 : 2), (2 : 2 : 1)}.",
+        "",
+        "Let E(n) be the number of subsets of M(n) which can produce the mixture with ratio (1 : 1 : 1), i.e., the mixture with equal parts A, B and C. ",
+        "We can verify that E(1) = 103, E(2) = 520447, E(10) mod 118 = 82608406 and E(500) mod 118 = 13801403.",
+        "Find E(10 000 000) mod 118."
+      ]
+    },
+    {
+      "_id": "5900f54b1000cf542c51005d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 479: Roots on the Rise",
+      "tests": [
+        "assert.strictEqual(euler479(), 191541795, 'message: <code>euler479()</code> should return 191541795.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler479() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler479();"
+      ],
+      "description": [
+        "Let ak, bk, and ck represent the three solutions (real or complex numbers) to the expression 1/x = (k/x)2(k+x2) - kx.",
+        "",
+        "For instance, for k = 5, we see that {a5, b5, c5} is approximately {5.727244, -0.363622+2.057397i, -0.363622-2.057397i}.",
+        "",
+        "Let S(n) = Σ (ak+bk)p(bk+ck)p(ck+ak)p for all integers p, k such that 1 ≤ p, k ≤ n. ",
+        "",
+        "Interestingly, S(n) is always an integer. For example, S(4) = 51160.",
+        "",
+        "Find S(106) modulo 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f54c1000cf542c51005f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 480: The Last Question",
+      "tests": [
+        "assert.strictEqual(euler480(), turnthestarson, 'message: <code>euler480()</code> should return turnthestarson.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler480() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler480();"
+      ],
+      "description": [
+        "Consider all the words which can be formed by selecting letters, in any order, from the phrase:",
+        "thereisasyetinsufficientdataforameaningfulanswer",
+        "Suppose those with 15 letters or less are listed in alphabetical order and numbered sequentially starting at 1.",
+        "The list would include:",
+        "1 : a",
+        "2 : aa",
+        "3 : aaa",
+        "4 : aaaa",
+        "5 : aaaaa",
+        "6 : aaaaaa",
+        "7 : aaaaaac",
+        "8 : aaaaaacd",
+        "9 : aaaaaacde",
+        "10 : aaaaaacdee",
+        "11 : aaaaaacdeee",
+        "12 : aaaaaacdeeee",
+        "13 : aaaaaacdeeeee",
+        "14 : aaaaaacdeeeeee",
+        "15 : aaaaaacdeeeeeef",
+        "16 : aaaaaacdeeeeeeg",
+        "17 : aaaaaacdeeeeeeh",
+        "...",
+        "28 : aaaaaacdeeeeeey",
+        "29 : aaaaaacdeeeeef",
+        "30 : aaaaaacdeeeeefe",
+        "...",
+        "115246685191495242: euleoywuttttsss",
+        "115246685191495243: euler",
+        "115246685191495244: eulera",
+        "...",
+        "525069350231428029: ywuuttttssssrrrDefine P(w) as the position of the word w.",
+        "Define W(p) as the word in position p.",
+        "We can see that P(w) and W(p) are inverses: P(W(p)) = p and W(P(w)) = w.",
+        "Examples:",
+        "W(10) = aaaaaacdee",
+        "P(aaaaaacdee) = 10",
+        "W(115246685191495243) = euler",
+        "P(euler) = 115246685191495243Find W(P(legionary) + P(calorimeters) - P(annihilate) + P(orchestrated) - P(fluttering)).",
+        "Give your answer using lowercase characters (no punctuation or space)."
+      ]
+    },
+    {
+      "_id": "5900f54d1000cf542c510060",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 481: Chef Showdown",
+      "tests": [
+        "assert.strictEqual(euler481(), TODO: MISSING ANSWER, 'message: <code>euler481()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler481() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler481();"
+      ],
+      "description": [
+        "A group of chefs (numbered #1, #2, etc) participate in a turn-based strategic cooking competition. On each chef's turn, he/she cooks up a dish to the best of his/her ability and gives it to a separate panel of judges for taste-testing. Let S(k) represent chef #k's skill level (which is publicly known). More specifically, S(k) is the probability that chef #k's dish will be assessed favorably by the judges (on any/all turns). If the dish receives a favorable rating, then the chef must choose one other chef to be eliminated from the competition. The last chef remaining in the competition is the winner.",
+        "",
+        "The game always begins with chef #1, with the turn order iterating sequentially over the rest of the chefs still in play. Then the cycle repeats from the lowest-numbered chef. All chefs aim to optimize their chances of winning within the rules as stated, assuming that the other chefs behave in the same manner. In the event that a chef has more than one equally-optimal elimination choice, assume that the chosen chef is always the one with the next-closest turn.",
+        "",
+        "Define Wn(k) as the probability that chef #k wins in a competition with n chefs. If we have S(1) = 0.25, S(2) = 0.5, and S(3) = 1, then W3(1) = 0.29375.",
+        "",
+        "Going forward, we assign S(k) = Fk/Fn+1 over all 1 ≤ k ≤ n, where Fk is a Fibonacci number: Fk = Fk-1 + Fk-2 with base cases F1 = F2 = 1. Then, for example, when considering a competition with n = 7 chefs, we have W7(1) = 0.08965042, W7(2) = 0.20775702, W7(3) = 0.15291406, W7(4) = 0.14554098, W7(5) = 0.15905291, W7(6) = 0.10261412, and W7(7) = 0.14247050, rounded to 8 decimal places each.",
+        "",
+        "Let E(n) represent the expected number of dishes cooked in a competition with n chefs. For instance, E(7) = 42.28176050.",
+        "",
+        "Find E(14) rounded to 8 decimal places."
+      ]
+    },
+    {
+      "_id": "5900f54f1000cf542c510061",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 482: The incenter of a triangle",
+      "tests": [
+        "assert.strictEqual(euler482(), TODO: MISSING ANSWER, 'message: <code>euler482()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler482() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler482();"
+      ],
+      "description": [
+        "ABC is an integer sided triangle with incenter I and perimeter p.",
+        "The segments IA, IB and IC have integral length as well. ",
+        "",
+        "",
+        "Let L = p + |IA| + |IB| + |IC|. ",
+        "",
+        "",
+        "Let S(P) = ∑L for all such triangles where p ≤ P. For example, S(103) = 3619.",
+        "",
+        "",
+        "Find S(107)."
+      ]
+    },
+    {
+      "_id": "5900f54f1000cf542c510062",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 483: Repeated permutation",
+      "tests": [
+        "assert.strictEqual(euler483(), TODO: MISSING ANSWER, 'message: <code>euler483()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler483() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler483();"
+      ],
+      "description": [
+        "We define a permutation as an operation that rearranges the order of the elements {1, 2, 3, ..., n}.",
+        "There are n! such permutations, one of which leaves the elements in their initial order.",
+        "For n = 3 we have 3! = 6 permutations:",
+        "- P1 = keep the initial order",
+        "- P2 = exchange the 1st and 2nd elements",
+        "- P3 = exchange the 1st and 3rd elements",
+        "- P4 = exchange the 2nd and 3rd elements",
+        "- P5 = rotate the elements to the right",
+        "- P6 = rotate the elements to the left",
+        "",
+        "",
+        "If we select one of these permutations, and we re-apply the same permutation repeatedly, we eventually restore the initial order.For a permutation Pi, let f(Pi) be the number of steps required to restore the initial order by applying the permutation Pi repeatedly.For n = 3, we obtain:- f(P1) = 1 : (1,2,3) → (1,2,3)- f(P2) = 2 : (1,2,3) → (2,1,3) → (1,2,3)- f(P3) = 2 : (1,2,3) → (3,2,1) → (1,2,3)- f(P4) = 2 : (1,2,3) → (1,3,2) → (1,2,3)- f(P5) = 3 : (1,2,3) → (3,1,2) → (2,3,1) → (1,2,3)- f(P6) = 3 : (1,2,3) → (2,3,1) → (3,1,2) → (1,2,3)",
+        "",
+        "",
+        "Let g(n) be the average value of f2(Pi) over all permutations Pi of length n.g(3) = (12 + 22 + 22 + 22 + 32 + 32)/3! = 31/6 ≈ 5.166666667e0g(5) = 2081/120 ≈ 1.734166667e1g(20) = 12422728886023769167301/2432902008176640000 ≈ 5.106136147e3",
+        "",
+        "",
+        "Find g(350) and write the answer in scientific notation rounded to 10 significant digits, using a lowercase e to separate mantissa and exponent, as in the examples above."
+      ]
+    },
+    {
+      "_id": "5900f5501000cf542c510063",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 484: Arithmetic Derivative",
+      "tests": [
+        "assert.strictEqual(euler484(), TODO: MISSING ANSWER, 'message: <code>euler484()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler484() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler484();"
+      ],
+      "description": [
+        "The arithmetic derivative is defined by",
+        "p' = 1 for any prime p",
+        "(ab)' = a'b + ab' for all integers a, b (Leibniz rule)",
+        "For example, 20' = 24",
+        "",
+        "Find ∑ gcd(k,k') for 1 < k ≤ 5·1015",
+        "",
+        "Note: gcd(x,y) denotes the greatest common divisor of x and y."
+      ]
+    },
+    {
+      "_id": "5900f5511000cf542c510064",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 485: Maximum number of divisors",
+      "tests": [
+        "assert.strictEqual(euler485(), 51281274340, 'message: <code>euler485()</code> should return 51281274340.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler485() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler485();"
+      ],
+      "description": [
+        "Let d(n) be the number of divisors of n.",
+        "Let M(n,k) be the maximum value of d(j) for n ≤ j ≤ n+k-1.",
+        "Let S(u,k) be the sum of M(n,k) for 1 ≤ n ≤ u-k+1.",
+        "",
+        "",
+        "You are given that S(1000,10)=17176.",
+        "",
+        "",
+        "Find S(100 000 000,100 000)."
+      ]
+    },
+    {
+      "_id": "5900f5531000cf542c510065",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 486: Palindrome-containing strings",
+      "tests": [
+        "assert.strictEqual(euler486(), 11408450515, 'message: <code>euler486()</code> should return 11408450515.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler486() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler486();"
+      ],
+      "description": [
+        "Let F5(n) be the number of strings s such that:",
+        "s consists only of '0's and '1's,",
+        "s has length at most n, and",
+        "s contains a palindromic substring of length at least 5.",
+        "For example, F5(4) = 0, F5(5) = 8, ",
+        "F5(6) = 42 and F5(11) = 3844.",
+        "",
+        "Let D(L) be the number of integers n such that ",
+        "5 ≤ n ≤ L and F5(n) is divisible by 87654321.",
+        "",
+        "For example, D(107) = 0 and D(5·109) = 51.",
+        "",
+        "Find D(1018)."
+      ]
+    },
+    {
+      "_id": "5900f5531000cf542c510066",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 487: Sums of power sums",
+      "tests": [
+        "assert.strictEqual(euler487(), 106650212746, 'message: <code>euler487()</code> should return 106650212746.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler487() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler487();"
+      ],
+      "description": [
+        "Let fk(n) be the sum of the kth powers of the first n positive integers.",
+        "",
+        "For example, f2(10) = 12 + 22 + 32 + 42 + 52 + 62 + 72 + 82 + 92 + 102 = 385.",
+        "",
+        "Let Sk(n) be the sum of fk(i) for 1 ≤ i ≤ n. For example, S4(100) = 35375333830.",
+        "",
+        "What is ∑ (S10000(1012) mod p) over all primes p between 2 ⋅ 109 and 2 ⋅ 109 + 2000?"
+      ]
+    },
+    {
+      "_id": "5900f5541000cf542c510067",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 488: Unbalanced Nim",
+      "tests": [
+        "assert.strictEqual(euler488(), TODO: MISSING ANSWER, 'message: <code>euler488()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler488() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler488();"
+      ],
+      "description": [
+        "Alice and Bob have enjoyed playing Nim every day. However, they finally got bored of playing ordinary three-heap Nim.",
+        "So, they added an extra rule:",
+        "",
+        "- Must not make two heaps of the same size.",
+        "",
+        "The triple (a,b,c) indicates the size of three heaps.",
+        "Under this extra rule, (2,4,5) is one of the losing positions for the next player.",
+        "",
+        "To illustrate:",
+        "- Alice moves to (2,4,3)",
+        "- Bob   moves to (0,4,3)",
+        "- Alice moves to (0,2,3)",
+        "- Bob   moves to (0,2,1)",
+        "",
+        "Unlike ordinary three-heap Nim, (0,1,2) and its permutations are the end states of this game.",
+        "",
+        "For an integer N, we define F(N) as the sum of a+b+c for all the losing positions for the next player, with 0 < a < b < c < N.",
+        "",
+        "For example, F(8) = 42, because there are 4 losing positions for the next player, (1,3,5), (1,4,6), (2,3,6) and (2,4,5).",
+        "We can also verify that F(128) = 496062.",
+        "",
+        "Find the last 9 digits of F(1018)."
+      ]
+    },
+    {
+      "_id": "5900f5561000cf542c510068",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 489: Common factors between two sequences",
+      "tests": [
+        "assert.strictEqual(euler489(), TODO: MISSING ANSWER, 'message: <code>euler489()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler489() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler489();"
+      ],
+      "description": [
+        "Let G(a, b) be the smallest non-negative integer n for which gcd(n3 + b, (n + a)3 + b) is maximized.",
+        "For example, G(1, 1) = 5 because gcd(n3 + 1, (n + 1)3 + 1) reaches its maximum value of 7 for n = 5, and is smaller for 0 ≤ n < 5.",
+        "Let H(m, n) = Σ G(a, b) for 1 ≤ a ≤ m, 1 ≤ b ≤ n.",
+        "You are given H(5, 5) = 128878 and H(10, 10) = 32936544.",
+        "Find H(18, 1900)."
+      ]
+    },
+    {
+      "_id": "5900f5561000cf542c510069",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 490: Jumping frog",
+      "tests": [
+        "assert.strictEqual(euler490(), TODO: MISSING ANSWER, 'message: <code>euler490()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler490() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler490();"
+      ],
+      "description": [
+        "There are n stones in a pond, numbered 1 to n. Consecutive stones are spaced one unit apart.",
+        "",
+        "A frog sits on stone 1. He wishes to visit each stone exactly once, stopping on stone n. However, he can only jump from one stone to another if they are at most 3 units apart. In other words, from stone i, he can reach a stone j if 1 ≤ j ≤ n and j is in the set {i-3, i-2, i-1, i+1, i+2, i+3}.",
+        "",
+        "Let f(n) be the number of ways he can do this. For example, f(6) = 14, as shown below:",
+        "1 → 2 → 3 → 4 → 5 → 6 ",
+        "1 → 2 → 3 → 5 → 4 → 6 ",
+        "1 → 2 → 4 → 3 → 5 → 6 ",
+        "1 → 2 → 4 → 5 → 3 → 6 ",
+        "1 → 2 → 5 → 3 → 4 → 6 ",
+        "1 → 2 → 5 → 4 → 3 → 6 ",
+        "1 → 3 → 2 → 4 → 5 → 6 ",
+        "1 → 3 → 2 → 5 → 4 → 6 ",
+        "1 → 3 → 4 → 2 → 5 → 6 ",
+        "1 → 3 → 5 → 2 → 4 → 6 ",
+        "1 → 4 → 2 → 3 → 5 → 6 ",
+        "1 → 4 → 2 → 5 → 3 → 6 ",
+        "1 → 4 → 3 → 2 → 5 → 6 ",
+        "1 → 4 → 5 → 2 → 3 → 6",
+        "",
+        "Other examples are f(10) = 254 and f(40) = 1439682432976.",
+        "",
+        "Let S(L) = ∑ f(n)3 for 1 ≤ n ≤ L.",
+        "Examples:",
+        "S(10) = 18230635",
+        "S(20) = 104207881192114219",
+        "S(1 000) mod 109 = 225031475",
+        "S(1 000 000) mod 109 = 363486179",
+        "",
+        "Find S(1014) mod 109."
+      ]
+    },
+    {
+      "_id": "5900f5591000cf542c51006b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 491: Double pandigital number divisible by 11",
+      "tests": [
+        "assert.strictEqual(euler491(), 194505988824000, 'message: <code>euler491()</code> should return 194505988824000.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler491() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler491();"
+      ],
+      "description": [
+        "We call a positive integer double pandigital if it uses all the digits 0 to 9 exactly twice (with no leading zero). For example, 40561817703823564929 is one such number.",
+        "",
+        "How many double pandigital numbers are divisible by 11?"
+      ]
+    },
+    {
+      "_id": "5900f5581000cf542c51006a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 492: Exploding sequence",
+      "tests": [
+        "assert.strictEqual(euler492(), TODO: MISSING ANSWER, 'message: <code>euler492()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler492() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler492();"
+      ],
+      "description": [
+        "Define the sequence a1, a2, a3, ... as:",
+        "a1 = 1",
+        "an+1 = 6an2 + 10an + 3 for n ≥ 1.",
+        "",
+        "Examples:",
+        "a3 = 2359",
+        "a6 = 269221280981320216750489044576319",
+        "a6 mod 1 000 000 007 = 203064689",
+        "a100 mod 1 000 000 007 = 456482974",
+        "",
+        "",
+        "",
+        "Define B(x,y,n) as ∑ (an mod p) for every prime p such that x ≤ p ≤ x+y.",
+        "",
+        "",
+        "",
+        "Examples:",
+        "B(109, 103, 103) = 23674718882",
+        "B(109, 103, 1015) = 20731563854",
+        "",
+        "",
+        "Find B(109, 107, 1015)."
+      ]
+    },
+    {
+      "_id": "5900f55a1000cf542c51006c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 493: Under The Rainbow",
+      "tests": [
+        "assert.strictEqual(euler493(), 6.818741802, 'message: <code>euler493()</code> should return 6.818741802.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler493() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler493();"
+      ],
+      "description": [
+        "70 colored balls are placed in an urn, 10 for each of the seven rainbow colors.",
+        "What is the expected number of distinct colors in 20 randomly picked balls?",
+        "Give your answer with nine digits after the decimal point (a.bcdefghij)."
+      ]
+    },
+    {
+      "_id": "5900f55a1000cf542c51006d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 494: Collatz prefix families",
+      "tests": [
+        "assert.strictEqual(euler494(), TODO: MISSING ANSWER, 'message: <code>euler494()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler494() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler494();"
+      ],
+      "description": [
+        "The Collatz sequence is defined as:",
+        "$a_{i+1} = \\left\\{  \\large{\\frac {a_i} 2 \\atop 3 a_i+1} {\\text{if }a_i\\text{ is even} \\atop \\text{if }a_i\\text{ is odd}} \\right.$.",
+        "",
+        "",
+        "The Collatz conjecture states that starting from any positive integer, the sequence eventually reaches the cycle 1,4,2,1....",
+        "We shall define the sequence prefix p(n) for the Collatz sequence starting with a1 = n as the sub-sequence of all numbers not a power of 2 (20=1 is considered a power of 2 for this problem). For example:p(13) = {13, 40, 20, 10, 5} p(8) = {}",
+        "Any number invalidating the conjecture would have an infinite length sequence prefix.",
+        "",
+        "",
+        "Let Sm be the set of all sequence prefixes of length m. Two sequences {a1, a2, ..., am} and {b1, b2, ..., bm} in Sm are said to belong to the same prefix family if ai < aj if and only if bi < bj for all 1 ≤ i,j ≤ m.",
+        "",
+        "",
+        "For example, in S4, {6, 3, 10, 5} is in the same family as {454, 227, 682, 341}, but not {113, 340, 170, 85}.",
+        "Let f(m) be the number of distinct prefix families in Sm.",
+        "You are given f(5) = 5, f(10) = 55, f(20) = 6771.",
+        "",
+        "",
+        "Find f(90)."
+      ]
+    },
+    {
+      "_id": "5900f55b1000cf542c51006e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 495: Writing n as the product of k distinct positive integers",
+      "tests": [
+        "assert.strictEqual(euler495(), TODO: MISSING ANSWER, 'message: <code>euler495()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler495() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler495();"
+      ],
+      "description": [
+        "Let W(n,k) be the number of ways in which n can be written as the product of k distinct positive integers.",
+        "For example, W(144,4) = 7. There are 7 ways in which 144 can be written as a product of 4 distinct positive integers:",
+        "144 = 1×2×4×18",
+        "144 = 1×2×8×9",
+        "144 = 1×2×3×24",
+        "144 = 1×2×6×12",
+        "144 = 1×3×4×12",
+        "144 = 1×3×6×8",
+        "144 = 2×3×4×6",
+        "Note that permutations of the integers themselves are not considered distinct.",
+        "Furthermore, W(100!,10) modulo 1 000 000 007 = 287549200.",
+        "Find W(10000!,30) modulo 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f55d1000cf542c51006f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 496: Incenter and circumcenter of triangle",
+      "tests": [
+        "assert.strictEqual(euler496(), 2042473533769142800, 'message: <code>euler496()</code> should return 2042473533769142800.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler496() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler496();"
+      ],
+      "description": [
+        "Given an integer sided triangle ABC:",
+        "Let I be the incenter of ABC.",
+        "Let D be the intersection between the line AI and the circumcircle of ABC (A ≠ D).",
+        "",
+        "We define F(L) as the sum of BC for the triangles ABC that satisfy AC = DI and BC ≤ L.",
+        "",
+        "For example, F(15) = 45 because the triangles ABC with (BC,AC,AB) = (6,4,5), (12,8,10), (12,9,7), (15,9,16) satisfy the conditions.",
+        "",
+        "Find F(109)."
+      ]
+    },
+    {
+      "_id": "5900f55f1000cf542c510070",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 497: Drunken Tower of Hanoi",
+      "tests": [
+        "assert.strictEqual(euler497(), 684901360, 'message: <code>euler497()</code> should return 684901360.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler497() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler497();"
+      ],
+      "description": [
+        "Bob is very familiar with the famous mathematical puzzle/game, \"Tower of Hanoi,\" which consists of three upright rods and disks of different sizes that can slide onto any of the rods. The game begins with a stack of n disks placed on the leftmost rod in descending order by size. The objective of the game is to move all of the disks from the leftmost rod to the rightmost rod, given the following restrictions:",
+        "",
+        "Only one disk can be moved at a time.",
+        "A valid move consists of taking the top disk from one stack and placing it onto another stack (or an empty rod).",
+        "No disk can be placed on top of a smaller disk.",
+        "Moving on to a variant of this game, consider a long room k units (square tiles) wide, labeled from 1 to k in ascending order. Three rods are placed at squares a, b, and c, and a stack of n disks is placed on the rod at square a.",
+        "",
+        "Bob begins the game standing at square b. His objective is to play the Tower of Hanoi game by moving all of the disks to the rod at square c. However, Bob can only pick up or set down a disk if he is on the same square as the rod / stack in question.",
+        "",
+        "Unfortunately, Bob is also drunk. On a given move, Bob will either stumble one square to the left or one square to the right with equal probability, unless Bob is at either end of the room, in which case he can only move in one direction. Despite Bob's inebriated state, he is still capable of following the rules of the game itself, as well as choosing when to pick up or put down a disk.",
+        "",
+        "The following animation depicts a side-view of a sample game for n = 3, k = 7, a = 2, b = 4, and c = 6:",
+        "",
+        "",
+        "",
+        "Let E(n,k,a,b,c) be the expected number of squares that Bob travels during a single optimally-played game. A game is played optimally if the number of disk-pickups is minimized.",
+        "",
+        "Interestingly enough, the result is always an integer. For example, E(2,5,1,3,5) = 60 and E(3,20,4,9,17) = 2358.",
+        "",
+        "Find the last nine digits of ∑1≤n≤10000 E(n,10n,3n,6n,9n)."
+      ]
+    },
+    {
+      "_id": "5900f55f1000cf542c510071",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 498: Remainder of polynomial division",
+      "tests": [
+        "assert.strictEqual(euler498(), 472294837, 'message: <code>euler498()</code> should return 472294837.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler498() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler498();"
+      ],
+      "description": [
+        "For positive integers n and m, we define two polynomials Fn(x) = xn and Gm(x) = (x-1)m.",
+        "We also define a polynomial Rn,m(x) as the remainder of the division of Fn(x) by Gm(x).",
+        "For example, R6,3(x) = 15x2 - 24x + 10.",
+        "",
+        "Let C(n, m, d) be the absolute value of the coefficient of the d-th degree term of Rn,m(x).",
+        "We can verify that C(6, 3, 1) = 24 and C(100, 10, 4) = 227197811615775.",
+        "",
+        "Find C(1013, 1012, 104) mod 999999937."
+      ]
+    },
+    {
+      "_id": "5900f5611000cf542c510072",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 499: St. Petersburg Lottery",
+      "tests": [
+        "assert.strictEqual(euler499(), 0.8660312, 'message: <code>euler499()</code> should return 0.8660312.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler499() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler499();"
+      ],
+      "description": [
+        "A gambler decides to participate in a special lottery. In this lottery the gambler plays a series of one or more games.",
+        "Each game costs m pounds to play and starts with an initial pot of 1 pound. The gambler flips an unbiased coin. Every time a head appears, the pot is doubled and the gambler continues. When a tail appears, the game ends and the gambler collects the current value of the pot. The gambler is certain to win at least 1 pound, the starting value of the pot, at the cost of m pounds, the initial fee.",
+        "",
+        "The gambler cannot continue to play if his fortune falls below m pounds.",
+        "Let pm(s) denote the probability that the gambler will never run out of money in this lottery given his initial fortune s and the cost per game m.",
+        "For example p2(2) ≈ 0.2522, p2(5) ≈ 0.6873 and p6(10 000) ≈ 0.9952 (note: pm(s) = 0 for s < m).",
+        "",
+        "Find p15(109) and give your answer rounded to 7 decimal places behind the decimal point in the form 0.abcdefg."
+      ]
+    },
+    {
+      "_id": "5900f5611000cf542c510073",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 500: Problem 500!!!",
+      "tests": [
+        "assert.strictEqual(euler500(), 35407281, 'message: <code>euler500()</code> should return 35407281.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler500() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler500();"
+      ],
+      "description": [
+        "The number of divisors of 120 is 16.",
+        "In fact 120 is the smallest number having 16 divisors.",
+        "",
+        "",
+        "Find the smallest number with 2500500 divisors.",
+        "Give your answer modulo 500500507."
+      ]
+    },
+    {
+      "_id": "5900f5621000cf542c510074",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 501: Eight Divisors",
+      "tests": [
+        "assert.strictEqual(euler501(), 197912312715, 'message: <code>euler501()</code> should return 197912312715.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler501() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler501();"
+      ],
+      "description": [
+        "The eight divisors of 24 are 1, 2, 3, 4, 6, 8, 12 and 24.",
+        "The ten numbers not exceeding 100 having exactly eight divisors are 24, 30, 40, 42, 54, 56, 66, 70, 78 and 88.",
+        "Let f(n) be the count of numbers not exceeding n with exactly eight divisors.",
+        "You are given f(100) = 10, f(1000) = 180 and f(106) = 224427.",
+        "Find f(1012)."
+      ]
+    },
+    {
+      "_id": "5900f5621000cf542c510075",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 502: Counting Castles",
+      "tests": [
+        "assert.strictEqual(euler502(), TODO: MISSING ANSWER, 'message: <code>euler502()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler502() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler502();"
+      ],
+      "description": [
+        "We define a block to be a rectangle with a height of 1 and an integer-valued length. Let a castle be a configuration of stacked blocks.",
+        "",
+        "Given a game grid that is w units wide and h units tall, a castle is generated according to the following rules:",
+        "",
+        "",
+        "Blocks can be placed on top of other blocks as long as nothing sticks out past the edges or hangs out over open space.",
+        "All blocks are aligned/snapped to the grid.",
+        "Any two neighboring blocks on the same row have at least one unit of space between them.",
+        "The bottom row is occupied by a block of length w.",
+        "The maximum achieved height of the entire castle is exactly h.",
+        "The castle is made from an even number of blocks.",
+        "The following is a sample castle for w=8 and h=5:",
+        "",
+        "",
+        "",
+        "Let F(w,h) represent the number of valid castles, given grid parameters w and h.",
+        "",
+        "For example, F(4,2) = 10, F(13,10) = 3729050610636, F(10,13) = 37959702514, and F(100,100) mod 1 000 000 007 = 841913936.",
+        "",
+        "Find (F(1012,100) + F(10000,10000) + F(100,1012)) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f5631000cf542c510076",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 503: Compromise or persist",
+      "tests": [
+        "assert.strictEqual(euler503(), 3.8694550145, 'message: <code>euler503()</code> should return 3.8694550145.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler503() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler503();"
+      ],
+      "description": [
+        "Alice is playing a game with n cards numbered 1 to n.",
+        "",
+        "A game consists of iterations of the following steps.",
+        "(1) Alice picks one of the cards at random.",
+        "(2) Alice cannot see the number on it. Instead, Bob, one of her friends, sees the number and tells Alice how many previously-seen numbers are bigger than the number which he is seeing.",
+        "(3) Alice can end or continue the game. If she decides to end, the number becomes her score. If she decides to continue, the card is removed from the game and she returns to (1). If there is no card left, she is forced to end the game.",
+        "",
+        "Let F(n) be the Alice's expected score if she takes the optimized strategy to minimize her score.",
+        "",
+        "For example, F(3) = 5/3. At the first iteration, she should continue the game. At the second iteration, she should end the game if Bob says that one previously-seen number is bigger than the number which he is seeing, otherwise she should continue the game.",
+        "",
+        "We can also verify that F(4) = 15/8 and F(10) ≈ 2.5579365079.",
+        "",
+        "Find F(106). Give your answer rounded to 10 decimal places behind the decimal point."
+      ]
+    },
+    {
+      "_id": "5900f5641000cf542c510077",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 504: Square on the Inside",
+      "tests": [
+        "assert.strictEqual(euler504(), 694687, 'message: <code>euler504()</code> should return 694687.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler504() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler504();"
+      ],
+      "description": [
+        "Let ABCD be a quadrilateral whose vertices are lattice points lying on the coordinate axes as follows:",
+        "",
+        "A(a, 0), B(0, b), C(−c, 0), D(0, −d), where 1 ≤ a, b, c, d ≤ m and a, b, c, d, m are integers.",
+        "",
+        "It can be shown that for m = 4 there are exactly 256 valid ways to construct ABCD. Of these 256 quadrilaterals, 42 of them strictly contain a square number of lattice points.",
+        "",
+        "How many quadrilaterals ABCD strictly contain a square number of lattice points for m = 100?"
+      ]
+    },
+    {
+      "_id": "5900f5661000cf542c510078",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 505: Bidirectional Recurrence",
+      "tests": [
+        "assert.strictEqual(euler505(), TODO: MISSING ANSWER, 'message: <code>euler505()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler505() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler505();"
+      ],
+      "description": [
+        "Let:",
+        "$\\begin{array}{ll} x(0)&=0 \\\\ x(1)&=1 \\\\ x(2k)&=(3x(k)+2x(\\lfloor \\frac k 2 \\rfloor)) \\text{ mod } 2^{60} \\text{ for } k \\ge 1 \\text {, where } \\lfloor \\text { } \\rfloor \\text { is the floor function} \\\\ x(2k+1)&=(2x(k)+3x(\\lfloor \\frac k 2 \\rfloor)) \\text{ mod } 2^{60} \\text{ for } k \\ge 1 \\\\ y_n(k)&=\\left\\{{\\begin{array}{lc} x(k) && \\text{if } k \\ge n \\\\ 2^{60} - 1 - max(y_n(2k),y_n(2k+1)) && \\text{if } k < n \\end{array}} \\right. \\\\ A(n)&=y_n(1) \\end{array}$",
+        "You are given:",
+        "$\\begin{array}{ll} x(2)&=3 \\\\ x(3)&=2 \\\\ x(4)&=11 \\\\ y_4(4)&=11 \\\\ y_4(3)&=2^{60}-9\\\\ y_4(2)&=2^{60}-12 \\\\ y_4(1)&=A(4)=8 \\\\ A(10)&=2^{60}-34\\\\ A(10^3)&=101881 \\end{array}$",
+        "Find $A(10^{12})$."
+      ]
+    },
+    {
+      "_id": "5900f5671000cf542c510079",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 506: Clock sequence",
+      "tests": [
+        "assert.strictEqual(euler506(), 18934502, 'message: <code>euler506()</code> should return 18934502.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler506() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler506();"
+      ],
+      "description": [
+        "Consider the infinite repeating sequence of digits:",
+        "1234321234321234321...",
+        "Amazingly, you can break this sequence of digits into a sequence of integers such that the sum of the digits in the n'th value is n.",
+        "The sequence goes as follows:",
+        "1, 2, 3, 4, 32, 123, 43, 2123, 432, 1234, 32123, ...",
+        "Let vn be the n'th value in this sequence. For example, v2 = 2, v5 = 32 and v11 = 32123.",
+        "Let S(n) be v1 + v2 + ... + vn. For example, S(11) = 36120, and S(1000) mod 123454321 = 18232686.",
+        "Find S(1014) mod 123454321."
+      ]
+    },
+    {
+      "_id": "5900f5671000cf542c51007a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 507: Shortest Lattice Vector",
+      "tests": [
+        "assert.strictEqual(euler507(), TODO: MISSING ANSWER, 'message: <code>euler507()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler507() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler507();"
+      ],
+      "description": [
+        "Let $t_n$ be the tribonacci numbers defined as:",
+        "$t_0 = t_1 = 0$;",
+        "$t_2 = 1$;",
+        "$t_n = t_{n-1} + t_{n-2} + t_{n-3}$ for $n \\ge 3$",
+        "and let $r_n = t_n \\text{ mod } 10^7$.",
+        "",
+        "",
+        "For each pair of Vectors $V_n=(v_1,v_2,v_3)$ and $W_n=(w_1,w_2,w_3)$ with $v_1=r_{12n-11}-r_{12n-10}, v_2=r_{12n-9}+r_{12n-8}, v_3=r_{12n-7} \\cdot r_{12n-6}$  and  $w_1=r_{12n-5}-r_{12n-4}, w_2=r_{12n-3}+r_{12n-2}, w_3=r_{12n-1} \\cdot r_{12n}$",
+        "",
+        "",
+        "we define $S(n)$ as the minimal value of the manhattan length of the vector $D=k \\cdot V_n+l \\cdot W_n$ measured as $|k \\cdot v_1+l \\cdot w_1|+|k \\cdot v_2+l \\cdot w_2|+|k \\cdot v_3+l \\cdot w_3|$",
+        " for any integers $k$ and $l$ with $(k,l)\\neq (0,0)$.",
+        "",
+        "The first vector pair  is (-1, 3, 28), (-11, 125, 40826).",
+        "You are given that $S(1)=32$ and $\\sum_{n=1}^{10} S(n)=130762273722$.",
+        "",
+        "",
+        "Find $\\sum_{n=1}^{20000000} S(n)$."
+      ]
+    },
+    {
+      "_id": "5900f5691000cf542c51007c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 508: Integers in base i-1",
+      "tests": [
+        "assert.strictEqual(euler508(), TODO: MISSING ANSWER, 'message: <code>euler508()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler508() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler508();"
+      ],
+      "description": [
+        "Consider the Gaussian integer i-1. A base i-1 representation of a Gaussian integer a+bi is a finite sequence of digits dn-1dn-2...d1d0 such that:",
+        "",
+        "a+bi = dn-1(i-1)n-1 + dn-2(i-1)n-2 + ... + d1(i-1) + d0",
+        "Each dk is in {0,1}",
+        "There are no leading zeroes, i.e. dn-1 ≠ 0, unless a+bi is itself 0",
+        "Here are base i-1 representations of a few Gaussian integers:",
+        "11+24i → 111010110001101",
+        "24-11i → 110010110011",
+        "8+0i → 111000000",
+        "-5+0i → 11001101",
+        "0+0i → 0",
+        "",
+        "Remarkably, every Gaussian integer has a unique base i-1 representation!",
+        "",
+        "Define f(a+bi) as the number of 1s in the unique base i-1 representation of a+bi. For example, f(11+24i) = 9 and f(24-11i) = 7.",
+        "",
+        "Define B(L) as the sum of f(a+bi) for all integers a, b such that |a| ≤ L and |b| ≤ L. For example, B(500) = 10795060.",
+        "",
+        "Find B(1015) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900f5691000cf542c51007b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 509: Divisor Nim",
+      "tests": [
+        "assert.strictEqual(euler509(), 151725678, 'message: <code>euler509()</code> should return 151725678.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler509() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler509();"
+      ],
+      "description": [
+        "Anton and Bertrand love to play three pile Nim.",
+        "However, after a lot of games of Nim they got bored and changed the rules somewhat.",
+        "They may only take a number of stones from a pile that is a proper divisor of the number of stones present in the pile. E.g. if a pile at a certain moment contains 24 stones they may take only 1,2,3,4,6,8 or 12 stones from that pile.",
+        "So if a pile contains one stone they can't take the last stone from it as 1 isn't a proper divisor of 1.",
+        "The first player that can't make a valid move loses the game.",
+        "Of course both Anton and Bertrand play optimally.",
+        "",
+        "The triple (a,b,c) indicates the number of stones in the three piles.",
+        "Let S(n) be the number of winning positions for the next player for 1 ≤ a, b, c ≤ n.S(10) = 692 and S(100) = 735494.",
+        "",
+        "Find S(123456787654321) modulo 1234567890."
+      ]
+    },
+    {
+      "_id": "5900f56b1000cf542c51007d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 510: Tangent Circles",
+      "tests": [
+        "assert.strictEqual(euler510(), 315306518862563700, 'message: <code>euler510()</code> should return 315306518862563700.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler510() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler510();"
+      ],
+      "description": [
+        "Circles A and B are tangent to each other and to line L at three distinct points.",
+        "Circle C is inside the space between A, B and L, and tangent to all three.",
+        "Let rA, rB and rC be the radii of A, B and C respectively.",
+        "Let S(n) = Σ rA + rB + rC, for 0 < rA ≤ rB ≤ n where rA, rB and rC are integers.",
+        "The only solution for 0 < rA ≤ rB ≤ 5 is rA = 4, rB = 4 and rC = 1, so S(5) = 4 + 4 + 1 = 9.",
+        "You are also given S(100) = 3072.",
+        "Find S(109)."
+      ]
+    },
+    {
+      "_id": "5900f56b1000cf542c51007e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 511: Sequences with nice divisibility properties",
+      "tests": [
+        "assert.strictEqual(euler511(), 935247012, 'message: <code>euler511()</code> should return 935247012.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler511() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler511();"
+      ],
+      "description": [
+        "Let Seq(n,k) be the number of positive-integer sequences {ai}1≤i≤n of length n such that:",
+        "n is divisible by ai for 1 ≤ i ≤ n, and",
+        "  n + a1 + a2 + ... + an is divisible by k.",
+        "Examples:",
+        "Seq(3,4) = 4, and the 4 sequences are:",
+        "{1, 1, 3}",
+        "{1, 3, 1}",
+        "{3, 1, 1}",
+        "{3, 3, 3}",
+        "Seq(4,11) = 8, and the 8 sequences are:",
+        "{1, 1, 1, 4}",
+        "{1, 1, 4, 1}",
+        "{1, 4, 1, 1}",
+        "{4, 1, 1, 1}",
+        "{2, 2, 2, 1}",
+        "{2, 2, 1, 2}",
+        "{2, 1, 2, 2}",
+        "{1, 2, 2, 2}",
+        "The last nine digits of Seq(1111,24) are 840643584.",
+        "Find the last nine digits of Seq(1234567898765,4321)."
+      ]
+    },
+    {
+      "_id": "5900f56d1000cf542c51007f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 512: Sums of totients of powers",
+      "tests": [
+        "assert.strictEqual(euler512(), 50660591862310320, 'message: <code>euler512()</code> should return 50660591862310320.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler512() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler512();"
+      ],
+      "description": [
+        "Let $\\varphi(n)$ be Euler's totient function.",
+        "Let $f(n)=(\\sum_{i=1}^{n}\\varphi(n^i)) \\text{ mod } (n+1)$.",
+        "Let $g(n)=\\sum_{i=1}^{n} f(i)$.",
+        "$g(100)=2007$.",
+        "",
+        "",
+        "Find $g(5 \\times 10^8)$."
+      ]
+    },
+    {
+      "_id": "5900f56e1000cf542c510080",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 513: Integral median",
+      "tests": [
+        "assert.strictEqual(euler513(), TODO: MISSING ANSWER, 'message: <code>euler513()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler513() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler513();"
+      ],
+      "description": [
+        "ABC is an integral sided triangle with sides a≤b≤c.",
+        "mc is the median connecting C and the midpoint of AB. ",
+        "F(n) is the number of such triangles with  c≤n for which mc has integral length as well.",
+        "F(10)=3 and F(50)=165.",
+        "",
+        "Find F(100000)."
+      ]
+    },
+    {
+      "_id": "5900f56f1000cf542c510081",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 514: Geoboard Shapes",
+      "tests": [
+        "assert.strictEqual(euler514(), TODO: MISSING ANSWER, 'message: <code>euler514()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler514() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler514();"
+      ],
+      "description": [
+        "A geoboard (of order N) is a square board with equally-spaced pins protruding from the surface, representing an integer point lattice for coordinates 0 ≤ x,y ≤ N.",
+        "",
+        "John begins with a pinless geoboard. Each position on the board is a hole that can be filled with a pin. John decides to generate a random integer between 1 and N+1 (inclusive) for each hole in the geoboard. If the random integer is equal to 1 for a given hole, then a pin is placed in that hole.",
+        "",
+        "After John is finished generating numbers for all (N+1)2 holes and placing any/all corresponding pins, he wraps a tight rubberband around the entire group of pins protruding from the board. Let S represent the shape that is formed. S can also be defined as the smallest convex shape that contains all the pins.",
+        "",
+        "",
+        "",
+        "The above image depicts a sample layout for N = 4. The green markers indicate positions where pins have been placed, and the blue lines collectively represent the rubberband. For this particular arrangement, S has an area of 6. If there are fewer than three pins on the board (or if all pins are collinear), S can be assumed to have zero area.",
+        "",
+        "Let E(N) be the expected area of S given a geoboard of order N. For example, E(1) = 0.18750, E(2) = 0.94335, and E(10) = 55.03013 when rounded to five decimal places each.",
+        "",
+        "Calculate E(100) rounded to five decimal places."
+      ]
+    },
+    {
+      "_id": "5900f5711000cf542c510083",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 515: Dissonant Numbers",
+      "tests": [
+        "assert.strictEqual(euler515(), 2422639000800, 'message: <code>euler515()</code> should return 2422639000800.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler515() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler515();"
+      ],
+      "description": [
+        "Let d(p,n,0) be the multiplicative inverse of n modulo prime p, defined as n × d(p,n,0) = 1 mod p.",
+        "Let d(p,n,k) = $\\sum_{i=1}^n$d(p,i,k−1) for k ≥ 1.",
+        "Let D(a,b,k) = $\\sum$(d(p,p-1,k) mod p) for all primes a ≤ p < a + b.",
+        "You are given:",
+        "D(101,1,10) = 45",
+        "D(103,102,102) = 8334",
+        "D(106,103,103) = 38162302Find D(109,105,105)."
+      ]
+    },
+    {
+      "_id": "5900f5701000cf542c510082",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 516: 5-smooth totients",
+      "tests": [
+        "assert.strictEqual(euler516(), 939087315, 'message: <code>euler516()</code> should return 939087315.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler516() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler516();"
+      ],
+      "description": [
+        "5-smooth numbers are numbers whose largest prime factor doesn't exceed 5.",
+        "5-smooth numbers are also called Hamming numbers.",
+        "Let S(L) be the sum of the numbers n not exceeding L such that Euler's totient function φ(n) is a Hamming number.",
+        "S(100)=3728.",
+        "",
+        "",
+        "Find S(1012). Give your answer modulo 232."
+      ]
+    },
+    {
+      "_id": "5900f5721000cf542c510084",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 517: A real recursion",
+      "tests": [
+        "assert.strictEqual(euler517(), 581468882, 'message: <code>euler517()</code> should return 581468882.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler517() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler517();"
+      ],
+      "description": [
+        "For every real number $a \\gt 1$ is given the sequence $g_a$ by:",
+        "$g_{a}(x)=1$ for $x \\lt a$",
+        "$g_{a}(x)=g_{a}(x-1)+g_a(x-a)$ for $x \\ge a$",
+        "",
+        "$G(n)=g_{\\sqrt {n}}(n)$",
+        "$G(90)=7564511$.",
+        "",
+        "Find $\\sum G(p)$ for $p$ prime and $10000000 \\lt p \\lt 10010000$",
+        "Give your answer modulo 1000000007."
+      ]
+    },
+    {
+      "_id": "5900f5721000cf542c510085",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 518: Prime triples and geometric sequences",
+      "tests": [
+        "assert.strictEqual(euler518(), 100315739184392, 'message: <code>euler518()</code> should return 100315739184392.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler518() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler518();"
+      ],
+      "description": [
+        "Let S(n) = Σ a+b+c over all triples (a,b,c) such that:",
+        "",
+        "a, b, and c are prime numbers.",
+        "a < b < c < n.",
+        "a+1, b+1, and c+1 form a geometric sequence.",
+        "For example, S(100) = 1035 with the following triples: ",
+        "",
+        "(2, 5, 11), (2, 11, 47), (5, 11, 23), (5, 17, 53), (7, 11, 17), (7, 23, 71), (11, 23, 47), (17, 23, 31), (17, 41, 97), (31, 47, 71), (71, 83, 97)",
+        "",
+        "Find S(108)."
+      ]
+    },
+    {
+      "_id": "5900f5741000cf542c510086",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 519: Tricolored Coin Fountains",
+      "tests": [
+        "assert.strictEqual(euler519(), 804739330, 'message: <code>euler519()</code> should return 804739330.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler519() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler519();"
+      ],
+      "description": [
+        "An arrangement of coins in one or more rows with the bottom row being a block without gaps and every coin in a higher row touching exactly two coins in the row below is called a fountain of coins. Let f(n) be the number of possible fountains with n coins. For 4 coins there are three possible arrangements:",
+        "",
+        "Therefore f(4) = 3 while f(10) = 78.",
+        "Let T(n) be the number of all possible colorings with three colors for all f(n) different fountains with n coins, given the condition that no two touching coins have the same color. Below you see the possible colorings for one of the three valid fountains for 4 coins:",
+        "",
+        "You are given that T(4) = 48 and T(10) = 17760.",
+        "Find the last 9 digits of T(20000)."
+      ]
+    },
+    {
+      "_id": "5900f5751000cf542c510087",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 520: Simbers",
+      "tests": [
+        "assert.strictEqual(euler520(), 238413705, 'message: <code>euler520()</code> should return 238413705.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler520() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler520();"
+      ],
+      "description": [
+        "We define a simber to be a positive integer in which any odd digit, if present, occurs an odd number of times, and any even digit, if present, occurs an even number of times.",
+        "",
+        "For example, 141221242 is a 9-digit simber because it has three 1's, four 2's and two 4's. ",
+        "",
+        "Let Q(n) be the count of all simbers with at most n digits. ",
+        "",
+        "You are given Q(7) = 287975 and Q(100) mod 1 000 000 123 = 123864868.",
+        "",
+        "Find (∑1≤u≤39 Q(2u)) mod 1 000 000 123."
+      ]
+    },
+    {
+      "_id": "5900f5751000cf542c510088",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 521: Smallest prime factor",
+      "tests": [
+        "assert.strictEqual(euler521(), 44389811, 'message: <code>euler521()</code> should return 44389811.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler521() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler521();"
+      ],
+      "description": [
+        "Let smpf(n) be the smallest prime factor of n.",
+        "smpf(91)=7 because 91=7×13 and smpf(45)=3 because 45=3×3×5.",
+        "Let S(n) be the sum of smpf(i) for 2 ≤ i ≤ n.",
+        "E.g. S(100)=1257.",
+        "",
+        "",
+        "",
+        "Find S(1012) mod 109."
+      ]
+    },
+    {
+      "_id": "5900f5761000cf542c510089",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 522: Hilbert's Blackout",
+      "tests": [
+        "assert.strictEqual(euler522(), TODO: MISSING ANSWER, 'message: <code>euler522()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler522() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler522();"
+      ],
+      "description": [
+        "Despite the popularity of Hilbert's infinite hotel, Hilbert decided to try managing extremely large finite hotels, instead. ",
+        "",
+        "To cut costs, Hilbert wished to power the new hotel with his own special generator. Each floor would send power to the floor above it, with the top floor sending power back down to the bottom floor. That way, Hilbert could have the generator placed on any given floor (as he likes having the option) and have electricity flow freely throughout the entire hotel.",
+        "",
+        "Unfortunately, the contractors misinterpreted the schematics when they built the hotel. They informed Hilbert that each floor sends power to another floor at random, instead. This may compromise Hilbert's freedom to have the generator placed anywhere, since blackouts could occur on certain floors.",
+        "",
+        "For example, consider a sample flow diagram for a three-story hotel:",
+        "",
+        "",
+        "",
+        "If the generator were placed on the first floor, then every floor would receive power. But if it were placed on the second or third floors instead, then there would be a blackout on the first floor. Note that while a given floor can receive power from many other floors at once, it can only send power to one other floor.",
+        "",
+        "To resolve the blackout concerns, Hilbert decided to have a minimal number of floors rewired. To rewire a floor is to change the floor it sends power to. In the sample diagram above, all possible blackouts can be avoided by rewiring the second floor to send power to the first floor instead of the third floor.",
+        "",
+        "Let F(n) be the sum of the minimum number of floor rewirings needed over all possible power-flow arrangements in a hotel of n floors. For example, F(3) = 6, F(8) = 16276736, and F(100) mod 135707531 = 84326147.",
+        "",
+        "Find F(12344321) mod 135707531."
+      ]
+    },
+    {
+      "_id": "5900fe885726495c153991c8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 523: First Sort I",
+      "tests": [
+        "assert.strictEqual(euler523(), TODO: MISSING ANSWER, 'message: <code>euler523()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler523() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler523();"
+      ],
+      "description": [
+        "Consider the following algorithm for sorting a list:",
+        "1. Starting from the beginning of the list, check each pair of adjacent elements in turn.",
+        "2. If the elements are out of order:",
+        "a. Move the smallest element of the pair at the beginning of the list.",
+        "b. Restart the process from step 1.",
+        "3. If all pairs are in order, stop.For example, the list { 4 1 3 2 } is sorted as follows:",
+        "4 1 3 2  (4 and 1 are out of order so move 1 to the front of the list)",
+        "1 4 3 2  (4 and 3 are out of order so move 3 to the front of the list)",
+        "3 1 4 2  (3 and 1 are out of order so move 1 to the front of the list)",
+        "1 3 4 2  (4 and 2 are out of order so move 2 to the front of the list)",
+        "2 1 3 4  (2 and 1 are out of order so move 1 to the front of the list)",
+        "1 2 3 4  (The list is now sorted)Let F(L) be the number of times step 2a is executed to sort list L. For example, F({ 4 1 3 2 }) = 5.",
+        "",
+        "Let E(n) be the expected value of F(P) over all permutations P of the integers {1, 2, ..., n}.",
+        "You are given E(4) = 3.25 and E(10) = 115.725.",
+        "",
+        "Find E(30). Give your answer rounded to two digits after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900fece58d9425c70af4f5e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 524: First Sort II",
+      "tests": [
+        "assert.strictEqual(euler524(), TODO: MISSING ANSWER, 'message: <code>euler524()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler524() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler524();"
+      ],
+      "description": [
+        "Consider the following algorithm for sorting a list:",
+        "1. Starting from the beginning of the list, check each pair of adjacent elements in turn.",
+        "2. If the elements are out of order:",
+        "a. Move the smallest element of the pair at the beginning of the list.",
+        "b. Restart the process from step 1.",
+        "3. If all pairs are in order, stop.For example, the list { 4 1 3 2 } is sorted as follows:",
+        "4 1 3 2  (4 and 1 are out of order so move 1 to the front of the list)",
+        "1 4 3 2  (4 and 3 are out of order so move 3 to the front of the list)",
+        "3 1 4 2  (3 and 1 are out of order so move 1 to the front of the list)",
+        "1 3 4 2  (4 and 2 are out of order so move 2 to the front of the list)",
+        "2 1 3 4  (2 and 1 are out of order so move 1 to the front of the list)",
+        "1 2 3 4  (The list is now sorted)Let F(L) be the number of times step 2a is executed to sort list L. For example, F({ 4 1 3 2 }) = 5.",
+        "",
+        "We can list all permutations P of the integers {1, 2, ..., n} in lexicographical order, and assign to each permutation an index In(P) from 1 to n! corresponding to its position in the list.",
+        "",
+        "Let Q(n, k) = min(In(P)) for F(P) = k, the index of the first permutation requiring exactly k steps to sort with First Sort. If there is no permutation for which F(P) = k, then Q(n, k) is undefined.",
+        "",
+        "For n = 4 we have:",
+        "",
+        "PI4(P)F(P){1, 2, 3, 4}10Q(4, 0) = 1{1, 2, 4, 3}24Q(4, 4) = 2{1, 3, 2, 4}32Q(4, 2) = 3{1, 3, 4, 2}42{1, 4, 2, 3}56Q(4, 6) = 5{1, 4, 3, 2}64{2, 1, 3, 4}71Q(4, 1) = 7{2, 1, 4, 3}85Q(4, 5) = 8{2, 3, 1, 4}91{2, 3, 4, 1}101{2, 4, 1, 3}115{2, 4, 3, 1}123Q(4, 3) = 12{3, 1, 2, 4}133{3, 1, 4, 2}143{3, 2, 1, 4}152{3, 2, 4, 1}162{3, 4, 1, 2}173{3, 4, 2, 1}182{4, 1, 2, 3}197Q(4, 7) = 19{4, 1, 3, 2}205{4, 2, 1, 3}216{4, 2, 3, 1}224{4, 3, 1, 2}234{4, 3, 2, 1}243Let R(k) = min(Q(n, k)) over all n for which Q(n, k) is defined.",
+        "",
+        "Find R(1212)."
+      ]
+    },
+    {
+      "_id": "5900fecf58d9425c70af4f5f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 525: Rolling Ellipse",
+      "tests": [
+        "assert.strictEqual(euler525(), TODO: MISSING ANSWER, 'message: <code>euler525()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler525() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler525();"
+      ],
+      "description": [
+        "An ellipse E(a, b) is given at its initial position by equation:",
+        "$\\frac {x^2} {a^2} + \\frac {(y - b)^2} {b^2} = 1$",
+        "",
+        "The ellipse rolls without slipping along the x axis for one complete turn. Interestingly, the length of the curve generated by a focus is independent from the size of the minor axis:",
+        "$F(a,b) =  2 \\pi \\text{ } max(a,b)$",
+        "",
+        "",
+        "",
+        "This is not true for the curve generated by the ellipse center. Let C(a,b) be the length of the curve generated by the center of the ellipse as it rolls without slipping for one turn.",
+        "",
+        "",
+        "",
+        "You are given C(2, 4) ~ 21.38816906.",
+        "",
+        "Find C(1, 4) + C(3, 4). Give your answer rounded to 8 digits behind the decimal point in the form ab.cdefghij."
+      ]
+    },
+    {
+      "_id": "5900fed058d9425c70af4f60",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 526: Largest prime factors of consecutive numbers",
+      "tests": [
+        "assert.strictEqual(euler526(), TODO: MISSING ANSWER, 'message: <code>euler526()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler526() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler526();"
+      ],
+      "description": [
+        "Let f(n) be the largest prime factor of n.",
+        "Let g(n) = f(n) + f(n+1) + f(n+2) + f(n+3) + f(n+4) + f(n+5) + f(n+6) + f(n+7) + f(n+8), the sum of the largest prime factor of each of nine consecutive numbers starting with n.",
+        "Let h(n) be the maximum value of g(k) for 2 ≤ k ≤ n.",
+        "You are given:",
+        "f(100) = 5",
+        "f(101) = 101",
+        "g(100) = 409",
+        "h(100) = 417",
+        "h(109) = 4896292593Find h(1016)."
+      ]
+    },
+    {
+      "_id": "5900fed158d9425c70af4f61",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 527: Randomized Binary Search",
+      "tests": [
+        "assert.strictEqual(euler527(), TODO: MISSING ANSWER, 'message: <code>euler527()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler527() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler527();"
+      ],
+      "description": [
+        "A secret integer t is selected at random within the range 1 ≤ t ≤ n. ",
+        "",
+        "The goal is to guess the value of t by making repeated guesses, via integer g. After a guess is made, there are three possible outcomes, in which it will be revealed that either g < t, g = t, or g > t. Then the process can repeat as necessary.",
+        "",
+        "Normally, the number of guesses required on average can be minimized with a binary search: Given a lower bound L and upper bound H (initialized to L = 1 and H = n), let g = ⌊(L+H)/2⌋ where ⌊⋅⌋ is the integer floor function. If g = t, the process ends. Otherwise, if g < t, set L = g+1, but if g > t instead, set H = g−1. After setting the new bounds, the search process repeats, and ultimately ends once t is found. Even if t can be deduced without searching, assume that a search will be required anyway to confirm the value.",
+        "",
+        "Your friend Bob believes that the standard binary search is not that much better than his randomized variant: Instead of setting g = ⌊(L+H)/2⌋, simply let g be a random integer between L and H, inclusive. The rest of the algorithm is the same as the standard binary search. This new search routine will be referred to as a random binary search.",
+        "",
+        "Given that 1 ≤ t ≤ n for random t, let B(n) be the expected number of guesses needed to find t using the standard binary search, and let R(n) be the expected number of guesses needed to find t using the random binary search. For example, B(6) = 2.33333333 and R(6) = 2.71666667 when rounded to 8 decimal places.",
+        "",
+        "Find R(1010) − B(1010) rounded to 8 decimal places."
+      ]
+    },
+    {
+      "_id": "5900fed258d9425c70af4f62",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 528: Constrained Sums",
+      "tests": [
+        "assert.strictEqual(euler528(), TODO: MISSING ANSWER, 'message: <code>euler528()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler528() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler528();"
+      ],
+      "description": [
+        "Let S(n,k,b) represent the number of valid solutions to x1 + x2 + ... + xk ≤ n, where 0 ≤ xm ≤ bm for all 1 ≤ m ≤ k.",
+        "",
+        "For example, S(14,3,2) = 135, S(200,5,3) = 12949440, and S(1000,10,5) mod 1 000 000 007 = 624839075.",
+        "",
+        "Find (∑10 ≤ k ≤ 15 S(10k,k,k)) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900fed358d9425c70af4f63",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 529: 10-substrings",
+      "tests": [
+        "assert.strictEqual(euler529(), TODO: MISSING ANSWER, 'message: <code>euler529()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler529() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler529();"
+      ],
+      "description": [
+        "A 10-substring of a number is a substring of its digits that sum to 10. For example, the 10-substrings of the number 3523014 are:",
+        "3523014",
+        "3523014",
+        "3523014",
+        "3523014A number is called 10-substring-friendly if every one of its digits belongs to a 10-substring. For example, 3523014 is 10-substring-friendly, but 28546 is not.",
+        "Let T(n) be the number of 10-substring-friendly numbers from 1 to 10n (inclusive).",
+        "For example T(2) = 9 and T(5) = 3492.",
+        "Find T(1018) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900fed458d9425c70af4f64",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 530: GCD of Divisors",
+      "tests": [
+        "assert.strictEqual(euler530(), TODO: MISSING ANSWER, 'message: <code>euler530()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler530() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler530();"
+      ],
+      "description": [
+        "Every divisor d of a number n has a complementary divisor n/d.",
+        "",
+        "Let f(n) be the sum of the greatest common divisor of d and n/d over all positive divisors d of n, that is",
+        "$f(n)=\\displaystyle\\sum\\limits_{d|n}\\, \\text{gcd}(d,\\frac n d)$.",
+        "",
+        "Let F be the summatory function of f, that is",
+        "$F(k)=\\displaystyle\\sum\\limits_{n=1}^k \\, f(n)$.",
+        "",
+        "You are given that F(10)=32 and F(1000)=12776.",
+        "",
+        "Find F(1015)."
+      ]
+    },
+    {
+      "_id": "5900fed558d9425c70af4f65",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 531: Chinese leftovers",
+      "tests": [
+        "assert.strictEqual(euler531(), TODO: MISSING ANSWER, 'message: <code>euler531()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler531() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler531();"
+      ],
+      "description": [
+        "Let g(a,n,b,m) be the smallest non-negative solution x to the system:x = a mod nx = b mod m",
+        "if such a solution exists, otherwise 0.",
+        "",
+        "",
+        "E.g. g(2,4,4,6)=10, but g(3,4,4,6)=0.",
+        "",
+        "",
+        "Let φ(n) be Euler's totient function.",
+        "",
+        "",
+        "Let f(n,m)=g(φ(n),n,φ(m),m)",
+        "",
+        "",
+        "Find ∑f(n,m) for 1000000 ≤ n < m < 1005000"
+      ]
+    },
+    {
+      "_id": "5900fed658d9425c70af4f66",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 532: Nanobots on Geodesics",
+      "tests": [
+        "assert.strictEqual(euler532(), TODO: MISSING ANSWER, 'message: <code>euler532()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler532() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler532();"
+      ],
+      "description": [
+        "Bob is a manufacturer of nanobots and wants to impress his customers by giving them a ball colored by his new nanobots as a present.",
+        "",
+        "His nanobots can be programmed to select and locate exactly one other bot precisely and, after activation, move towards this bot along the shortest possible path and draw a colored line onto the surface while moving. Placed on a plane, the bots will start to move towards their selected bots in a straight line. In contrast, being placed on a ball, they will start to move along a geodesic as the shortest possible path. However, in both cases, whenever their target moves they will adjust their direction instantaneously to the new shortest possible path. All bots will move at the same speed after their simultaneous activation until each bot reaches its goal.",
+        "",
+        "Now Bob places n bots on the ball (with radius 1) equidistantly on a small circle with radius 0.999 and programs each of them to move toward the next nanobot sitting counterclockwise on that small circle. After activation, the bots move in a sort of spiral until they finally meet at one point on the ball.",
+        "",
+        "Using three bots, Bob finds that every bot will draw a line of length 2.84, resulting in a total length of 8.52 for all three bots, each time rounded to two decimal places. The colored ball looks like this:",
+        "",
+        "",
+        "",
+        "In order to show off a little with his presents, Bob decides to use just enough bots to make sure that the line each bot draws is longer than 1000. What is the total length of all lines drawn with this number of bots, rounded to two decimal places?"
+      ]
+    },
+    {
+      "_id": "5900fed758d9425c70af4f67",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 533: Minimum values of the Carmichael function",
+      "tests": [
+        "assert.strictEqual(euler533(), TODO: MISSING ANSWER, 'message: <code>euler533()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler533() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler533();"
+      ],
+      "description": [
+        "The Carmichael function λ(n) is defined as the smallest positive integer m such that am = 1 modulo n for all integers a coprime with n.",
+        "For example λ(8) = 2 and λ(240) = 4.",
+        "",
+        "Define L(n) as the smallest positive integer m such that λ(k) ≥ n for all k ≥ m.",
+        "For example, L(6) = 241 and L(100) = 20 174 525 281.",
+        "",
+        "Find L(20 000 000). Give the last 9 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900fed858d9425c70af4f68",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 534: Weak Queens",
+      "tests": [
+        "assert.strictEqual(euler534(), TODO: MISSING ANSWER, 'message: <code>euler534()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler534() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler534();"
+      ],
+      "description": [
+        "The classical eight queens puzzle is the well known problem of placing eight chess queens on a 8×8 chessboard so that no two queens threaten each other. Allowing configurations to reappear in rotated or mirrored form, a total of 92 distinct configurations can be found for eight queens. The general case asks for the number of distinct ways of placing n queens on a n×n board, e.g. you can find 2 distinct configurations for n=4.",
+        "",
+        "Lets define a weak queen on a n×n board to be a piece which can move any number of squares if moved horizontally, but a maximum of n−1−w squares if moved vertically or diagonally, 0≤w<n being the \"weakness factor\". For example, a weak queen on a n×n board with a weakness factor of w=1 located in the bottom row will not be able to threaten any square in the top row as the weak queen would need to move n−1 squares vertically or diagonally to get there, but may only move n−2 squares in these directions. In contrast, the weak queen is not handicapped horizontally, thus threatening every square in its own row, independently from its current position in that row.",
+        "",
+        "Let Q(n,w) be the number of ways n weak queens with weakness factor w can be placed on a n×n board so that no two queens threaten each other. It can be shown, for example, that Q(4,0)=2, Q(4,2)=16 and Q(4,3)=256.",
+        "",
+        "Let $S(n)=\\displaystyle\\sum_{w=0}^{n-1} Q(n,w)$.",
+        "",
+        "You are given that S(4)=276 and S(5)=3347.",
+        "",
+        "Find S(14)."
+      ]
+    },
+    {
+      "_id": "5900fed958d9425c70af4f69",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 535: Fractal Sequence",
+      "tests": [
+        "assert.strictEqual(euler535(), TODO: MISSING ANSWER, 'message: <code>euler535()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler535() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler535();"
+      ],
+      "description": [
+        "Consider the infinite integer sequence S starting with:S = 1, 1, 2, 1, 3, 2, 4, 1, 5, 3, 6, 2, 7, 8, 4, 9, 1, 10, 11, 5, ...",
+        "",
+        "Circle the first occurrence of each integer.S = ①, 1, ②, 1, ③, 2, ④, 1, ⑤, 3, ⑥, 2, ⑦, ⑧, 4, ⑨, 1, ⑩, ⑪, 5, ...",
+        "",
+        "The sequence is characterized by the following properties:",
+        "The circled numbers are consecutive integers starting with 1.",
+        "Immediately preceding each non-circled numbers ai, there are exactly ⌊√ai⌋ adjacent circled numbers, where ⌊⌋ is the floor function.",
+        "If we remove all circled numbers, the remaining numbers form a sequence identical to S, so S is a fractal sequence.Let T(n) be the sum of the first n elements of the sequence.",
+        "You are given T(1) = 1, T(20) = 86, T(103) = 364089 and T(109) = 498676527978348241.",
+        "",
+        "Find T(1018). Give the last 9 digits of your answer."
+      ]
+    },
+    {
+      "_id": "5900feda58d9425c70af4f6a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 536: Modulo power identity",
+      "tests": [
+        "assert.strictEqual(euler536(), TODO: MISSING ANSWER, 'message: <code>euler536()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler536() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler536();"
+      ],
+      "description": [
+        "Let S(n) be the sum of all positive integers m not exceeding n having the following property:a m+4 ≡ a (mod m) for all integers a.",
+        "",
+        "",
+        "The values of m ≤ 100 that satisfy this property are 1, 2, 3, 5 and 21, thus S(100) = 1+2+3+5+21 = 32.",
+        "You are given S(106) = 22868117.",
+        "",
+        "",
+        "Find S(1012)."
+      ]
+    },
+    {
+      "_id": "5900fedb58d9425c70af4f6b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 537: Counting tuples",
+      "tests": [
+        "assert.strictEqual(euler537(), TODO: MISSING ANSWER, 'message: <code>euler537()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler537() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler537();"
+      ],
+      "description": [
+        "Let π(x) be the prime counting function, i.e. the number of prime numbers less than or equal to x.",
+        "For example, π(1)=0, π(2)=1, π(100)=25.",
+        "",
+        "",
+        "Let T(n,k) be the number of k-tuples (x1,…,xk) which satisfy:",
+        "1. every xi is a positive integer;",
+        "2. $\\displaystyle \\sum_{i=1}^k \\pi(x_i)=n$",
+        "",
+        "",
+        "For example T(3,3)=19.",
+        "The 19 tuples are (1,1,5), (1,5,1), (5,1,1), (1,1,6), (1,6,1), (6,1,1), (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), (3,2,1), (1,2,4), (1,4,2), (2,1,4), (2,4,1), (4,1,2), (4,2,1), (2,2,2).",
+        "",
+        "",
+        "You are given T(10,10) = 869 985 and T(103,103) ≡ 578 270 566 (mod 1 004 535 809).",
+        "",
+        "Find T(20 000, 20 000) mod 1 004 535 809."
+      ]
+    },
+    {
+      "_id": "5900fedc58d9425c70af4f6c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 538: Maximum quadrilaterals",
+      "tests": [
+        "assert.strictEqual(euler538(), TODO: MISSING ANSWER, 'message: <code>euler538()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler538() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler538();"
+      ],
+      "description": [
+        "Consider a positive integer sequence S = (s1, s2, ..., sn).",
+        "",
+        "Let f(S) be the perimeter of the maximum-area quadrilateral whose side lengths are 4 elements (si, sj, sk, sl) of S (all i, j, k, l distinct). If there are many quadrilaterals with the same maximum area, then choose the one with the largest perimeter.",
+        "",
+        "For example, if S = (8, 9, 14, 9, 27), then we can take the elements (9, 14, 9, 27) and form an isosceles trapezium with parallel side lengths 14 and 27 and both leg lengths 9. The area of this quadrilateral is 127.611470879... It can be shown that this is the largest area for any quadrilateral that can be formed using side lengths from S. Therefore, f(S) = 9 + 14 + 9 + 27 = 59.",
+        "",
+        "Let un = 2B(3n) + 3B(2n) + B(n+1), where B(k) is the number of 1 bits of k in base 2.",
+        "For example, B(6) = 2, B(10) = 2 and B(15) = 4, and u5 = 24 + 32 + 2 = 27.",
+        "",
+        "Also, let Un be the sequence (u1, u2, ..., un).",
+        "For example, U10 = (8, 9, 14, 9, 27, 16, 36, 9, 27, 28).",
+        "",
+        "It can be shown that f(U5) = 59, f(U10) = 118, f(U150) = 3223.",
+        "It can also be shown that Σ f(Un) = 234761 for 4 ≤ n ≤ 150.",
+        "Find Σ f(Un) for 4 ≤ n ≤ 3 000 000."
+      ]
+    },
+    {
+      "_id": "5900fedd58d9425c70af4f6d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 539: Odd elimination",
+      "tests": [
+        "assert.strictEqual(euler539(), TODO: MISSING ANSWER, 'message: <code>euler539()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler539() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler539();"
+      ],
+      "description": [
+        "Start from an ordered list of all integers from 1 to n. Going from left to right, remove the first number and every other number afterward until the end of the list. Repeat the procedure from right to left, removing the right most number and every other number from the numbers left. Continue removing every other numbers, alternating left to right and right to left, until a single number remains.",
+        "",
+        "",
+        "Starting with n = 9, we have:1 2 3 4 5 6 7 8 9",
+        "2 4 6 82 6",
+        "6",
+        "",
+        "",
+        "Let P(n) be the last number left starting with a list of length n.",
+        "Let $\\displaystyle S(n) = \\sum_{k=1}^n P(k)$.",
+        "You are given P(1)=1, P(9) = 6, P(1000)=510, S(1000)=268271.",
+        "",
+        "",
+        "Find S(1018) mod 987654321."
+      ]
+    },
+    {
+      "_id": "5900fede58d9425c70af4f6e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 540: Counting primitive Pythagorean triples",
+      "tests": [
+        "assert.strictEqual(euler540(), TODO: MISSING ANSWER, 'message: <code>euler540()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler540() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler540();"
+      ],
+      "description": [
+        "A Pythagorean triple consists of three positive integers $a, b$ and $c$ satisfying $a^2+b^2=c^2$.",
+        "The triple is called primitive if $a, b$ and $c$ are relatively prime.",
+        "Let P($n$) be the number of primitive Pythagorean triples with $a < b < c <= n$.",
+        "For example P(20) = 3, since there are three triples: (3,4,5), (5,12,13) and (8,15,17).",
+        "",
+        "",
+        "You are given that P(106) = 159139.",
+        "Find P(3141592653589793)."
+      ]
+    },
+    {
+      "_id": "5900fedf58d9425c70af4f6f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 541: Divisibility of Harmonic Number Denominators",
+      "tests": [
+        "assert.strictEqual(euler541(), TODO: MISSING ANSWER, 'message: <code>euler541()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler541() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler541();"
+      ],
+      "description": [
+        "The nthharmonic number Hn is defined as the sum of the multiplicative inverses of the first n positive integers, and can be written as a reduced fraction an/bn.",
+        "$H_n = \\displaystyle \\sum_{k=1}^n \\frac 1 k = \\frac {a_n} {b_n}$, with $\\text {gcd}(a_n, b_n)=1$.",
+        "",
+        "Let M(p) be the largest value of n such that bn is not divisible by p.",
+        "",
+        "For example, M(3) = 68 because $H_{68} = \\frac {a_{68}} {b_{68}} = \\frac {14094018321907827923954201611} {2933773379069966367528193600}$, b68=2933773379069966367528193600 is not divisible by 3, but all larger harmonic numbers have denominators divisible by 3.",
+        "",
+        "You are given M(7) = 719102.",
+        "",
+        "Find M(137)."
+      ]
+    },
+    {
+      "_id": "5900fee058d9425c70af4f70",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 542: Geometric Progression with Maximum Sum",
+      "tests": [
+        "assert.strictEqual(euler542(), TODO: MISSING ANSWER, 'message: <code>euler542()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler542() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler542();"
+      ],
+      "description": [
+        "Let S(k) be the sum of three or more distinct positive integers having the following properties:",
+        "No value exceeds k.",
+        "The values form a geometric progression.",
+        "The sum is maximal.S(4) = 4 + 2 + 1 = 7S(10) = 9 + 6 + 4 = 19S(12) = 12 + 6 + 3 = 21S(1000) = 1000 + 900 + 810 + 729 = 3439",
+        "",
+        "Let $T(n) = \\sum_{k=4}^n (-1)^k S(k)$.T(1000) = 2268",
+        "",
+        "Find T(1017)."
+      ]
+    },
+    {
+      "_id": "5900fee158d9425c70af4f71",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 543: Prime-Sum Numbers",
+      "tests": [
+        "assert.strictEqual(euler543(), TODO: MISSING ANSWER, 'message: <code>euler543()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler543() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler543();"
+      ],
+      "description": [
+        "Define function P(n,k) = 1 if n can be written as the sum of k prime numbers (with repetitions allowed), and P(n,k) = 0 otherwise.",
+        "",
+        "For example, P(10,2) = 1 because 10 can be written as either 3 + 7 or 5 + 5, but P(11,2) = 0 because no two primes can sum to 11.",
+        "",
+        "Let S(n) be the sum of all P(i,k) over 1 ≤ i,k ≤ n.",
+        "",
+        "For example, S(10) = 20, S(100) = 2402, and S(1000) = 248838.",
+        "",
+        "Let F(k) be the kth Fibonacci number (with F(0) = 0 and F(1) = 1).",
+        "",
+        "Find the sum of all S(F(k)) over 3 ≤ k ≤ 44"
+      ]
+    },
+    {
+      "_id": "5900fee258d9425c70af4f72",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 544: Chromatic Conundrum",
+      "tests": [
+        "assert.strictEqual(euler544(), TODO: MISSING ANSWER, 'message: <code>euler544()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler544() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler544();"
+      ],
+      "description": [
+        "Let F(r,c,n) be the number of ways to color a rectangular grid with r rows and c columns using at most n colors such that no two adjacent cells share the same color. Cells that are diagonal to each other are not considered adjacent.",
+        "",
+        "For example, F(2,2,3) = 18, F(2,2,20) = 130340, and F(3,4,6) = 102923670.",
+        "",
+        "Let S(r,c,n) = $\\sum_{k=1}^{n}$ F(r,c,k).",
+        "",
+        "For example, S(4,4,15) mod 109+7 = 325951319.",
+        "",
+        "Find S(9,10,1112131415) mod 109+7."
+      ]
+    },
+    {
+      "_id": "5900fee358d9425c70af4f73",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 545: Faulhaber's Formulas",
+      "tests": [
+        "assert.strictEqual(euler545(), TODO: MISSING ANSWER, 'message: <code>euler545()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler545() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler545();"
+      ],
+      "description": [
+        "The sum of the kth powers of the first n positive integers can be expressed as a polynomial of degree k+1 with rational coefficients, the Faulhaber's Formulas:",
+        "$1^k + 2^k + ... + n^k = \\sum_{i=1}^n i^k = \\sum_{i=1}^{k+1} a_{i} n^i = a_{1} n + a_{2} n^2 + ... + a_{k} n^k + a_{k+1} n^{k + 1}$,",
+        "where ai's are rational coefficients that can be written as reduced fractions pi/qi (if ai = 0, we shall consider qi = 1).",
+        "",
+        "For example, $1^4 + 2^4 + ... + n^4 = -\\frac 1 {30} n + \\frac 1 3 n^3 + \\frac 1 2 n^4 + \\frac 1 5 n^5.$",
+        "",
+        "Define D(k) as the value of q1 for the sum of kth powers (i.e. the denominator of the reduced fraction a1).",
+        "Define F(m) as the mth value of k ≥ 1 for which D(k) = 20010.",
+        "You are given D(4) = 30 (since a1 = -1/30), D(308) = 20010, F(1) = 308, F(10) = 96404.",
+        "",
+        "Find F(105)."
+      ]
+    },
+    {
+      "_id": "5900fee458d9425c70af4f74",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 546: The Floor's Revenge",
+      "tests": [
+        "assert.strictEqual(euler546(), TODO: MISSING ANSWER, 'message: <code>euler546()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler546() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler546();"
+      ],
+      "description": [
+        "Define fk(n) = $\\sum_{i=0}^{n}$ fk($\\lfloor\\frac{i}{k}\\rfloor$) where fk(0) = 1 and $\\lfloor x \\rfloor$ denotes the floor function.",
+        "",
+        "For example, f5(10) = 18, f7(100) = 1003, and f2(103) = 264830889564.",
+        "",
+        "Find $(\\sum_{k=2}^{10}$ fk(1014)$)$ mod (109+7)."
+      ]
+    },
+    {
+      "_id": "5900fee558d9425c70af4f75",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 547: Distance of random points within hollow square laminae",
+      "tests": [
+        "assert.strictEqual(euler547(), TODO: MISSING ANSWER, 'message: <code>euler547()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler547() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler547();"
+      ],
+      "description": [
+        "Assuming that two points are chosen randomly (with uniform distribution) within a rectangle, it is possible to determine the expected value of the distance between these two points.",
+        "",
+        "For example, the expected distance between two random points in a unit square is about 0.521405, while the expected distance between two random points in a rectangle with side lengths 2 and 3 is about 1.317067.",
+        "",
+        "Now we define a hollow square lamina of size n to be an integer sized square with side length n ≥ 3 consisting of n2 unit squares from which a rectangle consisting of x × y unit squares (1 ≤ x,y ≤ n - 2) within the original square has been removed.",
+        "",
+        "For n = 3 there exists only one hollow square lamina:",
+        "",
+        "",
+        "",
+        "For n = 4 you can find 9 distinct hollow square laminae, allowing shapes to reappear in rotated or mirrored form:",
+        "",
+        "",
+        "",
+        "Let S(n) be the sum of the expected distance between two points chosen randomly within each of the possible hollow square laminae of size n. The two points have to lie within the area left after removing the inner rectangle, i.e. the gray-colored areas in the illustrations above.",
+        "",
+        "For example, S(3) = 1.6514 and S(4) = 19.6564, rounded to four digits after the decimal point.",
+        "",
+        "Find S(40) rounded to four digits after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900fee658d9425c70af4f76",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 548: Gozinta Chains",
+      "tests": [
+        "assert.strictEqual(euler548(), TODO: MISSING ANSWER, 'message: <code>euler548()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler548() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler548();"
+      ],
+      "description": [
+        "A gozinta chain for n is a sequence {1,a,b,...,n} where each element properly divides the next.",
+        "There are eight gozinta chains for 12:",
+        "{1,12} ,{1,2,12}, {1,2,4,12}, {1,2,6,12}, {1,3,12}, {1,3,6,12}, {1,4,12} and {1,6,12}. ",
+        "Let g(n) be the number of gozinta chains for n, so g(12)=8.",
+        "g(48)=48 and g(120)=132.",
+        "",
+        "",
+        "Find the sum of the numbers n  not exceeding 1016 for which g(n)=n."
+      ]
+    },
+    {
+      "_id": "5900fee758d9425c70af4f77",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 549: Divisibility of factorials",
+      "tests": [
+        "assert.strictEqual(euler549(), TODO: MISSING ANSWER, 'message: <code>euler549()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler549() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler549();"
+      ],
+      "description": [
+        "The smallest number m such that 10 divides m! is m=5.",
+        "The smallest number m such that 25 divides m! is m=10.",
+        "",
+        "Let s(n) be the smallest number m such that n divides m!.",
+        "So s(10)=5 and s(25)=10.",
+        "Let S(n) be ∑s(i) for 2 ≤ i ≤ n.",
+        "S(100)=2012.",
+        "",
+        "",
+        "Find S(108)."
+      ]
+    },
+    {
+      "_id": "5900fee858d9425c70af4f78",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 550: Divisor game",
+      "tests": [
+        "assert.strictEqual(euler550(), TODO: MISSING ANSWER, 'message: <code>euler550()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler550() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler550();"
+      ],
+      "description": [
+        "Two players are playing a game. There are k piles of stones.",
+        "When it is his turn a player has to choose a pile and replace it by two piles of stones under the following two conditions:",
+        "",
+        "",
+        " Both new piles must have a number of stones more than one and less than the number of stones of the original pile.",
+        " The number of stones of each of the new piles must be a divisor of the number of stones of the original pile.",
+        "The first player unable to make a valid move loses.",
+        "",
+        "Let f(n,k) be the number of winning positions for the first player, assuming perfect play, when the game is played with k piles each having between 2 and n stones (inclusively).f(10,5)=40085.",
+        "",
+        "",
+        "Find  f(107,1012).Give your answer modulo 987654321."
+      ]
+    },
+    {
+      "_id": "5900fee958d9425c70af4f79",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 551: Sum of digits sequence",
+      "tests": [
+        "assert.strictEqual(euler551(), TODO: MISSING ANSWER, 'message: <code>euler551()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler551() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler551();"
+      ],
+      "description": [
+        "Let a0, a1, a2, ... be an integer sequence defined by:",
+        "a0 = 1;",
+        "for n ≥ 1, an is the sum of the digits of all preceding terms.",
+        "The sequence starts with 1, 1, 2, 4, 8, 16, 23, 28, 38, 49, ...",
+        "You are given a106 = 31054319.",
+        "Find a1015."
+      ]
+    },
+    {
+      "_id": "5900feea58d9425c70af4f7a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 552: Chinese leftovers II",
+      "tests": [
+        "assert.strictEqual(euler552(), TODO: MISSING ANSWER, 'message: <code>euler552()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler552() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler552();"
+      ],
+      "description": [
+        "Let An be the smallest positive integer satisfying  An mod pi = i  for all 1 ≤ i ≤ n, where pi is the",
+        "i-th prime.",
+        "For example A2 = 5, since this is the smallest positive solution of the system of equations ",
+        " A2 mod 2 = 1 ",
+        " A2 mod 3 = 2",
+        "The system of equations for A3 adds another constraint. That is, A3 is the smallest positive solution of",
+        " A3 mod 2 = 1 ",
+        " A3 mod 3 = 2",
+        " A3 mod 5 = 3",
+        "and hence A3 = 23. Similarly, one gets A4 = 53 and A5 = 1523.",
+        "",
+        "",
+        "Let S(n) be the sum of all primes up to n that divide at least one element in the sequence A.",
+        "For example, S(50) = 69 = 5 + 23 + 41, since 5 divides A2, 23 divides A3 and 41 divides A10 = 5765999453. No other prime number up to 50 divides an element in A.",
+        "",
+        "",
+        "Find S(300000)."
+      ]
+    },
+    {
+      "_id": "5900feeb58d9425c70af4f7b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 553: Power sets of power sets",
+      "tests": [
+        "assert.strictEqual(euler553(), TODO: MISSING ANSWER, 'message: <code>euler553()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler553() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler553();"
+      ],
+      "description": [
+        "Let P(n) be the set of the first n positive integers {1, 2, ..., n}.",
+        "Let Q(n) be the set of all the non-empty subsets of P(n).",
+        "Let R(n) be the set of all the non-empty subsets of Q(n).",
+        "",
+        "An element X ∈ R(n) is a non-empty subset of Q(n), so it is itself a set.",
+        "From X we can construct a graph as follows:",
+        "",
+        "Each element Y ∈ X corresponds to a vertex and labeled with Y;",
+        "Two vertices Y1 and Y2 are connected if Y1 ∩ Y2 ≠ ∅.",
+        "For example, X = {{1}, {1,2,3}, {3}, {5,6}, {6,7}} results in the following graph:",
+        "",
+        "",
+        "",
+        "This graph has two connected components.",
+        "",
+        "Let C(n,k) be the number of elements of R(n) that have exactly k connected components in their graph.",
+        "You are given C(2,1) = 6, C(3,1) = 111, C(4,2) = 486, C(100,10) mod 1 000 000 007 = 728209718.",
+        "",
+        "Find C(104,10) mod 1 000 000 007."
+      ]
+    },
+    {
+      "_id": "5900feec58d9425c70af4f7c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 554: Centaurs on a chess board",
+      "tests": [
+        "assert.strictEqual(euler554(), TODO: MISSING ANSWER, 'message: <code>euler554()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler554() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler554();"
+      ],
+      "description": [
+        "On a chess board, a centaur moves like a king or a knight. The diagram below shows the valid moves of a centaur (represented by an inverted king) on an 8x8 board.",
+        "",
+        "",
+        "",
+        "It can be shown that at most n2 non-attacking centaurs can be placed on a board of size 2n×2n.",
+        "Let C(n) be the number of ways to place n2 centaurs on a 2n×2n board so that no centaur attacks another directly.",
+        "For example C(1) = 4, C(2) = 25, C(10) = 1477721.",
+        "",
+        "Let Fi be the ith Fibonacci number defined as F1 = F2 = 1 and Fi = Fi-1 + Fi-2 for i > 2.",
+        "",
+        "Find $\\displaystyle \\left( \\sum_{i=2}^{90} C(F_i) \\right) \\text{mod } (10^8+7)$."
+      ]
+    },
+    {
+      "_id": "5900feed58d9425c70af4f7d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 555: McCarthy 91 function",
+      "tests": [
+        "assert.strictEqual(euler555(), TODO: MISSING ANSWER, 'message: <code>euler555()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler555() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler555();"
+      ],
+      "description": [
+        "The McCarthy 91 function is defined as follows:",
+        "$$",
+        "M_{91}(n) = ",
+        "    \\begin{cases}",
+        "        n - 10 & \\text{if } n > 100 \\\\",
+        "        M_{91}(M_{91}(n+11)) & \\text{if } 0 \\leq n \\leq 100",
+        "    \\end{cases}",
+        "$$",
+        "",
+        "",
+        "We can generalize this definition by abstracting away the constants into new variables:",
+        "",
+        "$$",
+        "M_{m,k,s}(n) = ",
+        "    \\begin{cases}",
+        "        n - s & \\text{if } n > m \\\\",
+        "        M_{m,k,s}(M_{m,k,s}(n+k)) & \\text{if } 0 \\leq n \\leq m",
+        "    \\end{cases}",
+        "$$",
+        "",
+        "",
+        "This way, we have $M_{91} = M_{100,11,10}$.",
+        "",
+        "",
+        "Let $F_{m,k,s}$ be the set of fixed points of $M_{m,k,s}$. That is, ",
+        "",
+        "$$F_{m,k,s}= \\left\\{ n \\in \\mathbb{N} \\, | \\, M_{m,k,s}(n) = n \\right\\}$$",
+        "",
+        "",
+        "For example, the only fixed point of $M_{91}$ is $n = 91$. In other words, $F_{100,11,10}= \\{91\\}$.",
+        " ",
+        "",
+        "Now, define $SF(m,k,s)$ as the sum of the elements in $F_{m,k,s}$ and let $S(p,m) = \\displaystyle \\sum_{1 \\leq s < k \\leq p}{SF(m,k,s)}$.",
+        "",
+        "",
+        "For example, $S(10, 10) = 225$ and $S(1000, 1000)=208724467$.",
+        "",
+        "",
+        "Find $S(10^6, 10^6)$."
+      ]
+    },
+    {
+      "_id": "5900feee58d9425c70af4f7e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 556: Squarefree Gaussian Integers",
+      "tests": [
+        "assert.strictEqual(euler556(), TODO: MISSING ANSWER, 'message: <code>euler556()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler556() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler556();"
+      ],
+      "description": [
+        "A Gaussian integer is a number z = a + bi where a, b are integers and i2 = -1.",
+        "Gaussian integers are a subset of the complex numbers, and the integers are the subset of Gaussian integers for which b = 0.",
+        "",
+        "A Gaussian integer unit is one for which a2 + b2 = 1, i.e. one of 1, i, -1, -i.",
+        "Let's define a proper Gaussian integer as one for which a > 0 and b ≥ 0.",
+        "",
+        "A Gaussian integer z1 = a1 + b1i is said to be divisible by z2 = a2 + b2i if z3 = a3 + b3i = z1/z2 is a Gaussian integer.",
+        "$\\frac {z_1} {z_2} = \\frac {a_1 + b_1 i} {a_2 + b_2 i} = \\frac {(a_1 + b_1 i)(a_2 - b_2 i)} {(a_2 + b_2 i)(a_2 - b_2 i)} = \\frac {a_1 a_2 + b_1 b_2} {a_2^2 + b_2^2} + \\frac  {a_2 b_1 - a_1 b_2}  {a_2^2 + b_2^2}i = a_3 + b_3 i$",
+        "So, z1 is divisible by z2 if $\\frac {a_1 a_2 + b_1 b_2} {a_2^2 + b_2^2}$ and $\\frac  {a_2 b_1 - a_1 b_2}  {a_2^2 + b_2^2}$ are integers.",
+        "For example, 2 is divisible by 1 + i because 2/(1 + i) = 1 - i is a Gaussian integer.",
+        "",
+        "A Gaussian prime is a Gaussian integer that is divisible only by a unit, itself or itself times a unit.",
+        "For example, 1 + 2i is a Gaussian prime, because it is only divisible by 1, i, -1, -i, 1 + 2i, i(1 + 2i) = i - 2, -(1 + 2i) = -1 - 2i and -i(1 + 2i) = 2 - i.",
+        "2 is not a Gaussian prime as it is divisible by 1 + i.",
+        "",
+        "A Gaussian integer can be uniquely factored as the product of a unit and proper Gaussian primes.",
+        "For example 2 = -i(1 + i)2 and 1 + 3i = (1 + i)(2 + i).",
+        "A Gaussian integer is said to be squarefree if its prime factorization does not contain repeated proper Gaussian primes.",
+        "So 2 is not squarefree over the Gaussian integers, but 1 + 3i is.",
+        "Units and Gaussian primes are squarefree by definition.",
+        "",
+        "Let f(n) be the count of proper squarefree Gaussian integers with a2 + b2 ≤ n.",
+        "For example f(10) = 7 because 1, 1 + i, 1 + 2i, 1 + 3i = (1 + i)(2 + i), 2 + i, 3 and 3 + i = -i(1 + i)(1 + 2i) are squarefree, while 2 = -i(1 + i)2 and 2 + 2i = -i(1 + i)3 are not.",
+        "You are given f(102) = 54, f(104) = 5218 and f(108) = 52126906.",
+        "",
+        "Find f(1014)."
+      ]
+    },
+    {
+      "_id": "5900feef58d9425c70af4f7f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 557: Cutting triangles",
+      "tests": [
+        "assert.strictEqual(euler557(), TODO: MISSING ANSWER, 'message: <code>euler557()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler557() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler557();"
+      ],
+      "description": [
+        "A triangle is cut into four pieces by two straight lines, each starting at one vertex and ending on the opposite edge. This results in forming three smaller triangular pieces, and one quadrilateral.  If the original triangle has an integral area, it is often possible to choose cuts such that all of the four pieces also have integral area.  For example, the diagram below shows a triangle of area 55 that has been cut in this way.",
+        "",
+        "",
+        "",
+        "Representing the areas as a, b, c and d, in the example above, the individual areas are a = 22, b = 8, c = 11 and d = 14.  It is also possible to cut a triangle of area 55 such that a = 20, b = 2, c = 24, d = 9.",
+        "",
+        "Define a triangle cutting quadruple (a, b, c, d) as a valid integral division of a triangle, where a is the area of the triangle between the two cut vertices, d is the area of the quadrilateral and b and c are the areas of the two other triangles, with the restriction that b ≤ c.  The two solutions described above are (22,8,11,14) and (20,2,24,9).  These are the only two possible quadruples that have a total area of 55.",
+        "",
+        "",
+        "Define S(n) as the sum of the area of the uncut triangles represented by all valid quadruples with a+b+c+d ≤ n. For example, S(20) = 259.  ",
+        "",
+        "",
+        "Find S(10000)."
+      ]
+    },
+    {
+      "_id": "5900fef058d9425c70af4f80",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 558: Irrational base",
+      "tests": [
+        "assert.strictEqual(euler558(), TODO: MISSING ANSWER, 'message: <code>euler558()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler558() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler558();"
+      ],
+      "description": [
+        "Let r be the real root of the equation x3 = x2 + 1.",
+        "Every positive integer can be written as the sum of distinct increasing powers of r.",
+        "If we require the number of terms to be finite and the difference between any two exponents to be three or more, then the representation is unique.",
+        "For example, 3 = r -10 + r -5 + r -1 + r 2 and 10 = r -10 + r -7 + r 6.",
+        "Interestingly, the relation holds for the complex roots of the equation.",
+        "",
+        "Let w(n) be the number of terms in this unique representation of n. Thus w(3) = 4 and w(10) = 3.",
+        "",
+        "More formally, for all positive integers n, we have:n = $\\displaystyle \\sum_{k=-\\infty}^{\\infty}$ bk rk",
+        "under the conditions that:bk is 0 or 1 for all k;bk + bk+1 + bk+2 ≤ 1 for all k;w(n) = $\\displaystyle \\sum_{k=-\\infty}^{\\infty}$ bk is finite.",
+        "",
+        "Let S(m) = $\\displaystyle \\sum_{j=1}^{m}$ w(j2).",
+        "You are given S(10) = 61 and S(1000) = 19403.",
+        "",
+        "Find S(5 000 000)."
+      ]
+    },
+    {
+      "_id": "5900fef158d9425c70af4f81",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 559: Permuted Matrices",
+      "tests": [
+        "assert.strictEqual(euler559(), TODO: MISSING ANSWER, 'message: <code>euler559()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler559() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler559();"
+      ],
+      "description": [
+        "An ascent of a column j in a matrix occurs if the value of column j is smaller than the value of column j+1 in all rows.",
+        "",
+        "Let P(k, r, n) be the number of r x n matrices with the following properties:",
+        "",
+        "The rows are permutations of {1, 2, 3, ... , n}.",
+        " Numbering the first column as 1, a column ascent occurs at column j<n if and only if j is not a multiple of k.",
+        "",
+        "For example, P(1, 2, 3) = 19, P(2, 4, 6) = 65508751 and  P(7, 5, 30) mod 1000000123 = 161858102.",
+        "",
+        "Let Q(n) =$\\,  \\displaystyle \\sum_{k=1}^n\\,$ P(k, n, n).",
+        "For example, Q(5) = 21879393751 and Q(50) mod 1000000123 = 819573537.",
+        "",
+        "Find Q(50000) mod 1000000123."
+      ]
+    },
+    {
+      "_id": "5900fef258d9425c70af4f82",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 560: Coprime Nim",
+      "tests": [
+        "assert.strictEqual(euler560(), TODO: MISSING ANSWER, 'message: <code>euler560()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler560() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler560();"
+      ],
+      "description": [
+        "Coprime Nim is just like ordinary normal play Nim, but the players may only remove a number of stones from a pile  that is coprime with the current size of the pile. Two players remove stones in turn. The player who removes the last stone wins.",
+        "",
+        "Let L(n, k) be the number of losing starting positions for the first player, assuming perfect play, when the game is played with k piles, each having between 1 and n - 1 stones inclusively.",
+        "",
+        "For example, L(5, 2) = 6 since the losing initial positions are (1, 1), (2, 2), (2, 4), (3, 3), (4, 2) and (4, 4).",
+        "You are also given L(10, 5) = 9964, L(10, 10) = 472400303, L(103, 103) mod 1 000 000 007 = 954021836.",
+        "",
+        "Find L(107, 107) mod 1 000 000 007"
+      ]
+    },
+    {
+      "_id": "5900fef358d9425c70af4f83",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 561: Divisor Pairs",
+      "tests": [
+        "assert.strictEqual(euler561(), TODO: MISSING ANSWER, 'message: <code>euler561()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler561() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler561();"
+      ],
+      "description": [
+        "Let $S(n)$ be the number of pairs $(a,b)$ of distinct divisors of $n$ such that $a$ divides $b$.",
+        "For $n=6$ we get the following pairs: $(1,2), (1,3), (1,6),( 2,6)$ and $(3,6)$. So $S(6)=5$.",
+        "Let $p_m\\#$ be the product of the first $m$ prime numbers,  so $p_2\\# = 2*3 = 6$.",
+        "Let $E(m, n)$ be the highest integer $k$ such that $2^k$ divides $S((p_m\\#)^n)$.",
+        "$E(2,1) = 0$ since $2^0$ is the highest power of 2 that divides S(6)=5.",
+        "Let $Q(n)=\\sum_{i=1}^{n} E(904961, i)$",
+        "$Q(8)=2714886$.",
+        "",
+        "",
+        "Evaluate $Q(10^{12})$."
+      ]
+    },
+    {
+      "_id": "5900fef458d9425c70af4f84",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 562: Maximal perimeter",
+      "tests": [
+        "assert.strictEqual(euler562(), TODO: MISSING ANSWER, 'message: <code>euler562()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler562() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler562();"
+      ],
+      "description": [
+        "Construct triangle ABC such that:",
+        "Vertices A, B and C are lattice points inside or on the circle of radius r centered at the origin;",
+        "the triangle contains no other lattice point inside or on its edges;",
+        "the perimeter is maximum.Let R be the circumradius of triangle ABC and T(r) = R/r.",
+        "For r = 5, one possible triangle has vertices (-4,-3), (4,2)  and (1,0) with perimeter $\\sqrt{13}+\\sqrt{34}+\\sqrt{89}$ and circumradius R = $\\sqrt {\\frac {19669} 2 }$, so T(5) =$\\sqrt {\\frac {19669} {50} }$.",
+        "You are given T(10) ~ 97.26729 and T(100) ~ 9157.64707.",
+        "",
+        "Find T(107). Give your answer rounded to the nearest integer."
+      ]
+    },
+    {
+      "_id": "5900fef558d9425c70af4f85",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 563: Robot Welders",
+      "tests": [
+        "assert.strictEqual(euler563(), TODO: MISSING ANSWER, 'message: <code>euler563()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler563() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler563();"
+      ],
+      "description": [
+        "A company specialises in producing large rectangular metal sheets, starting from unit square metal plates.  The welding is performed by a range of robots of increasing size.  Unfortunately, the programming options of these robots are rather limited.  Each one can only process up to 25 identical rectangles of metal, which they can weld along either edge to produce a larger rectangle.  The only programmable variables are the number of rectangles to be processed (up to and including 25), and whether to weld the long or short edge.",
+        "",
+        "For example, the first robot could be programmed to weld together 11 raw unit square plates to make a 11×1 strip.  The next could take 10 of these 11×1 strips, and weld them either to make a longer 110×1 strip, or a 11×10 rectangle.  Many, but not all, possible dimensions of  metal sheets can be constructed in this way.",
+        "",
+        "One regular customer has a particularly unusual order.  He always demands that the finished product should have an exact area, and that the long side must not be more than 10% larger than the short side.  If these requirements can be met in more than one way, in terms of the exact dimensions of the two sides, then he demands that all variants are produced.  For example, if he were to ask for metal sheet of area 889200, then there are three final dimensions that can be produced: 900×988, 912×975 and 936×950.  The target area of 889200 is the smallest area which can be manufactured in three different variants, within the limitations of the robot welders.",
+        "",
+        "Let M(n) be the minimal area that can be manufactured in exactly n variants with the longer edge not greater than 10% bigger than the shorter edge.  Hence M(3) = 889200.",
+        "",
+        "Find $ \\sum_{n=2}^{100} M(n)$."
+      ]
+    },
+    {
+      "_id": "5900fef658d9425c70af4f86",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 564: Maximal polygons",
+      "tests": [
+        "assert.strictEqual(euler564(), TODO: MISSING ANSWER, 'message: <code>euler564()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler564() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler564();"
+      ],
+      "description": [
+        "A line segment of length $2n-3$ is randomly split into $n$ segments of integer length ($n \\ge 3$). In the sequence given by this split, the segments are then used as consecutive sides of a convex $n$-polygon, formed in such a way that its area is maximal.  All of the $\\binom{2n-4} {n-1}$ possibilities for splitting up the initial line segment occur with the same probability. ",
+        "",
+        "Let $E(n)$ be the expected value of the area that is obtained by this procedure.",
+        "For example, for $n=3$ the only possible split of the line segment of length $3$ results in three line segments with length $1$, that form an equilateral triangle with an area of $\\frac 1 4 \\sqrt{3}$. Therefore $E(3)=0.433013$, rounded to $6$ decimal places.",
+        "For $n=4$ you can find $4$ different possible splits, each of which is composed of three line segments with length $1$ and one line segment with length $2$. All of these splits lead to the same maximal quadrilateral with an area of $\\frac 3 4 \\sqrt{3}$, thus $E(4)=1.299038$, rounded to $6$ decimal places.",
+        "",
+        "Let $S(k)=\\displaystyle \\sum_{n=3}^k E(n)$.",
+        "For example, $S(3)=0.433013$, $S(4)=1.732051$, $S(5)=4.604767$ and $S(10)=66.955511$, rounded to $6$ decimal places each.",
+        "",
+        "Find $S(50)$, rounded to $6$ decimal places."
+      ]
+    },
+    {
+      "_id": "5900fef758d9425c70af4f87",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 565: Divisibility of sum of divisors",
+      "tests": [
+        "assert.strictEqual(euler565(), TODO: MISSING ANSWER, 'message: <code>euler565()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler565() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler565();"
+      ],
+      "description": [
+        "Let $\\sigma(n)$ be the sum of the divisors of $n$.",
+        "E.g. the divisors of 4 are 1, 2 and 4, so $\\sigma(4)=7$.",
+        "",
+        "",
+        "The numbers $n$ not exceeding 20 such that 7 divides  $\\sigma(n)$ are:  4,12,13 and 20, the sum of these numbers being 49.",
+        "",
+        "",
+        "Let $S(n , d)$ be the sum of the numbers $i$ not exceeding $n$ such that $d$ divides $\\sigma(i)$.",
+        "So $S(20 , 7)=49$.",
+        "",
+        "",
+        "",
+        "You are given: $S(10^6,2017)=150850429$ and $S(10^9 , 2017)=249652238344557$.",
+        "",
+        "",
+        "Find $S(10^{11} , 2017)$"
+      ]
+    },
+    {
+      "_id": "5900fef858d9425c70af4f88",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 566: Cake Icing Puzzle",
+      "tests": [
+        "assert.strictEqual(euler566(), TODO: MISSING ANSWER, 'message: <code>euler566()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler566() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler566();"
+      ],
+      "description": [
+        "Adam plays the following game with his birthday cake.",
+        "",
+        "He cuts a piece forming a circular sector of 60 degrees and flips the piece upside down, with the icing on the bottom.",
+        "He then rotates the cake by 60 degrees counterclockwise, cuts an adjacent 60 degree piece and flips it upside down.",
+        "He keeps repeating this, until after a total of twelve steps, all the icing is back on top.",
+        "",
+        "Amazingly, this works for any piece size, even if the cutting angle is an irrational number: all the icing will be back on top after a finite number of steps.",
+        "",
+        "Now, Adam tries something different: he alternates cutting pieces of size $x=\\frac{360}{9}$ degrees, $y=\\frac{360}{10}$ degrees and $z=\\frac{360 }{\\sqrt{11}}$ degrees. The first piece he cuts has size x and he flips it. The second has size y and he flips it. The third has size z and he flips it. He repeats this with pieces of size x, y and z in that order until all the icing is back on top, and discovers he needs 60 flips altogether.",
+        "",
+        "",
+        "",
+        "Let F(a, b, c) be the minimum number of piece flips needed to get all the icing back on top for pieces of size $x=\\frac{360}{a}$ degrees, $y=\\frac{360}{b}$ degrees and $z=\\frac{360}{\\sqrt{c}}$ degrees.",
+        "Let $G(n) = \\sum_{9 \\le a < b < c \\le n} F(a,b,c)$, for integers a, b and c.",
+        "",
+        "You are given that F(9, 10, 11) = 60, F(10, 14, 16) = 506, F(15, 16, 17) = 785232.",
+        "You are also given G(11) = 60, G(14) = 58020 and G(17) = 1269260.",
+        "",
+        "Find G(53)."
+      ]
+    },
+    {
+      "_id": "5900fef958d9425c70af4f89",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 567: Reciprocal games I",
+      "tests": [
+        "assert.strictEqual(euler567(), TODO: MISSING ANSWER, 'message: <code>euler567()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler567() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler567();"
+      ],
+      "description": [
+        "Tom has built a random generator that is connected to a row of $n$ light bulbs. Whenever the random generator is activated each of the $n$ lights is turned on with the probability of $\\frac 1 2$, independently of its former state or the state of the other light bulbs.",
+        "",
+        "While discussing with his friend Jerry how to use his generator, they invent two different games, they call the reciprocal games:",
+        "Both games consist of $n$ turns. Each turn is started by choosing a number $k$ randomly between (and including) $1$ and $n$, with equal probability of $\\frac 1 n$ for each number, while the possible win for that turn is the reciprocal of $k$, that is $\\frac 1 k$.",
+        "",
+        "In game A, Tom activates his random generator once in each turn. If the number of lights turned on is the same as the previously chosen number $k$, Jerry wins and gets $\\frac 1 k$, otherwise he will receive nothing for that turn. Jerry's expected win after playing the total game A consisting of $n$ turns is called $J_A(n)$. For example $J_A(6)=0.39505208$, rounded to 8 decimal places.",
+        "",
+        "For each turn in game B, after $k$ has been randomly selected, Tom keeps reactivating his random generator until exactly $k$ lights are turned on. After that Jerry takes over and reactivates the random generator until he, too, has generated a pattern with exactly $k$ lights turned on. If this pattern is identical to Tom's last pattern, Jerry wins and gets $\\frac 1 k$, otherwise he will receive nothing. Jerry's expected win after the total game B consisting of $n$ turns is called $J_B(n)$. For example $J_B(6)=0.43333333$, rounded to 8 decimal places.",
+        "",
+        "Let $\\displaystyle S(m)=\\sum_{n=1}^m (J_A(n)+J_B(n))$. For example $S(6)=7.58932292$, rounded to 8 decimal places.",
+        "",
+        "Find S(123456789), rounded to 8 decimal places."
+      ]
+    },
+    {
+      "_id": "5900fefa58d9425c70af4f8a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 568: Reciprocal games II",
+      "tests": [
+        "assert.strictEqual(euler568(), TODO: MISSING ANSWER, 'message: <code>euler568()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler568() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler568();"
+      ],
+      "description": [
+        "Tom has built a random generator that is connected to a row of $n$ light bulbs. Whenever the random generator is activated each of the $n$ lights is turned on with the probability of $\\frac 1 2$, independently of its former state or the state of the other light bulbs.",
+        "",
+        "While discussing with his friend Jerry how to use his generator, they invent two different games, they call the reciprocal games:",
+        "Both games consist of $n$ turns. Each turn is started by choosing a number $k$ randomly between (and including) $1$ and $n$, with equal probability of $\\frac 1 n$ for each number, while the possible win for that turn is the reciprocal of $k$, that is $\\frac 1 k$.",
+        "",
+        "In game A, Tom activates his random generator once in each turn. If the number of lights turned on is the same as the previously chosen number $k$, Jerry wins and gets $\\frac 1 k$, otherwise he will receive nothing for that turn. Jerry's expected win after playing the total game A consisting of $n$ turns is called $J_A(n)$. For example $J_A(6)=0.39505208$, rounded to 8 decimal places.",
+        "",
+        "For each turn in game B, after $k$ has been randomly selected, Tom keeps reactivating his random generator until exactly $k$ lights are turned on. After that Jerry takes over and reactivates the random generator until he, too, has generated a pattern with exactly $k$ lights turned on. If this pattern is identical to Tom's last pattern, Jerry wins and gets $\\frac 1 k$, otherwise he will receive nothing. Jerry's expected win after the total game B consisting of $n$ turns is called $J_B(n)$. For example $J_B(6)=0.43333333$, rounded to 8 decimal places.",
+        "",
+        "Let $D(n)=J_B(n)−J_A(n)$. For example, $D(6) = 0.03828125$.",
+        "",
+        "Find the 7 most significant digits of $D(123456789)$ after removing all leading zeros.",
+        "(If, for example, we had asked for the 7 most significant digits of $D(6)$, the answer would have been 3828125.)"
+      ]
+    },
+    {
+      "_id": "5900fefb58d9425c70af4f8b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 569: Prime Mountain Range",
+      "tests": [
+        "assert.strictEqual(euler569(), TODO: MISSING ANSWER, 'message: <code>euler569()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler569() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler569();"
+      ],
+      "description": [
+        "A mountain range consists of a line of mountains with slopes of exactly 45°, and heights governed by the prime numbers, pn. The up-slope of the kth mountain is of height p2k−1, and the downslope is p2k. The first few foot-hills of this range are illustrated below.",
+        "",
+        "",
+        "",
+        "",
+        "Tenzing sets out to climb each one in turn, starting from the lowest. At the top of each peak, he looks back and counts how many of the previous peaks he can see. In the example above, the eye-line from the third mountain is drawn in red, showing that he can only see the peak of the second mountain from this viewpoint. Similarly, from the 9th mountain, he can see three peaks, those of the 5th, 7th and 8th mountain.",
+        "",
+        "Let P(k) be the number of peaks that are visible looking back from the kth mountain.  Hence P(3)=1 and P(9)=3.",
+        "Also $\\displaystyle \\sum_{k=1}^{100} P(k) = 227$.",
+        "",
+        "Find $\\displaystyle \\sum_{k=1}^{2500000} P(k)$."
+      ]
+    },
+    {
+      "_id": "5900fefc58d9425c70af4f8c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 570: Snowflakes",
+      "tests": [
+        "assert.strictEqual(euler570(), TODO: MISSING ANSWER, 'message: <code>euler570()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler570() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler570();"
+      ],
+      "description": [
+        "A snowflake of order n is formed by overlaying an equilateral triangle (rotated by 180 degrees) onto each equilateral triangle of the same size in a snowflake of order n-1. A snowflake of order 1 is a single equilateral triangle.",
+        "",
+        "",
+        "",
+        " ",
+        "",
+        "",
+        "Some areas of the snowflake are overlaid repeatedly. In the above picture, blue represents the areas that are one layer thick, red two layers thick, yellow three layers thick, and so on. ",
+        "",
+        "For an order n snowflake, let A(n) be the number of triangles that are one layer thick, and let B(n) be the number of triangles that are three layers thick. Define G(n) = gcd(A(n), B(n)).",
+        "",
+        "E.g. A(3) = 30, B(3) = 6, G(3)=6",
+        "A(11) = 3027630, B(11) = 19862070, G(11) = 30",
+        "",
+        "Further, G(500) = 186 and  $\\sum_{n=3}^{500}G(n)=5124$",
+        "",
+        "Find $\\displaystyle \\sum_{n=3}^{10^7}G(n)$."
+      ]
+    },
+    {
+      "_id": "5900fefd58d9425c70af4f8d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 571: Super Pandigital Numbers",
+      "tests": [
+        "assert.strictEqual(euler571(), TODO: MISSING ANSWER, 'message: <code>euler571()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler571() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler571();"
+      ],
+      "description": [
+        "A positive number is pandigital in base b if it contains all digits from 0 to b - 1 at least once when written in base b.",
+        "",
+        "A n-super-pandigital number is a number that is simultaneously pandigital in all bases from 2 to n inclusively.",
+        "For example 978 = 11110100102 = 11000203 = 331024 = 124035 is the smallest 5-super-pandigital number.",
+        "Similarly, 1093265784 is the smallest 10-super-pandigital number.",
+        "The sum of the 10 smallest 10-super-pandigital numbers is 20319792309.",
+        "",
+        "What is the sum of the 10 smallest 12-super-pandigital numbers?"
+      ]
+    },
+    {
+      "_id": "5900fefe58d9425c70af4f8e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 572: Idempotent matrices",
+      "tests": [
+        "assert.strictEqual(euler572(), TODO: MISSING ANSWER, 'message: <code>euler572()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler572() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler572();"
+      ],
+      "description": [
+        "A matrix $M$ is called idempotent if $M^2 = M$.",
+        "Let $M$ be a three by three matrix : ",
+        "$M=\\begin{pmatrix} ",
+        "  a & b & c\\\\ ",
+        "  d & e & f\\\\",
+        "  g &h &i\\\\",
+        "\\end{pmatrix}$.",
+        "Let C(n) be the number of  idempotent three by three matrices $M$ with integer elements such that",
+        "$ -n \\le a,b,c,d,e,f,g,h,i \\le n$.",
+        "",
+        "C(1)=164 and C(2)=848.",
+        "",
+        "",
+        "Find C(200)."
+      ]
+    },
+    {
+      "_id": "5900feff58d9425c70af4f8f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 573: Unfair race",
+      "tests": [
+        "assert.strictEqual(euler573(), TODO: MISSING ANSWER, 'message: <code>euler573()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler573() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler573();"
+      ],
+      "description": [
+        "$n$ runners in very different training states want to compete in a race. Each one of them is given a different starting number $k$ $(1\\leq k \\leq n)$ according to his (constant) individual racing speed being $v_k=\\frac{k}{n}$.",
+        "In order to give the slower runners a chance to win the race, $n$ different starting positions are chosen randomly (with uniform distribution) and independently from each other within the racing track of length $1$. After this, the starting position nearest to the goal is assigned to runner $1$, the next nearest starting position to runner $2$ and so on, until finally the starting position furthest away from the goal is assigned to runner $n$. The winner of the race is the runner who reaches the goal first.",
+        "",
+        "Interestingly, the expected running time for the winner is $\\frac{1}{2}$, independently of the number of runners. Moreover, while it can be shown that all runners will have the same expected running time of $\\frac{n}{n+1}$, the race is still unfair, since the winning chances may differ significantly for different starting numbers:",
+        "",
+        "Let $P_{n,k}$ be the probability for runner $k$ to win a race with $n$ runners and $E_n = \\sum_{k=1}^n k P_{n,k}$ be the expected starting number of the winner in that race. It can be shown that, for example,",
+        "$P_{3,1}=\\frac{4}{9}$, $P_{3,2}=\\frac{2}{9}$, $P_{3,3}=\\frac{1}{3}$ and $E_3=\\frac{17}{9}$ for a race with $3$ runners. ",
+        "You are given that $E_4=2.21875$, $E_5=2.5104$ and $E_{10}=3.66021568$.",
+        "",
+        "Find $E_{1000000}$ rounded to 4 digits after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900ff0058d9425c70af4f90",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 574: Verifying Primes",
+      "tests": [
+        "assert.strictEqual(euler574(), TODO: MISSING ANSWER, 'message: <code>euler574()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler574() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler574();"
+      ],
+      "description": [
+        "Let $q$ be a prime and $A \\ge B >0$ be two integers with the following properties:",
+        " $A$ and $B$ have no prime factor in common, that is $\\text{gcd}(A,B)=1$.",
+        " The product $AB$ is divisible by every prime less than q.",
+        "",
+        "It can be shown that, given these conditions, any sum $A+B<q^2$ and any difference $1<A-B<q^2$ has to be a prime number. Thus you can verify that a number $p$ is prime by showing that either $p=A+B<q^2$ or $p=A-B<q^2$ for some $A,B,q$ fulfilling the conditions listed above.",
+        "",
+        "Let $V(p)$ be the smallest possible value of $A$ in any sum $p=A+B$ and any difference $p=A-B$, that verifies $p$ being prime. Examples:",
+        "$V(2)=1$, since $2=1+1< 2^2$. ",
+        "$V(37)=22$, since $37=22+15=2 \\cdot 11+3 \\cdot 5< 7^2$ is the associated sum with the smallest possible $A$.",
+        "$V(151)=165$ since $151=165-14=3 \\cdot 5 \\cdot 11 - 2 \\cdot 7<13^2$ is the associated difference with the smallest possible $A$. ",
+        "",
+        "Let $S(n)$ be the sum of $V(p)$ for all primes $p<n$. For example, $S(10)=10$ and $S(200)=7177$.",
+        "",
+        "Find $S(3800)$."
+      ]
+    },
+    {
+      "_id": "5900ff0158d9425c70af4f91",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 575: Wandering Robots",
+      "tests": [
+        "assert.strictEqual(euler575(), TODO: MISSING ANSWER, 'message: <code>euler575()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler575() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler575();"
+      ],
+      "description": [
+        "It was quite an ordinary day when a mysterious alien vessel appeared as if from nowhere. After waiting several hours and receiving no response it is decided to send a team to investigate, of which you are included. Upon entering the vessel you are met by a friendly holographic figure, Katharina, who explains the purpose of the vessel, Eulertopia.",
+        "",
+        "She claims that Eulertopia is almost older than time itself. Its mission was to take advantage of a combination of incredible computational power and vast periods of time to discover the answer to life, the universe, and everything. Hence the resident cleaning robot, Leonhard, along with his housekeeping responsibilities, was built with a powerful computational matrix to ponder the meaning of life as he wanders through a massive 1000 by 1000 square grid of rooms. She goes on to explain that the rooms are numbered sequentially from left to right, row by row. So, for example, if Leonhard was wandering around a 5 by 5 grid then the rooms would be numbered in the following way.",
+        "",
+        "",
+        "",
+        "",
+        "Many millenia ago Leonhard reported to Katharina to have found the answer and he is willing to share it with any life form who proves to be worthy of such knowledge.",
+        "",
+        "Katharina further explains that the designers of Leonhard were given instructions to program him with equal probability of remaining in the same room or travelling to an adjacent room. However, it was not clear to them if this meant (i) an equal probability being split equally between remaining in the room and the number of available routes, or, (ii) an equal probability (50%) of remaining in the same room and then the other 50% was to be split equally between the number of available routes.",
+        "",
+        "",
+        "",
+        "",
+        "(i) Probability of remaining related to number of exits",
+        "(ii) Fixed 50% probability of remaining",
+        "",
+        "",
+        "The records indicate that they decided to flip a coin. Heads would mean that the probability of remaining was dynamically related to the number of exits whereas tails would mean that they program Leonhard with a fixed 50% probability of remaining in a particular room. Unfortunately there is no record of the outcome of the coin, so without further information we would need to assume that there is equal probability of either of the choices being implemented.",
+        "",
+        "Katharina suggests it should not be too challenging to determine that the probability of finding him in a square numbered room in a 5 by 5 grid after unfathomable periods of time would be approximately 0.177976190476 [12 d.p.].",
+        "",
+        "In order to prove yourself worthy of visiting the great oracle you must calculate the probability of finding him in a square numbered room in the 1000 by 1000 lair in which he has been wandering.",
+        "(Give your answer rounded to 12 decimal places)"
+      ]
+    },
+    {
+      "_id": "5900ff0258d9425c70af4f92",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 576: Irrational jumps",
+      "tests": [
+        "assert.strictEqual(euler576(), TODO: MISSING ANSWER, 'message: <code>euler576()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler576() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler576();"
+      ],
+      "description": [
+        "A bouncing point moves counterclockwise along a circle with circumference $1$ with  jumps of constant length $l<1$, until it hits a gap of length $g<1$, that is placed in a distance $d$ counterclockwise from the starting point. The gap does not include the starting point, that is $g+d<1$.",
+        "",
+        "Let $S(l,g,d)$ be the sum of the length of all jumps, until the point falls into the gap. It can be shown that $S(l,g,d)$ is finite for any irrational jump size $l$, regardless of the values of $g$ and $d$.",
+        "Examples: ",
+        "$S(\\sqrt{\\frac 1 2}, 0.06, 0.7)=0.7071 \\dots$, $S(\\sqrt{\\frac 1 2}, 0.06, 0.3543)=1.4142 \\dots$ and  $S(\\sqrt{\\frac 1 2}, 0.06, 0.2427)=16.2634 \\dots$.",
+        "",
+        "Let $M(n, g)$ be the maximum of $ \\sum S(\\sqrt{\\frac 1 p}, g, d)$ for all primes $p \\le n$ and any valid value of $d$.",
+        "Examples:",
+        "$M(3, 0.06) =29.5425 \\dots$, since $S(\\sqrt{\\frac 1 2}, 0.06, 0.2427)+S(\\sqrt{\\frac 1 3}, 0.06, 0.2427)=29.5425 \\dots$ is the maximal reachable sum for $g=0.06$. ",
+        "$M(10, 0.01)=266.9010 \\dots$ ",
+        "",
+        "Find $M(100, 0.00002)$, rounded to 4 decimal places."
+      ]
+    },
+    {
+      "_id": "5900ff0358d9425c70af4f93",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 577: Counting hexagons",
+      "tests": [
+        "assert.strictEqual(euler577(), TODO: MISSING ANSWER, 'message: <code>euler577()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler577() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler577();"
+      ],
+      "description": [
+        "An equilateral triangle with integer side length $n \\ge 3$ is divided into $n^2$ equilateral triangles with side length 1 as shown in the diagram below.",
+        "The vertices of these triangles constitute a triangular lattice with $\\frac{(n+1)(n+2)} 2$ lattice points.",
+        "Let $H(n)$ be the number of all regular hexagons that can be found by connecting 6 of these points. ",
+        "",
+        "",
+        "",
+        "",
+        "For example, $H(3)=1$, $H(6)=12$ and $H(20)=966$.",
+        "",
+        "Find $\\displaystyle \\sum_{n=3}^{12345} H(n)$."
+      ]
+    },
+    {
+      "_id": "5900ff0458d9425c70af4f94",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 578: Integers with decreasing prime powers",
+      "tests": [
+        "assert.strictEqual(euler578(), TODO: MISSING ANSWER, 'message: <code>euler578()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler578() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler578();"
+      ],
+      "description": [
+        "Any positive integer can be written as a product of prime powers: p1a1 × p2a2 × ... × pkak,",
+        "where pi are distinct prime integers, ai > 0 and pi < pj if i < j.",
+        "",
+        "A decreasing prime power positive integer is one for which ai ≥ aj if i < j.",
+        "For example, 1, 2, 15=3×5, 360=23×32×5 and 1000=23×53 are decreasing prime power integers.",
+        "",
+        "Let C(n) be the count of decreasing prime power positive integers not exceeding n.",
+        "C(100) = 94 since all positive integers not exceeding 100 have decreasing prime powers except 18, 50, 54, 75, 90 and 98.",
+        "You are given C(106) = 922052.",
+        "",
+        "Find C(1013)."
+      ]
+    },
+    {
+      "_id": "5900ff0558d9425c70af4f95",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 579: Lattice points in lattice cubes",
+      "tests": [
+        "assert.strictEqual(euler579(), TODO: MISSING ANSWER, 'message: <code>euler579()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler579() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler579();"
+      ],
+      "description": [
+        "A lattice cube is a cube in which all vertices have integer coordinates. Let C(n) be the number of different lattice cubes in which the coordinates of all vertices range between (and including) 0 and n. Two cubes are hereby considered different if any of their vertices have different coordinates.",
+        "For example, C(1)=1, C(2)=9, C(4)=100, C(5)=229, C(10)=4469 and C(50)=8154671.",
+        "",
+        "Different cubes may contain different numbers of lattice points.",
+        "",
+        "For example, the cube with the vertices",
+        "(0, 0, 0), (3, 0, 0), (0, 3, 0), (0, 0, 3), (0, 3, 3), (3, 0, 3), (3, 3, 0), (3, 3, 3) contains 64 lattice points (56 lattice points on the surface including the 8 vertices and 8 points within the cube). ",
+        "In contrast, the cube with the vertices",
+        "(0, 2, 2), (1, 4, 4), (2, 0, 3), (2, 3, 0), (3, 2, 5), (3, 5, 2), (4, 1, 1), (5, 3, 3) contains only 40 lattice points (20 points on the surface and 20 points within the cube), although both cubes have the same side length 3.",
+        "",
+        "",
+        "Let S(n) be the sum of the lattice points contained in the different lattice cubes in which the coordinates of all vertices range between (and including) 0 and n.",
+        "",
+        "For example, S(1)=8, S(2)=91, S(4)=1878, S(5)=5832, S(10)=387003 and S(50)=29948928129.",
+        "",
+        "Find S(5000) mod 109."
+      ]
+    },
+    {
+      "_id": "5900ff0658d9425c70af4f96",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 580: Squarefree Hilbert numbers",
+      "tests": [
+        "assert.strictEqual(euler580(), TODO: MISSING ANSWER, 'message: <code>euler580()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler580() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler580();"
+      ],
+      "description": [
+        "A Hilbert number is any positive integer of the form $4k+1$ for integer $k\\geq 0$.  We shall define a squarefree Hilbert number as a Hilbert number which is not divisible by the square of any Hilbert number other than one.  For example, $117$ is a squarefree Hilbert number, equaling $9\\times13$.  However $6237$ is a Hilbert number that is not squarefree in this sense, as it is divisible by $9^2$.  The number $3969$ is also not squarefree, as it is divisible by both $9^2$ and $21^2$.  ",
+        "",
+        "",
+        "There are $2327192$ squarefree Hilbert numbers below $10^7$. ",
+        "How many squarefree Hilbert numbers are there below $10^{16}$?"
+      ]
+    },
+    {
+      "_id": "5900ff0758d9425c70af4f97",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 581: 47-smooth triangular numbers",
+      "tests": [
+        "assert.strictEqual(euler581(), TODO: MISSING ANSWER, 'message: <code>euler581()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler581() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler581();"
+      ],
+      "description": [
+        "A number is p-smooth if it has no prime factors larger than p.",
+        "Let T be the sequence of triangular numbers, ie T(n)=n(n+1)/2.",
+        "Find the sum of all indices n such that T(n) is 47-smooth."
+      ]
+    },
+    {
+      "_id": "5900ff0858d9425c70af4f98",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 582: Nearly isosceles 120 degree triangles",
+      "tests": [
+        "assert.strictEqual(euler582(), TODO: MISSING ANSWER, 'message: <code>euler582()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler582() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler582();"
+      ],
+      "description": [
+        "Let a, b and c be the sides of an integer sided triangle with one angle of 120 degrees, a≤b≤c and b-a≤100.",
+        "Let T(n) be the number of such triangles with c≤n.",
+        "T(1000)=235 and T(108)=1245.",
+        "Find T(10100)."
+      ]
+    },
+    {
+      "_id": "5900ff0958d9425c70af4f99",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 583: Heron Envelopes",
+      "tests": [
+        "assert.strictEqual(euler583(), TODO: MISSING ANSWER, 'message: <code>euler583()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler583() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler583();"
+      ],
+      "description": [
+        "A standard envelope shape is a convex figure consisting of an isosceles triangle (the flap) placed on top of a rectangle.  An example of an envelope with integral sides is shown below.  Note that to form a sensible envelope, the perpendicular height of the flap (BCD) must be smaller than the height of the rectangle (ABDE).  ",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "In the envelope illustrated, not only are all the sides integral, but also all the diagonals (AC, AD, BD, BE and CE) are integral too. Let us call an envelope with these properties a Heron envelope.",
+        "",
+        "",
+        "",
+        "Let S(p) be the sum of the perimeters of all the Heron envelopes with a perimeter less than or equal to p. ",
+        "",
+        "",
+        "You are given that S(104) = 884680.  Find S(107)."
+      ]
+    },
+    {
+      "_id": "5900ff0a58d9425c70af4f9a",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 584: Birthday Problem Revisited",
+      "tests": [
+        "assert.strictEqual(euler584(), TODO: MISSING ANSWER, 'message: <code>euler584()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler584() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler584();"
+      ],
+      "description": [
+        "A long long time ago in a galaxy far far away, the Wimwians, inhabitants of planet WimWi, discovered an unmanned drone that had landed on their planet. On examining the drone, they uncovered a device that sought the answer for the so called \"Birthday Problem\". The description of the problem was as follows:",
+        "",
+        "If people on your planet were to enter a very large room one by one, what will be the expected number of people in the room when you first find 3 people with Birthdays within 1 day from each other.",
+        "",
+        "The description further instructed them to enter the answer into the device and send the drone into space again. Startled by this turn of events, the Wimwians consulted their best mathematicians. Each year on Wimwi has 10 days and the mathematicians assumed equally likely birthdays and ignored leap years (leap years in Wimwi have 11 days), and found 5.78688636 to be the required answer. As such, the Wimwians entered this answer and sent the drone back into space.",
+        "",
+        "",
+        "After traveling light years away, the drone then landed on planet Joka. The same events ensued except this time, the numbers in the device had changed due to some unknown technical issues. The description read:",
+        "",
+        "If people on your planet were to enter a very large room one by one, what will be the expected number of people in the room when you first find 3 people with Birthdays within 7 days from each other.",
+        "",
+        "With a 100-day year on the planet, the Jokars (inhabitants of Joka) found the answer to be 8.48967364 (rounded to 8 decimal places because the device allowed only 8 places after the decimal point) assuming equally likely birthdays. They too entered the answer into the device and launched the drone into space again.",
+        "",
+        "",
+        "This time the drone landed on planet Earth. As before the numbers in the problem description had changed. It read:",
+        "",
+        "If people on your planet were to enter a very large room one by one, what will be the expected number of people in the room when you first find 4 people with Birthdays within 7 days from each other.",
+        "",
+        "What would be the answer (rounded to eight places after the decimal point) the people of Earth have to enter into the device for a year with 365 days? Ignore leap years. Also assume that all birthdays are equally likely and independent of each other."
+      ]
+    },
+    {
+      "_id": "5900ff0b58d9425c70af4f9b",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 585: Nested square roots",
+      "tests": [
+        "assert.strictEqual(euler585(), TODO: MISSING ANSWER, 'message: <code>euler585()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler585() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler585();"
+      ],
+      "description": [
+        "Consider the term $\\small \\sqrt{x+\\sqrt{y}+\\sqrt{z}}$ that is representing a nested square root. $x$, $y$ and $z$ are positive integers and $y$ and $z$ are not allowed to be perfect squares, so the number below the outer square root is irrational. Still it can be shown that for some combinations of $x$, $y$ and $z$ the given term can be simplified into a sum and/or difference of simple square roots of integers, actually denesting the square roots in the initial expression. ",
+        "",
+        "Here are some examples of this denesting:",
+        "$\\small \\sqrt{3+\\sqrt{2}+\\sqrt{2}}=\\sqrt{2}+\\sqrt{1}=\\sqrt{2}+1$",
+        "$\\small \\sqrt{8+\\sqrt{15}+\\sqrt{15}}=\\sqrt{5}+\\sqrt{3}$",
+        "$\\small \\sqrt{20+\\sqrt{96}+\\sqrt{12}}=\\sqrt{9}+\\sqrt{6}+\\sqrt{3}-\\sqrt{2}=3+\\sqrt{6}+\\sqrt{3}-\\sqrt{2}$",
+        "$\\small \\sqrt{28+\\sqrt{160}+\\sqrt{108}}=\\sqrt{15}+\\sqrt{6}+\\sqrt{5}-\\sqrt{2}$",
+        "As you can see the integers used in the denested expression may also be perfect squares resulting in further simplification.",
+        "",
+        "Let F($n$) be the number of different terms $\\small \\sqrt{x+\\sqrt{y}+\\sqrt{z}}$, that can be denested into the sum and/or difference of a finite number of square roots, given the additional condition that $0<x \\le n$. That is,",
+        "$\\small \\displaystyle \\sqrt{x+\\sqrt{y}+\\sqrt{z}}=\\sum_{i=1}^k s_i\\sqrt{a_i}$",
+        "with $k$, $x$, $y$, $z$ and all $a_i$ being positive integers, all $s_i =\\pm 1$ and $x\\le n$. Furthermore $y$ and $z$  are not allowed to be perfect squares.",
+        "",
+        "Nested roots with the same value are not considered different, for example $\\small \\sqrt{7+\\sqrt{3}+\\sqrt{27}}$, $\\small \\sqrt{7+\\sqrt{12}+\\sqrt{12}}$ and $\\small \\sqrt{7+\\sqrt{27}+\\sqrt{3}}$, that can all three be denested into $\\small 2+\\sqrt{3}$, would only be counted once.",
+        "",
+        "You are given that F(10)=17, F(15)=46, F(20)=86, F(30)=213 and F(100)=2918 and F(5000)=11134074.",
+        "Find F(5000000)."
+      ]
+    },
+    {
+      "_id": "5900ff0c58d9425c70af4f9c",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 586: Binary Quadratic Form",
+      "tests": [
+        "assert.strictEqual(euler586(), TODO: MISSING ANSWER, 'message: <code>euler586()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler586() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler586();"
+      ],
+      "description": [
+        "The number 209 can be expressed as $a^2 + 3ab + b^2$ in two distinct ways:",
+        "",
+        "",
+        "$ \\qquad 209 = 8^2 + 3\\cdot 8\\cdot 5 + 5^2$ ",
+        "$ \\qquad 209 = 13^2 + 3\\cdot13\\cdot 1 + 1^2$",
+        "",
+        "",
+        "Let $f(n,r)$ be the number of integers $k$ not exceeding $n$ that can be expressed as $k=a^2 + 3ab + b^2$, with $a\\gt b>0$ integers, in exactly $r$ different ways.",
+        "",
+        "",
+        "You are given that $f(10^5, 4) = 237$ and $f(10^8, 6) = 59517$.",
+        "",
+        "",
+        "Find $f(10^{15}, 40)$."
+      ]
+    },
+    {
+      "_id": "5900ff0d58d9425c70af4f9d",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 587: Concave triangle",
+      "tests": [
+        "assert.strictEqual(euler587(), TODO: MISSING ANSWER, 'message: <code>euler587()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler587() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler587();"
+      ],
+      "description": [
+        "A square is drawn around a circle as shown in the diagram below on the left.",
+        "We shall call the blue shaded region the L-section.",
+        "A line is drawn from the bottom left of the square to the top right as shown in the diagram on the right.",
+        "We shall call the orange shaded region a concave triangle.",
+        "",
+        "",
+        "",
+        "",
+        "It should be clear that the concave triangle occupies exactly half of the L-section.",
+        "",
+        "",
+        "",
+        "Two circles are placed next to each other horizontally, a rectangle is drawn around both circles, and a line is drawn from the bottom left to the top right as shown in the diagram below.",
+        "",
+        "",
+        "",
+        "",
+        "This time the concave triangle occupies approximately 36.46% of the L-section.",
+        "",
+        "",
+        "If n circles are placed next to each other horizontally, a rectangle is drawn around the n circles, and a line is drawn from the bottom left to the top right, then it can be shown that the least value of n for which the concave triangle occupies less than 10% of the L-section is n = 15.",
+        "",
+        "",
+        "What is the least value of n for which the concave triangle occupies less than 0.1% of the L-section?"
+      ]
+    },
+    {
+      "_id": "5900ff0e58d9425c70af4f9e",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 588: Quintinomial coefficients",
+      "tests": [
+        "assert.strictEqual(euler588(), TODO: MISSING ANSWER, 'message: <code>euler588()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler588() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler588();"
+      ],
+      "description": [
+        "The coefficients in the expansion of $(x+1)^k$ are called binomial coefficients.",
+        "Analoguously the coefficients in the expansion of $(x^4+x^3+x^2+x+1)^k$ are called quintinomial coefficients. (quintus= Latin for fifth).",
+        "",
+        "",
+        "Consider the expansion of $(x^4+x^3+x^2+x+1)^3$:",
+        "$x^{12}+3x^{11}+6x^{10}+10x^9+15x^8+18x^7+19x^6+18x^5+15x^4+10x^3+6x^2+3x+1$",
+        "As we can see 7 out of the 13 quintinomial coefficients for $k=3$ are odd.",
+        "",
+        "",
+        "Let $Q(k)$ be the number of odd coefficients in the expansion of $(x^4+x^3+x^2+x+1)^k$.",
+        "So $Q(3)=7$.",
+        "",
+        "",
+        "You are given $Q(10)=17$ and $Q(100)=35$.",
+        "",
+        "Find  $\\sum_{k=1}^{18}Q(10^k) $."
+      ]
+    },
+    {
+      "_id": "5900ff0f58d9425c70af4f9f",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 589: Poohsticks Marathon",
+      "tests": [
+        "assert.strictEqual(euler589(), TODO: MISSING ANSWER, 'message: <code>euler589()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler589() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler589();"
+      ],
+      "description": [
+        "Christopher Robin and Pooh Bear love the game of Poohsticks so much that they invented a new version which allows them to play for longer before one of them wins and they have to go home for tea. The game starts as normal with both dropping a stick simultaneously on the upstream side of a bridge. But rather than the game ending when one of the sticks emerges on the downstream side, instead they fish their sticks out of the water, and drop them back in again on the upstream side. The game only ends when one of the sticks emerges from under the bridge ahead of the other one having also 'lapped' the other stick - that is, having made one additional journey under the bridge compared to the other stick.",
+        "",
+        "",
+        "On a particular day when playing this game, the time taken for a stick to travel under the bridge varies between a minimum of 30 seconds, and a maximum of 60 seconds. The time taken to fish a stick out of the water and drop it back in again on the other side is 5 seconds. The current under the bridge has the unusual property that the sticks' journey time is always an integral number of seconds, and it is equally likely to emerge at any of the possible times between 30 and 60 seconds (inclusive). It turns out that under these circumstances, the expected time for playing a single game is 1036.15 seconds (rounded to 2 decimal places). This time is measured from the point of dropping the sticks for the first time, to the point where the winning stick emerges from under the bridge having lapped the other.",
+        "",
+        "",
+        "The stream flows at different rates each day, but maintains the property that the journey time in seconds is equally distributed amongst the integers from a minimum, $n$, to a maximum, $m$, inclusive. Let the expected time of play in seconds be $E(m,n)$. Hence $E(60,30)=1036.15...$",
+        "",
+        "",
+        "Let $S(k)=\\sum_{m=2}^k\\sum_{n=1}^{m-1}E(m,n)$.",
+        "",
+        "",
+        "For example $S(5)=7722.82$ rounded to 2 decimal places.",
+        "",
+        "",
+        "Find $S(100)$ and give your answer rounded to 2 decimal places."
+      ]
+    },
+    {
+      "_id": "5900ff1058d9425c70af4fa0",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 590: Sets with a given Least Common Multiple",
+      "tests": [
+        "assert.strictEqual(euler590(), TODO: MISSING ANSWER, 'message: <code>euler590()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler590() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler590();"
+      ],
+      "description": [
+        "Let H(n) denote the number of sets of positive integers such that the least common multiple of the integers in the set equals n.",
+        "E.g.:",
+        "The integers in the following ten sets all have a least common multiple of 6:",
+        "{2,3}, {1,2,3}, {6}, {1,6}, {2,6} ,{1,2,6}, {3,6}, {1,3,6}, {2,3,6} and {1,2,3,6}.",
+        "Thus H(6)=10.",
+        "",
+        "",
+        "Let L(n) denote the least common multiple of the numbers 1 through n.",
+        "E.g. L(6) is the least common multiple of the numbers 1,2,3,4,5,6 and L(6) equals 60.",
+        "",
+        "",
+        "Let HL(n) denote H(L(n)).",
+        "You are given HL(4)=H(12)=44.",
+        "",
+        "",
+        "Find HL(50000). Give your answer modulo 109."
+      ]
+    },
+    {
+      "_id": "5900ff1158d9425c70af4fa1",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 591: Best Approximations by Quadratic Integers",
+      "tests": [
+        "assert.strictEqual(euler591(), TODO: MISSING ANSWER, 'message: <code>euler591()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler591() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler591();"
+      ],
+      "description": [
+        "Given a non-square integer $d$, any real $x$ can be approximated arbitrarily close by quadratic integers $a+b\\sqrt{d}$, where $a,b$ are integers. For example, the following inequalities approximate $\\pi$ with precision $10^{-13}$:",
+        "$$4375636191520\\sqrt{2}-6188084046055 < \\pi < 721133315582\\sqrt{2}-1019836515172 $$ ",
+        "We call $BQA_d(x,n)$ the quadratic integer closest to $x$ with the absolute values of $a,b$ not exceeding $n$. We also define the integral part of a quadratic integer as $I_d(a+b\\sqrt{d}) = a$.",
+        "",
+        "You are given that:",
+        "$BQA_2(\\pi,10) = 6 - 2\\sqrt{2}$",
+        "$BQA_5(\\pi,100)=26\\sqrt{5}-55$",
+        "$BQA_7(\\pi,10^6)=560323 - 211781\\sqrt{7}$",
+        "$I_2(BQA_2(\\pi,10^{13}))=-6188084046055$Find the sum of $|I_d(BQA_d(\\pi,10^{13}))|$ for all  non-square positive integers less than 100."
+      ]
+    },
+    {
+      "_id": "5900ff1258d9425c70af4fa2",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 592: Factorial trailing digits 2",
+      "tests": [
+        "assert.strictEqual(euler592(), TODO: MISSING ANSWER, 'message: <code>euler592()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler592() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler592();"
+      ],
+      "description": [
+        "For any N, let f(N) be the last twelve hexadecimal digits before the trailing zeroes in N!.",
+        "",
+        "For example, the hexadecimal representation of 20! is 21C3677C82B40000,",
+        "so f(20) is the digit sequence 21C3677C82B4.",
+        "",
+        "Find f(20!). Give your answer as twelve hexadecimal digits, using uppercase for the digits A to F."
+      ]
+    },
+    {
+      "_id": "5900ff1358d9425c70af4fa3",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 593: Fleeting Medians",
+      "tests": [
+        "assert.strictEqual(euler593(), TODO: MISSING ANSWER, 'message: <code>euler593()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler593() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler593();"
+      ],
+      "description": [
+        "We define two sequences $S = \\{S(1), S(2), ..., S(n)\\}$ and $S_2 = \\{S_2(1), S_2(2), ..., S_2(n)\\}$:",
+        "",
+        "$S(k) = (p_k)^k$ mod $10007$ where $p_k$ is the $k$th prime number.",
+        "",
+        "$S_2(k) = S(k) + S(\\lfloor\\frac{k}{10000}\\rfloor + 1)$ where $\\lfloor \\cdot \\rfloor$ denotes the floor function.",
+        "",
+        "Then let $M(i, j)$ be the median of elements $S_2(i)$ through $S_2(j)$, inclusive. For example, $M(1, 10) = 2021.5$ and $M(10^2, 10^3) = 4715.0$.",
+        "",
+        "Let $F(n, k) = \\sum_{i=1}^{n-k+1} M(i, i + k - 1)$. For example, $F(100, 10) = 463628.5$ and $F(10^5, 10^4) = 675348207.5$.",
+        "",
+        "Find $F(10^7, 10^5)$. If the sum is not an integer, use $.5$ to denote a half. Otherwise, use $.0$ instead."
+      ]
+    },
+    {
+      "_id": "5900ff1458d9425c70af4fa4",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 594: Rhombus Tilings",
+      "tests": [
+        "assert.strictEqual(euler594(), TODO: MISSING ANSWER, 'message: <code>euler594()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler594() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler594();"
+      ],
+      "description": [
+        "For a polygon $P$, let $t(P)$ be the number of ways in which $P$ can be tiled using rhombi and squares with edge length 1. Distinct rotations and reflections are counted as separate tilings.",
+        "",
+        "",
+        "For example, if $O$ is a regular octagon with edge length 1, then $t(O) = 8$. As it happens, all these 8 tilings are rotations of one another:",
+        "",
+        "",
+        "",
+        "",
+        "Let $O_{a,b}$ be the equal-angled convex octagon whose edges alternate in length between $a$ and $b$.",
+        "",
+        "For example, here is $O_{2,1}$, with one of its tilings:",
+        "",
+        "",
+        "",
+        "",
+        "",
+        "You are given that $t(O_{1,1})=8$, $t(O_{2,1})=76$ and $t(O_{3,2})=456572$.",
+        "",
+        "",
+        "Find $t(O_{4,2})$."
+      ]
+    },
+    {
+      "_id": "5900ff1558d9425c70af4fa5",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 595: Incremental Random Sort",
+      "tests": [
+        "assert.strictEqual(euler595(), TODO: MISSING ANSWER, 'message: <code>euler595()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler595() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler595();"
+      ],
+      "description": [
+        "A deck of cards numbered from 1 to n is shuffled randomly such that each permutation is equally likely.",
+        "",
+        "",
+        "The cards are to be sorted into ascending order using the following technique:",
+        " Look at the initial sequence of cards.  If it is already sorted, then there is no need for further action.  Otherwise, if any subsequences of cards happen to be in the correct place relative to one another (ascending with no gaps), then those subsequences are fixed by attaching the cards together.  For example, with 7 cards initially in the order 4123756, the cards labelled 1, 2 and 3 would be attached together, as would 5 and 6.",
+        " The cards are 'shuffled' by being thrown into the air, but note that any correctly sequenced cards remain attached, so their orders are maintained.  The cards (or bundles of attached cards) are then picked up randomly.  You should assume that this randomisation is unbiased, despite the fact that some cards are single, and others are grouped together. ",
+        " Repeat steps 1 and 2 until the cards are sorted. ",
+        "",
+        "   Let S(n) be the expected number of shuffles needed to sort the cards. Since the order is checked before the first shuffle, S(1) = 0. You are given that S(2) = 1, and S(5) = 4213/871.",
+        "",
+        "",
+        "Find S(52), and give your answer rounded to 8 decimal places."
+      ]
+    },
+    {
+      "_id": "5900ff1658d9425c70af4fa6",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 596: Number of lattice points in a hyperball",
+      "tests": [
+        "assert.strictEqual(euler596(), TODO: MISSING ANSWER, 'message: <code>euler596()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler596() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler596();"
+      ],
+      "description": [
+        "Let T(r) be the number of integer quadruplets x, y, z, t such that x2 + y2 + z2 + t2 ≤ r2. In other words, T(r) is the number of lattice points in the four-dimensional hyperball of radius r.",
+        "",
+        "You are given that T(2) = 89, T(5) = 3121, T(100) = 493490641 and T(104) = 49348022079085897.",
+        "",
+        "Find T(108) mod 1000000007."
+      ]
+    },
+    {
+      "_id": "5900ff1758d9425c70af4fa7",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 597: Torpids",
+      "tests": [
+        "assert.strictEqual(euler597(), TODO: MISSING ANSWER, 'message: <code>euler597()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler597() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler597();"
+      ],
+      "description": [
+        "The Torpids are rowing races held annually in Oxford, following some curious rules:",
+        "",
+        "",
+        "A division consists of $n$ boats (typically 13), placed in order based on past performance.",
+        "",
+        "All boats within a division start at 40 metre intervals along the river, in order with the highest-placed boat starting furthest upstream.",
+        "",
+        "The boats all start rowing simultaneously, upstream, trying to catch the boat in front while avoiding being caught by boats behind.",
+        "",
+        "Each boat continues rowing until either it reaches the finish line or it catches up with (\"bumps\") a boat in front.",
+        "",
+        "The finish line is a distance $L$ metres (the course length, in reality about 1800 metres) upstream from the starting position of the lowest-placed boat. (Because of the staggered starting positions, higher-placed boats row a slightly shorter course than lower-placed boats.)",
+        "",
+        "When a \"bump\" occurs, the \"bumping\" boat takes no further part in the race. The \"bumped\" boat must continue, however, and may even be \"bumped\" again by boats that started two or more places behind it.",
+        "",
+        "After the race, boats are assigned new places within the division, based on the bumps that occurred. Specifically, for any boat $A$ that started in a lower place than $B$, then $A$ will be placed higher than $B$ in the new order if and only if one of the following occurred:",
+        "   $A$ bumped $B$ directly ",
+        "   $A$ bumped another boat that went on to bump $B$ ",
+        "   $A$ bumped another boat, that bumped yet another boat, that bumped $B$ ",
+        "   etc NOTE: For the purposes of this problem you may disregard the boats' lengths, and assume that a bump occurs precisely when the two boats draw level. (In reality, a bump is awarded as soon as physical contact is made, which usually occurs when there is much less than a full boat length's overlap.)",
+        "",
+        "",
+        "Suppose that, in a particular race, each boat $B_j$ rows at a steady speed $v_j = -$log$X_j$ metres per second, where the $X_j$ are chosen randomly (with uniform distribution) between 0 and 1, independently from one another. These speeds are relative to the riverbank: you may disregard the flow of the river.",
+        "",
+        "",
+        "Let $p(n,L)$ be the probability that the new order is an even permutation of the starting order, when there are $n$ boats in the division and $L$ is the course length.",
+        "",
+        "",
+        "For example, with $n=3$ and $L=160$, labelling the boats as $A$,$B$,$C$ in starting order with $C$ highest, the different possible outcomes of the race are as follows:",
+        "",
+        " Bumps occurring ",
+        "   New order ",
+        "   Permutation ",
+        "   Probability ",
+        "  none ",
+        "   $A$, $B$, $C$ ",
+        "   even ",
+        "   $4/15$ ",
+        "  $B$ bumps $C$ ",
+        "   $A$, $C$, $B$ ",
+        "   odd ",
+        "   $8/45$ ",
+        "  $A$ bumps $B$ ",
+        "   $B$, $A$, $C$ ",
+        "   odd ",
+        "   $1/3$ ",
+        "      $B$ bumps $C$, then $A$ bumps $C$     ",
+        "   $C$, $A$, $B$ ",
+        "   even ",
+        "   $4/27$ ",
+        "      $A$ bumps $B$, then $B$ bumps $C$     ",
+        "   $C$, $B$, $A$ ",
+        "   odd ",
+        "   $2/27$ ",
+        " ",
+        "Therefore, $p(3,160) = 4/15 + 4/27 = 56/135$.",
+        "",
+        "",
+        "You are also given that $p(4,400)=0.5107843137$, rounded to 10 digits after the decimal point.",
+        "",
+        "",
+        "Find $p(13,1800)$ rounded to 10 digits after the decimal point."
+      ]
+    },
+    {
+      "_id": "5900ff1858d9425c70af4fa8",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 598: Split Divisibilities",
+      "tests": [
+        "assert.strictEqual(euler598(), TODO: MISSING ANSWER, 'message: <code>euler598()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler598() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler598();"
+      ],
+      "description": [
+        "Consider the number 48.",
+        "There are five pairs of integers $a$ and $b$ ($a \\leq b$) such that $a \\times b=48$: (1,48), (2,24), (3,16), (4,12) and (6,8).",
+        "It can be seen that both 6 and 8 have 4 divisors.",
+        "So of those five pairs one consists of two integers with the same number of divisors.",
+        "",
+        "In general:",
+        "Let $C(n)$ be the number of pairs of positive integers $a \\times b=n$, ($a \\leq b$) such that $a$ and $b$ have the same number of divisors; so $C(48)=1$.",
+        "",
+        "",
+        "You are given $C(10!)=3$: (1680, 2160), (1800, 2016) and (1890,1920). ",
+        "Find $C(100!)$"
+      ]
+    },
+    {
+      "_id": "5900ff1958d9425c70af4fa9",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 599: Distinct Colourings of a Rubik's Cube",
+      "tests": [
+        "assert.strictEqual(euler599(), TODO: MISSING ANSWER, 'message: <code>euler599()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler599() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler599();"
+      ],
+      "description": [
+        "The well-known Rubik's Cube puzzle has many fascinating mathematical properties. The 2×2×2 variant has 8 cubelets with a total of 24 visible faces, each with a coloured sticker. Successively turning faces will rearrange the cubelets, although not all arrangements of cubelets are reachable without dismantling the puzzle.",
+        "",
+        "",
+        "Suppose that we wish to apply new stickers to a 2×2×2 Rubik's cube in a non-standard colouring. Specifically, we have $n$ different colours available (with an unlimited supply of stickers of each colour), and we place one sticker on each of the 24 faces in any arrangement that we please. We are not required to use all the colours, and if desired the same colour may appear in more than one face of a single cubelet.",
+        "",
+        "",
+        "We say that two such colourings $c_1,c_2$ are essentially distinct if a cube coloured according to $c_1$ cannot be made to match a cube coloured according to $c_2$ by performing mechanically possible Rubik's Cube moves.",
+        "",
+        "",
+        "For example, with two colours available, there are 183 essentially distinct colourings.",
+        "",
+        "",
+        "How many essentially distinct colourings are there with 10 different colours available?"
+      ]
+    },
+    {
+      "_id": "5900ff1a58d9425c70af4faa",
+      "challengeType": 5,
+      "type": "bonfire",
+      "title": "Problem 600: Integer sided equiangular hexagons",
+      "tests": [
+        "assert.strictEqual(euler600(), TODO: MISSING ANSWER, 'message: <code>euler600()</code> should return TODO: MISSING ANSWER.');"
+      ],
+      "solutions": [],
+      "translations": {},
+      "challengeSeed": [
+        "function euler600() {",
+        "  // Good luck!",
+        "  return true;",
+        "}",
+        "",
+        "euler600();"
+      ],
+      "description": [
+        "Let H(n) be the number of distinct integer sided equiangular convex hexagons with perimeter not exceeding n.",
+        "Hexagons are distinct if and only if they are not congruent.",
+        "",
+        "You are given H(6) = 1, H(12) = 10, H(100) = 31248.",
+        "Find H(55106).",
+        "",
+        "",
+        "Equiangular hexagons with perimeter not exceeding 12"
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/take-home-interview-projects.json b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/take-home-interview-projects.json
new file mode 100644
index 0000000000..2cdcc09104
--- /dev/null
+++ b/seed/math-challenges/08-coding-interview-questions-and-take-home-assignments/take-home-interview-projects.json
@@ -0,0 +1,681 @@
+{
+  "name": "Coding Interview Take-home Projects",
+  "order": 4,
+  "time": "",
+  "helpRoom": "HelpFrontEnd",
+  "challenges": [
+    {
+      "id": "bd7158d8c442eddfaeb5bd10",
+      "title": "Show the Local Weather",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/bELRjV' target='_blank'>https://codepen.io/freeCodeCamp/full/bELRjV</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can see the weather in my current location.",
+        "<strong>User Story:</strong> I can see a different icon or background image (e.g. snowy mountain, hot desert) depending on the weather.",
+        "<strong>User Story:</strong> I can push a button to toggle between Fahrenheit and Celsius.",
+        "<strong>Note:</strong> Many internet browsers now require an HTTP Secure (<code>https://</code>) connection to obtain a user's locale via HTML5 Geolocation. For this reason, we recommend using HTML5 Geolocation to get user location and then use the freeCodeCamp Weather API <a href='https://fcc-weather-api.glitch.me' target='_blank'>https://fcc-weather-api.glitch.me</a> which uses an HTTP Secure connection for the weather. Also, be sure to connect to <a href='https://codepen.io' target='_blank'>CodePen.io</a> via <code>https://</code>.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "GCLiJU-vvVc"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": false,
+      "translations": {
+        "es": {
+          "title": "Muestra el clima local",
+          "description": [
+            "<span class='text-info'>Objetivo:</span> Crea una aplicación con <a href='https://codepen.io' target='_blank'>CodePen.io</a> cuya funcionalidad sea similar a la de esta: <a href='https://codepen.io/freeCodeCamp/full/bELRjV' target='_blank'>https://codepen.io/freeCodeCamp/full/bELRjV</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o APIs que necesites.",
+            "<span class='text-info'>Historia de usuario:</span> Pedo obtener información acerca del clima en mi localización actual.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo ver un icono diferente o una imagen de fondo diferente (e.g. montaña con nieve, desierto caliente) dependiendo del clima.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo pulsar un botón para cambiar la unidad de temperatura de grados Fahrenheit a Celsius y viceversa.",
+            "Recomendamos utilizar <a href='https://openweathermap.org/current#geo' target='_blank'>Open Weather API</a>. 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 <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Sala de chat para revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        },
+        "ru": {
+          "title": "Покажите местную погоду",
+          "description": [
+            "<span class='text-info'>Задание:</span> Создайте <a href='https://codepen.io' target='_blank'>CodePen.io</a> который успешно копирует вот этот: <a href='https://codepen.io/freeCodeCamp/full/bELRjV' target='_blank'>https://codepen.io/freeCodeCamp/full/bELRjV</a>.",
+            "<span class='text-info'>Правило #1:</span> Не подсматривайте код приведенного на CodePen примера. Напишите его самостоятельно.",
+            "<span class='text-info'>Правило #2:</span> Можете использовать любые библиотеки или API, которые потребуются.",
+            "<span class='text-info'>Правило #3:</span> Воссоздайте функционал приведенного примера и не стесняйтесь добавить что-нибудь от себя.",
+            "Реализуйте следующие <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>пользовательские истории</a>, сделайте также бонусные по желанию:",
+            "<span class='text-info'>Пользовательская история:</span> В качестве пользователя, я могу узнать погоду с учетом моего текущего местоположения.",
+            "<span class='text-info'>Бонусная пользовательская история:</span> В качестве пользователя, я могу в зависимости от погоды видеть различные температурные значки.",
+            "<span class='text-info'>Бонусная пользовательская история:</span> В качестве пользователя, я могу в зависимости от погоды видеть различные фоновые изображения (снежные горы, знойная пустыня).",
+            "<span class='text-info'>Бонусная пользовательская история:</span> В качестве пользователя, я могу нажать на кнопку чтобы переключится между градусами по Цельсию или по Фаренгейту.",
+            "Если что-то не получается, воспользуйтесь <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a>.",
+            "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen. Если вы программировали с кем-то в паре, также добавьте имя вашего напарника.",
+            "Если вы хотите получить немедленную оценку вашего проекта, нажмите эту кнопку и добавьте ссылку на ваш CodePen. В противном случае мы проверим его перед тем как вы приступите к проектам для некоммерческих организаций.<br><br><a class='btn btn-primary btn-block' href='https://twitter.com/intent/tweet?text=Check%20out%20the%20project%20I%20just%20built%20with%20%40FreeCodeCamp:%20%0A%20%23LearnToCode%20%23JavaScript' target='_blank'>Click here then add your link to your tweet's text</a>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eddfaeb5bd19",
+      "title": "Build a Wikipedia Viewer",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/wGqEga/' target='_blank'>https://codepen.io/freeCodeCamp/full/wGqEga/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can search Wikipedia entries in a search box and see the resulting Wikipedia entries.",
+        "<strong>User Story:</strong> I can click a button to see a random Wikipedia entry.",
+        "<span class='text-info'>Hint #1:</span> Here's a URL you can use to get a random Wikipedia article: <code>https://en.wikipedia.org/wiki/Special:Random</code>.",
+        "<span class='text-info'>Hint #2:</span> Here's an entry on using Wikipedia's API: <code>https://www.mediawiki.org/wiki/API:Main_page</code>.",
+        "<span class='text-info'>Hint #3:</span> Use this <a href='https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm' target='_blank'>link</a> to experiment with Wikipedia's API.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "wJhcPwVYA1g"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": false,
+      "translations": {
+        "es": {
+          "title": "Crea un buscador de Wikipedia",
+          "description": [
+            "<span class='text-info'>Objetivo:</span> Crea una aplicación con <a href='https://codepen.io' target='_blank'>CodePen.io</a> cuya funcionalidad sea similar a la de esta: <a href='https://codepen.io/freeCodeCamp/full/wGqEga/' target='_blank'>https://codepen.io/freeCodeCamp/full/wGqEga/</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o APIs que necesites. Dale tu estilo personal.",
+            "<span class='text-info'>Historia de usuario:</span> Pedo obtener información acerca del clima en mi localización actual.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo ver un icono diferente o una imagen de fondo diferente (e.g. montaña con nieve, desierto caliente) dependiendo del clima.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo pulsar un botón para cambiar la unidad de temperatura de grados Fahrenheit a Celsius y viceversa.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo buscar entradas en Wikipedia en un cuadro de búsqueda y ver las entradas de Wikipedia resultantes.",
+            "<span class='text-info'>Historia de usuario:</span>Puedo pulsar un botón para ver un artículo aleatorio de Wikipedia.",
+            "<span class='text-info'>Pista 1:</span> Aquí está una URL donde puedes ver una entrada aleatoria de Wikipedia: <code>https://en.wikipedia.org/wiki/Special:Random<</code>.",
+            "<span class='text-info'>Pista 2:</span> Este es un artículo muy útil relativo al uso del API de Wikipedia: <code>https://www.mediawiki.org/wiki/API:Main_page</code>.",
+            "<span class='text-info'>Pista 3:</span> Usa este <a href='https://en.wikipedia.org/wiki/Special:ApiSandbox#action=query&titles=Main%20Page&prop=revisions&rvprop=content&format=jsonfm' target='_blank'>enlace</a> para experimentar con el API de Wikipedia.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Sala de chat para revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eddfaeb5bd1f",
+      "title": "Use the Twitch.tv JSON API",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/Myvqmo/' target='_blank'>https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can see whether freeCodeCamp is currently streaming on Twitch.tv.",
+        "<strong>User Story:</strong> I can click the status output and be sent directly to the freeCodeCamp's Twitch.tv channel.",
+        "<strong>User Story:</strong> if a Twitch user is currently streaming, I can see additional details about what they are streaming.",
+        "<strong>Hint:</strong> See an example call to Twitch.tv's JSONP API at <a href='http://forum.freeCodeCamp.com/t/use-the-twitchtv-json-api/19541' target='_blank'>http://forum.freeCodeCamp.com/t/use-the-twitchtv-json-api/19541</a>.",
+        "<strong>Hint:</strong> The relevant documentation about this API call is here: <a href='https://dev.twitch.tv/docs/v5/reference/streams/#get-stream-by-user' target='_blank'>https://dev.twitch.tv/docs/v5/reference/streams/#get-stream-by-user</a>.",
+        "<strong>Hint:</strong> Here's an array of the Twitch.tv usernames of people who regularly stream: <code>[\"ESL_SC2\", \"OgamingSC2\", \"cretetion\", \"freecodecamp\", \"storbeck\", \"habathcx\", \"RobotCaleb\", \"noobs2ninjas\"]</code>",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "6WrbY1d-IHI"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": false,
+      "translations": {
+        "es": {
+          "title": "Usa el API JSON de Twitch.tv",
+          "description": [
+            "<span class='text-info'>Objetivo:</span> Crea una aplicación con <a href='https://codepen.io' target='_blank'>CodePen.io</a> cuya funcionalidad sea similar a la de esta: <a href='https://codepen.io/freeCodeCamp/full/Myvqmo/' target='_blank'>https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o APIs que necesites. Dale tu estilo personal.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo verificar si freeCodeCamp está transmitiendo actualmente en Twitch.tv",
+            "<span class='text-info'>Historia de usuario:</span> Puedo pulsar el estatus y ser enviado directamente al canal de freeCodeCamp en Twitch.tv.",
+            "<span class='text-info'>Historia de usuario:</span> Si un usuario Twitch está transmitiendo actualmente, puedo ver detalles adicionales acerca del contenido que están transmitiendo.",
+            "<span class='text-info'>Pista:</span> Obseva una llamada de ejemplo al API JSONP de Twitch.tv en <code>http://forum.freeCodeCamp.com/t/use-the-twitchtv-json-api/19541</code>.",
+            "<span class='text-info'>Pista:</span> La documentación relevante sobre esta llamada al API está aquí: <a href='https://github.com/justintv/Twitch-API/blob/master/v3_resources/streams.md#get-streamschannel' target='_blank'>https://github.com/justintv/Twitch-API/blob/master/v3_resources/streams.md#get-streamschannel</a>.",
+            "<span class='text-info'>Pista:</span> Aquí está un vector de usuarios en Twitch.tv que regularmente transmiten sobre programación: <code>[\"ESL_SC2\", \"OgamingSC2\", \"cretetion\", \"freecodecamp\", \"storbeck\", \"habathcx\", \"RobotCaleb\", \"noobs2ninjas\"]</code>",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Sala de chat para revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        },
+        "ru": {
+          "title": "Используйте Twitch.tv JSON API",
+          "description": [
+            "<span class='text-info'>Задание:</span> Создайте <a href='https://codepen.io' target='_blank'>CodePen.io</a> который успешно копирует вот этот: <a href='https://codepen.io/freeCodeCamp/full/Myvqmo/' target='_blank'>https://codepen.io/freeCodeCamp/full/Myvqmo/</a>.",
+            "<span class='text-info'>Правило #1:</span> Не подсматривайте код приведенного на CodePen примера. Напишите его самостоятельно.",
+            "<span class='text-info'>Правило #2:</span> Можете использовать любые библиотеки или API, которые потребуются.",
+            "<span class='text-info'>Правило #3:</span> Воссоздайте функционал приведенного примера и не стесняйтесь добавить что-нибудь от себя.",
+            "Реализуйте следующие <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>пользовательские истории</a>, сделайте также бонусные по желанию:",
+            "<span class='text-info'>Пользовательская история:</span> В качестве пользователя, я могу увидеть идет ли в данный момент на Twitch.tv трансляция freeCodeCamp.",
+            "<span class='text-info'>Пользовательская история:</span> В качестве пользователя, я могу, кликнув на описание трансляции, перейти на канал freeCodeCamp.",
+            "<span class='text-info'>Пользовательская история:</span> В качестве пользователя, я могу видеть дополнительную информацию о текущей трансляции freeCodeCamp.",
+            "<span class='text-info'>Бонусная пользовательская история:</span> В качестве пользователя, я могу произвести поиск среди перечисленных каналов.",
+            "<span class='text-info'>Подсказка:</span> Пример запроса к Twitch.tv JSON API: <code>https://api.twitch.tv/kraken/streams/freecodecamp</code>.",
+            "<span class='text-info'>Подсказка:</span> Документацию об этом запросе можно найти по ссылке: <a href='https://github.com/justintv/Twitch-API/blob/master/v3_resources/streams.md#get-streamschannel' target='_blank'>https://github.com/justintv/Twitch-API/blob/master/v3_resources/streams.md#get-streamschannel</a>.",
+            "<span class='text-info'>Подсказка:</span> В этом массиве приведены имена пользователей, которые регулярно пишут код онлайн: <code>[\"ESL_SC2\", \"OgamingSC2\", \"cretetion\", \"freecodecamp\", \"storbeck\", \"habathcx\", \"RobotCaleb\", \"noobs2ninjas\"]</code>",
+            "Если что-то не получается, воспользуйтесь <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a>.",
+            "Когда выполните задание кликните кнопку \"I've completed this challenge\" и добавьте ссылку на ваш CodePen. Если вы программировали с кем-то в паре, также добавьте имя вашего напарника.",
+            "Если вы хотите получить немедленную оценку вашего проекта, нажмите эту кнопку и добавьте ссылку на ваш CodePen. В противном случае мы проверим его перед тем как вы приступите к проектам для некоммерческих организаций.<br><br><a class='btn btn-primary btn-block' href='https://twitter.com/intent/tweet?text=Check%20out%20the%20project%20I%20just%20built%20with%20%40FreeCodeCamp:%20%0A%20%23LearnToCode%20%23JavaScript' target='_blank'>Click here then add your link to your tweet's text</a>"
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eedfaeb5bd1c",
+      "title": "Build a Tic Tac Toe Game",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/KzXQgy/' target='_blank'>https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can play a game of Tic Tac Toe with the computer.",
+        "<strong>User Story:</strong> My game will reset as soon as it's over so I can play again.",
+        "<strong>User Story:</strong> I can choose whether I want to play as X or O.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "Ia69O1ZNGEg"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": false,
+      "translations": {
+        "es": {
+          "title": "Crea un juego de Tic Tac Toe",
+          "description": [
+            "<span class='text-info'>Objetivo:</span> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> cuya funcionalidad sea similar a la de esta: <a href='https://codepen.io/freeCodeCamp/full/KzXQgy/' target='_blank'>https://codepen.io/freeCodeCamp/full/KzXQgy/</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o APIs que necesites. Dale tu estilo personal.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo jugar un juego de Tic Tac Toe contra el computador.",
+            "<span class='text-info'>Historia de usuario:</span> Mi juego se reiniciará tan pronto como termine para poder jugar de nuevo.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo elegir si quiero jugar como X o como O.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Sala de chat para revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c442eddfaeb5bd1c",
+      "title": "Build a Simon Game",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/Em-Ant/full/QbRyqq/' target='_blank'>https://codepen.io/freeCodeCamp/full/obYBjE</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I am presented with a random series of button presses.",
+        "<strong>User Story:</strong> Each time I input a series of button presses correctly, I see the same series of button presses but with an additional step.",
+        "<strong>User Story:</strong> I hear a sound that corresponds to each button both when the series of button presses plays, and when I personally press a button.",
+        "<strong>User Story:</strong> If I press the wrong button, I am notified that I have done so, and that series of button presses starts again to remind me of the pattern so I can try again.",
+        "<strong>User Story:</strong> I can see how many steps are in the current series of button presses.",
+        "<strong>User Story:</strong> If I want to restart, I can hit a button to do so, and the game will return to a single step.",
+        "<strong>User Story:</strong> 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.",
+        "<strong>User Story:</strong> I can win the game by getting a series of 20 steps correct. I am notified of my victory, then the game starts over.",
+        "<strong>Hint:</strong> Here are mp3s you can use for each button: <code>https://s3.amazonaws.com/freecodecamp/simonSound1.mp3</code>, <code>https://s3.amazonaws.com/freecodecamp/simonSound2.mp3</code>, <code>https://s3.amazonaws.com/freecodecamp/simonSound3.mp3</code>, <code>https://s3.amazonaws.com/freecodecamp/simonSound4.mp3</code>.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "tAPut8a47bA"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": false,
+      "translations": {
+        "es": {
+          "title": "Construye un juego de Simon",
+          "description": [
+            "<span class='text-info'>Objetivo:</span> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> cuya funcionalidad sea similar a la de esta: <a href='https://codepen.io/Em-Ant/full/QbRyqq/' target='_blank'>https://codepen.io/Em-Ant/full/QbRyqq/</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o APIs que necesites. Dale tu estilo personal.",
+            "<span class='text-info'>Historia de usuario:</span> Se me presenta una serie aleatoria de pulsaciones a botones.",
+            "<span class='text-info'>Historia de usuario:</span> Cada vez que presiono una secuencia de pulsaciones correctamente, veo que vuelve a ejecutarse la misma serie de pulsaciones con un paso adicional.",
+            "<span class='text-info'>Historia de usuario:</span> Escucho un sonido que corresponde a cada botón cuando se ejecuta una secuencia de pulsaciones, así como cuando yo presiono un botón.",
+            "<span class='text-info'>Historia de usuario:</span> Si presiono el botón equivocado, se me notifica sobre mi error, y se ejecuta de nuevo la serie correcta de pulsaciones para recordarme cuál es la secuencia correcta, tras lo cual puedo intentar de nuevo.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo ver cuántos pasos hay en la serie de pulsaciones actual.",
+            "<span class='text-info'>Historia de usuario:</span> Si deseo reiniciar, puedo pulsar un botón para hacerlo, y el juego comenzará desde una secuencia con un solo paso.",
+            "<span class='text-info'>Historia de usuario:</span> 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.",
+            "<span class='text-info'>Historia de usuario:</span> Puedo ganar el juego si completo 20 pasos correctos. Se me notifica sobre mi victoria, tras lo cual el juego se reinicia.",
+            "<span class='text-info'>Pista:</span> Aquí hay algunos mp3s que puedes utilizar para tus botones: <code>https://s3.amazonaws.com/freecodecamp/simonSound1.mp3</code>, <code>https://s3.amazonaws.com/freecodecamp/simonSound2.mp3</code>, <code>https://s3.amazonaws.com/freecodecamp/simonSound3.mp3</code>, <code>https://s3.amazonaws.com/freecodecamp/simonSound4.mp3</code>.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Leer-Buscar-Preguntar</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Sala de chat para revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7156d8c242eddfaeb5bd13",
+      "title": "Build a Camper Leaderboard",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/eZGMjp/' target='_blank'>https://codepen.io/freeCodeCamp/full/eZGMjp/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can see a table of the freeCodeCamp campers who've earned the most brownie points in the past 30 days.",
+        "<strong>User Story:</strong> I can see how many brownie points they've earned in the past 30 days, and how many they've earned total.",
+        "<strong>User Story:</strong> 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.",
+        "<strong>Hint:</strong> To get the top 100 campers for the last 30 days: <a href='https://fcctop100.herokuapp.com/api/fccusers/top/recent' target='_blank'>https://fcctop100.herokuapp.com/api/fccusers/top/recent</a>.",
+        "<strong>Hint:</strong> To get the top 100 campers of all time: <a href='https://fcctop100.herokuapp.com/api/fccusers/top/alltime' target='_blank'>https://fcctop100.herokuapp.com/api/fccusers/top/alltime</a>.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "LJQcFNo_-QY"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": false,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Crea un marcador para los campistas",
+          "description": [
+            "<strong>Objetivo:</strong> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> que funcione de forma similar al siguiente ejemplo: <a href='https://codepen.io/freeCodeCamp/full/eZGMjp/' target='_blank'>https://codepen.io/freeCodeCamp/full/eZGMjp/</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o API que sea necesaria. ¡Ponle un toque personal!.",
+            "<strong>Historia de usuario:</strong> Puedo ver un tablero con los campistas de freeCodeCamp que han ganado más puntos de brownie en los últimos 30 días.",
+            "<strong>Historia de usuario:</strong> Puedo ver cuántos puntos de brownie han ganado en los últimos 30 días, y cuántos han ganado en total.",
+            "<strong>Historia de usuario:</strong> 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.",
+            "<strong>Pista:</strong> Para obtener los 100 mejores campistas para los últimos 30 días: <a href='https://fcctop100.herokuapp.com/api/fccusers/top/recent' target='_blank'>https://fcctop100.herokuapp.com/api/fccusers/top/recent</a>.",
+            "<strong>Pista:</strong> Para obtener los 100 mejores campistas de toda la historia: <a href='http://fcctop100.herokuapp.com/api/fccusers/top/alltime' target='_blank'>http://fcctop100.herokuapp.com/api/fccusers/top/alltime</a>.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        },
+        "ru": {
+          "title": "Создайте таблицу Кемперов-Лидеров",
+          "description": [
+            "<strong>Задание:</strong> Создайте приложение <a href='https://codepen.io' target='_blank'>CodePen.io</a>, функционал которого схож с этим: <a href='https://codepen.io/freeCodeCamp/full/eZGMjp/' target='_blank'>https://codepen.io/freeCodeCamp/full/eZGMjp/</a>.",
+            "Приложение должно удовлетворять нижеприведённым <a href='https://ru.wikipedia.org/wiki/Пользовательские_истории' target='_blank'>пользовательским историям</a>. Используйте любые библиотеки или API, которые потребуются. Придайте ему свой личный стиль.",
+            "<strong>Пользовательская история:</strong> Я могу видеть таблицу кемперов freeCodeCamp, которые получили наибольшее количество очков за последние 30 дней.",
+            "<strong>Пользовательская история:</strong> Я могу видеть сколько очков они получили за последние 30 дней, и сколько они получили их всего.",
+            "<strong>Пользовательская история:</strong> Я могу отсортировать список по количеству очков, которые они получили за последние 30 дней, и по общему количеству полученных очков.",
+            "<strong>Подсказка:</strong> Ссылка на топ 100 кемперов за последние 30 дней в формате JSON: <a href='https://fcctop100.herokuapp.com/api/fccusers/top/recent' target='_blank'>https://fcctop100.herokuapp.com/api/fccusers/top/recent</a>.",
+            "<strong>Подсказка:</strong> Ссылка на топ 100 кемперов за все время в формате JSON: <a href='http://fcctop100.herokuapp.com/api/fccusers/top/alltime' target='_blank'>http://fcctop100.herokuapp.com/api/fccusers/top/alltime</a>.",
+            "Если что-то не получается, не забывайте пользоваться методом <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Читай-Ищи-Спрашивай</a>.",
+            "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.",
+            "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем <a href='//gitter.im/freecodecamp/codereview' target='_blank'>чате для рассмотрения кода</a>. Также вы можете поделиться ею через Twitter и на странице freeCodeCamp вашего города на Facebook."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7155d8c242eddfaeb5bd13",
+      "title": "Build a Recipe Box",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/dNVazZ/' target='_blank'>https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can create recipes that have names and ingredients.",
+        "<strong>User Story:</strong> I can see an index view where the names of all the recipes are visible.",
+        "<strong>User Story:</strong> I can click into any of those recipes to view it.",
+        "<strong>User Story:</strong> I can edit these recipes.",
+        "<strong>User Story:</strong> I can delete these recipes.",
+        "<strong>User Story:</strong> All new recipes I add are saved in my browser's local storage. If I refresh the page, these recipes will still be there.",
+        "<strong>Hint: </strong> You should prefix your local storage keys on CodePen, i.e. <code>_username_recipes</code>",
+        "Remember to use <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/FreeCodeCamp-Get-Help' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "6tZ4c-Bxstg"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": false,
+      "challengeType": 3,
+      "titleRu": "Создайте хранилище рецептов",
+      "descriptionRu": [
+        "<strong>Задание:</strong> Создайте приложение <a href='https://codepen.io' target='_blank'>CodePen.io</a>, функционал которого схож с этим: <a href='https://codepen.io/freeCodeCamp/full/dNVazZ/' target='_blank'>https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.",
+        "<strong>Правило #1:</strong> Не подсматривайте код приложения-примера. Напишите его самостоятельно.",
+        "<strong>Правило #2:</strong> Приложение должно удовлетворять нижеприведённым <a href='https://ru.wikipedia.org/wiki/Пользовательские_истории' target='_blank'>пользовательским историям</a>. Используйте любые библиотеки или API, которые потребуются. Придайте ему свой личный стиль.",
+        "<strong>Правило #3:</strong> Для создания этого проекта вы должны использовать Sass и React.",
+        "<strong>Пользовательская история:</strong> Я могу создавать рецепты, содержащие название и ингредиенты.",
+        "<strong>Пользовательская история:</strong> Я могу просмотреть корневой вид, на котором видны все рецепты.",
+        "<strong>Пользовательская история:</strong> Я могу нажать на имя каждого из рецептов для просмотра содержимого.",
+        "<strong>Пользовательская история:</strong> Я могу отредактировать эти рецепты.",
+        "<strong>Пользовательская история:</strong> Я могу удалить эти рецепты.",
+        "<strong>Пользовательская история:</strong> Все новые рецепты, которые я добавил, сохранены в локальном хранилище моего браузера. Если я обновлю страницу, эти рецепты будут всё ещё там.",
+        "Если что-то не получается, не забывайте пользоваться методом <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/FreeCodeCamp-Get-Help' target='_blank'>Читай-Ищи-Спрашивай</a>.",
+        "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.",
+        "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем <a href='//gitter.im/freecodecamp/codereview' target='_blank'>чате для рассмотрения кода</a>. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook."
+      ],
+      "titleEs": "Crea una caja de recetas",
+      "descriptionEs": [
+        "<strong>Objetivo:</strong> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> que funcione de forma similar al siguiente ejemplo: <a href='https://codepen.io/freeCodeCamp/full/dNVazZ/' target='_blank'>https://codepen.io/freeCodeCamp/full/dNVazZ/</a>.",
+        "<strong>Regla #1:</strong> No veas el código del proyecto de ejemplo. Encuentra la forma de hacerlo por tu cuenta.",
+        "<strong>Regla #2:</strong> Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o API que sea necesaria. ¡Ponle un toque personal!.",
+        "<strong>Rule #3:</strong> Debes utilizar ambos Sass y React para construir este proyecto.",
+        "<strong>Historia de usuario:</strong> Puedo crear recetas a las que les puedo poner un nombre y los ingredientes necesarios.",
+        "<strong>Historia de usuario:</strong> Puedo ver un índice que contenga los nombres de todas las recetas.",
+        "<strong>Historia de usuario:</strong> Puedo pulsar cualquiera de las recetas para verla.",
+        "<strong>Historia de usuario:</strong> Puedo editar las recetas.",
+        "<strong>Historia de usuario:</strong> Puedo eliminar las recetas.",
+        "<strong>Historia de usuario:</strong> 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 <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/FreeCodeCamp-Get-Help' target='_blank'>Read-Search-Ask</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+      ]
+    },
+    {
+      "id": "bd7154d8c242eddfaeb5bd13",
+      "title": "Build the Game of Life",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/BpwMZv/' target='_blank'>https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> When I first arrive at the game, it will randomly generate a board and start playing.",
+        "<strong>User Story:</strong> I can start and stop the board.",
+        "<strong>User Story:</strong> I can set up the board.",
+        "<strong>User Story:</strong> I can clear the board.",
+        "<strong>User Story:</strong> When I press start, the game will play out.",
+        "<strong>User Story:</strong> Each time the board changes, I can see how many generations have gone by.",
+        "<strong>Hint:</strong> Here's an explanation of Conway's Game of Life from John Conway himself: <a href='https://www.youtube.com/watch?v=E8kUJL04ELA' target='_blank'>https://www.youtube.com/watch?v=E8kUJL04ELA</a>",
+        "<strong>Hint:</strong> Here's an overview of Conway's Game of Life with rules for your reference: <a href='https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life' target='_blank'>https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life</a>",
+        "Remember to use <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/FreeCodeCamp-Get-Help' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "5Ajcjs3OmjA"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": false,
+      "challengeType": 3,
+      "titleRu": "Создайте игру \"Жизнь\"",
+      "descriptionRu": [
+        "<strong>Задание:</strong> Создайте приложение <a href='https://codepen.io' target='_blank'>CodePen.io</a>, функционал которого схож с этим: <a href='https://codepen.io/freeCodeCamp/full/BpwMZv/' target='_blank'>https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.",
+        "<strong>Правило #1:</strong> Не подсматривайте код приложения-примера. Напишите его самостоятельно.",
+        "<strong>Правило #2:</strong> Приложение должно удовлетворять нижеприведённым <a href='https://ru.wikipedia.org/wiki/Пользовательские_истории' target='_blank'>пользовательским историям</a>. Используйте любые библиотеки или API, которые потребуются. Придайте ему свой личный стиль.",
+        "<strong>Правило #3:</strong> Для создания этого проекта вы должны использовать Sass и React.",
+        "<strong>Пользовательская история:</strong> Когда я впервые запускаю игру, она генерирует доску случайным образом и начинает игру.",
+        "<strong>Пользовательская история:</strong> Я могу запустить и остановить игру.",
+        "<strong>Пользовательская история:</strong> Я могу настроить доску.",
+        "<strong>Пользовательская история:</strong> Я могу очистить доску.",
+        "<strong>Пользовательская история:</strong> Когда я нажимаю начать, игра начинает воспроизведение.",
+        "<strong>Пользовательская история:</strong> Каждый раз, когда доска меняется, я могу видеть сколько поколений прошло.",
+        "<strong>Подсказка:</strong> Вот объяснение игры \"Жизнь\" от её создателя Джона Конвея: <a href='https://www.youtube.com/watch?v=E8kUJL04ELA' target='_blank'>https://www.youtube.com/watch?v=E8kUJL04ELA</a>",
+        "<strong>Подсказка:</strong> Вот обзор правил игры \"Жизнь\" для вашего сведения: <a href='https://ru.wikipedia.org/wiki/Жизнь_(игра)' target='_blank'>https://ru.wikipedia.org/wiki/Жизнь_(игра)</a>",
+        "Если что-то не получается, не забывайте пользоваться методом <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/FreeCodeCamp-Get-Help' target='_blank'>Читай-Ищи-Спрашивай</a>.",
+        "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.",
+        "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем <a href='//gitter.im/freecodecamp/codereview' target='_blank'>чате для рассмотрения кода</a>. Также вы можете поделиться ею через Twitter и на странице Free Code Camp вашего города на Facebook."
+      ],
+      "titleEs": "Crea un Juego de la vida",
+      "descriptionEs": [
+        "<strong>Objetivo:</strong> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> que funcione de forma similar al siguiente ejemplo: <a href='https://codepen.io/freeCodeCamp/full/BpwMZv/' target='_blank'>https://codepen.io/freeCodeCamp/full/BpwMZv/</a>.",
+        "<strong>Regla #1:</strong> No veas el código del proyecto de ejemplo. Encuentra la forma de hacerlo por tu cuenta.",
+        "<strong>Regla #2:</strong> Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o API que sea necesaria. ¡Ponle un toque personal!.",
+        "<strong>Rule #3:</strong> Debes utilizar ambos Sass y React para construir este proyecto.",
+        "<strong>Historia de usuario:</strong> La aplicación debe generar aleatoriamente un tablero y comenzar a jugar cuando entro al juego por primera vez.",
+        "<strong>Historia de usuario:</strong> Puedo iniciar y detener el tablero.",
+        "<strong>Historia de usuario:</strong> Puedo preparar el tablero.",
+        "<strong>Historia de usuario:</strong> Puedo limpiar el tablero.",
+        "<strong>Historia de usuario:</strong> El juego inicia cuando presiono un botón de inicio.",
+        "<strong>Historia de usuario:</strong> Puedo ver cuántas generaciones han pasado cada vez que el tablero cambia.",
+        "<strong>Pista:</strong> Puedes encontrar una explicación del Juego de la vida de Conway de parte del mismísimo John Conway aquí: <a href='https://www.youtube.com/watch?v=E8kUJL04ELA' target='_blank'>https://www.youtube.com/watch?v=E8kUJL04ELA</a>",
+        "<strong>Pista:</strong> Puedes referirte al siguiente enlace para obtener información general acerca del Juego de la vida de Conway incluyendo las reglas del juego: <a href='https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life' target='_blank'>https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life</a>",
+        "Recuerda utilizar <a href='//github.com/FreeCodeCamp/freecodecamp/wiki/FreeCodeCamp-Get-Help' target='_blank'>Read-Search-Ask</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+      ]
+    },
+    {
+      "id": "bd7153d8c242eddfaeb5bd13",
+      "title": "Build a Roguelike Dungeon Crawler Game",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/apLXEJ/' target='_blank'>https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I have health, a level, and a weapon. I can pick up a better weapon. I can pick up health items.",
+        "<strong>User Story:</strong> All the items and enemies on the map are arranged at random.",
+        "<strong>User Story:</strong> I can move throughout a map, discovering items.",
+        "<strong>User Story:</strong> I can move anywhere within the map's boundaries, but I can't move through an enemy until I've beaten it.",
+        "<strong>User Story:</strong> Much of the map is hidden. When I take a step, all spaces that are within a certain number of spaces from me are revealed.",
+        "<strong>User Story:</strong> When I beat an enemy, the enemy goes away and I get XP, which eventually increases my level.",
+        "<strong>User Story:</strong> 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.",
+        "<strong>User Story:</strong> When I find and beat the boss, I win.",
+        "<strong>User Story:</strong> The game should be challenging, but theoretically winnable.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "releasedOn": "January 1, 2016",
+      "challengeSeed": [
+        "BwyKI9iePUQ"
+      ],
+      "tests": [],
+      "type": "zipline",
+      "isRequired": false,
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Crea un juego de dragones al estilo Rogue",
+          "description": [
+            "<strong>Objetivo:</strong> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> que funcione de forma similar al siguiente ejemplo: <a href='https://codepen.io/freeCodeCamp/full/apLXEJ/' target='_blank'>https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.",
+            "Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o API que sea necesaria. ¡Ponle un toque personal!.",
+            "<strong>Historia de usuario:</strong> Tengo energía, nivel de habilidad y un arma. Puedo recoger un arma mejor. Puedo recoger ítems que recuperan mi energía.",
+            "<strong>Historia de usuario:</strong> Todos los ítems y los enemigos en el mapa están colocados aleatoriamente.",
+            "<strong>Historia de usuario:</strong> Puedo moverme a lo largo de un mapa y descubrir ítems.",
+            "<strong>Historia de usuario:</strong> Puedo moverme hacia cualquier parte dentro de los límites del mapa, pero no puedo moverme sobre un enemigo hasta que lo haya vencido.",
+            "<strong>Historia de usuario:</strong> Gran parte del mapa está escondido. Cuando doy un paso, todos los espacios que están a cierto número de espacios de distancia de mi son revelados.",
+            "<strong>Historia de usuario:</strong> Cuando venzo un enemigo, este desaparece y yo gano puntos de experiencia (XP), lo que eventualmente me permite aumentar de nivel.",
+            "<strong>Historia de usuario:</strong> 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.",
+            "<strong>Historia de usuario:</strong> Gano el juego cuando encuentre y venza al jefe.",
+            "<strong>Historia de usuario:</strong> El juego debe representar un reto, pero ganar debe ser teóricamente posible.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        },
+        "ru": {
+          "title": "Создайте Roguelike-подобную игру Подземелье",
+          "description": [
+            "<strong>Задание:</strong> Создайте приложение <a href='https://codepen.io' target='_blank'>CodePen.io</a>, функционал которого схож с этим: <a href='https://codepen.io/freeCodeCamp/full/apLXEJ/' target='_blank'>https://codepen.io/freeCodeCamp/full/apLXEJ/</a>.",
+            "Приложение должно удовлетворять нижеприведённым <a href='https://ru.wikipedia.org/wiki/Пользовательские_истории' target='_blank'>пользовательским историям</a>. Используйте любые библиотеки или API, которые потребуются. Придайте ему свой личный стиль.",
+            "<strong>Пользовательская история:</strong> У меня есть жизни, уровень и оружие. Я могу подобрать оружие получше. Я могу подобрать очки здоровья.",
+            "<strong>Пользовательская история:</strong> Все предметы и враги располагаются на карте случайным образом.",
+            "<strong>Пользовательская история:</strong> Я могу передвигаться по карте, обнаруживая новые предметы.",
+            "<strong>Пользовательская история:</strong> Я могу двигаться куда угодно в рамках карты, но не могу продвинуться дальше врага, пока он не будет побежден.",
+            "<strong>Пользовательская история:</strong> Большая часть карты скрыта. Когда я делаю шаг, все клетки в определенном количестве клеток от меня становятся видимы.",
+            "<strong>Пользовательская история:</strong> Когда я побеждаю врага, враг исчезает, а я получаю очки опыта (XP), что увеличивает мой уровень.",
+            "<strong>Пользовательская история:</strong> Когда я веду бой с врагом, мы поочередно наносим друг-другу повреждения, до тех пор пока кто-нибудь не победит. Я наношу повреждения, которые зависят от моего уровня и моего оружия. Враг наносит повреждения, которые зависят от его уровня. Значение повреждений распределено случайным образом в некотором диапазоне.",
+            "<strong>Пользовательская история:</strong> Когад я нахожу и побеждаю босса, я выигрываю игру.",
+            "<strong>Пользовательская история:</strong> Игра должна быть интересной и достаточно сложной, но теоретически проходимой.",
+            "Если что-то не получается, не забывайте пользоваться методом <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Читай-Ищи-Спрашивай</a>.",
+            "Когда закончите, нажмите кнопку \"I've completed this challenge\" и укажите ссылку на вашу работу на CodePen.",
+            "Вы можете получить отзыв о вашем проекте от коллег, поделившись ссылкой на него в нашем <a href='//gitter.im/freecodecamp/codereview' target='_blank'>чате для рассмотрения кода</a>. Также вы можете поделиться ею через Twitter и на странице freeCodeCamp вашего города на Facebook."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7150d8c442eddfafb5bd1c",
+      "title": "P2P Video Chat Application",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://glitch.com' target='_blank'>Glitch</a> app that is functionally similar to this: <a href='https://unequaled-cement.glitch.me' target='_blank'>https://unequaled-cement.glitch.me</a>.",
+        "Fulfill the below <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> Upon arriving, the browser will prompt me to access my camera and microphone. ",
+        "<strong>User Story:</strong> After I give it permission, I am prompted to type in a room name.",
+        "<strong>User Story:</strong> Once I type in the room name, a room will be created if no room of that name existed before. ",
+        "<strong>User Story:</strong> A friend of mine can subsequently go to the same website, type in the same room I entered, and join the same room, then enter into a video chat with me. ",
+        "<strong>User Story:</strong> If I type in a room name, and there are already two people in that room, I get a notification that the room is full. ",
+        "<strong>User Story:</strong> Anyone can create or join any room. And there can be any number of rooms, but all of them must have unique names. ",
+        "<strong>User Story:</strong> I can choose to not permit the site to access my microphone and webcam. If I choose not to do this, if some other driver problem occurs, I see an error message saying these are required. ",
+        "<strong>User Story:</strong> When I choose to cancel the room name input step, or if I type in no name, or just spaces, it should again ask me again to type in a valid room name. ",
+        "<strong>User Story:</strong> If one of the two people in the room get disconnected, they can reconnect to the same room and continue chatting.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> if you get stuck.",
+        "When you are finished, click the \"I've completed this challenge\" button and include a link to your Glitch App.",
+        "You can get feedback on your project by sharing it with your friends on Facebook."
+      ],
+      "challengeSeed": [],
+      "tests": [],
+      "type": "zipline",
+      "challengeType": 3,
+      "isRequired": false,
+      "releasedOn": "January 1, 2016"
+    },
+    {
+      "id": "bd7198d8c242eddfaeb5bd13",
+      "title": "Show National Contiguity with a Force Directed Graph",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/xVopBo' target='_blank'>https://codepen.io/freeCodeCamp/full/xVopBo</a>.",
+        "Fulfill the following <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can see a Force-directed Graph that shows which countries share borders.",
+        "<strong>User Story:</strong> I can see each country's flag on its node.",
+        "<strong>Hint:</strong> Here's a dataset you can use to build this: <a href='https://raw.githubusercontent.com/DealPete/forceDirected/master/countries.json' target='_blank'>https://raw.githubusercontent.com/DealPete/forceDirected/master/countries.json</a>",
+        "<strong>Hint:</strong> You can create a spritesheet of national flags at <a href='https://www.flag-sprites.com' target='_blank'>https://www.flag-sprites.com</a>.",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "etBaP3IdlIE"
+      ],
+      "tests": [],
+      "isRequired": false,
+      "releasedOn": "January 1, 2016",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Muestra asociaciones utilizando un gráfico de fuerzas dirigidas",
+          "description": [
+            "<strong>Objetivo:</strong> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> que funcione de forma similar al siguiente ejemplo: <a href='https://codepen.io/freeCodeCamp/full/KVNNXY' target='_blank'>https://codepen.io/freeCodeCamp/full/KVNNXY</a>.",
+            "<strong>Regla #1:</strong> No veas el código del proyecto de ejemplo. Encuentra la forma de hacerlo por tu cuenta.",
+            "<strong>Regla #2:</strong> Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o API que sea necesaria. ¡Ponle un toque personal!.",
+            "<strong>Regla #3:</strong> Debes utilizar D3.js para construir este proyecto.",
+            "<strong>Historia de usuario:</strong> Puedo ver un gráfico de fuerza dirigida que muestra qué campistas están publicando enlaces en Camper News hacia qué dominios.",
+            "<strong>Historia de usuario:</strong> Puedo ver el icono de cada campista en su nodo respectivo.",
+            "<strong>Historia de usuario:</strong> Puedo ver la relación entre los campistas y los dominios que publican.",
+            "<strong>Historia de usuario:</strong> Puedo conocer aproximadamente cuántas veces los campistas han enlazado un dominio en particular a partir del tamaño del nodo respectivo.",
+            "<strong>Historia de usuario:</strong> Puedo conocer aproximadamente cuántas veces un campista específico ha publicado un enlace a partir del tamaño de su nodo.",
+            "<strong>Pista:</strong> La siguiente es la ruta del API de noticias de Camper News: <code>http://www.freeCodeCamp.com/news/hot</code>.",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7108d8c242eddfaeb5bd13",
+      "title": "Map Data Across the Globe",
+      "description": [
+        "<strong>Objective:</strong> Build a <a href='https://codepen.io' target='_blank'>CodePen.io</a> app that is functionally similar to this: <a href='https://codepen.io/freeCodeCamp/full/mVEJag' target='_blank'>https://codepen.io/freeCodeCamp/full/mVEJag</a>.",
+        "Fulfill the following <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>user stories</a>. Use whichever libraries or APIs you need. Give it your own personal style.",
+        "<strong>User Story:</strong> I can see where all Meteorites landed on a world map.",
+        "<strong>User Story:</strong> I can tell the relative size of the meteorite, just by looking at the way it's represented on the map.",
+        "<strong>User Story:</strong> I can mouse over the meteorite's data point for additional data.",
+        "<strong>Hint:</strong> Here's a dataset you can use to build this: <a href='https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json' target='_blank'>https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json</a>",
+        "Remember to use <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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."
+      ],
+      "challengeSeed": [
+        "kSAqct10gA0"
+      ],
+      "tests": [],
+      "isRequired": false,
+      "releasedOn": "January 1, 2016",
+      "type": "zipline",
+      "challengeType": 3,
+      "translations": {
+        "es": {
+          "title": "Mapea datos a lo largo del Globo",
+          "description": [
+            "<strong>Objetivo:</strong> Construye una aplicación en <a href='https://codepen.io' target='_blank'>CodePen.io</a> que funcione de forma similar al siguiente ejemplo: <a href='https://codepen.io/freeCodeCamp/full/mVEJag' target='_blank'>https://codepen.io/freeCodeCamp/full/mVEJag</a>.",
+            "<strong>Regla #1:</strong> No veas el código del proyecto de ejemplo. Encuentra la forma de hacerlo por tu cuenta.",
+            "<strong>Regla #2:</strong> Satisface las siguientes <a href='https://en.wikipedia.org/wiki/User_story' target='_blank'>historias de usuario</a>. Usa cualquier librería o API que sea necesaria. ¡Ponle un toque personal!.",
+            "<strong>Regla #3:</strong> Debes utilizar D3.js para construir este proyecto.",
+            "<strong>Historia de usuario:</strong> Puedo ver a dónde cayeron todos los meteoritos en un mapa mundi.",
+            "<strong>Historia de usuario:</strong> Puedo distinguir el tamaño relativo de cada meteorito simplemente viendo la forma en que está representado en el mapa.",
+            "<strong>Historia de usuario:</strong> Puedo mover el ratón sobre el dato de cada meteorito para obtener información adicional.",
+            "<strong>Pista:</strong> Puedes utilizar el siguiente conjunto de datos para construir tu proyecto: <a href='https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json' target='_blank'>https://raw.githubusercontent.com/freeCodeCamp/ProjectReferenceData/master/meteorite-strike-data.json</a>",
+            "Recuerda utilizar <a href='http://forum.freeCodeCamp.com/t/how-to-get-help-when-you-are-stuck/19514' target='_blank'>Read-Search-Ask</a> 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 <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+          ]
+        }
+      }
+    },
+    {
+      "id": "bd7158d8c443eddfaeb5bd0f",
+      "title": "Manage a Book Trading Club",
+      "description": [
+        "<strong>Objective:</strong> Build a full stack JavaScript app that is functionally similar to this: <a href='http://bookjump.herokuapp.com/' target='_blank'>http://bookjump.herokuapp.com/</a> 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 <a href='/challenges/get-set-for-our-dynamic-web-application-projects'>https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects</a>.",
+        "Here are the specific user stories you should implement for this project:",
+        "<strong>User Story:</strong> I can view all books posted by every user.",
+        "<strong>User Story:</strong> I can add a new book.",
+        "<strong>User Story:</strong> I can update my settings to store my full name, city, and state.",
+        "<strong>User Story:</strong> I can propose a trade and wait for the other user to accept the trade.",
+        "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 Heroku.",
+        "You can get feedback on your project by sharing it with your friends on Facebook."
+      ],
+      "challengeSeed": [
+        "mzElFmbGqQI"
+      ],
+      "tests": [],
+      "type": "basejump",
+      "challengeType": 4,
+      "descriptionEs": [
+        "<strong>Objetivo:</strong> Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: <a href='http://bookjump.herokuapp.com/' target='_blank'>http://bookjump.herokuapp.com/</a> 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 <a href='/challenges/get-set-for-our-dynamic-web-application-projects'>https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects</a>.",
+        "Estas son las Historias de usuario que debes satisfacer para este Basejump:",
+        "<strong>Historia de usuario:</strong> Puedo ver todos los libros agregados por cada usuario.",
+        "<strong>Historia de usuario:</strong> Puedo agregar un nuevo libro.",
+        "<strong>Historia de usuario:</strong> Puedo actualizar mi configuración para que almacene mi nombre completo, ciudad y Estado.",
+        "<strong>Historia de usuario:</strong> Puedo proponer un intercambio y esperar a que algún otro usuario acepte el trato.",
+        "Una vez hayas terminado de implementar estas historias de usuario, pulsa el botón de \"I've completed this challenge\" e incluye las URLs de tu repositorio GitHub y de tu aplicación corriendo en Heroku.",
+        "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+      ],
+      "isRequired": false,
+      "titleEs": "Administra un club de intercambio de libros"
+    },
+    {
+      "id": "bd7158d8c443eddfaeb5bdee",
+      "title": "Build a Pinterest Clone",
+      "description": [
+        "<strong>Objective:</strong> Build a full stack JavaScript app that is functionally similar to this: <a href='https://midnight-dust.glitch.me' target='_blank'>https://midnight-dust.glitch.me</a> 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 <a href='/challenges/get-set-for-our-dynamic-web-application-projects'>https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects</a>.",
+        "Here are the specific user stories you should implement for this project:",
+        "<strong>User Story:</strong> As an unauthenticated user, I can login with Twitter.",
+        "<strong>User Story:</strong> As an authenticated user, I can link to images.",
+        "<strong>User Story:</strong> As an authenticated user, I can delete images that I've linked to.",
+        "<strong>User Story:</strong> As an authenticated user, I can see a Pinterest-style wall of all the images I've linked to.",
+        "<strong>User Story:</strong> As an unauthenticated user, I can browse other users' walls of images.",
+        "<strong>User Story:</strong> As an authenticated user, if I upload an image that is broken, it will be replaced by a placeholder image. (can use jQuery broken image detection)",
+        "<strong>Hint:</strong> <a href='http://masonry.desandro.com/' target='_blank'>Masonry.js</a> is a library that allows for Pinterest-style image grids.",
+        "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 Heroku.",
+        "You can get feedback on your project by sharing it with your friends on Facebook."
+      ],
+      "challengeSeed": [
+        "adrOtJCVP04"
+      ],
+      "tests": [],
+      "type": "basejump",
+      "challengeType": 4,
+      "descriptionEs": [
+        "<strong>Objetivo:</strong> Construye una aplicación de pila completa (full stack) en JavaScript que funcione de forma similar al siguiente proyecto: <a href='https://midnight-dust.glitch.me/' target='_blank'>https://midnight-dust.glitch.me/</a> 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 <a href='/challenges/get-set-for-our-dynamic-web-application-projects'>https://freecodecamp.com/challenges/get-set-for-our-dynamic-web-application-projects</a>.",
+        "Estas son las Historias de usuario que debes satisfacer para este Basejump:",
+        "<strong>Historia de usuario:</strong> Como usuario autenticado, puedo acceder a mi cuenta con Twitter.",
+        "<strong>Historia de usuario:</strong> Como usuario autenticado, puedo agregar enlaces a imágenes.",
+        "<strong>Historia de usuario:</strong> Como usuario autenticado, puedo elimiar imágenes que he agregado.",
+        "<strong>Historia de usuario:</strong> Como usuario autenticado, puedo ver un muro al estilo de Pinterest con todas las imágenes para las que he agregado un enlace.",
+        "<strong>Historia de usuario:</strong> Como usuario no autenticado, puedo navegar los muros de imágenes de otros usuarios.",
+        "<strong>Historia de usuario:</strong> Como usuario autenticado, si agrego una imagen corrupta, será reemplazada por una imagen predeterminada. (Puedes utilizar la detección de imágenes corruptas de jQuery)",
+        "<strong>Pista:</strong> <a href='http://masonry.desandro.com/' target='_blank'>Masonry.js</a> es una librería que permite crear cuadrículas de imágenes al estilo de Pinterest.",
+        "Una vez hayas terminado de implementar estas historias de usuario, pulsa el botón de \"I've completed this challenge\" e incluye las URLs de tu repositorio GitHub y de tu aplicación corriendo en Heroku.",
+        "Puedes obtener retroalimentación acerca de tu proyecto de parte de tus compañeros campistas compartiéndolo en nuestro <a href='//gitter.im/freecodecamp/codereview' target='_blank'>Cuarto de revisión de código</a>. También puedes compartirlo en Twitter y en el campamento de tu ciudad (en Facebook)."
+      ],
+      "isRequired": false,
+      "titleEs": "Crea un clon de Pinterest"
+    }
+  ]
+}
diff --git a/seed/math-challenges/30-arithmetic/adding-and-subtracting-decimals.json b/seed/math-challenges/30-arithmetic/adding-and-subtracting-decimals.json
new file mode 100644
index 0000000000..03b18eab33
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/adding-and-subtracting-decimals.json
@@ -0,0 +1,58 @@
+{
+  "name": "Add and Subtract Decimals",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b428",
+      "title": "Add and Subtract Decimal Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836409",
+      "title": "Mental Math to Add and Subtract Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836410",
+      "title": "Add and Subtract Decimals with Front-End Estimation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836411",
+      "title": "Round Decimals to Estimate Sums and Differences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/adding-and-subtracting-fractions.json b/seed/math-challenges/30-arithmetic/adding-and-subtracting-fractions.json
new file mode 100644
index 0000000000..e9b969bce1
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/adding-and-subtracting-fractions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Add and Subtract Fractions",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b421",
+      "title": "Add Fractions with Common Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836370",
+      "title": "Subtract Fractions with Common Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836371",
+      "title": "Add and Subtract with Common Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836372",
+      "title": "Add and Subtract Fractions with Common Denominators Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836373",
+      "title": "Add Fractions with Different Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836374",
+      "title": "Subtract Fractions with Different Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/adding-and-subtracting-mixed-numbers.json b/seed/math-challenges/30-arithmetic/adding-and-subtracting-mixed-numbers.json
new file mode 100644
index 0000000000..43af55ebd1
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/adding-and-subtracting-mixed-numbers.json
@@ -0,0 +1,71 @@
+{
+  "name": "Add and Subtract Mixed Numbers",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b422",
+      "title": "Add Mixed Numbers with Common Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836376",
+      "title": "Subtract Mixed Numbers with Common Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836377",
+      "title": "Subtract Mixed Numbers with Different Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836378",
+      "title": "Add and Subtract Three Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836379",
+      "title": "Add and Subtract Mixed Numbers Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/additon-and-subtraction.json b/seed/math-challenges/30-arithmetic/additon-and-subtraction.json
new file mode 100644
index 0000000000..c11c14e573
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/additon-and-subtraction.json
@@ -0,0 +1,45 @@
+{
+  "name": "Additon and Subtraction",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b411",
+      "title": "Add Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836306",
+      "title": "Subtract Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836307",
+      "title": "Estimate Whole Number Sums and Differences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/basic-decimals.json b/seed/math-challenges/30-arithmetic/basic-decimals.json
new file mode 100644
index 0000000000..65d24965db
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/basic-decimals.json
@@ -0,0 +1,71 @@
+{
+  "name": "Basic Decimals",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b425",
+      "title": "Place Value Charts and Decimals to Thousandths",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836398",
+      "title": "Equivalent Decimals Ending in Zero",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836399",
+      "title": "Decimals in Words",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836400",
+      "title": "Decimal Place Value",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836401",
+      "title": "Decimals in Expanded Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/basic-place-value.json b/seed/math-challenges/30-arithmetic/basic-place-value.json
new file mode 100644
index 0000000000..2e61774b0b
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/basic-place-value.json
@@ -0,0 +1,58 @@
+{
+  "name": "Basic Place Value",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac59836300",
+      "title": "Recognize Place Values to 10,000,000",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836301",
+      "title": "Greatest and Least Values of Given Digits to 10,000,000",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836303",
+      "title": "Higher Order Place Value and Number Placement Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836304",
+      "title": "Round Large Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/compare-decimals.json b/seed/math-challenges/30-arithmetic/compare-decimals.json
new file mode 100644
index 0000000000..65a4e00920
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/compare-decimals.json
@@ -0,0 +1,45 @@
+{
+  "name": "Compare Decimals",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b426",
+      "title": "Compare and Order Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836403",
+      "title": "Compare and Compose Decimals and Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836404",
+      "title": "Compare, Order and Identify Decimal Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/converting-decimals.json b/seed/math-challenges/30-arithmetic/converting-decimals.json
new file mode 100644
index 0000000000..0f0ceea0a8
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/converting-decimals.json
@@ -0,0 +1,71 @@
+{
+  "name": "Converting Decimals",
+  "order": 25,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b435",
+      "title": "Convert Decimals to Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836444",
+      "title": "Convert Decimals into Simplified Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836445",
+      "title": "Decimals as Percents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836446",
+      "title": "Compare and Order Fractions and Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836447",
+      "title": "Convert between Decimals, Fractions, and Percents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/converting-fractions.json b/seed/math-challenges/30-arithmetic/converting-fractions.json
new file mode 100644
index 0000000000..510e7b31f7
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/converting-fractions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Converting Fractions",
+  "order": 24,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b434",
+      "title": "Fraction and Decimal Conversion",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836438",
+      "title": "Convert Mixed Numbers to Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836439",
+      "title": "Compare Mixed Numbers and Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836440",
+      "title": "Convert Between Fractions or Mixed Numbers and Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836441",
+      "title": "Add Fractions and Convert to Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836442",
+      "title": "Fractions as Percents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/converting-percentages.json b/seed/math-challenges/30-arithmetic/converting-percentages.json
new file mode 100644
index 0000000000..9627d67d4c
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/converting-percentages.json
@@ -0,0 +1,32 @@
+{
+  "name": "Converting Percentages",
+  "order": 23,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b433",
+      "title": "Percents as Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836436",
+      "title": "Percents as Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/division.json b/seed/math-challenges/30-arithmetic/division.json
new file mode 100644
index 0000000000..f9ade81333
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/division.json
@@ -0,0 +1,71 @@
+{
+  "name": "Division",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b413",
+      "title": "Divide Two Digits by One or Two Digits Without Remainders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836319",
+      "title": "Higher Order Division to 1000 by One Digit",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836320",
+      "title": "Divide More than Two Digits by One Digit with Remainders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836321",
+      "title": "Relate Division to Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836322",
+      "title": "Estimate Whole Number Products and Quotients",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/exponents-and-roots.json b/seed/math-challenges/30-arithmetic/exponents-and-roots.json
new file mode 100644
index 0000000000..0e07676029
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/exponents-and-roots.json
@@ -0,0 +1,58 @@
+{
+  "name": "Exponents and Roots",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b417",
+      "title": "Exponents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836338",
+      "title": "Evaluate and Compare Powers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836339",
+      "title": "Perfect Square Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836340",
+      "title": "Evaluate Square Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/factors.json b/seed/math-challenges/30-arithmetic/factors.json
new file mode 100644
index 0000000000..4997ad02ab
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/factors.json
@@ -0,0 +1,97 @@
+{
+  "name": "Factors",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b418",
+      "title": "Prime and Composite Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836342",
+      "title": "Prime Factorization",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836343",
+      "title": "Identify Factor Pairs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836344",
+      "title": "Divisibility Rules to Find Factors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836345",
+      "title": "GCF Greatest Common Factor",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836346",
+      "title": "Common Multiples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836347",
+      "title": "LCM Least Common Multiple",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/fractions.json b/seed/math-challenges/30-arithmetic/fractions.json
new file mode 100644
index 0000000000..610fd11c9f
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/fractions.json
@@ -0,0 +1,136 @@
+{
+  "name": "Fractions",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b420",
+      "title": "Equivalent Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836360",
+      "title": "Simplify Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836361",
+      "title": "Simplify Fractions Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836362",
+      "title": "Compare Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836363",
+      "title": "Compare Fractions using Pictures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836364",
+      "title": "Compare Fractions that have Common Numerators or Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836365",
+      "title": "Compare Fractions without Common Numerators or Denominators",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836366",
+      "title": "Compare Fractions without Common Numerators or Denominators Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836367",
+      "title": "Estimate and Round Fractions and Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836368",
+      "title": "Convert and Compare Mixed Numbers and Improper Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/integer-operations.json b/seed/math-challenges/30-arithmetic/integer-operations.json
new file mode 100644
index 0000000000..4511b27cf6
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/integer-operations.json
@@ -0,0 +1,149 @@
+{
+  "name": "Integer Operations",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b419",
+      "title": "Integers in the Real World",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836349",
+      "title": "Integers on a Number Line",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836350",
+      "title": "Absolute Value of Integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836351",
+      "title": "Add Integers with the Same Signs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836352",
+      "title": "Add Integers with Different Signs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836353",
+      "title": "Integer Addition",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836354",
+      "title": "Subtract Integers with the Same Sign",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836355",
+      "title": "Subtract Integers with Different Signs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836356",
+      "title": "Integer Subtraction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836357",
+      "title": "Multiply Integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836358",
+      "title": "Divide Integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/long-division.json b/seed/math-challenges/30-arithmetic/long-division.json
new file mode 100644
index 0000000000..fab3c7026b
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/long-division.json
@@ -0,0 +1,71 @@
+{
+  "name": "Long Division",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b415",
+      "title": "Long Division Without Remainders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836324",
+      "title": "Divide up to Four Digits by Two Digits with Remainders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836325",
+      "title": "Groups and Remainders Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836326",
+      "title": "Long Division Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836327",
+      "title": "Divide Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/multiplication.json b/seed/math-challenges/30-arithmetic/multiplication.json
new file mode 100644
index 0000000000..273917b1e8
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/multiplication.json
@@ -0,0 +1,136 @@
+{
+  "name": "Multiplication",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b412",
+      "title": "Multiply Multiple Digits by One Digit",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836309",
+      "title": "Higher Order One Digit Multiplication Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836310",
+      "title": "Relate One Digit Number Patterns to Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836311",
+      "title": "Multiply Numbers with the Associative Property",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836312",
+      "title": "Multiply Two Digits by Two or More Digits",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836313",
+      "title": "Multiply and Compare with Greater/Less Than",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836314",
+      "title": "Relate Number Patterns to Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836315",
+      "title": "Higher Order Multiplication Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836316",
+      "title": "Multiply Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836317",
+      "title": "Mental Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/multiplying-and-dividing-decimals.json b/seed/math-challenges/30-arithmetic/multiplying-and-dividing-decimals.json
new file mode 100644
index 0000000000..0063cd52e6
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/multiplying-and-dividing-decimals.json
@@ -0,0 +1,58 @@
+{
+  "name": "Multiply and Divide Decimals",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b429",
+      "title": "Decimal Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836413",
+      "title": "Decimal Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836414",
+      "title": "Multiply Decimals and Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836415",
+      "title": "Estimate Products and Quotients of Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/multiplying-and-dividing-fractions.json b/seed/math-challenges/30-arithmetic/multiplying-and-dividing-fractions.json
new file mode 100644
index 0000000000..1b919180d9
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/multiplying-and-dividing-fractions.json
@@ -0,0 +1,162 @@
+{
+  "name": "Multiply and Divide Fractions",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b423",
+      "title": "Multiply Whole Numbers and Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836381",
+      "title": "Multiply Two Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836382",
+      "title": "Multiply Three or More Fractions and Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836383",
+      "title": "Multiply Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836384",
+      "title": "Multiply Mixed Numbers Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836385",
+      "title": "Reciprocal Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836386",
+      "title": "Divide Fractions and Whole Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836387",
+      "title": "Divide Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836388",
+      "title": "Divide Whole Numbers by Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836389",
+      "title": "Divide Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836390",
+      "title": "Multiply and Divide Fractions and Mixed Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836391",
+      "title": "Estimate Products of Whole Numbers and Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/order-of-operations.json b/seed/math-challenges/30-arithmetic/order-of-operations.json
new file mode 100644
index 0000000000..8ddf443a16
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/order-of-operations.json
@@ -0,0 +1,123 @@
+{
+  "name": "Order of Operations",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b416",
+      "title": "Introduction to Order of Operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836329",
+      "title": "Divide and Subtract with Remainders in Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836330",
+      "title": "Division and Subtraction Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836331",
+      "title": "Higher Order Division and Subtraction Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836332",
+      "title": "Multiply and Add Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836333",
+      "title": "Multiply and Add or Subtract Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836334",
+      "title": "Place Operators to Make True Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836335",
+      "title": "Place Operators to Make True Statements that Include Parentheses",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836336",
+      "title": "Place Parentheses to Make True Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/percentages.json b/seed/math-challenges/30-arithmetic/percentages.json
new file mode 100644
index 0000000000..a9cc757259
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/percentages.json
@@ -0,0 +1,110 @@
+{
+  "name": "Percentages",
+  "order": 22,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b432",
+      "title": "Overview of Percentages",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836428",
+      "title": "Percent of a Number",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836429",
+      "title": "Simple Interest",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836430",
+      "title": "Percent of Change",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836431",
+      "title": "Percent of Increase",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836432",
+      "title": "Percent of Decrease",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836433",
+      "title": "Prices Involving Discounts",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836434",
+      "title": "Total Bill Including Tip and Tax",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/powers-of-ten.json b/seed/math-challenges/30-arithmetic/powers-of-ten.json
new file mode 100644
index 0000000000..53d2a8778d
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/powers-of-ten.json
@@ -0,0 +1,58 @@
+{
+  "name": "Powers of Ten and Scientific Notation",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b430",
+      "title": "Multiply Decimals by Powers of Ten",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836417",
+      "title": "Multiplication and Powers of Ten",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836418",
+      "title": "Division and Powers of Ten",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836419",
+      "title": "Scientific Notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/rational-and-irrational-numbers.json b/seed/math-challenges/30-arithmetic/rational-and-irrational-numbers.json
new file mode 100644
index 0000000000..ccbe5041fd
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/rational-and-irrational-numbers.json
@@ -0,0 +1,97 @@
+{
+  "name": "Rational and Irrational numbers",
+  "order": 21,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b431",
+      "title": "Rational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836421",
+      "title": "Add Rational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836422",
+      "title": "Subtract Rational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836423",
+      "title": "Multiply Rational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836424",
+      "title": "Divide Rational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836425",
+      "title": "Irrational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836426",
+      "title": "Irrational Square Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/ratios.json b/seed/math-challenges/30-arithmetic/ratios.json
new file mode 100644
index 0000000000..d3206fe01d
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/ratios.json
@@ -0,0 +1,71 @@
+{
+  "name": "Ratios",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b424",
+      "title": "Definition of a Ratio",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836393",
+      "title": "Equivalent Ratios",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836394",
+      "title": "Ratios in Simplest Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836395",
+      "title": "Compare Ratios in Decimal Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836396",
+      "title": "Unit Rates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/30-arithmetic/round-decimals.json b/seed/math-challenges/30-arithmetic/round-decimals.json
new file mode 100644
index 0000000000..ee94cda15d
--- /dev/null
+++ b/seed/math-challenges/30-arithmetic/round-decimals.json
@@ -0,0 +1,32 @@
+{
+  "name": "Round Decimals",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b427",
+      "title": "Round Decimal Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836407",
+      "title": "Round Decimals with Place Value",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/31-algebra/algebra-expressions-and-variables.json b/seed/math-challenges/31-algebra/algebra-expressions-and-variables.json
new file mode 100644
index 0000000000..ff6225513d
--- /dev/null
+++ b/seed/math-challenges/31-algebra/algebra-expressions-and-variables.json
@@ -0,0 +1,84 @@
+{
+  "name": "Algebra Expressions and Variables",
+  "order": 29,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b439",
+      "title": "Expressions and Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836461",
+      "title": "Evaluate Single Variable Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836462",
+      "title": "Evaluate Expressions with One or More Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836463",
+      "title": "Words that Describe Mathematical Operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836464",
+      "title": "Translate Between English Phrases and Algebraic Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836465",
+      "title": "Calculator Use with Algebra Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/31-algebra/integers.json b/seed/math-challenges/31-algebra/integers.json
new file mode 100644
index 0000000000..ca4b994445
--- /dev/null
+++ b/seed/math-challenges/31-algebra/integers.json
@@ -0,0 +1,71 @@
+{
+  "name": "Integers",
+  "order": 27,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b437",
+      "title": "Absolute Value of Integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836451",
+      "title": "Integer Addition",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836452",
+      "title": "Integer Subtraction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836453",
+      "title": "Integer Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836454",
+      "title": "Integer Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/31-algebra/properties-and-axioms-of-real-numbers.json b/seed/math-challenges/31-algebra/properties-and-axioms-of-real-numbers.json
new file mode 100644
index 0000000000..e79be49c05
--- /dev/null
+++ b/seed/math-challenges/31-algebra/properties-and-axioms-of-real-numbers.json
@@ -0,0 +1,136 @@
+{
+  "name": "Properties and Axioms of Real Numbers",
+  "order": 30,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b440",
+      "title": "Real Number Properties and Axioms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836467",
+      "title": "Distributive Property",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836468",
+      "title": "Expressions and the Distributive Property",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836469",
+      "title": "When to Use the Distributive Property",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836470",
+      "title": "Distributive Property to Evaluate Formulas with Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836471",
+      "title": "Additive inverses and Absolute Values",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836472",
+      "title": "Associative and Commutative Property with Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836473",
+      "title": "Associative and Commutative Property with Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836474",
+      "title": "Addition and Multiplication Properties with Real Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836475",
+      "title": "Fraction and Mixed Number Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/31-algebra/real-number-variables-and-expressions.json b/seed/math-challenges/31-algebra/real-number-variables-and-expressions.json
new file mode 100644
index 0000000000..4b08ff3d9a
--- /dev/null
+++ b/seed/math-challenges/31-algebra/real-number-variables-and-expressions.json
@@ -0,0 +1,32 @@
+{
+  "name": "Real Number Variables and Expressions",
+  "order": 26,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b436",
+      "title": "The Real Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836449",
+      "title": "Order Real Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/31-algebra/simplifying-expressions.json b/seed/math-challenges/31-algebra/simplifying-expressions.json
new file mode 100644
index 0000000000..bce6fcda86
--- /dev/null
+++ b/seed/math-challenges/31-algebra/simplifying-expressions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Simplifying Expressions",
+  "order": 31,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b441",
+      "title": "Simplify Variable Expressions Involving Addition and Subtraction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836477",
+      "title": "Simplify Variable Expressions Involving Multiplication and Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836478",
+      "title": "Simplify Variable Expressions Involving Multiple Operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836479",
+      "title": "Simplify Algebraic Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/31-algebra/the-order-of-operations.json b/seed/math-challenges/31-algebra/the-order-of-operations.json
new file mode 100644
index 0000000000..b97c5360cd
--- /dev/null
+++ b/seed/math-challenges/31-algebra/the-order-of-operations.json
@@ -0,0 +1,71 @@
+{
+  "name": "The Order of Operations",
+  "order": 28,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b438",
+      "title": "Order of Operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836456",
+      "title": "PEMDAS in Numerical Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836457",
+      "title": "Algebra Expressions with Exponents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836458",
+      "title": "Algebra Expressions with Fraction Bars",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836459",
+      "title": "Order of Operations and Variable Substitution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/adding-and-subtracting-rational-expressions.json b/seed/math-challenges/32-linear-equations/adding-and-subtracting-rational-expressions.json
new file mode 100644
index 0000000000..fdccc04bc1
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/adding-and-subtracting-rational-expressions.json
@@ -0,0 +1,45 @@
+{
+  "name": "Add and Subtract Rational Expressions",
+  "order": 27,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b472",
+      "title": "Addition and Subtraction of Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a051",
+      "title": "Adding and Subtracting Rational Expressions where One Denominator is the LCD",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a052",
+      "title": "Applications of Adding and Subtracting Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/basic-equations.json b/seed/math-challenges/32-linear-equations/basic-equations.json
new file mode 100644
index 0000000000..08d31832ea
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/basic-equations.json
@@ -0,0 +1,97 @@
+{
+  "name": "Basic Equations",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b442",
+      "title": "Writing Basic Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836481",
+      "title": "Sentences as Single Variable Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836482",
+      "title": "Addition and Subtraction Phrases as Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836483",
+      "title": "Multiplication and Division Phrases as Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836484",
+      "title": "Input-Output Tables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836485",
+      "title": "Function Rules for Input-Output Tables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836486",
+      "title": "Input-Output Tables for Function Rules",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/direct-variations.json b/seed/math-challenges/32-linear-equations/direct-variations.json
new file mode 100644
index 0000000000..03732ee433
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/direct-variations.json
@@ -0,0 +1,45 @@
+{
+  "name": "Direct Variations",
+  "order": 31,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b476",
+      "title": "Direct Variation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a065",
+      "title": "Applications Using Direct Variation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a066",
+      "title": "Graphs of Linear Models of Direct Variation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/distance-rate-and-time.json b/seed/math-challenges/32-linear-equations/distance-rate-and-time.json
new file mode 100644
index 0000000000..0998cdba57
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/distance-rate-and-time.json
@@ -0,0 +1,97 @@
+{
+  "name": "Distance, Rate, and Time",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b448",
+      "title": "D = RT",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836514",
+      "title": "Solving for Elapsed Time Related to Rate",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836515",
+      "title": "Finding the Total Time Given a Distance between Two Objects",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836516",
+      "title": "Applications of Finding Time Using Multiple Steps",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836517",
+      "title": "Finding Total Distance Using Multiple Steps Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836518",
+      "title": "Find the Rate, Given Time and Distance",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836519",
+      "title": "Solving Length and Distance Problems Involving Time",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/exponential-growth-and-decay-functions.json b/seed/math-challenges/32-linear-equations/exponential-growth-and-decay-functions.json
new file mode 100644
index 0000000000..176b8104af
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/exponential-growth-and-decay-functions.json
@@ -0,0 +1,110 @@
+{
+  "name": "Exponential Growth and Decay Functions",
+  "order": 40,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b486",
+      "title": "Exponential Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a223",
+      "title": "Solving Equations with Exponents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a224",
+      "title": "Exponential Growth and Decay",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a225",
+      "title": "Exponential Growth",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a226",
+      "title": "Exponential Decay",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a227",
+      "title": "Geometric Sequences and Exponential Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a228",
+      "title": "Graphs of Exponential Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a229",
+      "title": "Applications of Exponential Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/exponents-and-irrational-numbers.json b/seed/math-challenges/32-linear-equations/exponents-and-irrational-numbers.json
new file mode 100644
index 0000000000..3b0f05ed50
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/exponents-and-irrational-numbers.json
@@ -0,0 +1,58 @@
+{
+  "name": "Exponents and Irrational Numbers",
+  "order": 33,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b479",
+      "title": "Negative and Zero Exponents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a079",
+      "title": "Fractional Exponents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a080",
+      "title": "Zero, Negative, and Fractional Exponents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a081",
+      "title": "Operations with Roots and Irrational Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/functions-and-function-notation.json b/seed/math-challenges/32-linear-equations/functions-and-function-notation.json
new file mode 100644
index 0000000000..1b8c284f4c
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/functions-and-function-notation.json
@@ -0,0 +1,97 @@
+{
+  "name": "Functions and Function Notation",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b451",
+      "title": "Function Notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836541",
+      "title": "Domain and Range of a Function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836543",
+      "title": "Applications of Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836544",
+      "title": "Identify Functions and the Vertical Line Test",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836545",
+      "title": "Even and Odd Functions and Function Symmetry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836546",
+      "title": "Operations on Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836547",
+      "title": "Composition of Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/graphing-in-the-coordinate-plane.json b/seed/math-challenges/32-linear-equations/graphing-in-the-coordinate-plane.json
new file mode 100644
index 0000000000..a72e02dc9a
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/graphing-in-the-coordinate-plane.json
@@ -0,0 +1,123 @@
+{
+  "name": "Graphing in the Coordinate Plane",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b450",
+      "title": "Graphs in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836533",
+      "title": "Points in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836534",
+      "title": "Ordered Pairs in Four Quadrants",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836535",
+      "title": "Coordinate Locations on a Map",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836536",
+      "title": "Graphs on a Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836537",
+      "title": "Graphs Based on Rules",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836538",
+      "title": "Rules Based on Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836539",
+      "title": "Identify Types of Linear and Nonlinear Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836540",
+      "title": "Function Families",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/graphing-linear-equations.json b/seed/math-challenges/32-linear-equations/graphing-linear-equations.json
new file mode 100644
index 0000000000..1e8cee9c9c
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/graphing-linear-equations.json
@@ -0,0 +1,97 @@
+{
+  "name": "Graph Linear Equations",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b452",
+      "title": "Graph of a Linear Equation in Two Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836549",
+      "title": "Graphs of Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836550",
+      "title": "Horizontal and Vertical Line Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836551",
+      "title": "Graph Using Intercepts",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836552",
+      "title": "Problem Solving with Linear Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836553",
+      "title": "Graphs of Absolute Value Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836554",
+      "title": "Linear and Absolute Value Function Families",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/graphing-polynomials.json b/seed/math-challenges/32-linear-equations/graphing-polynomials.json
new file mode 100644
index 0000000000..44a4f16bc9
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/graphing-polynomials.json
@@ -0,0 +1,58 @@
+{
+  "name": "Graphing Polynomials",
+  "order": 24,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b469",
+      "title": "Identify Parts of Polynomial Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a039",
+      "title": "Graphs of Polynomials Using Transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a040",
+      "title": "Graphs of Polynomials Using Zeros",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a041",
+      "title": "Graphing Calculator to Analyze Polynomial Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/graphing-quadratic-functions.json b/seed/math-challenges/32-linear-equations/graphing-quadratic-functions.json
new file mode 100644
index 0000000000..2fac63352a
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/graphing-quadratic-functions.json
@@ -0,0 +1,71 @@
+{
+  "name": "Graphing Quadratic Functions and Equations",
+  "order": 38,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b484",
+      "title": "Graph Quadratic Functions and Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a214",
+      "title": "Graphing with the Vertex Form of Quadratic Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a215",
+      "title": "Graphs of Quadratic Functions in Intercept Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a216",
+      "title": "Roots to Determine a Quadratic Function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a217",
+      "title": "Quadratic Functions and Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/graphing-slope.json b/seed/math-challenges/32-linear-equations/graphing-slope.json
new file mode 100644
index 0000000000..a671df2142
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/graphing-slope.json
@@ -0,0 +1,58 @@
+{
+  "name": "Graphing Slope",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b453",
+      "title": "Slope",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836556",
+      "title": "Rates of Change",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836557",
+      "title": "Slope of a Line Using Two Points",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836558",
+      "title": "Graph Using Slope-Intercept Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/introduction-to-polynomials.json b/seed/math-challenges/32-linear-equations/introduction-to-polynomials.json
new file mode 100644
index 0000000000..4ba37f3e80
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/introduction-to-polynomials.json
@@ -0,0 +1,45 @@
+{
+  "name": "Introduction to Polynomials",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b461",
+      "title": "Monomials, Binomials, and Trinomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a015",
+      "title": "Polynomials in Standard Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a016",
+      "title": "Addition and Subtraction of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/introduction-to-rational-expressions.json b/seed/math-challenges/32-linear-equations/introduction-to-rational-expressions.json
new file mode 100644
index 0000000000..5ea568d6d1
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/introduction-to-rational-expressions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Introduction to Rational Expressions",
+  "order": 25,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b470",
+      "title": "Working with Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a043",
+      "title": "Simplifying Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a044",
+      "title": "Excluded Values for Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a045",
+      "title": "Restricted Domain and Range",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/inverse-variation-and-rational-functions.json b/seed/math-challenges/32-linear-equations/inverse-variation-and-rational-functions.json
new file mode 100644
index 0000000000..aeb73e1895
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/inverse-variation-and-rational-functions.json
@@ -0,0 +1,149 @@
+{
+  "name": "Inverse Variation and Rational Functions",
+  "order": 32,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b478",
+      "title": "Direct and Inverse Variation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a068",
+      "title": "Inverse Variation Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a069",
+      "title": "Estimate Graphs of Rational Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a070",
+      "title": "Horizontal and Vertical Asymptotes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a071",
+      "title": "Vertical Asymptotes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a072",
+      "title": "Horizontal Asymptotes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a073",
+      "title": "Oblique Asymptotes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a074",
+      "title": "Determining Asymptotes by Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a075",
+      "title": "Inverse Variation Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a076",
+      "title": "Joint and Combined Variation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a077",
+      "title": "Applications Using Rational Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/linear-equations-in-the-real-world.json b/seed/math-challenges/32-linear-equations/linear-equations-in-the-real-world.json
new file mode 100644
index 0000000000..02858f232d
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/linear-equations-in-the-real-world.json
@@ -0,0 +1,58 @@
+{
+  "name": "Linear Equations in the Real World",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b447",
+      "title": "Applications of Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836510",
+      "title": "Problem-Solving Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836511",
+      "title": "Guess and Check, Work Backward",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836512",
+      "title": "Applications Using Linear Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/linear-exponential-and-quadratic-models.json b/seed/math-challenges/32-linear-equations/linear-exponential-and-quadratic-models.json
new file mode 100644
index 0000000000..76081fc07f
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/linear-exponential-and-quadratic-models.json
@@ -0,0 +1,58 @@
+{
+  "name": "Linear, Exponential and Quadratic Models",
+  "order": 42,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b488",
+      "title": "Identifying Linear, Exponential, and Quadratic Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a239",
+      "title": "Linear, Quadratic, and Cubic Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a240",
+      "title": "Cubic Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a241",
+      "title": "Applications of Function Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/linear-inequalities.json b/seed/math-challenges/32-linear-equations/linear-inequalities.json
new file mode 100644
index 0000000000..79de038c13
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/linear-inequalities.json
@@ -0,0 +1,162 @@
+{
+  "name": "Linear Inequalities",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b449",
+      "title": "Solve One Step Linear Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836521",
+      "title": "Inequalities on a Number Line",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836522",
+      "title": "Inequalities that Describe Patterns",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836523",
+      "title": "Inequality Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836524",
+      "title": "Inequalities with Addition and Subtraction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836525",
+      "title": "Inequalities with Multiplication and Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836526",
+      "title": "Multi-Step Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836527",
+      "title": "Checking Solutions to Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836528",
+      "title": "Compound Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836529",
+      "title": "Graph and Solve Absolute Value Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836530",
+      "title": "Intervals and Interval Notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836531",
+      "title": "Applications with Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/linear-systems.json b/seed/math-challenges/32-linear-equations/linear-systems.json
new file mode 100644
index 0000000000..d1eb61d1fc
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/linear-systems.json
@@ -0,0 +1,58 @@
+{
+  "name": "Linear Systems",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b458",
+      "title": "Consistent and Inconsistent Linear Systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a587af21a188128bc4071a",
+      "title": "Checking a Solution for a Linear System",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a587af21a188128bc4071c",
+      "title": "Graphs of Linear Systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a587af21a188128bc4071d",
+      "title": "Systems of Linear Equations in Two Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/logarithms.json b/seed/math-challenges/32-linear-equations/logarithms.json
new file mode 100644
index 0000000000..2023b6a2bd
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/logarithms.json
@@ -0,0 +1,110 @@
+{
+  "name": "Logarithms",
+  "order": 41,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b487",
+      "title": "Common and Natural Logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a231",
+      "title": "Analysis of Logarithmic Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a232",
+      "title": "Logarithm Properties",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a233",
+      "title": "Change of Base",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a234",
+      "title": "Product and Quotient Properties of Logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a235",
+      "title": "Power Property of Logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a236",
+      "title": "Inverse Properties of Logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a237",
+      "title": "Logistic Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/matrix-algebra.json b/seed/math-challenges/32-linear-equations/matrix-algebra.json
new file mode 100644
index 0000000000..25c87daea0
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/matrix-algebra.json
@@ -0,0 +1,97 @@
+{
+  "name": "Matrix Algebra",
+  "order": 43,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b489",
+      "title": "Introduction to Matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a243",
+      "title": "Adding and Subtracting Matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a244",
+      "title": "Multiplying Matrices by a Scalar",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a245",
+      "title": "Matrix Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a246",
+      "title": "Matrix Operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a247",
+      "title": "Determinants",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a248",
+      "title": "Cramer's Rule",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/matrix-equations.json b/seed/math-challenges/32-linear-equations/matrix-equations.json
new file mode 100644
index 0000000000..354c802ec2
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/matrix-equations.json
@@ -0,0 +1,110 @@
+{
+  "name": "Matrix Equations",
+  "order": 44,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b490",
+      "title": "Solving Matrix Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a250",
+      "title": "Augmented Matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a251",
+      "title": "Row Operations and Row Echelon Forms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a252",
+      "title": "Writing and Solving a Matrix Equation for a Linear System",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a253",
+      "title": "Solving Linear Systems Using Matrices and Technology",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a254",
+      "title": "Inverse Matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a255",
+      "title": "Applications of Matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a256",
+      "title": "Partial Fraction Expansions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/multi-step-equations.json b/seed/math-challenges/32-linear-equations/multi-step-equations.json
new file mode 100644
index 0000000000..95dd6770d3
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/multi-step-equations.json
@@ -0,0 +1,123 @@
+{
+  "name": "Multi-Step Equations",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b445",
+      "title": "Multi-Step Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59830501",
+      "title": "Multi-Step Equations with Like Terms and Distribution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836502",
+      "title": "Multi-Step Equations with Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836503",
+      "title": "Multi-Step Equations with Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836504",
+      "title": "Multi-Step Equations with Decimals, Fractions, and Parentheses",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836505",
+      "title": "Applications of Multi-Step Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836506",
+      "title": "Equations with Variables on Both Sides",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836507",
+      "title": "Solving for a Variable",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836508",
+      "title": "Absolute Value Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/multiplying-and-dividing-rational-expressions.json b/seed/math-challenges/32-linear-equations/multiplying-and-dividing-rational-expressions.json
new file mode 100644
index 0000000000..1c290b4116
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/multiplying-and-dividing-rational-expressions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Multiplying and Dividing Rational Expressions",
+  "order": 26,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b471",
+      "title": "Products and Quotients of Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a047",
+      "title": "Multiplication of Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a048",
+      "title": "Division of Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a049",
+      "title": "Complex Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/one-step-equations.json b/seed/math-challenges/32-linear-equations/one-step-equations.json
new file mode 100644
index 0000000000..c876cfd01d
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/one-step-equations.json
@@ -0,0 +1,84 @@
+{
+  "name": "One-Step Equations",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b443",
+      "title": "One-Step Equations and Properties of Equality",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836488",
+      "title": "Single Variable Equations with Addition and Subtraction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836489",
+      "title": "Properties of Equality with Fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836490",
+      "title": "Single Variable Equations with Multiplication and Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836491",
+      "title": "Properties of Equality with Decimals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836492",
+      "title": "Checking Solutions to Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/parallel-and-perpendicular-lines.json b/seed/math-challenges/32-linear-equations/parallel-and-perpendicular-lines.json
new file mode 100644
index 0000000000..d1c79c90b0
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/parallel-and-perpendicular-lines.json
@@ -0,0 +1,58 @@
+{
+  "name": "Parallel and Perpendicular Lines",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b456",
+      "title": "Equations of Parallel and Perpendicular Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836564",
+      "title": "Equations of Parallel Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836565",
+      "title": "Equations of Perpendicular Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836566",
+      "title": "Families of Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/percentages.json b/seed/math-challenges/32-linear-equations/percentages.json
new file mode 100644
index 0000000000..329da5551b
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/percentages.json
@@ -0,0 +1,58 @@
+{
+  "name": "Percentages",
+  "order": 28,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b473",
+      "title": "Percentage Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a054",
+      "title": "Simple Interest",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a055",
+      "title": "The Percent Equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a056",
+      "title": "Proportions and Percents",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/polynomial-division.json b/seed/math-challenges/32-linear-equations/polynomial-division.json
new file mode 100644
index 0000000000..0b06d92b36
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/polynomial-division.json
@@ -0,0 +1,71 @@
+{
+  "name": "Polynomial Division",
+  "order": 23,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b468",
+      "title": "Dividing Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a034",
+      "title": "Long Division of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a035",
+      "title": "Synthetic Division of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a036",
+      "title": "Finding Zeros of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a037",
+      "title": "Zeroes and Intercepts of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/polynomial-factoring.json b/seed/math-challenges/32-linear-equations/polynomial-factoring.json
new file mode 100644
index 0000000000..29310520d2
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/polynomial-factoring.json
@@ -0,0 +1,32 @@
+{
+  "name": "Polynomial Factoring",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b463",
+      "title": "Factoring Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a022",
+      "title": "Monomial Factors of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/polynomial-multiplication.json b/seed/math-challenges/32-linear-equations/polynomial-multiplication.json
new file mode 100644
index 0000000000..a86db7e9f7
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/polynomial-multiplication.json
@@ -0,0 +1,58 @@
+{
+  "name": "Polynomial Multiplication",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b462",
+      "title": "Multiply Polynomials by Monomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a018",
+      "title": "Multiply Binomials by Binomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a019",
+      "title": "Multiply Polynomials by Binomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a020",
+      "title": "Multiply Polynomials by Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/polynomial-special-products.json b/seed/math-challenges/32-linear-equations/polynomial-special-products.json
new file mode 100644
index 0000000000..7417593144
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/polynomial-special-products.json
@@ -0,0 +1,58 @@
+{
+  "name": "Polynomial Special Products",
+  "order": 21,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b465",
+      "title": "Special Products of Polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a024",
+      "title": "Factor Difference of Squares",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a025",
+      "title": "Factor Perfect Square Trinomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a026",
+      "title": "Sum and Difference of Cubes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/properties-of-exponents-in-variable-expressions.json b/seed/math-challenges/32-linear-equations/properties-of-exponents-in-variable-expressions.json
new file mode 100644
index 0000000000..b5111e1961
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/properties-of-exponents-in-variable-expressions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Properties of Exponents in Variable Expressions",
+  "order": 39,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b485",
+      "title": "Exponential Properties Involving Products",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a219",
+      "title": "Exponential Properties Involving Quotients",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a220",
+      "title": "Exponential Terms Raised to an Exponent",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a221",
+      "title": "Exponential Properties in Variable Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/proportion-and-scale.json b/seed/math-challenges/32-linear-equations/proportion-and-scale.json
new file mode 100644
index 0000000000..5f770376ee
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/proportion-and-scale.json
@@ -0,0 +1,45 @@
+{
+  "name": "Proportion and Scale",
+  "order": 30,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b475",
+      "title": "Proportions and Scale",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a062",
+      "title": "Dimensional Analysis",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a063",
+      "title": "Applications of Scale and Indirect Measurement",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/proportions.json b/seed/math-challenges/32-linear-equations/proportions.json
new file mode 100644
index 0000000000..19c24b71a4
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/proportions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Proportions",
+  "order": 29,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b474",
+      "title": "Proportions using LCD",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a058",
+      "title": "Proportions using Cross-Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a059",
+      "title": "Rational Equations and Proportions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a060",
+      "title": "Applications of Ratios and Proportions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/quadratic-expressions.json b/seed/math-challenges/32-linear-equations/quadratic-expressions.json
new file mode 100644
index 0000000000..16ee86a824
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/quadratic-expressions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Quadratic Expressions",
+  "order": 22,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b466",
+      "title": "Factor Quadratics with a Leading Coefficient of 1",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a028",
+      "title": "Factor Quadratic Expressions with Negative Coefficients",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a029",
+      "title": "Factor Quadratics",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a030",
+      "title": "Factor by Grouping",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a031",
+      "title": "Zero Product Principle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a032",
+      "title": "Applications of Factoring",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/radical-equations.json b/seed/math-challenges/32-linear-equations/radical-equations.json
new file mode 100644
index 0000000000..5f9459bc92
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/radical-equations.json
@@ -0,0 +1,123 @@
+{
+  "name": "Radical Equations",
+  "order": 36,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b482",
+      "title": "Equations with Radicals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a095",
+      "title": "Equations with Square Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a096",
+      "title": "Equations with Radicals on Both Sides",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a097",
+      "title": "Equations with Variables Under and not Under a Radical",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a098",
+      "title": "Graphs of Square Root Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a099",
+      "title": "Shifts of Square Root Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a200",
+      "title": "Graphing Cube Root Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a201",
+      "title": "Square and Cube Root Function Families",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a202",
+      "title": "Applications Using Radicals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/radical-expressions.json b/seed/math-challenges/32-linear-equations/radical-expressions.json
new file mode 100644
index 0000000000..73422b0baf
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/radical-expressions.json
@@ -0,0 +1,71 @@
+{
+  "name": "Radical Expressions",
+  "order": 35,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b481",
+      "title": "Simplify Expressions with Radicals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a090",
+      "title": "Multiplication and Division of Radicals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a091",
+      "title": "Raising a Product or Quotient to a Power",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a092",
+      "title": "Addition and Subtraction of Radicals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a093",
+      "title": "nth Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/solving-linear-systems.json b/seed/math-challenges/32-linear-equations/solving-linear-systems.json
new file mode 100644
index 0000000000..e5f6203b93
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/solving-linear-systems.json
@@ -0,0 +1,136 @@
+{
+  "name": "Solving Linear Systems",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b459",
+      "title": "Linear Systems by Elimination",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a587af21a178128bc4071a",
+      "title": "Solving Systems by Multiplying One Equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a587af21a188128bc4071b",
+      "title": "Solving Systems by Multiplying Both Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a001",
+      "title": "Linear Systems by Elimination Using Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a002",
+      "title": "Systems Using Substitution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a003",
+      "title": "Comparing Methods for Solving Linear Systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a004",
+      "title": "Applications of Linear Systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a005",
+      "title": "Mixture Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a006",
+      "title": "Systems of Linear Equations in Three Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a007",
+      "title": "Linear Programming",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/solving-quadratic-equations.json b/seed/math-challenges/32-linear-equations/solving-quadratic-equations.json
new file mode 100644
index 0000000000..a7d1e96f81
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/solving-quadratic-equations.json
@@ -0,0 +1,136 @@
+{
+  "name": "Solving Quadratic Equations",
+  "order": 37,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b483",
+      "title": "Quadratic and Exponential Equations and Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a204",
+      "title": "Use Square Roots to Solve Quadratic Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a205",
+      "title": "Square Root Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a206",
+      "title": "Completing the Square",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a207",
+      "title": "Completing the Square when the Leading Coefficient Equals 1",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a208",
+      "title": "Vertex Form of a Quadratic Equation by Completing the Square",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a209",
+      "title": "Use Graphs and Technology to Solve Quadratic Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a210",
+      "title": "The Quadratic Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a211",
+      "title": "The Discriminant",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a212",
+      "title": "Quadratic Equation Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/solving-systems-of-linear-inequalities.json b/seed/math-challenges/32-linear-equations/solving-systems-of-linear-inequalities.json
new file mode 100644
index 0000000000..63b9a69c39
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/solving-systems-of-linear-inequalities.json
@@ -0,0 +1,84 @@
+{
+  "name": "Solving Systems of Linear Inequalities",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b460",
+      "title": "Graphs of Systems of Linear Inequalities in Two Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a009",
+      "title": "Evaluate Solutions for Linear Inequalities in Two Variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a010",
+      "title": "Graphing to Check Solutions to Systems of Linear Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a011",
+      "title": "Systems of Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a012",
+      "title": "Quadratic Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a013",
+      "title": "Polynomial and Rational Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/the-equation-of-a-line.json b/seed/math-challenges/32-linear-equations/the-equation-of-a-line.json
new file mode 100644
index 0000000000..c89179412d
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/the-equation-of-a-line.json
@@ -0,0 +1,97 @@
+{
+  "name": "The Equation of a Line",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b457",
+      "title": "Determining the Equation of a Line",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836568",
+      "title": "Write an Equation Given the Slope and a Point",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836569",
+      "title": "Write an Equation Given Two Points",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836570",
+      "title": "Write a Function in Slope-Intercept Form",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836571",
+      "title": "Fitting Lines to Data",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836572",
+      "title": "Linear Interpolation and Extrapolation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836573",
+      "title": "Applications of Linear Interpolation and Extrapolation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/the-forms-of-a-linear-equation.json b/seed/math-challenges/32-linear-equations/the-forms-of-a-linear-equation.json
new file mode 100644
index 0000000000..731cfa19ef
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/the-forms-of-a-linear-equation.json
@@ -0,0 +1,58 @@
+{
+  "name": "The Forms of a Linear Equation",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b455",
+      "title": "Standard Form of Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836560",
+      "title": "Slope-Intercept Form of Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836561",
+      "title": "Point-Slope Form of Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836562",
+      "title": "Forms of Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/the-pythagorean-theorem.json b/seed/math-challenges/32-linear-equations/the-pythagorean-theorem.json
new file mode 100644
index 0000000000..1a3c37665a
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/the-pythagorean-theorem.json
@@ -0,0 +1,97 @@
+{
+  "name": "The Pythagorean Theorem",
+  "order": 34,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b480",
+      "title": "Pythagorean Theorem and its Converse",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a083",
+      "title": "Pythagorean Triples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a084",
+      "title": "Converse of the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a085",
+      "title": "Solving Equations Using the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a086",
+      "title": "Applications Using the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a087",
+      "title": "Distance Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a088",
+      "title": "Midpoint Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/32-linear-equations/two-step-equations.json b/seed/math-challenges/32-linear-equations/two-step-equations.json
new file mode 100644
index 0000000000..1888249ee6
--- /dev/null
+++ b/seed/math-challenges/32-linear-equations/two-step-equations.json
@@ -0,0 +1,97 @@
+{
+  "name": "Two-Step Equations",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b444",
+      "title": "Two-Step Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836494",
+      "title": "Two-Step Equations from Verbal Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836495",
+      "title": "Two-Step Equations with Addition and Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836496",
+      "title": "Two-Step Equations with Addition and Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836497",
+      "title": "Two-Step Equations with Subtraction and Multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836498",
+      "title": "Two-Step Equations with Subtraction and Division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59836499",
+      "title": "Applications of Two-Step Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/angle-pairs.json b/seed/math-challenges/33-geometry/angle-pairs.json
new file mode 100644
index 0000000000..0d6e5f2995
--- /dev/null
+++ b/seed/math-challenges/33-geometry/angle-pairs.json
@@ -0,0 +1,71 @@
+{
+  "name": "Angle Pairs",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b495",
+      "title": "Angle Properties and Theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a272",
+      "title": "Complementary Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a273",
+      "title": "Supplementary Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a274",
+      "title": "Missing Measures of Complementary and Supplementary Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a275",
+      "title": "Vertical Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/angles.json b/seed/math-challenges/33-geometry/angles.json
new file mode 100644
index 0000000000..cbd62506ce
--- /dev/null
+++ b/seed/math-challenges/33-geometry/angles.json
@@ -0,0 +1,84 @@
+{
+  "name": "Angles",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b493",
+      "title": "Introduction to Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a266",
+      "title": "Identification of Angles by Vertex and Ray",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a267",
+      "title": "Measuring Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a268",
+      "title": "Classifying Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a269",
+      "title": "Congruent Angles and Angle Bisectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a270",
+      "title": "Constructions and Bisectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/arcs-and-chords.json b/seed/math-challenges/33-geometry/arcs-and-chords.json
new file mode 100644
index 0000000000..5cb835c263
--- /dev/null
+++ b/seed/math-challenges/33-geometry/arcs-and-chords.json
@@ -0,0 +1,71 @@
+{
+  "name": "Arcs and Chords",
+  "order": 25,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b515",
+      "title": "Arcs in Circles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a394",
+      "title": "Area of Sectors and Segments",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a395",
+      "title": "Arc Length",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a396",
+      "title": "Chords and Central Angle Arcs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a397",
+      "title": "Segments from Chords",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/area-of-a-circle.json b/seed/math-challenges/33-geometry/area-of-a-circle.json
new file mode 100644
index 0000000000..3272835938
--- /dev/null
+++ b/seed/math-challenges/33-geometry/area-of-a-circle.json
@@ -0,0 +1,45 @@
+{
+  "name": "Area of a Circle",
+  "order": 24,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b514",
+      "title": "Circle Area",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a391",
+      "title": "Areas of Combined Figures Involving Semicircles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a392",
+      "title": "Radius or Diameter of a Circle Given Area",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/basic-polygons.json b/seed/math-challenges/33-geometry/basic-polygons.json
new file mode 100644
index 0000000000..ab12656865
--- /dev/null
+++ b/seed/math-challenges/33-geometry/basic-polygons.json
@@ -0,0 +1,45 @@
+{
+  "name": "Basic Polygons",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b497",
+      "title": "Classify Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a277",
+      "title": "Vertices and Sides",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a278",
+      "title": "Polygon Classification in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/basic-squares-and-rectangles.json b/seed/math-challenges/33-geometry/basic-squares-and-rectangles.json
new file mode 100644
index 0000000000..180175369a
--- /dev/null
+++ b/seed/math-challenges/33-geometry/basic-squares-and-rectangles.json
@@ -0,0 +1,84 @@
+{
+  "name": "Basic Squares and Rectangles",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b509",
+      "title": "Squares",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a358",
+      "title": "Rectangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a359",
+      "title": "Square and Rectangle Area and Perimeter",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a360",
+      "title": "Perimeter of Squares and Rectangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a361",
+      "title": "Area of Squares and Rectangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a362",
+      "title": "Unknown Dimensions of Squares and Rectangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/circles-and-angles.json b/seed/math-challenges/33-geometry/circles-and-angles.json
new file mode 100644
index 0000000000..ff0e6bfee3
--- /dev/null
+++ b/seed/math-challenges/33-geometry/circles-and-angles.json
@@ -0,0 +1,58 @@
+{
+  "name": "Circles and Angles",
+  "order": 26,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b516",
+      "title": "Inscribed Angles in Circles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a399",
+      "title": "Inscribed Quadrilaterals in Circles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a400",
+      "title": "Angles On and Inside a Circle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a401",
+      "title": "Angles Outside a Circle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/classifying-triangles.json b/seed/math-challenges/33-geometry/classifying-triangles.json
new file mode 100644
index 0000000000..cc4ed44d83
--- /dev/null
+++ b/seed/math-challenges/33-geometry/classifying-triangles.json
@@ -0,0 +1,71 @@
+{
+  "name": "Classifying Triangles",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b503",
+      "title": "Classify Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a311",
+      "title": "Classify Triangles by Angle Measurement",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a312",
+      "title": "Classify Triangles by Side Measurement",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a313",
+      "title": "Isosceles Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a314",
+      "title": "Equilateral Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/composition-of-transformations.json b/seed/math-challenges/33-geometry/composition-of-transformations.json
new file mode 100644
index 0000000000..90db2cc3b2
--- /dev/null
+++ b/seed/math-challenges/33-geometry/composition-of-transformations.json
@@ -0,0 +1,45 @@
+{
+  "name": "Composition of Transformations",
+  "order": 37,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b526",
+      "title": "Composite Transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a438",
+      "title": "Notation for Composite Transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a439",
+      "title": "Tessellations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/cones.json b/seed/math-challenges/33-geometry/cones.json
new file mode 100644
index 0000000000..d625355c89
--- /dev/null
+++ b/seed/math-challenges/33-geometry/cones.json
@@ -0,0 +1,45 @@
+{
+  "name": "Cones",
+  "order": 43,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b532",
+      "title": "Surface Area and Volume of Cones",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a461",
+      "title": "Surface Area of Cones",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a462",
+      "title": "Volume of Cones",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/cross-sections-and-basic-solids-of-revolution.json b/seed/math-challenges/33-geometry/cross-sections-and-basic-solids-of-revolution.json
new file mode 100644
index 0000000000..0b5f41a262
--- /dev/null
+++ b/seed/math-challenges/33-geometry/cross-sections-and-basic-solids-of-revolution.json
@@ -0,0 +1,45 @@
+{
+  "name": "Cross Sections and Basic Solids of Revolution",
+  "order": 39,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b528",
+      "title": "Composite Solids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a446",
+      "title": "Area and Volume of Similar Solids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a447",
+      "title": "Surface Area and Volume Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/cylinders.json b/seed/math-challenges/33-geometry/cylinders.json
new file mode 100644
index 0000000000..4c7d80d9ad
--- /dev/null
+++ b/seed/math-challenges/33-geometry/cylinders.json
@@ -0,0 +1,58 @@
+{
+  "name": "Cylinders",
+  "order": 42,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b531",
+      "title": "Surface Area and Volume of Cylinders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a457",
+      "title": "Surface Area of Cylinders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a458",
+      "title": "Volume of Cylinders",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a459",
+      "title": "Heights of Cylinders Given Surface Area or Volume",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/dilation.json b/seed/math-challenges/33-geometry/dilation.json
new file mode 100644
index 0000000000..dffda91d2b
--- /dev/null
+++ b/seed/math-challenges/33-geometry/dilation.json
@@ -0,0 +1,58 @@
+{
+  "name": "Dilation",
+  "order": 31,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b521",
+      "title": "Dilation of a Shape",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a421",
+      "title": "Dilation in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a422",
+      "title": "Mapping Dilations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a423",
+      "title": "Self-Similarity and Fractals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/geometry-of-circles.json b/seed/math-challenges/33-geometry/geometry-of-circles.json
new file mode 100644
index 0000000000..8651557fc8
--- /dev/null
+++ b/seed/math-challenges/33-geometry/geometry-of-circles.json
@@ -0,0 +1,71 @@
+{
+  "name": "Geometry of Circles",
+  "order": 23,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b513",
+      "title": "Semicircles and Quarter Circles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a386",
+      "title": "Identify Circle Components",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a387",
+      "title": "Use Diameter, Radius and Pi",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a388",
+      "title": "Circumference",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a389",
+      "title": "Diameter or Radius of a Circle Given Circumference",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/geometry-proofs.json b/seed/math-challenges/33-geometry/geometry-proofs.json
new file mode 100644
index 0000000000..15beb4ccae
--- /dev/null
+++ b/seed/math-challenges/33-geometry/geometry-proofs.json
@@ -0,0 +1,97 @@
+{
+  "name": "Geometry Proofs",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b496",
+      "title": "Basic Visual Patterns",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a280",
+      "title": "Identify Basic Pattern Type",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a281",
+      "title": "Number Patterns",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a282",
+      "title": "Reasoning Types",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a283",
+      "title": "Inductive Reasoning from Patterns",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a284",
+      "title": "Conjectures and Counterexamples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a285",
+      "title": "Deductive Reasoning",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/introduction-to-solid-figures.json b/seed/math-challenges/33-geometry/introduction-to-solid-figures.json
new file mode 100644
index 0000000000..02f8341bd8
--- /dev/null
+++ b/seed/math-challenges/33-geometry/introduction-to-solid-figures.json
@@ -0,0 +1,71 @@
+{
+  "name": "Introduction to Solid Figures",
+  "order": 38,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b527",
+      "title": "Polyhedrons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a441",
+      "title": "Faces Edges and Vertices of Solids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a442",
+      "title": "Cross-Sections and Nets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a443",
+      "title": "Surface Area",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a444",
+      "title": "Volume",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/introduction-to-transformation.json b/seed/math-challenges/33-geometry/introduction-to-transformation.json
new file mode 100644
index 0000000000..b7d8fe0f9d
--- /dev/null
+++ b/seed/math-challenges/33-geometry/introduction-to-transformation.json
@@ -0,0 +1,19 @@
+{
+  "name": "Introduction to Transformation Types",
+  "order": 32,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b725",
+      "title": "Identify Transformation Types",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/line-segments.json b/seed/math-challenges/33-geometry/line-segments.json
new file mode 100644
index 0000000000..4e3cec474b
--- /dev/null
+++ b/seed/math-challenges/33-geometry/line-segments.json
@@ -0,0 +1,58 @@
+{
+  "name": "Line Segments",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b492",
+      "title": "Definition of Line Segment",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a262",
+      "title": "Midpoints and Segment Bisectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a263",
+      "title": "Midpoint Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a264",
+      "title": "Points that Partition Line Segments",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/lines-in-the-coordinate-plane.json b/seed/math-challenges/33-geometry/lines-in-the-coordinate-plane.json
new file mode 100644
index 0000000000..63fb58f98d
--- /dev/null
+++ b/seed/math-challenges/33-geometry/lines-in-the-coordinate-plane.json
@@ -0,0 +1,45 @@
+{
+  "name": "Lines in the Coordinate Plane",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b502",
+      "title": "Parallel Lines in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a308",
+      "title": "Perpendicular Lines in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a309",
+      "title": "Line Construction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/lines.json b/seed/math-challenges/33-geometry/lines.json
new file mode 100644
index 0000000000..87f01508a6
--- /dev/null
+++ b/seed/math-challenges/33-geometry/lines.json
@@ -0,0 +1,32 @@
+{
+  "name": "Lines",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b500",
+      "title": "Line Types",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a299",
+      "title": "Parallel and Skew Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/logic-statements.json b/seed/math-challenges/33-geometry/logic-statements.json
new file mode 100644
index 0000000000..2c124c66c2
--- /dev/null
+++ b/seed/math-challenges/33-geometry/logic-statements.json
@@ -0,0 +1,71 @@
+{
+  "name": "Logic Statements",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b498",
+      "title": "Truth Tables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a287",
+      "title": "And and Or Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a288",
+      "title": "Negative Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a289",
+      "title": "If Then Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a290",
+      "title": "Converse, Inverse, and Contrapositive Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/polygon-angle-measures.json b/seed/math-challenges/33-geometry/polygon-angle-measures.json
new file mode 100644
index 0000000000..819b72e521
--- /dev/null
+++ b/seed/math-challenges/33-geometry/polygon-angle-measures.json
@@ -0,0 +1,45 @@
+{
+  "name": "Polygon Angle Measures",
+  "order": 22,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b512",
+      "title": "Determine Missing Angle Measures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a383",
+      "title": "Interior Angles in Convex Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a384",
+      "title": "Exterior Angles in Convex Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/polygons.json b/seed/math-challenges/33-geometry/polygons.json
new file mode 100644
index 0000000000..384be3efeb
--- /dev/null
+++ b/seed/math-challenges/33-geometry/polygons.json
@@ -0,0 +1,84 @@
+{
+  "name": "Polygons",
+  "order": 21,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b511",
+      "title": "Regular and Irregular Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a377",
+      "title": "Area of Regular and Irregular Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a378",
+      "title": "Area and Perimeter of Similar Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a379",
+      "title": "Construct Regular Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a380",
+      "title": "Congruent Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a381",
+      "title": "Corresponding Parts of Congruent Figures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/prisms.json b/seed/math-challenges/33-geometry/prisms.json
new file mode 100644
index 0000000000..0a44f7f98d
--- /dev/null
+++ b/seed/math-challenges/33-geometry/prisms.json
@@ -0,0 +1,84 @@
+{
+  "name": "Prisms",
+  "order": 40,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b529",
+      "title": "Surface Area and Volume of Prisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a449",
+      "title": "Surface Area of Prisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a450",
+      "title": "Volume of Prisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a451",
+      "title": "Volume of Prisms Using Unit Cubes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a452",
+      "title": "Volume of Rectangular Prisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a453",
+      "title": "Volume of Triangular Prisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/properties-and-proofs.json b/seed/math-challenges/33-geometry/properties-and-proofs.json
new file mode 100644
index 0000000000..7090875218
--- /dev/null
+++ b/seed/math-challenges/33-geometry/properties-and-proofs.json
@@ -0,0 +1,97 @@
+{
+  "name": "Properties and Proofs",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b499",
+      "title": "Introduction to Proofs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a292",
+      "title": "Properties of Equality and Congruence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a293",
+      "title": "Proofs: Angle Pairs and Segments",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a294",
+      "title": "Proofs involving Parallel and Perpendicular Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a295",
+      "title": "Parallelogram Proofs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a296",
+      "title": "Proofs Involving Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a297",
+      "title": "Indirect Proof in Algebra and Geometry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/pyramids.json b/seed/math-challenges/33-geometry/pyramids.json
new file mode 100644
index 0000000000..d195b4a180
--- /dev/null
+++ b/seed/math-challenges/33-geometry/pyramids.json
@@ -0,0 +1,32 @@
+{
+  "name": "Pyramids",
+  "order": 41,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b530",
+      "title": "Surface Area and Volume of Pyramids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a455",
+      "title": "Volume of Pyramids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/pythagorean-theorem.json b/seed/math-challenges/33-geometry/pythagorean-theorem.json
new file mode 100644
index 0000000000..86707f05bc
--- /dev/null
+++ b/seed/math-challenges/33-geometry/pythagorean-theorem.json
@@ -0,0 +1,136 @@
+{
+  "name": "Pythagorean Theorem",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b507",
+      "title": "Introduction to the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a338",
+      "title": "Basics of Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a339",
+      "title": "Pythagorean Theorem to Classify Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a340",
+      "title": "Pythagorean Triples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a341",
+      "title": "Converse of the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a342",
+      "title": "Pythagorean Theorem Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a343",
+      "title": "Right Triangles in Algebra",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a344",
+      "title": "Pythagorean Theorem and its Converse",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a345",
+      "title": "Solving Equations Using the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a346",
+      "title": "Applications Using the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/quadrilaterals.json b/seed/math-challenges/33-geometry/quadrilaterals.json
new file mode 100644
index 0000000000..23505a477c
--- /dev/null
+++ b/seed/math-challenges/33-geometry/quadrilaterals.json
@@ -0,0 +1,175 @@
+{
+  "name": "Quadrilaterals",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b510",
+      "title": "Quadrilateral Classification",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a364",
+      "title": "Parallelogram Classification",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a365",
+      "title": "Parallelograms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a366",
+      "title": "Area of a Parallelogram",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a367",
+      "title": "Unknown Dimensions of Parallelograms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a368",
+      "title": "Estimation of Parallelogram Area in Scale Drawings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a369",
+      "title": "Trapezoids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a370",
+      "title": "Area and Perimeter of Trapezoids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a371",
+      "title": "Area of Parallelograms: Squares, Rectangles and Trapezoids",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a372",
+      "title": "Kites",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a373",
+      "title": "Area and Perimeter of Rhombuses and Kites",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a374",
+      "title": "Area and Perimeter of Composite Shapes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a375",
+      "title": "Quadrilateral Classification in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/reflections.json b/seed/math-challenges/33-geometry/reflections.json
new file mode 100644
index 0000000000..878dadfb36
--- /dev/null
+++ b/seed/math-challenges/33-geometry/reflections.json
@@ -0,0 +1,45 @@
+{
+  "name": "Reflections",
+  "order": 36,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b525",
+      "title": "Defining Reflection",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a435",
+      "title": "Rules for Reflections",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a436",
+      "title": "Reflecting Figures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/rotations.json b/seed/math-challenges/33-geometry/rotations.json
new file mode 100644
index 0000000000..686b59c332
--- /dev/null
+++ b/seed/math-challenges/33-geometry/rotations.json
@@ -0,0 +1,32 @@
+{
+  "name": "Rotations",
+  "order": 35,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b524",
+      "title": "Defining Rotation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a433",
+      "title": "Rotation Rules",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/shapes.json b/seed/math-challenges/33-geometry/shapes.json
new file mode 100644
index 0000000000..0f12b62a42
--- /dev/null
+++ b/seed/math-challenges/33-geometry/shapes.json
@@ -0,0 +1,58 @@
+{
+  "name": "Shapes",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b491",
+      "title": "2D Shapes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a258",
+      "title": "Identify Shapes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a259",
+      "title": "Identify Less Common Shapes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a260",
+      "title": "Composite Shapes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/similarity.json b/seed/math-challenges/33-geometry/similarity.json
new file mode 100644
index 0000000000..971f971059
--- /dev/null
+++ b/seed/math-challenges/33-geometry/similarity.json
@@ -0,0 +1,84 @@
+{
+  "name": "Similarity",
+  "order": 28,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b518",
+      "title": "Similar Figures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a407",
+      "title": "Ratio and Proportion in Similar Figures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a408",
+      "title": "Similar Polygons and Scale Factors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a409",
+      "title": "Corresponding Parts of Similar Figures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a410",
+      "title": "Indirect Measurement",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a411",
+      "title": "Indirect Measurement Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/special-triangles.json b/seed/math-challenges/33-geometry/special-triangles.json
new file mode 100644
index 0000000000..a75eb1f1b1
--- /dev/null
+++ b/seed/math-challenges/33-geometry/special-triangles.json
@@ -0,0 +1,58 @@
+{
+  "name": "Special Triangles",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b508",
+      "title": "Special Right Triangles and Ratios",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a354",
+      "title": "45-45-90 Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a355",
+      "title": "30-60-90 Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a356",
+      "title": "Quadrilaterals and Polygons",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/spheres.json b/seed/math-challenges/33-geometry/spheres.json
new file mode 100644
index 0000000000..ada0c44be8
--- /dev/null
+++ b/seed/math-challenges/33-geometry/spheres.json
@@ -0,0 +1,45 @@
+{
+  "name": "Spheres",
+  "order": 44,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b533",
+      "title": "Surface Area and Volume of Spheres",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a464",
+      "title": "Surface Area of Spheres",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a465",
+      "title": "Volume of Spheres",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/symmetry.json b/seed/math-challenges/33-geometry/symmetry.json
new file mode 100644
index 0000000000..60fdf6217e
--- /dev/null
+++ b/seed/math-challenges/33-geometry/symmetry.json
@@ -0,0 +1,45 @@
+{
+  "name": "Symmetry",
+  "order": 33,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b522",
+      "title": "Lines of Symmetry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a426",
+      "title": "Reflection Symmetry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a427",
+      "title": "Rotation Symmetry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/tangent-lines-and-theorems.json b/seed/math-challenges/33-geometry/tangent-lines-and-theorems.json
new file mode 100644
index 0000000000..9a589112e5
--- /dev/null
+++ b/seed/math-challenges/33-geometry/tangent-lines-and-theorems.json
@@ -0,0 +1,58 @@
+{
+  "name": "Tangent Lines and Theorems",
+  "order": 27,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b517",
+      "title": "Tangent Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a403",
+      "title": "Intersecting Secants Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a404",
+      "title": "Tangent Secant Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a405",
+      "title": "Circles in the Coordinate Plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/the-distance-formula.json b/seed/math-challenges/33-geometry/the-distance-formula.json
new file mode 100644
index 0000000000..3df30f642e
--- /dev/null
+++ b/seed/math-challenges/33-geometry/the-distance-formula.json
@@ -0,0 +1,84 @@
+{
+  "name": "The Distance Formula",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5783b507",
+      "title": "Introduction to the Distance Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac59a3a348",
+      "title": "Distance and Triangle Classification Using the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a349",
+      "title": "Distance Formula and the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a350",
+      "title": "Distance Between Parallel Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a351",
+      "title": "The Distance Formula and Algebra",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a352",
+      "title": "Applications of the Distance Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/translations.json b/seed/math-challenges/33-geometry/translations.json
new file mode 100644
index 0000000000..0a148dc7b4
--- /dev/null
+++ b/seed/math-challenges/33-geometry/translations.json
@@ -0,0 +1,58 @@
+{
+  "name": "Translations",
+  "order": 34,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b523",
+      "title": "Geometric Translation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a429",
+      "title": "Sliding Figures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a430",
+      "title": "Translation Notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a431",
+      "title": "Translation Applications in Circle Similarity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/transversals.json b/seed/math-challenges/33-geometry/transversals.json
new file mode 100644
index 0000000000..2c44c64c4b
--- /dev/null
+++ b/seed/math-challenges/33-geometry/transversals.json
@@ -0,0 +1,84 @@
+{
+  "name": "Transversals",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b501",
+      "title": "Parallel Lines and Transversals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a302",
+      "title": "Corresponding Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a303",
+      "title": "Alternate Interior Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a304",
+      "title": "Alternate Exterior Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a305",
+      "title": "Same Side Interior Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a306",
+      "title": "Angles and Perpendicular Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/triangle-area-and-perimeter.json b/seed/math-challenges/33-geometry/triangle-area-and-perimeter.json
new file mode 100644
index 0000000000..ec931c59c6
--- /dev/null
+++ b/seed/math-challenges/33-geometry/triangle-area-and-perimeter.json
@@ -0,0 +1,45 @@
+{
+  "name": "Triangle Area and Perimeter",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b504",
+      "title": "Area and Perimeter of Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a316",
+      "title": "Triangle Area",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a317",
+      "title": "Unknown Dimensions of Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/triangle-congruency.json b/seed/math-challenges/33-geometry/triangle-congruency.json
new file mode 100644
index 0000000000..4f8f1d76d6
--- /dev/null
+++ b/seed/math-challenges/33-geometry/triangle-congruency.json
@@ -0,0 +1,110 @@
+{
+  "name": "Triangle Congruency",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b505",
+      "title": "CPCTC",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a319",
+      "title": "Congruence Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a320",
+      "title": "Third Angle Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a321",
+      "title": "Congruent Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a322",
+      "title": "SSS",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a323",
+      "title": "SAS",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a324",
+      "title": "ASA and AAS",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a325",
+      "title": "HL",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/triangle-proportionality.json b/seed/math-challenges/33-geometry/triangle-proportionality.json
new file mode 100644
index 0000000000..823761cf2c
--- /dev/null
+++ b/seed/math-challenges/33-geometry/triangle-proportionality.json
@@ -0,0 +1,71 @@
+{
+  "name": "Triangle Proportionality",
+  "order": 30,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b520",
+      "title": "Proportional Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a416",
+      "title": "Inscribed Similar Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a417",
+      "title": "Parallel Lines, Transversals, and Proportionality",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a418",
+      "title": "Proportions and Angle Bisectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a419",
+      "title": "Theorems Involving Similarity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/triangle-relationships.json b/seed/math-challenges/33-geometry/triangle-relationships.json
new file mode 100644
index 0000000000..a32434568d
--- /dev/null
+++ b/seed/math-challenges/33-geometry/triangle-relationships.json
@@ -0,0 +1,149 @@
+{
+  "name": "Triangle Relationships",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b506",
+      "title": "Triangle Angle Sum Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a327",
+      "title": "Exterior Angles and Theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a328",
+      "title": "Midsegment Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a329",
+      "title": "Perpendicular Bisectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a330",
+      "title": "Angle Bisectors in Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a331",
+      "title": "Concurrence and Constructions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a332",
+      "title": "Medians",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a333",
+      "title": "Altitudes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a334",
+      "title": "Comparing Angles and Sides in Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a335",
+      "title": "Triangle Inequality Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a336",
+      "title": "Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/33-geometry/triangle-similarity.json b/seed/math-challenges/33-geometry/triangle-similarity.json
new file mode 100644
index 0000000000..a483214fcf
--- /dev/null
+++ b/seed/math-challenges/33-geometry/triangle-similarity.json
@@ -0,0 +1,45 @@
+{
+  "name": "Triangle Similarity",
+  "order": 29,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b519",
+      "title": "AA Similarity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a413",
+      "title": "SSS Similarity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a414",
+      "title": "SAS Similarity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/area-of-non-right-triangles.json b/seed/math-challenges/34-trigonometry/area-of-non-right-triangles.json
new file mode 100644
index 0000000000..d9a6ffc5b1
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/area-of-non-right-triangles.json
@@ -0,0 +1,71 @@
+{
+  "name": "Area of Non-Right Triangles",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b548",
+      "title": "Area Formula for Non-Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a573",
+      "title": "Introduction to the Triangle Area Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a574",
+      "title": "Determination of Unknown Triangle Measures Given Area",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a575",
+      "title": "Heron's Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a576",
+      "title": "General Solutions of Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/basic-trig-identity-applications.json b/seed/math-challenges/34-trigonometry/basic-trig-identity-applications.json
new file mode 100644
index 0000000000..64dae92b61
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/basic-trig-identity-applications.json
@@ -0,0 +1,110 @@
+{
+  "name": "Basic Trig Identity Applications",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b544",
+      "title": "Trig Identities to Find Exact Trigonometric Values",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a538",
+      "title": "Simplifying Trigonometric Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a539",
+      "title": "Proofs of Trigonometric Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a540",
+      "title": "Simpler Form of Trigonometric Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a541",
+      "title": "Solving Trigonometric Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a542",
+      "title": "Solving Trigonometric Equations Using Basic Algebra",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a543",
+      "title": "Trigonometric Equations Using the Quadratic Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a544",
+      "title": "Trigonometric Equations Using Factoring",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/double-and-half-angle-identities.json b/seed/math-challenges/34-trigonometry/double-and-half-angle-identities.json
new file mode 100644
index 0000000000..183a9439ca
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/double-and-half-angle-identities.json
@@ -0,0 +1,84 @@
+{
+  "name": "Double and Half Angle Identities",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b546",
+      "title": "Double and Half Angle Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a554",
+      "title": "Double Angle Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a555",
+      "title": "Simplifying Trigonometric Expressions with Double-Angle Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a556",
+      "title": "Solving Equations with Double-Angle Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a557",
+      "title": "Half Angle Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a558",
+      "title": "Trigonometric Equations Using Half Angle Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/introduction-to-trigonometry.json b/seed/math-challenges/34-trigonometry/introduction-to-trigonometry.json
new file mode 100644
index 0000000000..eb9c2c7388
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/introduction-to-trigonometry.json
@@ -0,0 +1,162 @@
+{
+  "name": "Introduction to Trigonometry",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b534",
+      "title": "Right triangles and the Pythagorean theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a467",
+      "title": "Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a468",
+      "title": "Converse of the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a469",
+      "title": "Pythagorean Triples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a470",
+      "title": "Applications Using the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a471",
+      "title": "The Pythagorean Theorem for Area and Perimeter",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a472",
+      "title": "Distance Formula and the Pythagorean Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a473",
+      "title": "Pythagorean Theorem to Classify Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a474",
+      "title": "Special Right Triangles and Ratios",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a475",
+      "title": "45-45-90 Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a476",
+      "title": "30-60-90 Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a477",
+      "title": "Trigonometric Ratios",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/inverse-trigonometric-functions.json b/seed/math-challenges/34-trigonometry/inverse-trigonometric-functions.json
new file mode 100644
index 0000000000..60d3c36548
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/inverse-trigonometric-functions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Inverse Trigonometric Functions",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b538",
+      "title": "Inverse Trig Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a503",
+      "title": "Inverses by Mapping",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a504",
+      "title": "Composition of Trig Functions and Their Inverses",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a505",
+      "title": "Definition of Inverse Reciprocal Trig Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a506",
+      "title": "Composition of Inverse Reciprocal Trig Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a507",
+      "title": "Trig Functions as Algebra Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/non-right-triangle-trigonometry.json b/seed/math-challenges/34-trigonometry/non-right-triangle-trigonometry.json
new file mode 100644
index 0000000000..85e3fc098c
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/non-right-triangle-trigonometry.json
@@ -0,0 +1,136 @@
+{
+  "name": "Non-Right Triangle Trigonometry",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6adac5983b548",
+      "title": "Laws of Sines and Cosines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a563",
+      "title": "Law of Sines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a564",
+      "title": "Angle-Angle-Side Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a565",
+      "title": "Angle-Side-Angle Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a566",
+      "title": "Side-Side-Angle: The Ambiguous Case",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a567",
+      "title": "Law of Cosines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a568",
+      "title": "Determination of Unknown Angles Using Law of Cosines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a569",
+      "title": "Identify Accurate Drawings of Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a570",
+      "title": "Applications of the Law of Cosines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a571",
+      "title": "Trigonometry Word Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/polar-curves-and-rectangular-conversions.json b/seed/math-challenges/34-trigonometry/polar-curves-and-rectangular-conversions.json
new file mode 100644
index 0000000000..c7fdb53db1
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/polar-curves-and-rectangular-conversions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Polar Curves and Rectangular Conversions",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b550",
+      "title": " Polar and Rectangular Conversions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a583",
+      "title": " Rectangular to Polar Conversions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a584",
+      "title": " Rectangular to Polar Form for Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a585",
+      "title": " Intersections of Polar Curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a586",
+      "title": " Equivalent Polar Curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a587",
+      "title": " Systems of Polar Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/radians.json b/seed/math-challenges/34-trigonometry/radians.json
new file mode 100644
index 0000000000..8fb80d6c4e
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/radians.json
@@ -0,0 +1,110 @@
+{
+  "name": "Radians",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b539",
+      "title": "Radian Measure",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a509",
+      "title": "Conversion between Degrees and Radians",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a510",
+      "title": "Trig Functions and Radians with Technology",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a511",
+      "title": "Rotations in Radians",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a512",
+      "title": "Angular Velocity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a513",
+      "title": "Length of an Arc",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a514",
+      "title": "Area of a Sector",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a515",
+      "title": "Length of a Chord",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/sine-and-cosine-graphs.json b/seed/math-challenges/34-trigonometry/sine-and-cosine-graphs.json
new file mode 100644
index 0000000000..2e060ff5e8
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/sine-and-cosine-graphs.json
@@ -0,0 +1,123 @@
+{
+  "name": "Sine and Cosine Graphs",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b540",
+      "title": "Sine Graph and Cosine Graph",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a517",
+      "title": "Translating Sine and Cosine Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a518",
+      "title": "Vertical Translations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a519",
+      "title": "Horizontal Translations or Phase Shifts",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a520",
+      "title": "Amplitude, Period, and Frequency",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a521",
+      "title": "Amplitude",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a522",
+      "title": "Period and Frequency",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a523",
+      "title": "Trigonometric Identities and Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a524",
+      "title": "General Sinusoidal Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/six-trig-function-graphs.json b/seed/math-challenges/34-trigonometry/six-trig-function-graphs.json
new file mode 100644
index 0000000000..0526cec665
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/six-trig-function-graphs.json
@@ -0,0 +1,84 @@
+{
+  "name": "Six Trig Function Graphs",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b541",
+      "title": "Graphing Tangent, Cotangent, Secant and Cosecant",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a526",
+      "title": "Tangent Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a527",
+      "title": "Tangent and Cotangent Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a528",
+      "title": "Sine and Cosecant Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a529",
+      "title": "Cosine and Secant Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a530",
+      "title": "Graph Inverse Trigonometric Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/solving-triangles.json b/seed/math-challenges/34-trigonometry/solving-triangles.json
new file mode 100644
index 0000000000..b55def2867
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/solving-triangles.json
@@ -0,0 +1,97 @@
+{
+  "name": "Solving Triangles",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b536",
+      "title": "The Pythagorean Theorem and Trigonometry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a486",
+      "title": "Trig Function Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a487",
+      "title": "Angles of Elevation and Depression",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a488",
+      "title": "Right Triangles and Bearings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a489",
+      "title": "Solve Right Triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a490",
+      "title": "Applications of Inverse Trigonometric Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a491",
+      "title": "Inverse Trig Functions using Algebra",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/sum-and-difference-identities.json b/seed/math-challenges/34-trigonometry/sum-and-difference-identities.json
new file mode 100644
index 0000000000..4f246d32f4
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/sum-and-difference-identities.json
@@ -0,0 +1,110 @@
+{
+  "name": "Sum and Difference Identities",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b545",
+      "title": "Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a546",
+      "title": "Simplifying Trigonometric Expressions using Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a547",
+      "title": "Sine Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a548",
+      "title": "Cosine Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a549",
+      "title": "Tangent Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a550",
+      "title": "Solving Trigonometric Equations using Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a551",
+      "title": "Finding Exact Trigonometric Values Using Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a552",
+      "title": "Applications of Sum and Difference Formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/sum-to-product-and-triple-angle-formulas.json b/seed/math-challenges/34-trigonometry/sum-to-product-and-triple-angle-formulas.json
new file mode 100644
index 0000000000..0df060e2fe
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/sum-to-product-and-triple-angle-formulas.json
@@ -0,0 +1,45 @@
+{
+  "name": "Sum to Product and Triple Angle Formulas",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b547",
+      "title": "Sum to Product Formulas for Sine and Cosine",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a560",
+      "title": "Product to Sum Formulas for Sine and Cosine",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a561",
+      "title": "Triple-Angle Formulas and Linear Combinations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/the-polar-coordinate-system-and-graphing.json b/seed/math-challenges/34-trigonometry/the-polar-coordinate-system-and-graphing.json
new file mode 100644
index 0000000000..95a88c7938
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/the-polar-coordinate-system-and-graphing.json
@@ -0,0 +1,71 @@
+{
+  "name": "The Polar Coordinate System and Graphing",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b549",
+      "title": " Plots of Polar Coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a578",
+      "title": " Distance Between Two Polar Coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a579",
+      "title": " Graph Polar Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a580",
+      "title": " Transformations of Polar Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a581",
+      "title": " Special Polar Equations and Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/trig-functions.json b/seed/math-challenges/34-trigonometry/trig-functions.json
new file mode 100644
index 0000000000..3fda7f46e4
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/trig-functions.json
@@ -0,0 +1,97 @@
+{
+  "name": "Trig Functions",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b535",
+      "title": "Right Triangle Trigonometry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a479",
+      "title": "Calculator Trig Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a480",
+      "title": "SIN",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a481",
+      "title": "COS",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a482",
+      "title": "Sine and Cosine of Complementary Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a483",
+      "title": "TAN",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a484",
+      "title": "SEC CSC COT",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/trig-in-the-unit-circle.json b/seed/math-challenges/34-trigonometry/trig-in-the-unit-circle.json
new file mode 100644
index 0000000000..66bc2f8356
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/trig-in-the-unit-circle.json
@@ -0,0 +1,136 @@
+{
+  "name": "Trig in the Unit Circle",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b537",
+      "title": "Trigonometry and the Unit Circle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a493",
+      "title": "Measuring Rotation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a494",
+      "title": "Angles of Rotation in Standard Positions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a495",
+      "title": "Coterminal Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a496",
+      "title": "Signs of Trigonometric Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a497",
+      "title": "Trigonometric Functions and Angles of Rotation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a498",
+      "title": "Reference Angles and Angles in the Unit Circle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a499",
+      "title": "Trigonometric Functions of Negative Angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a500",
+      "title": "Trigonometric Functions of Angles Greater than 360 Degrees",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a501",
+      "title": "Exact Values for Inverse Sine, Cosine, and Tangent",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/34-trigonometry/trigonometric-identities.json b/seed/math-challenges/34-trigonometry/trigonometric-identities.json
new file mode 100644
index 0000000000..e19ce7cc54
--- /dev/null
+++ b/seed/math-challenges/34-trigonometry/trigonometric-identities.json
@@ -0,0 +1,84 @@
+{
+  "name": "Trigonometric Identities",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b543",
+      "title": "Fundamental Trigonometric Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a532",
+      "title": "Quotient Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a533",
+      "title": "Reciprocal Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a534",
+      "title": "Pythagorean Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a535",
+      "title": "Even and Odd Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a536",
+      "title": "Cofunction Identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/35-complex-numbers/introduction-to-complex-numbers.json b/seed/math-challenges/35-complex-numbers/introduction-to-complex-numbers.json
new file mode 100644
index 0000000000..4bb795f528
--- /dev/null
+++ b/seed/math-challenges/35-complex-numbers/introduction-to-complex-numbers.json
@@ -0,0 +1,162 @@
+{
+  "name": "Introduction to Complex Numbers",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b551",
+      "title": "Imaginary and Complex Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a589",
+      "title": "Imaginary Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a590",
+      "title": "The Complex Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a591",
+      "title": "Quadratic Formula and Complex Sums",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a592",
+      "title": "Products and Quotients of Complex Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a593",
+      "title": "Product and Quotient Theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a594",
+      "title": "Trigonometric Form of Complex Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a595",
+      "title": "Polar Form of a Complex Number",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a596",
+      "title": "DeMoivre's Theorem and nth Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a597",
+      "title": "DeMoivre's Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a598",
+      "title": "Equations Using DeMoivre's Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a599",
+      "title": "Geometry of Complex Roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/analytic-geometry.json b/seed/math-challenges/36-precalculus/analytic-geometry.json
new file mode 100644
index 0000000000..2426860dcb
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/analytic-geometry.json
@@ -0,0 +1,97 @@
+{
+  "name": "Analytic Geometry",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b561",
+      "title": "Parabolas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a661",
+      "title": "Ellipses",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a662",
+      "title": "Hyperbolas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a663",
+      "title": "Shifted Conics",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a664",
+      "title": "Rotation of axes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a665",
+      "title": "Polar equations of conics",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a666",
+      "title": "Plane curves and parametric equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/analytic-trigonometry.json b/seed/math-challenges/36-precalculus/analytic-trigonometry.json
new file mode 100644
index 0000000000..7a47f9fe75
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/analytic-trigonometry.json
@@ -0,0 +1,71 @@
+{
+  "name": "Analytic Trigonometry",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b558",
+      "title": "Trigonometric identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a641",
+      "title": "Addition and subtraction formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a642",
+      "title": "Double-angle, half-angle, and sum-product formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a643",
+      "title": "Inverse trigonometric functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a644",
+      "title": "Trigonometric equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/exponential-and-logarithmic-functions.json b/seed/math-challenges/36-precalculus/exponential-and-logarithmic-functions.json
new file mode 100644
index 0000000000..1b687e667e
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/exponential-and-logarithmic-functions.json
@@ -0,0 +1,71 @@
+{
+  "name": "Exponential and logarithmic functions",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b555",
+      "title": "Exponential functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a627",
+      "title": "Logarithmic functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a628",
+      "title": "Laws of Logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a629",
+      "title": "Exponential and Logarithmic equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a630",
+      "title": "Modeling with exponential and logarithmic equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/functions.json b/seed/math-challenges/36-precalculus/functions.json
new file mode 100644
index 0000000000..bc56e75146
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/functions.json
@@ -0,0 +1,136 @@
+{
+  "name": "Functions",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b553",
+      "title": "What is a function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a611",
+      "title": "Graphs of functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a612",
+      "title": "Increase and decreasing functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a613",
+      "title": "Average rate of change",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a614",
+      "title": "Transformations of functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a615",
+      "title": "Quadratic functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a616",
+      "title": "Maxima and minima",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a617",
+      "title": "Modeling with functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a618",
+      "title": "Combining functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a619",
+      "title": "One-to-one functions and their inverses",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/fundamentals.json b/seed/math-challenges/36-precalculus/fundamentals.json
new file mode 100644
index 0000000000..9a5e553e10
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/fundamentals.json
@@ -0,0 +1,136 @@
+{
+  "name": "Fundamentals",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b552",
+      "title": "Real numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a601",
+      "title": "Exponents and radicals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a602",
+      "title": "Algebraic Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a603",
+      "title": "Rational Expressions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a604",
+      "title": "Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a605",
+      "title": "Modeling with equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a606",
+      "title": "Inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a607",
+      "title": "Coordinate Geometry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a608",
+      "title": "Lines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a609",
+      "title": "Modeling variation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/polar-coordinates-and-vectors.json b/seed/math-challenges/36-precalculus/polar-coordinates-and-vectors.json
new file mode 100644
index 0000000000..ce48a99b1b
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/polar-coordinates-and-vectors.json
@@ -0,0 +1,84 @@
+{
+  "name": "Polar Coordinates and Vectors",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b559",
+      "title": "Polar coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a646",
+      "title": "Graphs of polar equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a647",
+      "title": "Polar form of complex numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a648",
+      "title": "Demoivre's theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a649",
+      "title": "Vectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a650",
+      "title": "Dot Product",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/polynomial-and-rational-functions.json b/seed/math-challenges/36-precalculus/polynomial-and-rational-functions.json
new file mode 100644
index 0000000000..b1c37e02a7
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/polynomial-and-rational-functions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Polynomial and Rational functions",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b554",
+      "title": "Polynomial functions and graphing them",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a621",
+      "title": "Dividing polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a622",
+      "title": "Real zeros of polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a623",
+      "title": "Complex numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a624",
+      "title": "Complex zeros and fundamental theorem of algebra",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a625",
+      "title": "Rational functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/sequences-and-series.json b/seed/math-challenges/36-precalculus/sequences-and-series.json
new file mode 100644
index 0000000000..c6421917df
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/sequences-and-series.json
@@ -0,0 +1,71 @@
+{
+  "name": "Sequences and series",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b562",
+      "title": "Sequences and summation notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a668",
+      "title": "Arithmetic sequences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a669",
+      "title": "Geometric sequences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a670",
+      "title": "Mathematical induction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a671",
+      "title": "Binomial theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/systems-of-equations-and-inequalities.json b/seed/math-challenges/36-precalculus/systems-of-equations-and-inequalities.json
new file mode 100644
index 0000000000..f49dc34ee5
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/systems-of-equations-and-inequalities.json
@@ -0,0 +1,123 @@
+{
+  "name": "Systems of equations and inequalities",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b560",
+      "title": "Systems of equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a652",
+      "title": "Systems of linear equations in two variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a653",
+      "title": "Systems of linear equations in several variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a654",
+      "title": "Systems of linear equations in matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a655",
+      "title": "Algebra of matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a656",
+      "title": "Inverses of matrices and matrix equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a657",
+      "title": "Determinants and Cramer's rule",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a658",
+      "title": "Partial fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a659",
+      "title": "Systems of inequalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/trigonometric-functions-of-angles.json b/seed/math-challenges/36-precalculus/trigonometric-functions-of-angles.json
new file mode 100644
index 0000000000..3d58b6b9a2
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/trigonometric-functions-of-angles.json
@@ -0,0 +1,71 @@
+{
+  "name": "Trigonometric Functions of Angles",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b557",
+      "title": "Angle measure",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a636",
+      "title": "Trigonometry of right triangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a637",
+      "title": "Trigonometric functions of angles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a638",
+      "title": "Law of sines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a639",
+      "title": "Law of cosines",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/36-precalculus/trigonometric-functions-of-real-numbers.json b/seed/math-challenges/36-precalculus/trigonometric-functions-of-real-numbers.json
new file mode 100644
index 0000000000..0ff1f0036e
--- /dev/null
+++ b/seed/math-challenges/36-precalculus/trigonometric-functions-of-real-numbers.json
@@ -0,0 +1,58 @@
+{
+  "name": "Trigonometric Functions of Real Numbers",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b556",
+      "title": "Unit Circle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a632",
+      "title": "Trigonometric Functions of Real Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a633",
+      "title": "Trigonometric Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a634",
+      "title": "Modeling Harmonic Motion",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/applications-of-differentiation.json b/seed/math-challenges/37-single-variable-calculus/applications-of-differentiation.json
new file mode 100644
index 0000000000..75aa2fdf0e
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/applications-of-differentiation.json
@@ -0,0 +1,97 @@
+{
+  "name": "Applications of Differentiation",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b566",
+      "title": "Max and min values",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a695",
+      "title": "Mean value theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a696",
+      "title": "How derivatives affect the shape of a graph",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a697",
+      "title": "Indeterminate form and l'Hospital's rule",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a698",
+      "title": "Optimization Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a699",
+      "title": "Newton's method",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a700",
+      "title": "Antiderivatives",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/applications-of-integration.json b/seed/math-challenges/37-single-variable-calculus/applications-of-integration.json
new file mode 100644
index 0000000000..47d43dd257
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/applications-of-integration.json
@@ -0,0 +1,58 @@
+{
+  "name": "Applications of Integration",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b568",
+      "title": "Areas between curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a707",
+      "title": "Volumes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a708",
+      "title": "Volumes by cylindrical shells",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a709",
+      "title": "Average value of a function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/differential-equations.json b/seed/math-challenges/37-single-variable-calculus/differential-equations.json
new file mode 100644
index 0000000000..0028a7dd71
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/differential-equations.json
@@ -0,0 +1,71 @@
+{
+  "name": "Differential Equations",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b571",
+      "title": "Modeling with differential equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a722",
+      "title": "Direction fields and Euler's method",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a723",
+      "title": "Separable equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a724",
+      "title": "Models for population growth",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a725",
+      "title": "Linear equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/differentiation.json b/seed/math-challenges/37-single-variable-calculus/differentiation.json
new file mode 100644
index 0000000000..c3b358b7ad
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/differentiation.json
@@ -0,0 +1,136 @@
+{
+  "name": "Differentiation",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b565",
+      "title": "Derivatives of polynomials and exponential functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a685",
+      "title": "Product and quotient rules",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a686",
+      "title": "Derivatives of trigonometric functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a687",
+      "title": "Chain rule",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a688",
+      "title": "Implicit differentiation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a689",
+      "title": "Derivatives of logarithmic functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a690",
+      "title": "Exponential growth and decay",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a691",
+      "title": "Linear approximations and differentials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a692",
+      "title": "Taylor polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a693",
+      "title": "Hyperbolic functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/functions-and-models.json b/seed/math-challenges/37-single-variable-calculus/functions-and-models.json
new file mode 100644
index 0000000000..aea609ac54
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/functions-and-models.json
@@ -0,0 +1,71 @@
+{
+  "name": "Functions and Models",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b563",
+      "title": "Ways to represent a functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a673",
+      "title": "Essential functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a674",
+      "title": "New functions from old functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a675",
+      "title": "Exponential functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a676",
+      "title": "Inverse functions and logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/further-applications-of-integration.json b/seed/math-challenges/37-single-variable-calculus/further-applications-of-integration.json
new file mode 100644
index 0000000000..3915945673
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/further-applications-of-integration.json
@@ -0,0 +1,58 @@
+{
+  "name": "Further applications of Integration",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b570",
+      "title": "Arc length",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a718",
+      "title": "Area of a surface of revolution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a719",
+      "title": "Applications to physics,engineering, economics, or biology",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a720",
+      "title": "Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/infinite-sequences-and-series.json b/seed/math-challenges/37-single-variable-calculus/infinite-sequences-and-series.json
new file mode 100644
index 0000000000..fb15937862
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/infinite-sequences-and-series.json
@@ -0,0 +1,149 @@
+{
+  "name": "Infinite Sequences and Series",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b574",
+      "title": "Sequences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a731",
+      "title": "Series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a732",
+      "title": "Integral test and estimates of sum",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a733",
+      "title": "Comparison tests",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a734",
+      "title": "alternating seres",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a735",
+      "title": "Absolute convergence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a736",
+      "title": "Ratio test and root test",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a737",
+      "title": "Power series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a738",
+      "title": "Representing functions as power series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a739",
+      "title": "Taylor and Maclaurin series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a740",
+      "title": "Applications of Taylor polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/integrals.json b/seed/math-challenges/37-single-variable-calculus/integrals.json
new file mode 100644
index 0000000000..70a0cad9b8
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/integrals.json
@@ -0,0 +1,71 @@
+{
+  "name": "Integrals",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b567",
+      "title": "Areas and distances",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a702",
+      "title": "Definite integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a703",
+      "title": "Fundamental theorem of calculus",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a704",
+      "title": "Indefinite integrals and the Net change theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a705",
+      "title": "Substitution rule",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/limits-and-derivatives.json b/seed/math-challenges/37-single-variable-calculus/limits-and-derivatives.json
new file mode 100644
index 0000000000..457fcba25d
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/limits-and-derivatives.json
@@ -0,0 +1,97 @@
+{
+  "name": "Limits and Derivatives",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b564",
+      "title": "Limit of a functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a678",
+      "title": "Calculating limits using the limit laws",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a679",
+      "title": "Precise definition of a limit",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a680",
+      "title": "Continuity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a681",
+      "title": "Limits at infinity: horizontal asymptotes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a682",
+      "title": "Derivatives and rates of change",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a683",
+      "title": "Derivative as a function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/parametric-equations.json b/seed/math-challenges/37-single-variable-calculus/parametric-equations.json
new file mode 100644
index 0000000000..b32aa97da2
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/parametric-equations.json
@@ -0,0 +1,32 @@
+{
+  "name": "Parametric Equations",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b572",
+      "title": "Curves defined by parametric equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a727",
+      "title": "Calculus with parametric curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/polar-coordinates.json b/seed/math-challenges/37-single-variable-calculus/polar-coordinates.json
new file mode 100644
index 0000000000..5cb7f555f9
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/polar-coordinates.json
@@ -0,0 +1,32 @@
+{
+  "name": "Polar Coordinates",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b573",
+      "title": "Areas and lengths in polar coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a729",
+      "title": "Conic sections in polar coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/37-single-variable-calculus/techniques-of-integration.json b/seed/math-challenges/37-single-variable-calculus/techniques-of-integration.json
new file mode 100644
index 0000000000..ed99b1e4b4
--- /dev/null
+++ b/seed/math-challenges/37-single-variable-calculus/techniques-of-integration.json
@@ -0,0 +1,97 @@
+{
+  "name": "Techniques of Integration",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b569",
+      "title": "Integration by parts",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a711",
+      "title": "Trigonometric integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a712",
+      "title": "Trigonometric Substitution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a713",
+      "title": "Integration of rational functions by partial fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a714",
+      "title": "Strategy for integration",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a715",
+      "title": "Approximate integration",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a716",
+      "title": "Improper integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/38-multivariable-calculus/multiple-integrals.json b/seed/math-challenges/38-multivariable-calculus/multiple-integrals.json
new file mode 100644
index 0000000000..4cee369810
--- /dev/null
+++ b/seed/math-challenges/38-multivariable-calculus/multiple-integrals.json
@@ -0,0 +1,136 @@
+{
+  "name": "Multiple Integrals",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b578",
+      "title": "Double integrals over rectangles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a760",
+      "title": "Iterated integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a761",
+      "title": "Double integrals over general regions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a762",
+      "title": "Double integrals in polar coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a763",
+      "title": "Application of double integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a764",
+      "title": "Surface area",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a765",
+      "title": "Triple integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a766",
+      "title": "Triple integrals in cylindrical coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a767",
+      "title": "Triple integrals in spherical coordinates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a768",
+      "title": "Change of variables in multiple integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/38-multivariable-calculus/partial-derivatives.json b/seed/math-challenges/38-multivariable-calculus/partial-derivatives.json
new file mode 100644
index 0000000000..b51bd91dfb
--- /dev/null
+++ b/seed/math-challenges/38-multivariable-calculus/partial-derivatives.json
@@ -0,0 +1,110 @@
+{
+  "name": "Partial derivatives",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b577",
+      "title": "Functions of several variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a752",
+      "title": "Limits and continuity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a753",
+      "title": "Partial derivatives",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a754",
+      "title": "Tangent planes and linear approximations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a755",
+      "title": "Chain rule",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a756",
+      "title": "Directional derivatives and the gradient vector",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a757",
+      "title": "Maximum and minimum values",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a758",
+      "title": "Lagrange multipliers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/38-multivariable-calculus/second-order-differential-equations.json b/seed/math-challenges/38-multivariable-calculus/second-order-differential-equations.json
new file mode 100644
index 0000000000..4a2b07d24f
--- /dev/null
+++ b/seed/math-challenges/38-multivariable-calculus/second-order-differential-equations.json
@@ -0,0 +1,58 @@
+{
+  "name": "Second-Order Differential Equations",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b580",
+      "title": "Second-Order Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a779",
+      "title": "Nonhomogenous linear equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a780",
+      "title": "Applications of second-order differential eqatuions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a781",
+      "title": "Series Solutions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/38-multivariable-calculus/vector-calculus.json b/seed/math-challenges/38-multivariable-calculus/vector-calculus.json
new file mode 100644
index 0000000000..09afc7148a
--- /dev/null
+++ b/seed/math-challenges/38-multivariable-calculus/vector-calculus.json
@@ -0,0 +1,123 @@
+{
+  "name": "Vector Calculus",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b579",
+      "title": "Vector Fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a770",
+      "title": "Line integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a771",
+      "title": "Fundamental theorem for line integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a772",
+      "title": "Green's theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a773",
+      "title": "Curl and divergence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a774",
+      "title": "Parametric surfaces and their areas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a775",
+      "title": "Surface integrals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a776",
+      "title": "Stoke's Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a777",
+      "title": "Divergence Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/38-multivariable-calculus/vector-functions.json b/seed/math-challenges/38-multivariable-calculus/vector-functions.json
new file mode 100644
index 0000000000..9d69fb305f
--- /dev/null
+++ b/seed/math-challenges/38-multivariable-calculus/vector-functions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Vector Functions",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b576",
+      "title": "Vectors functions and space curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a748",
+      "title": "Derivatives and integrals of vector functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a749",
+      "title": "Arc length and curvature",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a750",
+      "title": "Velocity and acceleration",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/38-multivariable-calculus/vectors-and-the-geometry-of-space.json b/seed/math-challenges/38-multivariable-calculus/vectors-and-the-geometry-of-space.json
new file mode 100644
index 0000000000..6c3999dc7e
--- /dev/null
+++ b/seed/math-challenges/38-multivariable-calculus/vectors-and-the-geometry-of-space.json
@@ -0,0 +1,84 @@
+{
+  "name": "Vectors and the geometry of space",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b575",
+      "title": "3d coordinate system",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a742",
+      "title": "Vectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a743",
+      "title": "Dot Product",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a744",
+      "title": "Cross Product",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a745",
+      "title": "Equations of lines and planes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a746",
+      "title": "Cylinders and quadric surfaces",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/determinants.json b/seed/math-challenges/39-linear-algebra/determinants.json
new file mode 100644
index 0000000000..44f44a3d1f
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/determinants.json
@@ -0,0 +1,32 @@
+{
+  "name": "Determinants",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b584",
+      "title": "Determinant of a matrix",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a807",
+      "title": "Properties of determinants of matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/eigenvalues.json b/seed/math-challenges/39-linear-algebra/eigenvalues.json
new file mode 100644
index 0000000000..a258c40c07
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/eigenvalues.json
@@ -0,0 +1,45 @@
+{
+  "name": "Eigenvalues",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b585",
+      "title": "Eigenvalues and eigenvectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a809",
+      "title": "Properties of eigenvalues and eigenvectors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a810",
+      "title": "Similarity and diagonalization",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/linear-transformations.json b/seed/math-challenges/39-linear-algebra/linear-transformations.json
new file mode 100644
index 0000000000..ea65bf584b
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/linear-transformations.json
@@ -0,0 +1,58 @@
+{
+  "name": "Linear Transformations",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b586",
+      "title": "Linear transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a812",
+      "title": "Injective linear transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a813",
+      "title": "Surjective linear transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a814",
+      "title": "Invertible linear transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/matrices.json b/seed/math-challenges/39-linear-algebra/matrices.json
new file mode 100644
index 0000000000..973cdb9a77
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/matrices.json
@@ -0,0 +1,84 @@
+{
+  "name": "Matrices",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b582",
+      "title": "Matrix operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a795",
+      "title": "Matrix multiplication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a796",
+      "title": "Matrix inverses and systems of linear equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a797",
+      "title": "Matrix inverses and nonsingular matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a798",
+      "title": "Column and row spaces",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a799",
+      "title": "The four subsets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/representations.json b/seed/math-challenges/39-linear-algebra/representations.json
new file mode 100644
index 0000000000..9c81170759
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/representations.json
@@ -0,0 +1,58 @@
+{
+  "name": "Representations",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b587",
+      "title": "Vector representations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a816",
+      "title": "Matrix representations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a817",
+      "title": "Change of basis",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a818",
+      "title": "Orthonormal Diagonalization",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/systems-of-linear-equations.json b/seed/math-challenges/39-linear-algebra/systems-of-linear-equations.json
new file mode 100644
index 0000000000..0ca41ecdbf
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/systems-of-linear-equations.json
@@ -0,0 +1,84 @@
+{
+  "name": "Systems of linear equations",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b581",
+      "title": "What is linear algebra?",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a783",
+      "title": "Solving systems of linear equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a784",
+      "title": "Reduced row-echelon formulas",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a785",
+      "title": "Types of solutions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a786",
+      "title": "Homogeneous Systems of Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a787",
+      "title": "Nonsingular matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/vector-spaces.json b/seed/math-challenges/39-linear-algebra/vector-spaces.json
new file mode 100644
index 0000000000..fdaa9c1f04
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/vector-spaces.json
@@ -0,0 +1,84 @@
+{
+  "name": "Vector spaces",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b583",
+      "title": "Vector spaces",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a801",
+      "title": "Subspaces",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a802",
+      "title": "Linear independence and spanning sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a803",
+      "title": "Bases",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a804",
+      "title": "Dimension",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a805",
+      "title": "Properties of Dimension",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/39-linear-algebra/vectors.json b/seed/math-challenges/39-linear-algebra/vectors.json
new file mode 100644
index 0000000000..a608ef0294
--- /dev/null
+++ b/seed/math-challenges/39-linear-algebra/vectors.json
@@ -0,0 +1,84 @@
+{
+  "name": "Vectors",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a580a209a6acac5983b582",
+      "title": "Vector Operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a789",
+      "title": "Linear combinations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a790",
+      "title": "Spanning sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a791",
+      "title": "Linear independence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a792",
+      "title": "Linear dependence and spans",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a793",
+      "title": "Orthogonality",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/boundary-value-problems-and-fourier-series.json b/seed/math-challenges/40-differential-equations/boundary-value-problems-and-fourier-series.json
new file mode 100644
index 0000000000..e212833993
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/boundary-value-problems-and-fourier-series.json
@@ -0,0 +1,97 @@
+{
+  "name": "Boundary Value Problems and Fourier Series",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b595",
+      "title": "Boundary Value Problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a869",
+      "title": "Eigenvalues and eigenfunctions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a870",
+      "title": "Periodic functions and orthogonal functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a871",
+      "title": "Fourier sine series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a872",
+      "title": "Fourier cosine series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a873",
+      "title": "Fourier series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a874",
+      "title": "Convergence of fourier series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/first-order-differential-equations.json b/seed/math-challenges/40-differential-equations/first-order-differential-equations.json
new file mode 100644
index 0000000000..bbd561008b
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/first-order-differential-equations.json
@@ -0,0 +1,123 @@
+{
+  "name": "First Order Differential Equations",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b589",
+      "title": "Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a822",
+      "title": "Separable Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a823",
+      "title": "Exact Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a824",
+      "title": "Bernoulli differential equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a825",
+      "title": "Substitutions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a826",
+      "title": "Intervals of validity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a827",
+      "title": "Modeling with first order differential equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a828",
+      "title": "Equilibrium solutions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a829",
+      "title": "Euler's method",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/higher-order-differential-equations.json b/seed/math-challenges/40-differential-equations/higher-order-differential-equations.json
new file mode 100644
index 0000000000..1e2089417e
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/higher-order-differential-equations.json
@@ -0,0 +1,97 @@
+{
+  "name": "Higher order Differential Equations",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b594",
+      "title": "Basic concepts for nth order linear equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a862",
+      "title": "Linear homogenous differential equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a863",
+      "title": "Undetermined coefficients",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a864",
+      "title": "variation of parameters",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a865",
+      "title": "laplace transforms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a866",
+      "title": "systems of differential equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a867",
+      "title": "series solutions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/introduction-to-differential-equations.json b/seed/math-challenges/40-differential-equations/introduction-to-differential-equations.json
new file mode 100644
index 0000000000..f0ab1cfac5
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/introduction-to-differential-equations.json
@@ -0,0 +1,32 @@
+{
+  "name": "Introduction to Differential Equations",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b588",
+      "title": "Definitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a820",
+      "title": "Direction Fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/laplace-transforms.json b/seed/math-challenges/40-differential-equations/laplace-transforms.json
new file mode 100644
index 0000000000..01145774cd
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/laplace-transforms.json
@@ -0,0 +1,136 @@
+{
+  "name": "Laplace Transforms",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b591",
+      "title": "Definition",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a842",
+      "title": "Laplace transform",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a843",
+      "title": "Inverse Laplace transform(IVP)",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a844",
+      "title": "Step functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a845",
+      "title": "Solving IVP's with Laplace transforms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a846",
+      "title": "Nonconstant coefficient IVP's",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a847",
+      "title": "IVP's with step functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a848",
+      "title": "Dirac Delta function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a849",
+      "title": "Convolution Integral",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a850",
+      "title": "Table of Laplace transforms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/partial-differential-equations.json b/seed/math-challenges/40-differential-equations/partial-differential-equations.json
new file mode 100644
index 0000000000..ff9bca3b1c
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/partial-differential-equations.json
@@ -0,0 +1,123 @@
+{
+  "name": "Partial Differential Equations",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b597",
+      "title": "Heat equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a876",
+      "title": "Wave equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a877",
+      "title": "Separation of variables terminology",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a878",
+      "title": "Separation of variables terminology - solving heat equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a879",
+      "title": "Heat equation with non-zero temperature boundaries",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a880",
+      "title": "Laplace's equation on a rectangle",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a881",
+      "title": "Laplace's equation on a disk",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a882",
+      "title": "Vibrating string",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a883",
+      "title": "Vibrating string - wave equation solution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/second-order-differential-equations.json b/seed/math-challenges/40-differential-equations/second-order-differential-equations.json
new file mode 100644
index 0000000000..7e47c54012
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/second-order-differential-equations.json
@@ -0,0 +1,149 @@
+{
+  "name": "Second order differential equations",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b590",
+      "title": "Basic concepts",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a831",
+      "title": "Real roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a832",
+      "title": "Complex roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a833",
+      "title": "Repeated roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a834",
+      "title": "Reduction of order",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a835",
+      "title": "Fundamental sets of solutions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a836",
+      "title": "More details about Wronskian",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a837",
+      "title": "Nonhomogenous differential equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a838",
+      "title": "Undetermined coefficients",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a839",
+      "title": "Variation of parameters",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a840",
+      "title": "Mechanical Vibrations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/series-solutions.json b/seed/math-challenges/40-differential-equations/series-solutions.json
new file mode 100644
index 0000000000..f0e1bbdd59
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/series-solutions.json
@@ -0,0 +1,32 @@
+{
+  "name": "Series Solutions",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b593",
+      "title": "constructing a series solutions ",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a860",
+      "title": "Euler equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/40-differential-equations/systems-of-differential-equations.json b/seed/math-challenges/40-differential-equations/systems-of-differential-equations.json
new file mode 100644
index 0000000000..3d58987cd1
--- /dev/null
+++ b/seed/math-challenges/40-differential-equations/systems-of-differential-equations.json
@@ -0,0 +1,110 @@
+{
+  "name": "Systems of Differential Equations",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b592",
+      "title": "Systems of differential equations basics",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a852",
+      "title": "Solutions to systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a853",
+      "title": "Phase plane",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a854",
+      "title": "Real eigenvalues",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a855",
+      "title": "complex eigenvalues",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a856",
+      "title": "repeated eigenvalues",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a857",
+      "title": "Nonhomogeneous systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a858",
+      "title": "Laplace transform to solve a system",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/cardinality-of-sets.json b/seed/math-challenges/41-proofs/cardinality-of-sets.json
new file mode 100644
index 0000000000..60e6b8bad3
--- /dev/null
+++ b/seed/math-challenges/41-proofs/cardinality-of-sets.json
@@ -0,0 +1,58 @@
+{
+  "name": "Cardinality of sets",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b610",
+      "title": "Sets with equal cardinalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a946",
+      "title": "Countable and uncountable sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a947",
+      "title": "Comparing cardinalities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a948",
+      "title": "The Cantor-Bernstein-Schroeder Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/contrapositive-proof.json b/seed/math-challenges/41-proofs/contrapositive-proof.json
new file mode 100644
index 0000000000..2523c015eb
--- /dev/null
+++ b/seed/math-challenges/41-proofs/contrapositive-proof.json
@@ -0,0 +1,45 @@
+{
+  "name": "Contrapositive Proof",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b602",
+      "title": "Contrapositive proof",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a915",
+      "title": "Congruence of integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a916",
+      "title": "Mathematical writing",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/counting.json b/seed/math-challenges/41-proofs/counting.json
new file mode 100644
index 0000000000..72e80f8ce5
--- /dev/null
+++ b/seed/math-challenges/41-proofs/counting.json
@@ -0,0 +1,71 @@
+{
+  "name": "Counting",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b600",
+      "title": "Counting lists",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a905",
+      "title": "Factorials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a906",
+      "title": "Counting subsets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a907",
+      "title": "Pascal's triangle and the binomial theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a908",
+      "title": "Inclusion-exclusion",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/direct-proof.json b/seed/math-challenges/41-proofs/direct-proof.json
new file mode 100644
index 0000000000..d8fd736b59
--- /dev/null
+++ b/seed/math-challenges/41-proofs/direct-proof.json
@@ -0,0 +1,71 @@
+{
+  "name": "Direct Proof",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b601",
+      "title": "Theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a910",
+      "title": "Definitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a911",
+      "title": "Direct Proof",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a912",
+      "title": "Using Cases",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a913",
+      "title": "Treating similar cases",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/disproof.json b/seed/math-challenges/41-proofs/disproof.json
new file mode 100644
index 0000000000..ecb61a5897
--- /dev/null
+++ b/seed/math-challenges/41-proofs/disproof.json
@@ -0,0 +1,45 @@
+{
+  "name": "Disproof",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b606",
+      "title": "Counterexamples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a929",
+      "title": "Disproving existence statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a930",
+      "title": "Disproof by contradiction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/functions.json b/seed/math-challenges/41-proofs/functions.json
new file mode 100644
index 0000000000..4874806f60
--- /dev/null
+++ b/seed/math-challenges/41-proofs/functions.json
@@ -0,0 +1,84 @@
+{
+  "name": "Functions",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b609",
+      "title": "Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a940",
+      "title": "Injective and surjective functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a941",
+      "title": "The pigeonhole principles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a942",
+      "title": "Composition",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a943",
+      "title": "Inverse functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a944",
+      "title": "Image and preimage",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/logic.json b/seed/math-challenges/41-proofs/logic.json
new file mode 100644
index 0000000000..6def18fd17
--- /dev/null
+++ b/seed/math-challenges/41-proofs/logic.json
@@ -0,0 +1,136 @@
+{
+  "name": "Logic",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b599",
+      "title": "Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a895",
+      "title": "And, Or, Not",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a896",
+      "title": "Conditional Statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a897",
+      "title": "Biconditional statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a898",
+      "title": "Truth tables for statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a899",
+      "title": "Logical equivalence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a900",
+      "title": "Quantifiers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a901",
+      "title": "Translating English to symbolic logic",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a902",
+      "title": "Negating statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a903",
+      "title": "Logical Inference",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/mathematical-induction.json b/seed/math-challenges/41-proofs/mathematical-induction.json
new file mode 100644
index 0000000000..6c3c6efd5f
--- /dev/null
+++ b/seed/math-challenges/41-proofs/mathematical-induction.json
@@ -0,0 +1,45 @@
+{
+  "name": "Mathematical Induction",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b607",
+      "title": "Proof by strong induction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a932",
+      "title": "Proof by smallest counterexample",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a933",
+      "title": "Fibonacci Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/proof-by-contradiction.json b/seed/math-challenges/41-proofs/proof-by-contradiction.json
new file mode 100644
index 0000000000..5fcab3c722
--- /dev/null
+++ b/seed/math-challenges/41-proofs/proof-by-contradiction.json
@@ -0,0 +1,45 @@
+{
+  "name": "Proof by Contradiction",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b603",
+      "title": "Proving statements with contradiction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a918",
+      "title": "Proving conditional statements by contradiction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a919",
+      "title": "Combining techniques",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/proofs-involving-sets.json b/seed/math-challenges/41-proofs/proofs-involving-sets.json
new file mode 100644
index 0000000000..3325445d8d
--- /dev/null
+++ b/seed/math-challenges/41-proofs/proofs-involving-sets.json
@@ -0,0 +1,58 @@
+{
+  "name": "Proofs Involving Sets",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b605",
+      "title": "How to prove a∈A",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a925",
+      "title": "How to prove A⊆B",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a926",
+      "title": "How to prove A=B",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a927",
+      "title": "Examples: Perfect Numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/proving-non-conditional-statements.json b/seed/math-challenges/41-proofs/proving-non-conditional-statements.json
new file mode 100644
index 0000000000..00466a59f2
--- /dev/null
+++ b/seed/math-challenges/41-proofs/proving-non-conditional-statements.json
@@ -0,0 +1,58 @@
+{
+  "name": "Proving non-conditional statements",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b604",
+      "title": "If-and-only-If proof",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a921",
+      "title": "Equivalent statements",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a922",
+      "title": "Existence Proofs; Existence and Uniqueness Proofs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a923",
+      "title": "Constructive versus non-constructive proofs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/relations.json b/seed/math-challenges/41-proofs/relations.json
new file mode 100644
index 0000000000..8b48e2abe8
--- /dev/null
+++ b/seed/math-challenges/41-proofs/relations.json
@@ -0,0 +1,71 @@
+{
+  "name": "Relations",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b608",
+      "title": "Properties of relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a935",
+      "title": "Equivalence of relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a936",
+      "title": "Equivalence classes and partitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a937",
+      "title": "The integers modulo n",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a938",
+      "title": "Relations between sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/41-proofs/sets.json b/seed/math-challenges/41-proofs/sets.json
new file mode 100644
index 0000000000..77ceb283b3
--- /dev/null
+++ b/seed/math-challenges/41-proofs/sets.json
@@ -0,0 +1,136 @@
+{
+  "name": "Sets",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b598",
+      "title": "Introduction to Sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a885",
+      "title": "Cartesian Products",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a886",
+      "title": "Subsets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a887",
+      "title": "Power Sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a888",
+      "title": "Union, Intersection, Difference",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a889",
+      "title": "Complement",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a890",
+      "title": "Venn Diagrams",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a891",
+      "title": "Indexed Sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a892",
+      "title": "Sets that are Number Systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a893",
+      "title": "Russell's Paradox",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/covering-circuits-and-graph-coloring.json b/seed/math-challenges/42-combinatorics/covering-circuits-and-graph-coloring.json
new file mode 100644
index 0000000000..987988a01d
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/covering-circuits-and-graph-coloring.json
@@ -0,0 +1,58 @@
+{
+  "name": "Covering circuits and graph coloring",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b612",
+      "title": "Euler cycles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a954",
+      "title": "Hamilton circuits",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a955",
+      "title": "Graph coloring",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a956",
+      "title": "Coloring theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/elements-of-graph-theory.json b/seed/math-challenges/42-combinatorics/elements-of-graph-theory.json
new file mode 100644
index 0000000000..3b60a257ad
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/elements-of-graph-theory.json
@@ -0,0 +1,58 @@
+{
+  "name": "Elements of Graph Theory",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b611",
+      "title": "Graph Models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a950",
+      "title": "Isomorphism",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a951",
+      "title": "Edge Counting",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a952",
+      "title": "Planar graphcs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/games-with-graphs.json b/seed/math-challenges/42-combinatorics/games-with-graphs.json
new file mode 100644
index 0000000000..29e6a50852
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/games-with-graphs.json
@@ -0,0 +1,32 @@
+{
+  "name": "Games with graphs",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b620",
+      "title": "Progressively finite games",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a988",
+      "title": "Nim-type games",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/general-enumeration.json b/seed/math-challenges/42-combinatorics/general-enumeration.json
new file mode 100644
index 0000000000..3c9705b462
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/general-enumeration.json
@@ -0,0 +1,71 @@
+{
+  "name": "General Enumeration",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b615",
+      "title": "Basic counting principles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a967",
+      "title": "Simple arrangements and selections",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a968",
+      "title": "Arrangements and selections with repetitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a969",
+      "title": "Distributions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a970",
+      "title": "Binomial identities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/generating-functions.json b/seed/math-challenges/42-combinatorics/generating-functions.json
new file mode 100644
index 0000000000..a218ac08ee
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/generating-functions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Generating Functions",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b616",
+      "title": "Generating function models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a972",
+      "title": "Calculating coefficients of generating functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a973",
+      "title": "Partitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a974",
+      "title": "Exponential generating functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/inclusion-exclusion.json b/seed/math-challenges/42-combinatorics/inclusion-exclusion.json
new file mode 100644
index 0000000000..7df520e1f1
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/inclusion-exclusion.json
@@ -0,0 +1,45 @@
+{
+  "name": "Inclusion-Exclusion",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b618",
+      "title": "Counting with Venn Diagrams",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a981",
+      "title": "Inclusion-Exclusion Formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a982",
+      "title": "Restricted positions and rook polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/network-algorithms.json b/seed/math-challenges/42-combinatorics/network-algorithms.json
new file mode 100644
index 0000000000..1aa9a96747
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/network-algorithms.json
@@ -0,0 +1,71 @@
+{
+  "name": "Network algorithms",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b614",
+      "title": "Shortest paths",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a962",
+      "title": "Minimum spanning trees",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a963",
+      "title": "Network flows",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a964",
+      "title": "Algorithmic matching",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a965",
+      "title": "The Transportation problem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/polya-enumeration-formula.json b/seed/math-challenges/42-combinatorics/polya-enumeration-formula.json
new file mode 100644
index 0000000000..a18c82c367
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/polya-enumeration-formula.json
@@ -0,0 +1,58 @@
+{
+  "name": "Polya's Enumeration Formula",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b619",
+      "title": "Equivalence and symmetry groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a984",
+      "title": "Burnside's theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a985",
+      "title": "Cycle index",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a986",
+      "title": "Polya's formula",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/recurrence-relations.json b/seed/math-challenges/42-combinatorics/recurrence-relations.json
new file mode 100644
index 0000000000..130315903e
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/recurrence-relations.json
@@ -0,0 +1,71 @@
+{
+  "name": "Recurrence Relations",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b617",
+      "title": "Recurrence relation models",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a976",
+      "title": "Divide-and-conquer relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a977",
+      "title": "Solution of linear recurrence relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a978",
+      "title": "Solution of inhomogeneous recurrence relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a979",
+      "title": "Solutions with generating functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/42-combinatorics/trees-and-searching.json b/seed/math-challenges/42-combinatorics/trees-and-searching.json
new file mode 100644
index 0000000000..541d0cf5f1
--- /dev/null
+++ b/seed/math-challenges/42-combinatorics/trees-and-searching.json
@@ -0,0 +1,58 @@
+{
+  "name": "Trees and searching",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b613",
+      "title": "Properties of trees",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a958",
+      "title": "Search trees and spanning trees",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a959",
+      "title": "Traveling salesperson problem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a960",
+      "title": "Tree analysis of sorting algorithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/algebraic-coding-theory.json b/seed/math-challenges/43-abstract-algebra/algebraic-coding-theory.json
new file mode 100644
index 0000000000..000163ac2b
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/algebraic-coding-theory.json
@@ -0,0 +1,58 @@
+{
+  "name": "Algebraic Coding theory",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b628",
+      "title": "Error-detecting and correcting codes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b007",
+      "title": "Linear codes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b008",
+      "title": "Parity-check and generator matrices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b009",
+      "title": "Efficient decoding",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/cosets-and-lagrange-theorem.json b/seed/math-challenges/43-abstract-algebra/cosets-and-lagrange-theorem.json
new file mode 100644
index 0000000000..6b674c3f25
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/cosets-and-lagrange-theorem.json
@@ -0,0 +1,45 @@
+{
+  "name": "Cosets and Lagrange's Theorem",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b626",
+      "title": "Cosets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b002",
+      "title": "Lagrange's theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b003",
+      "title": "Fermat's and Euler's Theorems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/cyclic-groups.json b/seed/math-challenges/43-abstract-algebra/cyclic-groups.json
new file mode 100644
index 0000000000..e40a53a06e
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/cyclic-groups.json
@@ -0,0 +1,45 @@
+{
+  "name": "Cyclic groups",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b624",
+      "title": "Cyclic subgroups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a996",
+      "title": "Multiplicative group of complex numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a997",
+      "title": "Method of repeated squares",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/fields.json b/seed/math-challenges/43-abstract-algebra/fields.json
new file mode 100644
index 0000000000..059cb20e12
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/fields.json
@@ -0,0 +1,45 @@
+{
+  "name": "Fields",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b639",
+      "title": "Extension Fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b038",
+      "title": "Splitting Fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b039",
+      "title": "Geometric Constructions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/finite-fields.json b/seed/math-challenges/43-abstract-algebra/finite-fields.json
new file mode 100644
index 0000000000..b0d01fcb4f
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/finite-fields.json
@@ -0,0 +1,32 @@
+{
+  "name": "Finite Fields",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b640",
+      "title": "Structure of a Finite Field",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b041",
+      "title": "Polynomial Codes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/galois-theory.json b/seed/math-challenges/43-abstract-algebra/galois-theory.json
new file mode 100644
index 0000000000..e5502548c0
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/galois-theory.json
@@ -0,0 +1,45 @@
+{
+  "name": "Galois Theory",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b642",
+      "title": "Field Automorphisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b043",
+      "title": "The Fundamental Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b044",
+      "title": "Applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/group-actions.json b/seed/math-challenges/43-abstract-algebra/group-actions.json
new file mode 100644
index 0000000000..72948cdd9c
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/group-actions.json
@@ -0,0 +1,45 @@
+{
+  "name": "Group actions",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b634",
+      "title": "Groups acting on sets",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b021",
+      "title": "The class equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b022",
+      "title": "Burnside's Counting Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/groups.json b/seed/math-challenges/43-abstract-algebra/groups.json
new file mode 100644
index 0000000000..eb7ea6d53a
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/groups.json
@@ -0,0 +1,45 @@
+{
+  "name": "Groups",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b623",
+      "title": "Integer equivalence classes and symmetries",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a993",
+      "title": "Definitions and examples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a994",
+      "title": "Subgroups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/homomorphisms.json b/seed/math-challenges/43-abstract-algebra/homomorphisms.json
new file mode 100644
index 0000000000..0c3abbfa9a
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/homomorphisms.json
@@ -0,0 +1,32 @@
+{
+  "name": "Homomorphisms",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b631",
+      "title": "Group homomorphisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b015",
+      "title": "The isomorphism theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/integers.json b/seed/math-challenges/43-abstract-algebra/integers.json
new file mode 100644
index 0000000000..adff2e6902
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/integers.json
@@ -0,0 +1,32 @@
+{
+  "name": "Integers",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b622",
+      "title": "Mathematical induction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a991",
+      "title": "Division algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/integral-domains.json b/seed/math-challenges/43-abstract-algebra/integral-domains.json
new file mode 100644
index 0000000000..8ff0933bcc
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/integral-domains.json
@@ -0,0 +1,32 @@
+{
+  "name": "Integral domains",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b638",
+      "title": "Fields of fractions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b033",
+      "title": "Factorization in integral domains",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/intro-to-cryptography.json b/seed/math-challenges/43-abstract-algebra/intro-to-cryptography.json
new file mode 100644
index 0000000000..50b7a46545
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/intro-to-cryptography.json
@@ -0,0 +1,32 @@
+{
+  "name": "Intro To Cryptography",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b627",
+      "title": "Private Key Cryptography",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b005",
+      "title": "Public key cryptography",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/isomorphisms.json b/seed/math-challenges/43-abstract-algebra/isomorphisms.json
new file mode 100644
index 0000000000..433741810e
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/isomorphisms.json
@@ -0,0 +1,32 @@
+{
+  "name": "Isomorphisms",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b629",
+      "title": "Definition and examples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b011",
+      "title": "Direct products",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/lattices-and-boolean-algebras.json b/seed/math-challenges/43-abstract-algebra/lattices-and-boolean-algebras.json
new file mode 100644
index 0000000000..a05a3cb4d8
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/lattices-and-boolean-algebras.json
@@ -0,0 +1,45 @@
+{
+  "name": "Lattices and boolean algebras",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b641",
+      "title": "Lattices",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b035",
+      "title": "Boolean algebras",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b036",
+      "title": "Algebra of electrical circuits",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/matrix-group-and-symmetry.json b/seed/math-challenges/43-abstract-algebra/matrix-group-and-symmetry.json
new file mode 100644
index 0000000000..531242fdfd
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/matrix-group-and-symmetry.json
@@ -0,0 +1,32 @@
+{
+  "name": "Matrix group and symmetry",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b632",
+      "title": "Matrix groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b017",
+      "title": "Symmetry",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/normal-subgroups-and-factor-groups.json b/seed/math-challenges/43-abstract-algebra/normal-subgroups-and-factor-groups.json
new file mode 100644
index 0000000000..2ce2dc47f3
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/normal-subgroups-and-factor-groups.json
@@ -0,0 +1,32 @@
+{
+  "name": "Normal subgroups and factor groups",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b630",
+      "title": "Factor groups and normal subgroups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b013",
+      "title": "The simplicity of the alternating group",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/permutation-groups.json b/seed/math-challenges/43-abstract-algebra/permutation-groups.json
new file mode 100644
index 0000000000..c0b98d789e
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/permutation-groups.json
@@ -0,0 +1,32 @@
+{
+  "name": "Permutation groups",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b625",
+      "title": "Definitions and notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983a999",
+      "title": "Dihedral groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/polynomials.json b/seed/math-challenges/43-abstract-algebra/polynomials.json
new file mode 100644
index 0000000000..05ac55c0d8
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/polynomials.json
@@ -0,0 +1,45 @@
+{
+  "name": "Polynomials",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b637",
+      "title": "Polynomial rings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b030",
+      "title": "Division algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b031",
+      "title": "Irreducible polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/preliminaries.json b/seed/math-challenges/43-abstract-algebra/preliminaries.json
new file mode 100644
index 0000000000..8d1b5ef8f7
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/preliminaries.json
@@ -0,0 +1,19 @@
+{
+  "name": "Preliminaries",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b621",
+      "title": "Sets and equivalence relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/rings.json b/seed/math-challenges/43-abstract-algebra/rings.json
new file mode 100644
index 0000000000..6f7b73e826
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/rings.json
@@ -0,0 +1,58 @@
+{
+  "name": "Rings",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b636",
+      "title": "Rings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b026",
+      "title": "Integral domains and fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b027",
+      "title": "Ring homomorphisms and ideals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b028",
+      "title": "Maximal and prime ideals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/structure-of-groups.json b/seed/math-challenges/43-abstract-algebra/structure-of-groups.json
new file mode 100644
index 0000000000..48ceac1e6b
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/structure-of-groups.json
@@ -0,0 +1,32 @@
+{
+  "name": "Structure of groups",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b633",
+      "title": "Finite Abelian groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b019",
+      "title": "Solvable groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/43-abstract-algebra/the-sylow-theorems.json b/seed/math-challenges/43-abstract-algebra/the-sylow-theorems.json
new file mode 100644
index 0000000000..91780c58ea
--- /dev/null
+++ b/seed/math-challenges/43-abstract-algebra/the-sylow-theorems.json
@@ -0,0 +1,32 @@
+{
+  "name": "The Sylow Theorems",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b635",
+      "title": "The Sylow Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b024",
+      "title": "Examples and applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/abelian-groups.json b/seed/math-challenges/44-number-theory/abelian-groups.json
new file mode 100644
index 0000000000..9622eea830
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/abelian-groups.json
@@ -0,0 +1,84 @@
+{
+  "name": "Abelian groups",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b648",
+      "title": "Definitions, basic properties, examples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b074",
+      "title": "Subgroups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b075",
+      "title": "Cosets and quotient groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b076",
+      "title": "Group homomorphisms and isomorphisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b077",
+      "title": "Cyclic groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b078",
+      "title": "Structure of finite abelian groups",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/algorithms-for-finite-fields.json b/seed/math-challenges/44-number-theory/algorithms-for-finite-fields.json
new file mode 100644
index 0000000000..e5d5c47afc
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/algorithms-for-finite-fields.json
@@ -0,0 +1,84 @@
+{
+  "name": "Algorithms for finite fields",
+  "order": 22,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b663",
+      "title": "Tests for and constructing irreducible polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b153",
+      "title": "Computing minimal polynomials in F[X]/(f)(III)",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b154",
+      "title": "Factoring polynomials: square-free decomposition",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b155",
+      "title": "Factoring polynomials: the Cantor-Zassenhaus algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b156",
+      "title": "Factoring polynomials: Berlekamp's algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b157",
+      "title": "Deterministic factorization algorithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/basic-properties-of-integers.json b/seed/math-challenges/44-number-theory/basic-properties-of-integers.json
new file mode 100644
index 0000000000..be1c47aa9a
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/basic-properties-of-integers.json
@@ -0,0 +1,45 @@
+{
+  "name": "Basic properties of integers",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b643",
+      "title": "Divisibility and primality",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b046",
+      "title": "Ideals and greatest common divisors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b047",
+      "title": "Consequences of unique factorization",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/computing-with-large-integers.json b/seed/math-challenges/44-number-theory/computing-with-large-integers.json
new file mode 100644
index 0000000000..cc5391d0ad
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/computing-with-large-integers.json
@@ -0,0 +1,71 @@
+{
+  "name": "Computing with large integers",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b645",
+      "title": "Asymptotic notation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b057",
+      "title": "Machine models and complexity theory",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b058",
+      "title": "Basic integer arithmetic",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b059",
+      "title": "Computing in Zn ",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b060",
+      "title": "Faster integer arithmetic",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/congruences.json b/seed/math-challenges/44-number-theory/congruences.json
new file mode 100644
index 0000000000..c6b79c3e02
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/congruences.json
@@ -0,0 +1,110 @@
+{
+  "name": "Congruences",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b644",
+      "title": "Equivalence relations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b049",
+      "title": "Definitions and basic properties of congruences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b050",
+      "title": "Solving linear congruences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b051",
+      "title": "The Chinese Remainder Theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b052",
+      "title": "Residue classes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b053",
+      "title": "Euler's phi function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b054",
+      "title": "Euler's theorem and Fermat's little theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b055",
+      "title": "Quadratic Residues",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/deterministic-primality-testing.json b/seed/math-challenges/44-number-theory/deterministic-primality-testing.json
new file mode 100644
index 0000000000..c320b1de86
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/deterministic-primality-testing.json
@@ -0,0 +1,32 @@
+{
+  "name": "Deterministic primality testing",
+  "order": 23,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b664",
+      "title": "Basic idea",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b159",
+      "title": "Algorithm and its analysis",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/distribution-of-primes.json b/seed/math-challenges/44-number-theory/distribution-of-primes.json
new file mode 100644
index 0000000000..31c632c315
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/distribution-of-primes.json
@@ -0,0 +1,71 @@
+{
+  "name": "Distribution of primes",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b647",
+      "title": "Chebyshev's Theorem on the density of primes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b069",
+      "title": "Bertrand's postulate",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b070",
+      "title": "Merten's theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b071",
+      "title": "The sieve of Eratosthenes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b072",
+      "title": "The prime number theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/euclid-algorithm.json b/seed/math-challenges/44-number-theory/euclid-algorithm.json
new file mode 100644
index 0000000000..3429142e12
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/euclid-algorithm.json
@@ -0,0 +1,97 @@
+{
+  "name": "Euclid's algorithm",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b646",
+      "title": "Basic Euclidean algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b062",
+      "title": "Extended Euclidean algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b063",
+      "title": "Computing modular inverses and Chinese remaindering",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b064",
+      "title": "Speeding up algorithms via modular computation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b065",
+      "title": "An effective version of Fermat's two squares theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b066",
+      "title": "Rational reconstruction and applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b067",
+      "title": "RSA cryptosystem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/finding-generators-and-discrete-logarithms-in-zpstar.json b/seed/math-challenges/44-number-theory/finding-generators-and-discrete-logarithms-in-zpstar.json
new file mode 100644
index 0000000000..3125d26425
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/finding-generators-and-discrete-logarithms-in-zpstar.json
@@ -0,0 +1,45 @@
+{
+  "name": "Finding generators and discrete logarithms in Zp Star",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b654",
+      "title": "Finding a generator for Zp Star",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b106",
+      "title": "Computing discrete logarithms in Zp Star",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b107",
+      "title": "The Diffie-Hellman key establishment protocol",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/finite-and-discrete-probability-distributions.json b/seed/math-challenges/44-number-theory/finite-and-discrete-probability-distributions.json
new file mode 100644
index 0000000000..7d6fb22665
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/finite-and-discrete-probability-distributions.json
@@ -0,0 +1,136 @@
+{
+  "name": "Finite and discrete probability distributions",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b650",
+      "title": "Basic definitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b085",
+      "title": "Conditional probability and independence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b086",
+      "title": "Random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b087",
+      "title": "Expectation and variance",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b088",
+      "title": "Some useful bounds",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b089",
+      "title": "Balls and bins",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b090",
+      "title": "Hash functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b091",
+      "title": "Statistical distance",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b092",
+      "title": "Measures of randomness and the leftover hash lemma",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b093",
+      "title": "Discrete probability distributions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/finite-fields.json b/seed/math-challenges/44-number-theory/finite-fields.json
new file mode 100644
index 0000000000..eb4f5085ef
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/finite-fields.json
@@ -0,0 +1,58 @@
+{
+  "name": "Finite fields",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b662",
+      "title": "Preliminaries",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b149",
+      "title": "Existence of finite fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b150",
+      "title": "Subfield structure and uniqueness of finite fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b151",
+      "title": "Conjugates, norms and traces",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/linearly-generated-sequences-and-applications.json b/seed/math-challenges/44-number-theory/linearly-generated-sequences-and-applications.json
new file mode 100644
index 0000000000..9954cbed29
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/linearly-generated-sequences-and-applications.json
@@ -0,0 +1,84 @@
+{
+  "name": "Linearly generated sequences and applications",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b661",
+      "title": "Basic definition and properties",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b143",
+      "title": "Computing minimal polynomials: a special case",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b144",
+      "title": "Computing minimal polynomials: a more general case",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b145",
+      "title": "Solving sparse linear systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b146",
+      "title": "Computing minimal polynomials in F[X]/(f)(II)",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b147",
+      "title": "The algebra of linear transformations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/matrices.json b/seed/math-challenges/44-number-theory/matrices.json
new file mode 100644
index 0000000000..ce160ceccc
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/matrices.json
@@ -0,0 +1,71 @@
+{
+  "name": "Matrices",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b657",
+      "title": "Basic definitions and properties",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b120",
+      "title": "Matrices and linear maps",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b121",
+      "title": "Inverse of a matrix",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b122",
+      "title": "Gaussian elimination",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b123",
+      "title": "Applications of Gaussian elimination",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/modules-and-vector-spaces.json b/seed/math-challenges/44-number-theory/modules-and-vector-spaces.json
new file mode 100644
index 0000000000..644c50aef3
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/modules-and-vector-spaces.json
@@ -0,0 +1,71 @@
+{
+  "name": "Modules and vector spaces",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b656",
+      "title": "Definitions, basic properties, examples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b115",
+      "title": "Submodules and quotient modules",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b116",
+      "title": "Module homomorphisms and isomorphisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b117",
+      "title": "Linear independence and bases",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b118",
+      "title": "Vector spaces and dimensions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/more-rings.json b/seed/math-challenges/44-number-theory/more-rings.json
new file mode 100644
index 0000000000..d859e55c50
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/more-rings.json
@@ -0,0 +1,123 @@
+{
+  "name": "More Rings",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b659",
+      "title": "Algebras",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b128",
+      "title": "The field of fractions of an integral domain",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b129",
+      "title": "Unique factorization of polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b130",
+      "title": "Polynomial congruences",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b131",
+      "title": "Minimal polynomials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b132",
+      "title": "General properties of extension fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b133",
+      "title": "Formal derivatives",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b134",
+      "title": "Formal power series and Laurent series",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b135",
+      "title": "Unique factorization domains",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/polynomial-arithmetic-and-applications.json b/seed/math-challenges/44-number-theory/polynomial-arithmetic-and-applications.json
new file mode 100644
index 0000000000..52472595df
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/polynomial-arithmetic-and-applications.json
@@ -0,0 +1,84 @@
+{
+  "name": "Polynomial arithmetic and applications",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b660",
+      "title": "Basic arithmetic",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b137",
+      "title": "Computing minimal polynomials in F[X]/(f)(I)",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b138",
+      "title": "Euclid's algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b139",
+      "title": "Computing modular inverses and Chinese remaindering",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b140",
+      "title": "Rational function reconstruction and applications",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b141",
+      "title": "Faster polynomial arithmetic",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/probabilistic-algorithms.json b/seed/math-challenges/44-number-theory/probabilistic-algorithms.json
new file mode 100644
index 0000000000..78c312bfa1
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/probabilistic-algorithms.json
@@ -0,0 +1,97 @@
+{
+  "name": "Probabilistic algorithms",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b651",
+      "title": "Basic definitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b095",
+      "title": "Generating a random number from a given interval",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b652",
+      "title": "Generate and test paradigm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b097",
+      "title": "Generating a random prime",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b098",
+      "title": "Generating a random non-increasing sequence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b099",
+      "title": "Generating a random factored number",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b100",
+      "title": "Complexity theory",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/probabilistic-primary-testing.json b/seed/math-challenges/44-number-theory/probabilistic-primary-testing.json
new file mode 100644
index 0000000000..27345d8e33
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/probabilistic-primary-testing.json
@@ -0,0 +1,58 @@
+{
+  "name": "Probabilistic primary testing",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b653",
+      "title": "Trial division",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b102",
+      "title": "Miller-Rabin test",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b103",
+      "title": "Generating random primes using Miller-Rabin test",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b104",
+      "title": "Factoring and computing Euler's phi function",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/quadratic-reciprocity-and-computing-modular-square-roots.json b/seed/math-challenges/44-number-theory/quadratic-reciprocity-and-computing-modular-square-roots.json
new file mode 100644
index 0000000000..b7ec8ff8d1
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/quadratic-reciprocity-and-computing-modular-square-roots.json
@@ -0,0 +1,84 @@
+{
+  "name": "Quadratic reciprocity and computing modular square roots",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b655",
+      "title": "The Legendre symbol",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b109",
+      "title": "The Jacobi symbol",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b110",
+      "title": "Computing the Jacobi symbol",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b111",
+      "title": "Testing quadratic residuosity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b112",
+      "title": "Computing modular square roots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b113",
+      "title": "The quadratic residuosity assumption",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/rings.json b/seed/math-challenges/44-number-theory/rings.json
new file mode 100644
index 0000000000..1a26781de9
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/rings.json
@@ -0,0 +1,71 @@
+{
+  "name": "Rings",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b649",
+      "title": "Definitions, basic properties, examples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b080",
+      "title": "Polynomial rings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b081",
+      "title": "Ideals and quotient rings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b082",
+      "title": "Ring homomorphisms and isomorphisms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b083",
+      "title": "The structure of Zn*",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/44-number-theory/subexponential-time-discrete-logarithms-and-factoring.json b/seed/math-challenges/44-number-theory/subexponential-time-discrete-logarithms-and-factoring.json
new file mode 100644
index 0000000000..d319562644
--- /dev/null
+++ b/seed/math-challenges/44-number-theory/subexponential-time-discrete-logarithms-and-factoring.json
@@ -0,0 +1,45 @@
+{
+  "name": "Subexponential-time discrete logarithms and factoring",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b658",
+      "title": "Smooth numbers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b125",
+      "title": "Algorithm for discrete logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b126",
+      "title": "Algorithm for factoring integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/algorithms-for-the-discrete-logarithm-problem.json b/seed/math-challenges/45-cryptography/algorithms-for-the-discrete-logarithm-problem.json
new file mode 100644
index 0000000000..76a6b56aad
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/algorithms-for-the-discrete-logarithm-problem.json
@@ -0,0 +1,58 @@
+{
+  "name": "Algorithms for the discrete logarithm problem",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b683",
+      "title": "Shank's algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b226",
+      "title": "Pollard Rho discrete logarithm algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b227",
+      "title": "Pohlig-Hellman algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b228",
+      "title": "Index Calculus method",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/block-ciphers.json b/seed/math-challenges/45-cryptography/block-ciphers.json
new file mode 100644
index 0000000000..5fbb76bf8f
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/block-ciphers.json
@@ -0,0 +1,84 @@
+{
+  "name": "Block ciphers",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b668",
+      "title": "Introduction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b181",
+      "title": "Substitution-Permutation networks",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b182",
+      "title": "Linear cryptanalysis",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b183",
+      "title": "Piling-up lemma",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b184",
+      "title": "Linear approximations of S-boxes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b185",
+      "title": "Linear attack on an SPN",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/copyright-protection.json b/seed/math-challenges/45-cryptography/copyright-protection.json
new file mode 100644
index 0000000000..28c9af9c86
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/copyright-protection.json
@@ -0,0 +1,58 @@
+{
+  "name": "Copyright protection",
+  "order": 36,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b701",
+      "title": "Fingerprinting",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b319",
+      "title": "Identifiable parent property",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b320",
+      "title": "2-IPP Codes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b321",
+      "title": "Tracing illegally redistributed keys",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/cryptanalysis.json b/seed/math-challenges/45-cryptography/cryptanalysis.json
new file mode 100644
index 0000000000..c463888d76
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/cryptanalysis.json
@@ -0,0 +1,71 @@
+{
+  "name": "Cryptanalysis",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b666",
+      "title": "Cryptanalysis of affine cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b168",
+      "title": "Cryptanalysis of substitution cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b169",
+      "title": "Cryptanalysis of Vigenere cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b170",
+      "title": "Cryptanalysis of Hill cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b171",
+      "title": "Cryptanalysis of LFSR stream cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/differential-cryptanalysis.json b/seed/math-challenges/45-cryptography/differential-cryptanalysis.json
new file mode 100644
index 0000000000..377f2aba23
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/differential-cryptanalysis.json
@@ -0,0 +1,97 @@
+{
+  "name": "Differential Cryptanalysis",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b669",
+      "title": "Data Encryption standard DES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b187",
+      "title": "Description of DES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b188",
+      "title": "Analysis of DES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b189",
+      "title": "Advanced encryption standard AES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b190",
+      "title": "Description of AES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b191",
+      "title": "Analysis of AES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b192",
+      "title": "Modes of operations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/discrete-logarithm-algorithms-in-practice.json b/seed/math-challenges/45-cryptography/discrete-logarithm-algorithms-in-practice.json
new file mode 100644
index 0000000000..e8c9e2de01
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/discrete-logarithm-algorithms-in-practice.json
@@ -0,0 +1,19 @@
+{
+  "name": "Discrete logarithm algorithms in practice",
+  "order": 22,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b687",
+      "title": "Discrete logarithm algorithms in practice",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/elliptic-curves.json b/seed/math-challenges/45-cryptography/elliptic-curves.json
new file mode 100644
index 0000000000..ccf59b75ea
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/elliptic-curves.json
@@ -0,0 +1,71 @@
+{
+  "name": "Elliptic curves",
+  "order": 21,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b686",
+      "title": "Elliptic curves over the reals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b232",
+      "title": "Elliptic curves modulo a prime",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b233",
+      "title": "Properties of elliptic curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b234",
+      "title": "Point compression and ECIES",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b235",
+      "title": "Computing point multiples on elliptic curves",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/factoring-algorithms.json b/seed/math-challenges/45-cryptography/factoring-algorithms.json
new file mode 100644
index 0000000000..3b00558b99
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/factoring-algorithms.json
@@ -0,0 +1,58 @@
+{
+  "name": "Factoring algorithms",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b678",
+      "title": "Pollard p minus 1 algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b215",
+      "title": "Pollard Rho algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b216",
+      "title": "Dixon's Random squares algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b217",
+      "title": "Factoring algorithms in practice",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/finite-fields.json b/seed/math-challenges/45-cryptography/finite-fields.json
new file mode 100644
index 0000000000..01b098430b
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/finite-fields.json
@@ -0,0 +1,19 @@
+{
+  "name": "Finite fields",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b685",
+      "title": "Introduction to Finite Fields",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/future-of-pki.json b/seed/math-challenges/45-cryptography/future-of-pki.json
new file mode 100644
index 0000000000..e9e9ed042e
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/future-of-pki.json
@@ -0,0 +1,45 @@
+{
+  "name": "Future of PKI",
+  "order": 33,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b698",
+      "title": "Alternatives",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b300",
+      "title": "Identity-based Cryptography",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b301",
+      "title": "The Cocks identity-based encryption scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/genetic-algorithms.json b/seed/math-challenges/45-cryptography/genetic-algorithms.json
new file mode 100644
index 0000000000..25b7c2fd5b
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/genetic-algorithms.json
@@ -0,0 +1,19 @@
+{
+  "name": "Genetic algorithms",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b684",
+      "title": "Lower bounds on the complexity of genetic algorithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/hash-functions.json b/seed/math-challenges/45-cryptography/hash-functions.json
new file mode 100644
index 0000000000..6eea35ff2e
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/hash-functions.json
@@ -0,0 +1,123 @@
+{
+  "name": "Hash Functions",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b670",
+      "title": "Introduction to Hash Functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b194",
+      "title": "Data integrity",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b195",
+      "title": "Security of hash functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b196",
+      "title": "Random Oracle model",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b197",
+      "title": "Algorithms in the random oracle model",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b198",
+      "title": "Comparison of security criteria",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b199",
+      "title": "Iterated hash functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b201",
+      "title": "Merkle-Damgard Construction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b202",
+      "title": "Secure hash algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/identification-schemes-and-entity-authentication.json b/seed/math-challenges/45-cryptography/identification-schemes-and-entity-authentication.json
new file mode 100644
index 0000000000..d2cb572c0d
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/identification-schemes-and-entity-authentication.json
@@ -0,0 +1,162 @@
+{
+  "name": "Identification schemes and entity authentication",
+  "order": 26,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b691",
+      "title": "Introduction to identification schemes and entity authentication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b260",
+      "title": "Challenge-and-response in the secret-key setting",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b261",
+      "title": "Attack model and adversarial goals",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b262",
+      "title": "Mutual authentication",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b263",
+      "title": "Challenge-and-response in the public-key setting",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b264",
+      "title": "Certificates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b265",
+      "title": "Public-key identification schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b266",
+      "title": "Schnorr identification scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b267",
+      "title": "Security of the Schnorr identification scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b268",
+      "title": "Okamoto identification scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b269",
+      "title": "Guillou-Quisquater identification scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b270",
+      "title": "Identity-based identification schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/introduction-to-public-key-cryptography.json b/seed/math-challenges/45-cryptography/introduction-to-public-key-cryptography.json
new file mode 100644
index 0000000000..2a76dc4e2e
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/introduction-to-public-key-cryptography.json
@@ -0,0 +1,19 @@
+{
+  "name": "Introduction to public-key cryptography",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b674",
+      "title": "Introduction to public-key cryptography",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/key-agreement-schemes.json b/seed/math-challenges/45-cryptography/key-agreement-schemes.json
new file mode 100644
index 0000000000..44b6080333
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/key-agreement-schemes.json
@@ -0,0 +1,136 @@
+{
+  "name": "Key agreement schemes",
+  "order": 30,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b695",
+      "title": "Introduction to Key agreement schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b282",
+      "title": "Diffie-Hellman key agreement",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b283",
+      "title": "Station-to-station(STS) key agreement scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b284",
+      "title": "Security of STS",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b285",
+      "title": "Known session key attacks",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b286",
+      "title": "MTI key agreement schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b287",
+      "title": "Known session key attacks on MTI/A0",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b288",
+      "title": "Key agreement using self-certifying keys",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b289",
+      "title": "Encrypted key exchange",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b290",
+      "title": "Conference key agreement schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/key-distribution-patterns.json b/seed/math-challenges/45-cryptography/key-distribution-patterns.json
new file mode 100644
index 0000000000..df9a4bde06
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/key-distribution-patterns.json
@@ -0,0 +1,32 @@
+{
+  "name": "Key distribution patterns",
+  "order": 28,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b693",
+      "title": "Fiat-Naor key distribution patterns",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b276",
+      "title": "Mitchell-Piper key distribution patterns",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/key-distribution.json b/seed/math-challenges/45-cryptography/key-distribution.json
new file mode 100644
index 0000000000..d7ac2b6655
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/key-distribution.json
@@ -0,0 +1,58 @@
+{
+  "name": "Key distribution",
+  "order": 27,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b692",
+      "title": "Introduction to Key distribution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b272",
+      "title": "Diffie-Hellman Key Predistribution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b273",
+      "title": "Unconditionally secure key predistribution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b274",
+      "title": "The Blom Key Predistribution scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/message-authentication-codes-mac.json b/seed/math-challenges/45-cryptography/message-authentication-codes-mac.json
new file mode 100644
index 0000000000..a6d9d76288
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/message-authentication-codes-mac.json
@@ -0,0 +1,32 @@
+{
+  "name": "Message authentication codes(MAC)",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b671",
+      "title": "Nested MACs and HMAC",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b204",
+      "title": "CBC-MAC and authenticated encryption",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/more-number-theory.json b/seed/math-challenges/45-cryptography/more-number-theory.json
new file mode 100644
index 0000000000..6296b41e3b
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/more-number-theory.json
@@ -0,0 +1,32 @@
+{
+  "name": "More number theory",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b675",
+      "title": "Euclidean algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b208",
+      "title": "Chinese remainder theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/multicast-security.json b/seed/math-challenges/45-cryptography/multicast-security.json
new file mode 100644
index 0000000000..e9adf4eec2
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/multicast-security.json
@@ -0,0 +1,97 @@
+{
+  "name": "Multicast security",
+  "order": 35,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b700",
+      "title": "Introduction to Multicast security and copyright protection",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b312",
+      "title": "Broadcast encryption",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b313",
+      "title": "Improvement using Ramp Schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b314",
+      "title": "Multicast re-keying",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b315",
+      "title": "Blacklisting scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b316",
+      "title": "The Naor-Pinkas Re-keying scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b317",
+      "title": "Logical key hierarchy",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/other-attacks-on-rsa.json b/seed/math-challenges/45-cryptography/other-attacks-on-rsa.json
new file mode 100644
index 0000000000..6b537d3c00
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/other-attacks-on-rsa.json
@@ -0,0 +1,45 @@
+{
+  "name": "Other attacks on RSA",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b679",
+      "title": "Computing φ(n)",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b219",
+      "title": "The decryption exponent",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b220",
+      "title": "Wiener's low decryption exponent attack",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/primality-testing.json b/seed/math-challenges/45-cryptography/primality-testing.json
new file mode 100644
index 0000000000..b7779ebc48
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/primality-testing.json
@@ -0,0 +1,58 @@
+{
+  "name": "Primality testing",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b677",
+      "title": "Legendre and Jacobi symbols",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b211",
+      "title": "Solovay-Strassen algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b212",
+      "title": "Miller-Rabin algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b213",
+      "title": "Square roots modulo n",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/pseudo-random-number-generation.json b/seed/math-challenges/45-cryptography/pseudo-random-number-generation.json
new file mode 100644
index 0000000000..2c6bf7118c
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/pseudo-random-number-generation.json
@@ -0,0 +1,97 @@
+{
+  "name": "Pseudo-random number generation",
+  "order": 25,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b690",
+      "title": "Introduction to pseudo-random number generation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b253",
+      "title": "Examples of pseudo-random number generation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b254",
+      "title": "Indistinguishably of probability distributions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b255",
+      "title": "Next bit predictors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b256",
+      "title": "Blum-Blum-Shub generator",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b257",
+      "title": "Security of BBS generator",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b258",
+      "title": "Probabilistic Encryption",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/public-key-cryptography-and-discrete-logarithms.json b/seed/math-challenges/45-cryptography/public-key-cryptography-and-discrete-logarithms.json
new file mode 100644
index 0000000000..e9d48f7729
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/public-key-cryptography-and-discrete-logarithms.json
@@ -0,0 +1,19 @@
+{
+  "name": "Public-key Cryptography and Discrete Logarithms",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b682",
+      "title": "ElGamal cryptosystem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/public-key-infrastructure.json b/seed/math-challenges/45-cryptography/public-key-infrastructure.json
new file mode 100644
index 0000000000..3b8eefeef5
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/public-key-infrastructure.json
@@ -0,0 +1,58 @@
+{
+  "name": "Public-key infrastructure",
+  "order": 31,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b696",
+      "title": "Introduction to Public-key infrastructure",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b292",
+      "title": "A practical protocol: Secure socket layer",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b293",
+      "title": "Certificates",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b294",
+      "title": "Certificate life-cycle management",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/rabin-cryptosystem.json b/seed/math-challenges/45-cryptography/rabin-cryptosystem.json
new file mode 100644
index 0000000000..d218e31d8d
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/rabin-cryptosystem.json
@@ -0,0 +1,19 @@
+{
+  "name": "Rabin cryptosystem",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b680",
+      "title": "Security of Rabin cryptosystem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/rsa-cryptosystem-and-factoring-integers.json b/seed/math-challenges/45-cryptography/rsa-cryptosystem-and-factoring-integers.json
new file mode 100644
index 0000000000..79784eb8e3
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/rsa-cryptosystem-and-factoring-integers.json
@@ -0,0 +1,19 @@
+{
+  "name": "RSA Cryptosystem and Factoring Integers",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b673",
+      "title": "RSA Cryptosystem and Factoring Integers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/rsa-cryptosystem.json b/seed/math-challenges/45-cryptography/rsa-cryptosystem.json
new file mode 100644
index 0000000000..455809d160
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/rsa-cryptosystem.json
@@ -0,0 +1,19 @@
+{
+  "name": "RSA cryptosystem",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b676",
+      "title": "Implementing RSA",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/secret-sharing-schemes.json b/seed/math-challenges/45-cryptography/secret-sharing-schemes.json
new file mode 100644
index 0000000000..eefb07bdbc
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/secret-sharing-schemes.json
@@ -0,0 +1,123 @@
+{
+  "name": "Secret sharing schemes",
+  "order": 34,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b699",
+      "title": "Introduction: Shamir Threshold Scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b303",
+      "title": "A simplified (t,t)-threshold scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b304",
+      "title": "Access structures and general secret sharing",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b305",
+      "title": "Monotone circuit construction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b306",
+      "title": "Formal definitions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b307",
+      "title": "Information rate and construction of efficient schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b308",
+      "title": "Vector space construction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b309",
+      "title": "An upper bound on the information rate",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b310",
+      "title": "The decomposition construction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/security-of-elgamal-systems.json b/seed/math-challenges/45-cryptography/security-of-elgamal-systems.json
new file mode 100644
index 0000000000..968d23386c
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/security-of-elgamal-systems.json
@@ -0,0 +1,45 @@
+{
+  "name": "Security of ElGamal systems",
+  "order": 23,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b688",
+      "title": "Bit security of discrete logarithms",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b237",
+      "title": "Semantic security of ElGamal systems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b238",
+      "title": "Diffie-Hellman problems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/semantic-security-of-rsa.json b/seed/math-challenges/45-cryptography/semantic-security-of-rsa.json
new file mode 100644
index 0000000000..ea8f8fed5b
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/semantic-security-of-rsa.json
@@ -0,0 +1,32 @@
+{
+  "name": "Semantic security of RSA",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b681",
+      "title": "Partial information concerning plaintext bits",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b223",
+      "title": "Optimal asymmetric encryption padding",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/session-key-distribution-schemes.json b/seed/math-challenges/45-cryptography/session-key-distribution-schemes.json
new file mode 100644
index 0000000000..f5e52ab162
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/session-key-distribution-schemes.json
@@ -0,0 +1,58 @@
+{
+  "name": "Session key distribution schemes",
+  "order": 29,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b694",
+      "title": "The Needham-Schroeder(NS) Scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b278",
+      "title": "The Denning-Sacco Attack on the NS scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b279",
+      "title": "Kerberos",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b280",
+      "title": "The Bellare-Rogaway scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/shannons-theory.json b/seed/math-challenges/45-cryptography/shannons-theory.json
new file mode 100644
index 0000000000..ed06f19a72
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/shannons-theory.json
@@ -0,0 +1,110 @@
+{
+  "name": "Shannons Theory",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b667",
+      "title": "Introduction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b173",
+      "title": "Elementary Probability theory",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b174",
+      "title": "Perfect secrecy",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b175",
+      "title": "Entropy",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b176",
+      "title": "Huffman Encodings",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b177",
+      "title": "Properties of entropy",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b178",
+      "title": "Spurious keys and unicity distance",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b179",
+      "title": "Product cryptosystems",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/signature-schemes.json b/seed/math-challenges/45-cryptography/signature-schemes.json
new file mode 100644
index 0000000000..7fdb3c1d88
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/signature-schemes.json
@@ -0,0 +1,175 @@
+{
+  "name": "Signature Schemes",
+  "order": 24,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b689",
+      "title": "Security requirements for signature schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b240",
+      "title": "Signatures and hash functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b241",
+      "title": "ElGamal signature scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b242",
+      "title": "Security of ElGamal signature scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b243",
+      "title": "Variants of ElGamal signature scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b244",
+      "title": "Schnorr signature scheme",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b245",
+      "title": "Digital signature algorithm",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b246",
+      "title": "Elliptic Curve DSA",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b247",
+      "title": "Provably secure signature schemes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b248",
+      "title": "One-time signatures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b249",
+      "title": "Full domain hash",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b250",
+      "title": "Undeniable signatures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b251",
+      "title": "Fail-stop signatures",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/simple-cryptosystems.json b/seed/math-challenges/45-cryptography/simple-cryptosystems.json
new file mode 100644
index 0000000000..2f5c378b67
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/simple-cryptosystems.json
@@ -0,0 +1,97 @@
+{
+  "name": "Simple Cryptosystems",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b665",
+      "title": "Shift Cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b161",
+      "title": "Substitution cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b162",
+      "title": "Affine cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b163",
+      "title": "Vigenere cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b164",
+      "title": "Hill cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b165",
+      "title": "Permutation cipher",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b166",
+      "title": "Stream ciphers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/trust-models.json b/seed/math-challenges/45-cryptography/trust-models.json
new file mode 100644
index 0000000000..6cbe86cc29
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/trust-models.json
@@ -0,0 +1,58 @@
+{
+  "name": "Trust models",
+  "order": 32,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b697",
+      "title": "Strict hierarchy model",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b296",
+      "title": "Networked PKIs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b297",
+      "title": "Web Browser model",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b298",
+      "title": "Pretty good privacy",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/45-cryptography/unconditionally-secure-macs.json b/seed/math-challenges/45-cryptography/unconditionally-secure-macs.json
new file mode 100644
index 0000000000..5e70d83df5
--- /dev/null
+++ b/seed/math-challenges/45-cryptography/unconditionally-secure-macs.json
@@ -0,0 +1,32 @@
+{
+  "name": "Unconditionally secure MACs",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b672",
+      "title": "Strongly universal hash families",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b206",
+      "title": "Optimality of deception probabilities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/chi-square-distribution.json b/seed/math-challenges/46-statistics/chi-square-distribution.json
new file mode 100644
index 0000000000..57d23a2c98
--- /dev/null
+++ b/seed/math-challenges/46-statistics/chi-square-distribution.json
@@ -0,0 +1,45 @@
+{
+  "name": "Chi-Square Distribution",
+  "order": 10,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b711",
+      "title": "Chi-Square Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b361",
+      "title": "Chi-Square Goodness-of-Fit Test",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b362",
+      "title": "Chi-Square Test of Independence",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/confidence-intervals.json b/seed/math-challenges/46-statistics/confidence-intervals.json
new file mode 100644
index 0000000000..bd78a8baa2
--- /dev/null
+++ b/seed/math-challenges/46-statistics/confidence-intervals.json
@@ -0,0 +1,71 @@
+{
+  "name": "Confidence Intervals",
+  "order": 8,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b709",
+      "title": "Confidence Intervals Known",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b347",
+      "title": "Confidence Interval for a Population Mean",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b348",
+      "title": "Known Population Standard Deviation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b349",
+      "title": "Unknown Population Standard Deviation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b350",
+      "title": "Confidence Interval for a Single Population Proportion",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/continuous-random-variables.json b/seed/math-challenges/46-statistics/continuous-random-variables.json
new file mode 100644
index 0000000000..46893f63cb
--- /dev/null
+++ b/seed/math-challenges/46-statistics/continuous-random-variables.json
@@ -0,0 +1,45 @@
+{
+  "name": "Continuous Random Variables",
+  "order": 5,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b706",
+      "title": "Continuous Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b338",
+      "title": "Uniform Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b339",
+      "title": "Exponential Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/data.json b/seed/math-challenges/46-statistics/data.json
new file mode 100644
index 0000000000..2b2de39a4d
--- /dev/null
+++ b/seed/math-challenges/46-statistics/data.json
@@ -0,0 +1,58 @@
+{
+  "name": "Data",
+  "order": 1,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b702",
+      "title": "Qualitative",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b323",
+      "title": "Quantitative",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b324",
+      "title": "Sampling",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b325",
+      "title": "Frequency Tables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/descriptive-statistics.json b/seed/math-challenges/46-statistics/descriptive-statistics.json
new file mode 100644
index 0000000000..fdee1f3906
--- /dev/null
+++ b/seed/math-challenges/46-statistics/descriptive-statistics.json
@@ -0,0 +1,58 @@
+{
+  "name": "Descriptive Statistics",
+  "order": 2,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b703",
+      "title": "Data Graphs",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b327",
+      "title": "Quartiles and Percentiles",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b328",
+      "title": "Mean, Median, and Mode",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b329",
+      "title": "Variance and Standard Deviation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/discrete-distributions.json b/seed/math-challenges/46-statistics/discrete-distributions.json
new file mode 100644
index 0000000000..fe23397860
--- /dev/null
+++ b/seed/math-challenges/46-statistics/discrete-distributions.json
@@ -0,0 +1,58 @@
+{
+  "name": "Discrete Distributions",
+  "order": 4,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b705",
+      "title": "Discrete Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b334",
+      "title": "Expected Value",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b335",
+      "title": "Binomial Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b336",
+      "title": "Poisson Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/hypothesis-testing-single-mean-and-single-proportion.json b/seed/math-challenges/46-statistics/hypothesis-testing-single-mean-and-single-proportion.json
new file mode 100644
index 0000000000..d7b0b560e4
--- /dev/null
+++ b/seed/math-challenges/46-statistics/hypothesis-testing-single-mean-and-single-proportion.json
@@ -0,0 +1,123 @@
+{
+  "name": "Hypothesis Testing: Single Mean and Single Proportion",
+  "order": 9,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b710",
+      "title": "Hypothesis Testing Overview",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b352",
+      "title": "Hypothesis Testing for a Population Mean",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b353",
+      "title": "Known Population Standard Deviation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b354",
+      "title": "Unknown Population Standard Deviation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b355",
+      "title": "Hypothesis Testing for a Single Population Proportion",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b356",
+      "title": "Type I and II errors",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b357",
+      "title": "Hypothesis Testing for Two Population Means",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b358",
+      "title": "Hypothesis Testing for Two Population Proportions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b359",
+      "title": "Hypothesis Testing for Matched or Paired Samples",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/linear-regression-and-correlation.json b/seed/math-challenges/46-statistics/linear-regression-and-correlation.json
new file mode 100644
index 0000000000..10bfe30437
--- /dev/null
+++ b/seed/math-challenges/46-statistics/linear-regression-and-correlation.json
@@ -0,0 +1,84 @@
+{
+  "name": "Linear Regression and Correlation",
+  "order": 11,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b712",
+      "title": "Linear Equations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b364",
+      "title": "Scatter Plots",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b365",
+      "title": "The Regression Equation",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b366",
+      "title": "The Correlation Coefficient",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b367",
+      "title": "Prediction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b368",
+      "title": "Outliers",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/probability.json b/seed/math-challenges/46-statistics/probability.json
new file mode 100644
index 0000000000..a63470289d
--- /dev/null
+++ b/seed/math-challenges/46-statistics/probability.json
@@ -0,0 +1,45 @@
+{
+  "name": "Probability",
+  "order": 3,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b704",
+      "title": "Independent or Mutually Exclusive",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b331",
+      "title": "Addition and Multiplication Rules",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b332",
+      "title": "Contingency Tables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/the-central-limit-theorem.json b/seed/math-challenges/46-statistics/the-central-limit-theorem.json
new file mode 100644
index 0000000000..c906e15ff4
--- /dev/null
+++ b/seed/math-challenges/46-statistics/the-central-limit-theorem.json
@@ -0,0 +1,45 @@
+{
+  "name": "The Central Limit Theorem",
+  "order": 7,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b708",
+      "title": "Central Limit Theorem  ",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b344",
+      "title": "Central Limit Theorem for Averages",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b345",
+      "title": "Central Limit Theorem for Sums",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/46-statistics/the-normal-distribution.json b/seed/math-challenges/46-statistics/the-normal-distribution.json
new file mode 100644
index 0000000000..b4148e9657
--- /dev/null
+++ b/seed/math-challenges/46-statistics/the-normal-distribution.json
@@ -0,0 +1,45 @@
+{
+  "name": "The Normal Distribution",
+  "order": 6,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b707",
+      "title": "Normal Probability Distribution",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b341",
+      "title": "Standard Normal Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b342",
+      "title": "Normal Probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/central-limit-theorem.json b/seed/math-challenges/47-probability/central-limit-theorem.json
new file mode 100644
index 0000000000..9594422827
--- /dev/null
+++ b/seed/math-challenges/47-probability/central-limit-theorem.json
@@ -0,0 +1,45 @@
+{
+  "name": "Central limit theorem",
+  "order": 20,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b721",
+      "title": "Bernoulli trials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b389",
+      "title": "Discrete independent trials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b390",
+      "title": "Continuous independent trials",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/combinatorics.json b/seed/math-challenges/47-probability/combinatorics.json
new file mode 100644
index 0000000000..af970d5904
--- /dev/null
+++ b/seed/math-challenges/47-probability/combinatorics.json
@@ -0,0 +1,45 @@
+{
+  "name": "Combinatorics",
+  "order": 14,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b715",
+      "title": "Permutations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b374",
+      "title": "Combinations",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b375",
+      "title": "Card Shuffling",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/conditional-probability.json b/seed/math-challenges/47-probability/conditional-probability.json
new file mode 100644
index 0000000000..ef351abe1a
--- /dev/null
+++ b/seed/math-challenges/47-probability/conditional-probability.json
@@ -0,0 +1,45 @@
+{
+  "name": "Conditional Probability",
+  "order": 15,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b716",
+      "title": "Discrete conditional probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b377",
+      "title": "Continuous conditional probability",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b378",
+      "title": "Paradoxes",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/continuous-probability-densities.json b/seed/math-challenges/47-probability/continuous-probability-densities.json
new file mode 100644
index 0000000000..ec518fafad
--- /dev/null
+++ b/seed/math-challenges/47-probability/continuous-probability-densities.json
@@ -0,0 +1,32 @@
+{
+  "name": "Continuous probability densities",
+  "order": 13,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b714",
+      "title": "Simulation of continuous probabilities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b372",
+      "title": "Continuous density functions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/discrete-probability-distributions.json b/seed/math-challenges/47-probability/discrete-probability-distributions.json
new file mode 100644
index 0000000000..da63558ffc
--- /dev/null
+++ b/seed/math-challenges/47-probability/discrete-probability-distributions.json
@@ -0,0 +1,32 @@
+{
+  "name": "Discrete Probability Distributions",
+  "order": 12,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b713",
+      "title": "Simulation of discrete probabilities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b370",
+      "title": "Discrete probability distributions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/distributions-and-densities.json b/seed/math-challenges/47-probability/distributions-and-densities.json
new file mode 100644
index 0000000000..b39f9431e8
--- /dev/null
+++ b/seed/math-challenges/47-probability/distributions-and-densities.json
@@ -0,0 +1,32 @@
+{
+  "name": "Distributions and densities",
+  "order": 16,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b717",
+      "title": "Important distributions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b380",
+      "title": "Important densities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/expected-value-and-variance.json b/seed/math-challenges/47-probability/expected-value-and-variance.json
new file mode 100644
index 0000000000..b2adf54939
--- /dev/null
+++ b/seed/math-challenges/47-probability/expected-value-and-variance.json
@@ -0,0 +1,45 @@
+{
+  "name": "Expected Value and Variance",
+  "order": 17,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b718",
+      "title": "Expected value",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b382",
+      "title": "Variance of discrete random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b383",
+      "title": "Continuous random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/generating-functions.json b/seed/math-challenges/47-probability/generating-functions.json
new file mode 100644
index 0000000000..865b3267e0
--- /dev/null
+++ b/seed/math-challenges/47-probability/generating-functions.json
@@ -0,0 +1,45 @@
+{
+  "name": "Generating functions",
+  "order": 21,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b722",
+      "title": "Discrete distributions",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b392",
+      "title": "Branching Process",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b393",
+      "title": "Continuous Densities",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/law-of-large-numbers.json b/seed/math-challenges/47-probability/law-of-large-numbers.json
new file mode 100644
index 0000000000..42519df978
--- /dev/null
+++ b/seed/math-challenges/47-probability/law-of-large-numbers.json
@@ -0,0 +1,32 @@
+{
+  "name": "Law of large numbers",
+  "order": 19,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b720",
+      "title": "Discrete random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b387",
+      "title": "Continuous random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/markov-chains.json b/seed/math-challenges/47-probability/markov-chains.json
new file mode 100644
index 0000000000..5a26556e55
--- /dev/null
+++ b/seed/math-challenges/47-probability/markov-chains.json
@@ -0,0 +1,71 @@
+{
+  "name": "Markov chains",
+  "order": 22,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b723",
+      "title": "Introduction",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b395",
+      "title": "Absorbing Markov Chains",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b396",
+      "title": "Ergodic Markov Chains",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b397",
+      "title": "Fundamental Limit theorem",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b398",
+      "title": "Mean First Passage Time",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/random-walks.json b/seed/math-challenges/47-probability/random-walks.json
new file mode 100644
index 0000000000..34819bf9dc
--- /dev/null
+++ b/seed/math-challenges/47-probability/random-walks.json
@@ -0,0 +1,45 @@
+{
+  "name": "Random Walks",
+  "order": 23,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b724",
+      "title": "Random walks in Euclidean space",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b400",
+      "title": "Gambler's Ruin",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b401",
+      "title": "Arc Sine laws",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/seed/math-challenges/47-probability/sums-of-random-variables.json b/seed/math-challenges/47-probability/sums-of-random-variables.json
new file mode 100644
index 0000000000..e4260c1fab
--- /dev/null
+++ b/seed/math-challenges/47-probability/sums-of-random-variables.json
@@ -0,0 +1,32 @@
+{
+  "name": "Sums of random variables",
+  "order": 18,
+  "challenges": [
+    {
+      "id": "59a5801209a6acac5983b719",
+      "title": "Sums of discrete random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    },
+    {
+      "id": "59a5801209a6acac5983b385",
+      "title": "Sums of continuous random variables",
+      "description": [
+        ""
+      ],
+      "challengeSeed": [
+        ""
+      ],
+      "tests": [
+        ""
+      ]
+    }
+  ]
+}
\ No newline at end of file